About the Execution of Marcie+red for CANInsertWithFailure-PT-005
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6835.739 | 45990.00 | 56968.00 | 96.00 | TTTFFTTTTFFFTTFF | 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-167813696100698.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 CANInsertWithFailure-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-167813696100698
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 8.7K Feb 26 00:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 00:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 00:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 00:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 00:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 00:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 00:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 00:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 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 202K 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 CANInsertWithFailure-PT-005-CTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678742960157
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=CANInsertWithFailure-PT-005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 21:29:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 21:29:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:29:21] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2023-03-13 21:29:21] [INFO ] Transformed 114 places.
[2023-03-13 21:29:21] [INFO ] Transformed 180 transitions.
[2023-03-13 21:29:21] [INFO ] Parsed PT model containing 114 places and 180 transitions and 500 arcs in 110 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 87 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 14 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2023-03-13 21:29:22] [INFO ] Computed 7 place invariants in 14 ms
[2023-03-13 21:29:22] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-13 21:29:22] [INFO ] Invariant cache hit.
[2023-03-13 21:29:22] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-13 21:29:22] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2023-03-13 21:29:22] [INFO ] Invariant cache hit.
[2023-03-13 21:29:22] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 180/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 446 ms. Remains : 113/114 places, 180/180 transitions.
Support contains 87 out of 113 places after structural reductions.
[2023-03-13 21:29:22] [INFO ] Flatten gal took : 32 ms
[2023-03-13 21:29:22] [INFO ] Flatten gal took : 20 ms
[2023-03-13 21:29:22] [INFO ] Input system was already deterministic with 180 transitions.
Incomplete random walk after 10000 steps, including 99 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 88) seen :79
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-13 21:29:23] [INFO ] Invariant cache hit.
[2023-03-13 21:29:23] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 21:29:23] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 21:29:23] [INFO ] After 56ms SMT Verify possible using state equation in real domain returned unsat :1 sat :4 real:4
[2023-03-13 21:29:23] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-13 21:29:24] [INFO ] After 33ms SMT Verify possible using 45 Read/Feed constraints in real domain returned unsat :2 sat :0 real:7
[2023-03-13 21:29:24] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:7
[2023-03-13 21:29:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 21:29:24] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 21:29:24] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-03-13 21:29:24] [INFO ] After 72ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :3 sat :6
[2023-03-13 21:29:24] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :6
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-13 21:29:24] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :6
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 1 properties in 14 ms.
Support contains 14 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 180/180 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 113 transition count 156
Reduce places removed 24 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 28 rules applied. Total rules applied 52 place count 89 transition count 152
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 56 place count 85 transition count 152
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 84 place count 71 transition count 138
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 90 place count 71 transition count 132
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 113 place count 71 transition count 132
Applied a total of 113 rules in 35 ms. Remains 71 /113 variables (removed 42) and now considering 132/180 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 71/113 places, 132/180 transitions.
Incomplete random walk after 10000 steps, including 309 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Probably explored full state space saw : 20613 states, properties seen :0
Probabilistic random walk after 114725 steps, saw 20613 distinct states, run finished after 536 ms. (steps per millisecond=214 ) properties seen :0
Explored full state space saw : 20613 states, properties seen :0
Exhaustive walk after 114725 steps, saw 20613 distinct states, run finished after 459 ms. (steps per millisecond=249 ) properties seen :0
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
[2023-03-13 21:29:25] [INFO ] Flatten gal took : 9 ms
[2023-03-13 21:29:25] [INFO ] Flatten gal took : 9 ms
[2023-03-13 21:29:25] [INFO ] Input system was already deterministic with 180 transitions.
Support contains 80 out of 113 places (down from 81) after GAL structural reductions.
Computed a total of 22 stabilizing places and 35 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 113/113 places, 180/180 transitions.
[2023-03-13 21:29:25] [INFO ] Flatten gal took : 7 ms
[2023-03-13 21:29:25] [INFO ] Flatten gal took : 7 ms
[2023-03-13 21:29:25] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 113/113 places, 180/180 transitions.
[2023-03-13 21:29:25] [INFO ] Flatten gal took : 6 ms
[2023-03-13 21:29:25] [INFO ] Flatten gal took : 6 ms
[2023-03-13 21:29:25] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 113 transition count 146
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 79 transition count 146
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 78 place count 74 transition count 141
Applied a total of 78 rules in 9 ms. Remains 74 /113 variables (removed 39) and now considering 141/180 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 74/113 places, 141/180 transitions.
[2023-03-13 21:29:25] [INFO ] Flatten gal took : 4 ms
[2023-03-13 21:29:25] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:29:25] [INFO ] Input system was already deterministic with 141 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 113/113 places, 180/180 transitions.
[2023-03-13 21:29:25] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:29:25] [INFO ] Flatten gal took : 6 ms
[2023-03-13 21:29:25] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 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 113 transition count 149
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 82 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 62 place count 82 transition count 148
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 81 transition count 148
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 2 with 8 rules applied. Total rules applied 72 place count 77 transition count 144
Applied a total of 72 rules in 10 ms. Remains 77 /113 variables (removed 36) and now considering 144/180 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 77/113 places, 144/180 transitions.
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 4 ms
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 4 ms
[2023-03-13 21:29:26] [INFO ] Input system was already deterministic with 144 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 113/113 places, 180/180 transitions.
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 6 ms
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 6 ms
[2023-03-13 21:29:26] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 113/113 places, 180/180 transitions.
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 6 ms
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:29:26] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 113/113 places, 180/180 transitions.
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 6 ms
[2023-03-13 21:29:26] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 113/113 places, 180/180 transitions.
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:29:26] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 113 transition count 152
Reduce places removed 28 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 33 rules applied. Total rules applied 61 place count 85 transition count 147
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 66 place count 80 transition count 147
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 76 place count 75 transition count 142
Applied a total of 76 rules in 8 ms. Remains 75 /113 variables (removed 38) and now considering 142/180 (removed 38) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 75/113 places, 142/180 transitions.
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 4 ms
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 4 ms
[2023-03-13 21:29:26] [INFO ] Input system was already deterministic with 142 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 113/113 places, 180/180 transitions.
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 4 ms
[2023-03-13 21:29:26] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 113 transition count 155
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 88 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 87 transition count 154
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 52 place count 87 transition count 152
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 56 place count 85 transition count 152
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 3 with 6 rules applied. Total rules applied 62 place count 82 transition count 149
Applied a total of 62 rules in 8 ms. Remains 82 /113 variables (removed 31) and now considering 149/180 (removed 31) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 82/113 places, 149/180 transitions.
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 4 ms
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 3 ms
[2023-03-13 21:29:26] [INFO ] Input system was already deterministic with 149 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 113 transition count 145
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 78 transition count 145
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 80 place count 73 transition count 140
Applied a total of 80 rules in 6 ms. Remains 73 /113 variables (removed 40) and now considering 140/180 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 73/113 places, 140/180 transitions.
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 3 ms
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 3 ms
[2023-03-13 21:29:26] [INFO ] Input system was already deterministic with 140 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 113 transition count 159
Reduce places removed 21 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 26 rules applied. Total rules applied 47 place count 92 transition count 154
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 52 place count 87 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 52 place count 87 transition count 153
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 86 transition count 153
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 3 with 4 rules applied. Total rules applied 58 place count 84 transition count 151
Applied a total of 58 rules in 8 ms. Remains 84 /113 variables (removed 29) and now considering 151/180 (removed 29) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 84/113 places, 151/180 transitions.
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 4 ms
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 3 ms
[2023-03-13 21:29:26] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 113/113 places, 180/180 transitions.
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 4 ms
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 4 ms
[2023-03-13 21:29:26] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 113/113 places, 180/180 transitions.
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 4 ms
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 4 ms
[2023-03-13 21:29:26] [INFO ] Input system was already deterministic with 180 transitions.
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:29:26] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:29:26] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-13 21:29:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 113 places, 180 transitions and 490 arcs took 1 ms.
Total runtime 4505 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: 113 NrTr: 180 NrArc: 490)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.181sec
RS generation: 0m 1.220sec
-> reachability set: #nodes 21882 (2.2e+04) #states 200,157 (5)
starting MCC model checker
--------------------------
checking: EF [AG [p101<=0]]
normalized: E [true U ~ [E [true U ~ [p101<=0]]]]
abstracting: (p101<=0)
states: 197,441 (5)
-> the formula is TRUE
FORMULA CANInsertWithFailure-PT-005-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.510sec
checking: [EG [[p9<=0 | EG [1<=p89]]] | AF [AX [1<=0]]]
normalized: [~ [EG [EX [~ [1<=0]]]] | EG [[EG [1<=p89] | p9<=0]]]
abstracting: (p9<=0)
states: 187,732 (5)
abstracting: (1<=p89)
states: 2,895 (3)
.....
EG iterations: 5
.......
EG iterations: 7
abstracting: (1<=0)
states: 0
......
EG iterations: 5
-> the formula is TRUE
FORMULA CANInsertWithFailure-PT-005-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.772sec
checking: AG [AF [AX [~ [E [[1<=p26 & 1<=p63] U [1<=p13 & 1<=p14]]]]]]
normalized: ~ [E [true U EG [EX [E [[1<=p26 & 1<=p63] U [1<=p13 & 1<=p14]]]]]]
abstracting: (1<=p14)
states: 12,425 (4)
abstracting: (1<=p13)
states: 82,179 (4)
abstracting: (1<=p63)
states: 69,784 (4)
abstracting: (1<=p26)
states: 12,425 (4)
......
EG iterations: 5
-> the formula is FALSE
FORMULA CANInsertWithFailure-PT-005-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.558sec
checking: EF [AG [[[p108<=0 & [p102<=0 | [p7<=0 | p97<=0]]] | [EF [p86<=0] & p91<=0]]]]
normalized: E [true U ~ [E [true U ~ [[[p91<=0 & E [true U p86<=0]] | [p108<=0 & [p102<=0 | [p7<=0 | p97<=0]]]]]]]]
abstracting: (p97<=0)
states: 197,441 (5)
abstracting: (p7<=0)
states: 156,744 (5)
abstracting: (p102<=0)
states: 195,627 (5)
abstracting: (p108<=0)
states: 195,420 (5)
abstracting: (p86<=0)
states: 197,441 (5)
abstracting: (p91<=0)
states: 197,262 (5)
-> the formula is TRUE
FORMULA CANInsertWithFailure-PT-005-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.078sec
checking: ~ [E [~ [[1<=p39 | [[1<=p23 & 1<=p104] | [1<=p1 & 1<=p95]]]] U AX [EF [1<=p18]]]]
normalized: ~ [E [~ [[1<=p39 | [[1<=p1 & 1<=p95] | [1<=p23 & 1<=p104]]]] U ~ [EX [~ [E [true U 1<=p18]]]]]]
abstracting: (1<=p18)
states: 1
.abstracting: (1<=p104)
states: 4,910 (3)
abstracting: (1<=p23)
states: 12,425 (4)
abstracting: (1<=p95)
states: 4,737 (3)
abstracting: (1<=p1)
states: 128,327 (5)
abstracting: (1<=p39)
states: 12,425 (4)
-> the formula is FALSE
FORMULA CANInsertWithFailure-PT-005-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.186sec
checking: [EG [E [~ [[1<=p106 | 1<=p86]] U ~ [AX [[1<=p49 & 1<=p111]]]]] | EG [AX [[[EF [1<=p80] & EX [1<=p53]] | EG [AG [1<=p37]]]]]]
normalized: [EG [~ [EX [~ [[EG [~ [E [true U ~ [1<=p37]]]] | [EX [1<=p53] & E [true U 1<=p80]]]]]]] | EG [E [~ [[1<=p106 | 1<=p86]] U EX [~ [[1<=p49 & 1<=p111]]]]]]
abstracting: (1<=p111)
states: 4,910 (3)
abstracting: (1<=p49)
states: 66,550 (4)
.abstracting: (1<=p86)
states: 2,716 (3)
abstracting: (1<=p106)
states: 4,737 (3)
.....
EG iterations: 5
abstracting: (1<=p80)
states: 2,716 (3)
abstracting: (1<=p53)
states: 10,784 (4)
.abstracting: (1<=p37)
states: 12,425 (4)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is TRUE
FORMULA CANInsertWithFailure-PT-005-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.794sec
checking: A [AF [[p84<=0 & EG [[1<=p63 & 1<=p79]]]] U [~ [E [[1<=p12 & 1<=p35] U EG [p88<=0]]] & [1<=p21 & 1<=p107]]]
normalized: [~ [EG [~ [[[1<=p21 & 1<=p107] & ~ [E [[1<=p12 & 1<=p35] U EG [p88<=0]]]]]]] & ~ [E [~ [[[1<=p21 & 1<=p107] & ~ [E [[1<=p12 & 1<=p35] U EG [p88<=0]]]]] U [EG [~ [[p84<=0 & EG [[1<=p63 & 1<=p79]]]]] & ~ [[[1<=p21 & 1<=p107] & ~ [E [[1<=p12 & 1<=p35] U EG [p88<=0]]]]]]]]]
abstracting: (p88<=0)
states: 197,441 (5)
.
EG iterations: 1
abstracting: (1<=p35)
states: 43,413 (4)
abstracting: (1<=p12)
states: 12,425 (4)
abstracting: (1<=p107)
states: 2,716 (3)
abstracting: (1<=p21)
states: 43,413 (4)
abstracting: (1<=p79)
states: 4,737 (3)
abstracting: (1<=p63)
states: 69,784 (4)
.....
EG iterations: 5
abstracting: (p84<=0)
states: 197,262 (5)
.
EG iterations: 1
abstracting: (p88<=0)
states: 197,441 (5)
.
EG iterations: 1
abstracting: (1<=p35)
states: 43,413 (4)
abstracting: (1<=p12)
states: 12,425 (4)
abstracting: (1<=p107)
states: 2,716 (3)
abstracting: (1<=p21)
states: 43,413 (4)
abstracting: (p88<=0)
states: 197,441 (5)
.
EG iterations: 1
abstracting: (1<=p35)
states: 43,413 (4)
abstracting: (1<=p12)
states: 12,425 (4)
abstracting: (1<=p107)
states: 2,716 (3)
abstracting: (1<=p21)
states: 43,413 (4)
EG iterations: 0
-> the formula is FALSE
FORMULA CANInsertWithFailure-PT-005-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.423sec
checking: AF [[AG [~ [A [[[1<=p63 & 1<=p79] | [1<=p7 & 1<=p105]] U ~ [[1<=p2 & 1<=p17]]]]] & [1<=p92 | 1<=p84]]]
normalized: ~ [EG [~ [[[1<=p92 | 1<=p84] & ~ [E [true U [~ [EG [[1<=p2 & 1<=p17]]] & ~ [E [[1<=p2 & 1<=p17] U [~ [[[1<=p7 & 1<=p105] | [1<=p63 & 1<=p79]]] & [1<=p2 & 1<=p17]]]]]]]]]]]
abstracting: (1<=p17)
states: 12,437 (4)
abstracting: (1<=p2)
states: 1
abstracting: (1<=p79)
states: 4,737 (3)
abstracting: (1<=p63)
states: 69,784 (4)
abstracting: (1<=p105)
states: 2,716 (3)
abstracting: (1<=p7)
states: 43,413 (4)
abstracting: (1<=p17)
states: 12,437 (4)
abstracting: (1<=p2)
states: 1
abstracting: (1<=p17)
states: 12,437 (4)
abstracting: (1<=p2)
states: 1
..
EG iterations: 2
abstracting: (1<=p84)
states: 2,895 (3)
abstracting: (1<=p92)
states: 2,895 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA CANInsertWithFailure-PT-005-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.056sec
checking: ~ [A [AF [[EG [p90<=0] | p4<=0]] U [[~ [[E [1<=p83 U [1<=p26 & 1<=p35]] & AG [1<=p74]]] | ~ [[[A [1<=p78 U 1<=p50] & 1<=p0] & [1<=p17 & 1<=p9]]]] & AF [AG [[1<=p0 & 1<=p45]]]]]]
normalized: ~ [[~ [EG [~ [[~ [EG [E [true U ~ [[1<=p0 & 1<=p45]]]]] & [~ [[[1<=p17 & 1<=p9] & [1<=p0 & [~ [EG [~ [1<=p50]]] & ~ [E [~ [1<=p50] U [~ [1<=p78] & ~ [1<=p50]]]]]]]] | ~ [[~ [E [true U ~ [1<=p74]]] & E [1<=p83 U [1<=p26 & 1<=p35]]]]]]]]] & ~ [E [~ [[~ [EG [E [true U ~ [[1<=p0 & 1<=p45]]]]] & [~ [[[1<=p17 & 1<=p9] & [1<=p0 & [~ [EG [~ [1<=p50]]] & ~ [E [~ [1<=p50] U [~ [1<=p78] & ~ [1<=p50]]]]]]]] | ~ [[~ [E [true U ~ [1<=p74]]] & E [1<=p83 U [1<=p26 & 1<=p35]]]]]]] U [EG [~ [[p4<=0 | EG [p90<=0]]]] & ~ [[~ [EG [E [true U ~ [[1<=p0 & 1<=p45]]]]] & [~ [[[1<=p17 & 1<=p9] & [1<=p0 & [~ [EG [~ [1<=p50]]] & ~ [E [~ [1<=p50] U [~ [1<=p78] & ~ [1<=p50]]]]]]]] | ~ [[~ [E [true U ~ [1<=p74]]] & E [1<=p83 U [1<=p26 & 1<=p35]]]]]]]]]]]]
abstracting: (1<=p35)
states: 43,413 (4)
abstracting: (1<=p26)
states: 12,425 (4)
abstracting: (1<=p83)
states: 2,895 (3)
abstracting: (1<=p74)
states: 2,895 (3)
abstracting: (1<=p50)
states: 10,784 (4)
abstracting: (1<=p78)
states: 2,716 (3)
abstracting: (1<=p50)
states: 10,784 (4)
abstracting: (1<=p50)
states: 10,784 (4)
......
EG iterations: 6
abstracting: (1<=p0)
states: 200,141 (5)
abstracting: (1<=p9)
states: 12,425 (4)
abstracting: (1<=p17)
states: 12,437 (4)
abstracting: (1<=p45)
states: 10,796 (4)
abstracting: (1<=p0)
states: 200,141 (5)
EG iterations: 0
abstracting: (p90<=0)
states: 197,262 (5)
.
EG iterations: 1
abstracting: (p4<=0)
states: 200,156 (5)
.
EG iterations: 1
abstracting: (1<=p35)
states: 43,413 (4)
abstracting: (1<=p26)
states: 12,425 (4)
abstracting: (1<=p83)
states: 2,895 (3)
abstracting: (1<=p74)
states: 2,895 (3)
abstracting: (1<=p50)
states: 10,784 (4)
abstracting: (1<=p78)
states: 2,716 (3)
abstracting: (1<=p50)
states: 10,784 (4)
abstracting: (1<=p50)
states: 10,784 (4)
......
EG iterations: 6
abstracting: (1<=p0)
states: 200,141 (5)
abstracting: (1<=p9)
states: 12,425 (4)
abstracting: (1<=p17)
states: 12,437 (4)
abstracting: (1<=p45)
states: 10,796 (4)
abstracting: (1<=p0)
states: 200,141 (5)
EG iterations: 0
abstracting: (1<=p35)
states: 43,413 (4)
abstracting: (1<=p26)
states: 12,425 (4)
abstracting: (1<=p83)
states: 2,895 (3)
abstracting: (1<=p74)
states: 2,895 (3)
abstracting: (1<=p50)
states: 10,784 (4)
abstracting: (1<=p78)
states: 2,716 (3)
abstracting: (1<=p50)
states: 10,784 (4)
abstracting: (1<=p50)
states: 10,784 (4)
......
EG iterations: 6
abstracting: (1<=p0)
states: 200,141 (5)
abstracting: (1<=p9)
states: 12,425 (4)
abstracting: (1<=p17)
states: 12,437 (4)
abstracting: (1<=p45)
states: 10,796 (4)
abstracting: (1<=p0)
states: 200,141 (5)
EG iterations: 0
EG iterations: 0
-> the formula is TRUE
FORMULA CANInsertWithFailure-PT-005-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.387sec
checking: [AX [E [A [1<=p91 U EG [[1<=p7 & 1<=p68]]] U EF [AG [[1<=p21 & 1<=p99]]]]] & EG [[p24<=0 | [AX [[1<=p2 & 1<=p59]] | ~ [A [[~ [[1<=p49 & 1<=p77]] & p94<=0] U [1<=p26 & 1<=p63]]]]]]]
normalized: [EG [[p24<=0 | [~ [[~ [EG [~ [[1<=p26 & 1<=p63]]]] & ~ [E [~ [[1<=p26 & 1<=p63]] U [~ [[p94<=0 & ~ [[1<=p49 & 1<=p77]]]] & ~ [[1<=p26 & 1<=p63]]]]]]] | ~ [EX [~ [[1<=p2 & 1<=p59]]]]]]] & ~ [EX [~ [E [[~ [EG [~ [EG [[1<=p7 & 1<=p68]]]]] & ~ [E [~ [EG [[1<=p7 & 1<=p68]]] U [~ [1<=p91] & ~ [EG [[1<=p7 & 1<=p68]]]]]]] U E [true U ~ [E [true U ~ [[1<=p21 & 1<=p99]]]]]]]]]]
abstracting: (1<=p99)
states: 2,716 (3)
abstracting: (1<=p21)
states: 43,413 (4)
abstracting: (1<=p68)
states: 10,784 (4)
abstracting: (1<=p7)
states: 43,413 (4)
.....
EG iterations: 5
abstracting: (1<=p91)
states: 2,895 (3)
abstracting: (1<=p68)
states: 10,784 (4)
abstracting: (1<=p7)
states: 43,413 (4)
.....
EG iterations: 5
abstracting: (1<=p68)
states: 10,784 (4)
abstracting: (1<=p7)
states: 43,413 (4)
.....
EG iterations: 5
.
EG iterations: 1
.abstracting: (1<=p59)
states: 8,342 (3)
abstracting: (1<=p2)
states: 1
.abstracting: (1<=p63)
states: 69,784 (4)
abstracting: (1<=p26)
states: 12,425 (4)
abstracting: (1<=p77)
states: 4,530 (3)
abstracting: (1<=p49)
states: 66,550 (4)
abstracting: (p94<=0)
states: 197,441 (5)
abstracting: (1<=p63)
states: 69,784 (4)
abstracting: (1<=p26)
states: 12,425 (4)
abstracting: (1<=p63)
states: 69,784 (4)
abstracting: (1<=p26)
states: 12,425 (4)
..........
EG iterations: 10
abstracting: (p24<=0)
states: 187,732 (5)
........
EG iterations: 8
-> the formula is FALSE
FORMULA CANInsertWithFailure-PT-005-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.814sec
checking: A [EF [[E [EF [[1<=p63 & 1<=p87]] U 1<=p106] | 1<=p61]] U [EF [EG [E [[1<=p21 & 1<=p54] U 1<=p98]]] & [AF [1<=p20] | [AG [[1<=p93 & 1<=p24]] & [E [[1<=p63 & 1<=p79] U 1<=p44] | p80<=0]]]]]
normalized: [~ [EG [~ [[[[[p80<=0 | E [[1<=p63 & 1<=p79] U 1<=p44]] & ~ [E [true U ~ [[1<=p93 & 1<=p24]]]]] | ~ [EG [~ [1<=p20]]]] & E [true U EG [E [[1<=p21 & 1<=p54] U 1<=p98]]]]]]] & ~ [E [~ [[[[[p80<=0 | E [[1<=p63 & 1<=p79] U 1<=p44]] & ~ [E [true U ~ [[1<=p93 & 1<=p24]]]]] | ~ [EG [~ [1<=p20]]]] & E [true U EG [E [[1<=p21 & 1<=p54] U 1<=p98]]]]] U [~ [E [true U [1<=p61 | E [E [true U [1<=p63 & 1<=p87]] U 1<=p106]]]] & ~ [[[[[p80<=0 | E [[1<=p63 & 1<=p79] U 1<=p44]] & ~ [E [true U ~ [[1<=p93 & 1<=p24]]]]] | ~ [EG [~ [1<=p20]]]] & E [true U EG [E [[1<=p21 & 1<=p54] U 1<=p98]]]]]]]]]
abstracting: (1<=p98)
states: 4,530 (3)
abstracting: (1<=p54)
states: 10,784 (4)
abstracting: (1<=p21)
states: 43,413 (4)
.....
EG iterations: 5
abstracting: (1<=p20)
states: 1
...
EG iterations: 3
abstracting: (1<=p24)
states: 12,425 (4)
abstracting: (1<=p93)
states: 4,530 (3)
abstracting: (1<=p44)
states: 12,425 (4)
abstracting: (1<=p79)
states: 4,737 (3)
abstracting: (1<=p63)
states: 69,784 (4)
abstracting: (p80<=0)
states: 197,441 (5)
abstracting: (1<=p106)
states: 4,737 (3)
abstracting: (1<=p87)
states: 4,737 (3)
abstracting: (1<=p63)
states: 69,784 (4)
abstracting: (1<=p61)
states: 1
abstracting: (1<=p98)
states: 4,530 (3)
abstracting: (1<=p54)
states: 10,784 (4)
abstracting: (1<=p21)
states: 43,413 (4)
.....
EG iterations: 5
abstracting: (1<=p20)
states: 1
...
EG iterations: 3
abstracting: (1<=p24)
states: 12,425 (4)
abstracting: (1<=p93)
states: 4,530 (3)
abstracting: (1<=p44)
states: 12,425 (4)
abstracting: (1<=p79)
states: 4,737 (3)
abstracting: (1<=p63)
states: 69,784 (4)
abstracting: (p80<=0)
states: 197,441 (5)
abstracting: (1<=p98)
states: 4,530 (3)
abstracting: (1<=p54)
states: 10,784 (4)
abstracting: (1<=p21)
states: 43,413 (4)
.....
EG iterations: 5
abstracting: (1<=p20)
states: 1
...
EG iterations: 3
abstracting: (1<=p24)
states: 12,425 (4)
abstracting: (1<=p93)
states: 4,530 (3)
abstracting: (1<=p44)
states: 12,425 (4)
abstracting: (1<=p79)
states: 4,737 (3)
abstracting: (1<=p63)
states: 69,784 (4)
abstracting: (p80<=0)
states: 197,441 (5)
.
EG iterations: 1
-> the formula is FALSE
FORMULA CANInsertWithFailure-PT-005-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.908sec
checking: [EG [[p1<=0 | p79<=0]] & [EX [[1<=p90 | [AF [[1<=p35 & 1<=p75]] | EF [1<=p66]]]] | [EF [[1<=p86 | 1<=p78]] | [~ [A [~ [[1<=p97 | 1<=p36]] U [1<=p69 & 1<=p71]]] & E [[1<=p63 & 1<=p79] U EG [AX [1<=p96]]]]]]]
normalized: [[[[E [[1<=p63 & 1<=p79] U EG [~ [EX [~ [1<=p96]]]]] & ~ [[~ [EG [~ [[1<=p69 & 1<=p71]]]] & ~ [E [~ [[1<=p69 & 1<=p71]] U [[1<=p97 | 1<=p36] & ~ [[1<=p69 & 1<=p71]]]]]]]] | E [true U [1<=p86 | 1<=p78]]] | EX [[1<=p90 | [E [true U 1<=p66] | ~ [EG [~ [[1<=p35 & 1<=p75]]]]]]]] & EG [[p1<=0 | p79<=0]]]
abstracting: (p79<=0)
states: 195,420 (5)
abstracting: (p1<=0)
states: 71,830 (4)
.
EG iterations: 1
abstracting: (1<=p75)
states: 2,895 (3)
abstracting: (1<=p35)
states: 43,413 (4)
........
EG iterations: 8
abstracting: (1<=p66)
states: 10,784 (4)
abstracting: (1<=p90)
states: 2,895 (3)
.abstracting: (1<=p78)
states: 2,716 (3)
abstracting: (1<=p86)
states: 2,716 (3)
abstracting: (1<=p71)
states: 25,717 (4)
abstracting: (1<=p69)
states: 68,108 (4)
abstracting: (1<=p36)
states: 12,425 (4)
abstracting: (1<=p97)
states: 2,716 (3)
abstracting: (1<=p71)
states: 25,717 (4)
abstracting: (1<=p69)
states: 68,108 (4)
abstracting: (1<=p71)
states: 25,717 (4)
abstracting: (1<=p69)
states: 68,108 (4)
.
EG iterations: 1
abstracting: (1<=p96)
states: 2,716 (3)
..
EG iterations: 1
abstracting: (1<=p79)
states: 4,737 (3)
abstracting: (1<=p63)
states: 69,784 (4)
-> the formula is TRUE
FORMULA CANInsertWithFailure-PT-005-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.843sec
checking: EX [[EF [EX [[p21<=0 | p107<=0]]] & [~ [A [AX [1<=p90] U [A [1<=p52 U [1<=p69 & 1<=p71]] & [1<=p74 | 1<=p107]]]] & A [[~ [EX [[1<=p35 & 1<=p83]]] & AF [1<=p50]] U [E [1<=p58 U 1<=p89] | [1<=p11 | [1<=p21 & 1<=p73]]]]]]]
normalized: EX [[[[~ [EG [~ [[[1<=p11 | [1<=p21 & 1<=p73]] | E [1<=p58 U 1<=p89]]]]] & ~ [E [~ [[[1<=p11 | [1<=p21 & 1<=p73]] | E [1<=p58 U 1<=p89]]] U [~ [[~ [EG [~ [1<=p50]]] & ~ [EX [[1<=p35 & 1<=p83]]]]] & ~ [[[1<=p11 | [1<=p21 & 1<=p73]] | E [1<=p58 U 1<=p89]]]]]]] & ~ [[~ [EG [~ [[[1<=p74 | 1<=p107] & [~ [EG [~ [[1<=p69 & 1<=p71]]]] & ~ [E [~ [[1<=p69 & 1<=p71]] U [~ [1<=p52] & ~ [[1<=p69 & 1<=p71]]]]]]]]]] & ~ [E [~ [[[1<=p74 | 1<=p107] & [~ [EG [~ [[1<=p69 & 1<=p71]]]] & ~ [E [~ [[1<=p69 & 1<=p71]] U [~ [1<=p52] & ~ [[1<=p69 & 1<=p71]]]]]]]] U [EX [~ [1<=p90]] & ~ [[[1<=p74 | 1<=p107] & [~ [EG [~ [[1<=p69 & 1<=p71]]]] & ~ [E [~ [[1<=p69 & 1<=p71]] U [~ [1<=p52] & ~ [[1<=p69 & 1<=p71]]]]]]]]]]]]]] & E [true U EX [[p21<=0 | p107<=0]]]]]
abstracting: (p107<=0)
states: 197,441 (5)
abstracting: (p21<=0)
states: 156,744 (5)
.abstracting: (1<=p71)
states: 25,717 (4)
abstracting: (1<=p69)
states: 68,108 (4)
abstracting: (1<=p52)
states: 10,784 (4)
abstracting: (1<=p71)
states: 25,717 (4)
abstracting: (1<=p69)
states: 68,108 (4)
abstracting: (1<=p71)
states: 25,717 (4)
abstracting: (1<=p69)
states: 68,108 (4)
.
EG iterations: 1
abstracting: (1<=p107)
states: 2,716 (3)
abstracting: (1<=p74)
states: 2,895 (3)
abstracting: (1<=p90)
states: 2,895 (3)
.abstracting: (1<=p71)
states: 25,717 (4)
abstracting: (1<=p69)
states: 68,108 (4)
abstracting: (1<=p52)
states: 10,784 (4)
abstracting: (1<=p71)
states: 25,717 (4)
abstracting: (1<=p69)
states: 68,108 (4)
abstracting: (1<=p71)
states: 25,717 (4)
abstracting: (1<=p69)
states: 68,108 (4)
.
EG iterations: 1
abstracting: (1<=p107)
states: 2,716 (3)
abstracting: (1<=p74)
states: 2,895 (3)
abstracting: (1<=p71)
states: 25,717 (4)
abstracting: (1<=p69)
states: 68,108 (4)
abstracting: (1<=p52)
states: 10,784 (4)
abstracting: (1<=p71)
states: 25,717 (4)
abstracting: (1<=p69)
states: 68,108 (4)
abstracting: (1<=p71)
states: 25,717 (4)
abstracting: (1<=p69)
states: 68,108 (4)
.
EG iterations: 1
abstracting: (1<=p107)
states: 2,716 (3)
abstracting: (1<=p74)
states: 2,895 (3)
.
EG iterations: 1
abstracting: (1<=p89)
states: 2,895 (3)
abstracting: (1<=p58)
states: 10,784 (4)
abstracting: (1<=p73)
states: 2,895 (3)
abstracting: (1<=p21)
states: 43,413 (4)
abstracting: (1<=p11)
states: 12,425 (4)
abstracting: (1<=p83)
states: 2,895 (3)
abstracting: (1<=p35)
states: 43,413 (4)
.abstracting: (1<=p50)
states: 10,784 (4)
......
EG iterations: 6
abstracting: (1<=p89)
states: 2,895 (3)
abstracting: (1<=p58)
states: 10,784 (4)
abstracting: (1<=p73)
states: 2,895 (3)
abstracting: (1<=p21)
states: 43,413 (4)
abstracting: (1<=p11)
states: 12,425 (4)
abstracting: (1<=p89)
states: 2,895 (3)
abstracting: (1<=p58)
states: 10,784 (4)
abstracting: (1<=p73)
states: 2,895 (3)
abstracting: (1<=p21)
states: 43,413 (4)
abstracting: (1<=p11)
states: 12,425 (4)
.........
EG iterations: 9
.-> the formula is FALSE
FORMULA CANInsertWithFailure-PT-005-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.698sec
checking: [AF [[E [[1<=p1 & 1<=p95] U AF [[1<=p86 | [1<=p1 & 1<=p96]]]] & [1<=p63 & 1<=p87]]] | EG [[[[[1<=p2 & 1<=p59] & [1<=p35 & 1<=p109]] | p82<=0] | [EX [[1<=p7 & 1<=p54]] | AX [[~ [A [1<=p84 U [1<=p26 & 1<=p35]]] | [1<=p1 & 1<=p96]]]]]]]
normalized: [EG [[[~ [EX [~ [[[1<=p1 & 1<=p96] | ~ [[~ [EG [~ [[1<=p26 & 1<=p35]]]] & ~ [E [~ [[1<=p26 & 1<=p35]] U [~ [1<=p84] & ~ [[1<=p26 & 1<=p35]]]]]]]]]]] | EX [[1<=p7 & 1<=p54]]] | [p82<=0 | [[1<=p35 & 1<=p109] & [1<=p2 & 1<=p59]]]]] | ~ [EG [~ [[[1<=p63 & 1<=p87] & E [[1<=p1 & 1<=p95] U ~ [EG [~ [[1<=p86 | [1<=p1 & 1<=p96]]]]]]]]]]]
abstracting: (1<=p96)
states: 2,716 (3)
abstracting: (1<=p1)
states: 128,327 (5)
abstracting: (1<=p86)
states: 2,716 (3)
.
EG iterations: 1
abstracting: (1<=p95)
states: 4,737 (3)
abstracting: (1<=p1)
states: 128,327 (5)
abstracting: (1<=p87)
states: 4,737 (3)
abstracting: (1<=p63)
states: 69,784 (4)
.
EG iterations: 1
abstracting: (1<=p59)
states: 8,342 (3)
abstracting: (1<=p2)
states: 1
abstracting: (1<=p109)
states: 2,716 (3)
abstracting: (1<=p35)
states: 43,413 (4)
abstracting: (p82<=0)
states: 197,262 (5)
abstracting: (1<=p54)
states: 10,784 (4)
abstracting: (1<=p7)
states: 43,413 (4)
.abstracting: (1<=p35)
states: 43,413 (4)
abstracting: (1<=p26)
states: 12,425 (4)
abstracting: (1<=p84)
states: 2,895 (3)
abstracting: (1<=p35)
states: 43,413 (4)
abstracting: (1<=p26)
states: 12,425 (4)
abstracting: (1<=p35)
states: 43,413 (4)
abstracting: (1<=p26)
states: 12,425 (4)
..........
EG iterations: 10
abstracting: (1<=p96)
states: 2,716 (3)
abstracting: (1<=p1)
states: 128,327 (5)
.
EG iterations: 0
-> the formula is TRUE
FORMULA CANInsertWithFailure-PT-005-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.769sec
checking: EG [[[[AG [~ [A [1<=p92 U [1<=p26 & 1<=p63]]]] | EX [[[p26<=0 | p35<=0] & p76<=0]]] | [~ [A [1<=p74 U 1<=p82]] | [AX [p98<=0] | AX [[1<=p55 & 1<=p57]]]]] | [[1<=p82 | p94<=0] | [[AX [1<=p83] & AX [[1<=p7 & 1<=p40]]] | [[1<=p26 & 1<=p49] | [p73<=0 & [p55<=0 | p56<=0]]]]]]]
normalized: EG [[[[[[1<=p26 & 1<=p49] | [p73<=0 & [p55<=0 | p56<=0]]] | [~ [EX [~ [[1<=p7 & 1<=p40]]]] & ~ [EX [~ [1<=p83]]]]] | [1<=p82 | p94<=0]] | [[[~ [EX [~ [[1<=p55 & 1<=p57]]]] | ~ [EX [~ [p98<=0]]]] | ~ [[~ [EG [~ [1<=p82]]] & ~ [E [~ [1<=p82] U [~ [1<=p74] & ~ [1<=p82]]]]]]] | [EX [[p76<=0 & [p26<=0 | p35<=0]]] | ~ [E [true U [~ [EG [~ [[1<=p26 & 1<=p63]]]] & ~ [E [~ [[1<=p26 & 1<=p63]] U [~ [1<=p92] & ~ [[1<=p26 & 1<=p63]]]]]]]]]]]]
abstracting: (1<=p63)
states: 69,784 (4)
abstracting: (1<=p26)
states: 12,425 (4)
abstracting: (1<=p92)
states: 2,895 (3)
abstracting: (1<=p63)
states: 69,784 (4)
abstracting: (1<=p26)
states: 12,425 (4)
abstracting: (1<=p63)
states: 69,784 (4)
abstracting: (1<=p26)
states: 12,425 (4)
..........
EG iterations: 10
abstracting: (p35<=0)
states: 156,744 (5)
abstracting: (p26<=0)
states: 187,732 (5)
abstracting: (p76<=0)
states: 197,262 (5)
.abstracting: (1<=p82)
states: 2,895 (3)
abstracting: (1<=p74)
states: 2,895 (3)
abstracting: (1<=p82)
states: 2,895 (3)
abstracting: (1<=p82)
states: 2,895 (3)
.
EG iterations: 1
abstracting: (p98<=0)
states: 195,627 (5)
.abstracting: (1<=p57)
states: 25,143 (4)
abstracting: (1<=p55)
states: 68,888 (4)
.abstracting: (p94<=0)
states: 197,441 (5)
abstracting: (1<=p82)
states: 2,895 (3)
abstracting: (1<=p83)
states: 2,895 (3)
.abstracting: (1<=p40)
states: 12,425 (4)
abstracting: (1<=p7)
states: 43,413 (4)
.abstracting: (p56<=0)
states: 189,373 (5)
abstracting: (p55<=0)
states: 131,269 (5)
abstracting: (p73<=0)
states: 197,262 (5)
abstracting: (1<=p49)
states: 66,550 (4)
abstracting: (1<=p26)
states: 12,425 (4)
EG iterations: 0
-> the formula is TRUE
FORMULA CANInsertWithFailure-PT-005-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.527sec
checking: [EG [E [[[1<=p62 & [1<=p54 & 1<=p63]] | [1<=p100 | [1<=p0 & 1<=p3]]] U ~ [[1<=p0 & 1<=p45]]]] & [EF [EX [AF [[1<=p96 | 1<=p74]]]] | [E [[EX [E [[1<=p63 & 1<=p79] U [1<=p27 & 1<=p28]]] & [1<=p27 & 1<=p29]] U E [~ [[[1<=p1 & 1<=p79] & [1<=p63 & 1<=p79]]] U [A [1<=p91 U 1<=p108] | AF [[1<=p21 & 1<=p99]]]]] & [A [AF [~ [[1<=p26 & 1<=p35]]] U 1<=p88] | EF [1<=p53]]]]]
normalized: [EG [E [[[1<=p62 & [1<=p54 & 1<=p63]] | [1<=p100 | [1<=p0 & 1<=p3]]] U ~ [[1<=p0 & 1<=p45]]]] & [E [true U EX [~ [EG [~ [[1<=p96 | 1<=p74]]]]]] | [[E [true U 1<=p53] | [~ [EG [~ [1<=p88]]] & ~ [E [~ [1<=p88] U [EG [[1<=p26 & 1<=p35]] & ~ [1<=p88]]]]]] & E [[[1<=p27 & 1<=p29] & EX [E [[1<=p63 & 1<=p79] U [1<=p27 & 1<=p28]]]] U E [~ [[[1<=p63 & 1<=p79] & [1<=p1 & 1<=p79]]] U [~ [EG [~ [[1<=p21 & 1<=p99]]]] | [~ [EG [~ [1<=p108]]] & ~ [E [~ [1<=p108] U [~ [1<=p91] & ~ [1<=p108]]]]]]]]]]]
abstracting: (1<=p108)
states: 4,737 (3)
abstracting: (1<=p91)
states: 2,895 (3)
abstracting: (1<=p108)
states: 4,737 (3)
abstracting: (1<=p108)
states: 4,737 (3)
.........
EG iterations: 9
abstracting: (1<=p99)
states: 2,716 (3)
abstracting: (1<=p21)
states: 43,413 (4)
........
EG iterations: 8
abstracting: (1<=p79)
states: 4,737 (3)
abstracting: (1<=p1)
states: 128,327 (5)
abstracting: (1<=p79)
states: 4,737 (3)
abstracting: (1<=p63)
states: 69,784 (4)
abstracting: (1<=p28)
states: 12,425 (4)
abstracting: (1<=p27)
states: 82,179 (4)
abstracting: (1<=p79)
states: 4,737 (3)
abstracting: (1<=p63)
states: 69,784 (4)
.abstracting: (1<=p29)
states: 22,128 (4)
abstracting: (1<=p27)
states: 82,179 (4)
abstracting: (1<=p88)
states: 2,716 (3)
abstracting: (1<=p35)
states: 43,413 (4)
abstracting: (1<=p26)
states: 12,425 (4)
.....
EG iterations: 5
abstracting: (1<=p88)
states: 2,716 (3)
abstracting: (1<=p88)
states: 2,716 (3)
.
EG iterations: 1
abstracting: (1<=p53)
states: 10,784 (4)
abstracting: (1<=p74)
states: 2,895 (3)
abstracting: (1<=p96)
states: 2,716 (3)
.
EG iterations: 1
.abstracting: (1<=p45)
states: 10,796 (4)
abstracting: (1<=p0)
states: 200,141 (5)
abstracting: (1<=p3)
states: 12,437 (4)
abstracting: (1<=p0)
states: 200,141 (5)
abstracting: (1<=p100)
states: 4,530 (3)
abstracting: (1<=p63)
states: 69,784 (4)
abstracting: (1<=p54)
states: 10,784 (4)
abstracting: (1<=p62)
states: 1
....
EG iterations: 4
-> the formula is TRUE
FORMULA CANInsertWithFailure-PT-005-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.916sec
totally nodes used: 17705927 (1.8e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 16944113 59664111 76608224
used/not used/entry size/cache size: 45681280 21427584 16 1024MB
basic ops cache: hits/miss/sum: 3201077 12340021 15541098
used/not used/entry size/cache size: 11864082 4913134 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: 62292 254010 316302
used/not used/entry size/cache size: 250406 8138202 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 52910927
1 11346443
2 2306932
3 454602
4 76259
5 10826
6 1764
7 346
8 215
9 112
>= 10 438
Total processing time: 0m39.569sec
BK_STOP 1678743006147
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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:16377 (90), effective:438 (2)
initing FirstDep: 0m 0.000sec
iterations count:2763 (15), effective:93 (0)
iterations count:3144 (17), effective:138 (0)
iterations count:395 (2), effective:14 (0)
iterations count:1589 (8), effective:76 (0)
iterations count:193 (1), effective:1 (0)
iterations count:180 (1), effective:0 (0)
iterations count:188 (1), effective:1 (0)
iterations count:7326 (40), effective:306 (1)
iterations count:261 (1), effective:1 (0)
iterations count:1842 (10), effective:66 (0)
iterations count:182 (1), effective:1 (0)
iterations count:271 (1), effective:2 (0)
iterations count:271 (1), effective:2 (0)
iterations count:582 (3), effective:25 (0)
iterations count:271 (1), effective:2 (0)
iterations count:180 (1), effective:0 (0)
iterations count:182 (1), effective:1 (0)
iterations count:180 (1), effective:0 (0)
iterations count:240 (1), effective:1 (0)
iterations count:240 (1), effective:1 (0)
iterations count:186 (1), effective:1 (0)
iterations count:180 (1), effective:0 (0)
iterations count:240 (1), effective:1 (0)
iterations count:240 (1), effective:1 (0)
iterations count:186 (1), effective:1 (0)
iterations count:180 (1), effective:0 (0)
iterations count:240 (1), effective:1 (0)
iterations count:240 (1), effective:1 (0)
iterations count:186 (1), effective:1 (0)
iterations count:188 (1), effective:1 (0)
iterations count:187 (1), effective:1 (0)
iterations count:3454 (19), effective:126 (0)
iterations count:180 (1), effective:0 (0)
iterations count:2171 (12), effective:80 (0)
iterations count:181 (1), effective:1 (0)
iterations count:1269 (7), effective:45 (0)
iterations count:2476 (13), effective:90 (0)
iterations count:1627 (9), effective:54 (0)
iterations count:1618 (8), effective:59 (0)
iterations count:180 (1), effective:0 (0)
iterations count:2171 (12), effective:80 (0)
iterations count:181 (1), effective:1 (0)
iterations count:1269 (7), effective:45 (0)
iterations count:1338 (7), effective:60 (0)
iterations count:180 (1), effective:0 (0)
iterations count:2171 (12), effective:80 (0)
iterations count:181 (1), effective:1 (0)
iterations count:1269 (7), effective:45 (0)
iterations count:4210 (23), effective:138 (0)
iterations count:2091 (11), effective:91 (0)
iterations count:4150 (23), effective:160 (0)
iterations count:180 (1), effective:0 (0)
iterations count:219 (1), effective:1 (0)
iterations count:182 (1), effective:1 (0)
iterations count:182 (1), effective:1 (0)
iterations count:180 (1), effective:0 (0)
iterations count:182 (1), effective:1 (0)
iterations count:1145 (6), effective:38 (0)
iterations count:1145 (6), effective:38 (0)
iterations count:352 (1), effective:10 (0)
iterations count:1145 (6), effective:38 (0)
iterations count:1491 (8), effective:45 (0)
iterations count:193 (1), effective:1 (0)
iterations count:183 (1), effective:1 (0)
iterations count:2420 (13), effective:91 (0)
iterations count:240 (1), effective:1 (0)
iterations count:187 (1), effective:1 (0)
iterations count:5026 (27), effective:193 (1)
iterations count:432 (2), effective:14 (0)
iterations count:193 (1), effective:1 (0)
iterations count:1888 (10), effective:79 (0)
iterations count:3929 (21), effective:133 (0)
iterations count:3941 (21), effective:145 (0)
iterations count:186 (1), effective:1 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-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 CANInsertWithFailure-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-167813696100698"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-005.tgz
mv CANInsertWithFailure-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 ;