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-167813695800474.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 BusinessProcesses-PT-04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695800474
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:43 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 3.6K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 79K 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 BusinessProcesses-PT-04-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678727773162

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=BusinessProcesses-PT-04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 17:16:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 17:16:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:16:16] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-13 17:16:16] [INFO ] Transformed 288 places.
[2023-03-13 17:16:16] [INFO ] Transformed 283 transitions.
[2023-03-13 17:16:16] [INFO ] Found NUPN structural information;
[2023-03-13 17:16:16] [INFO ] Parsed PT model containing 288 places and 283 transitions and 916 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 2 transitions.
Support contains 122 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 281/281 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 283 transition count 281
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 260 transition count 258
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 260 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 260 transition count 257
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 254 transition count 251
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 254 transition count 251
Applied a total of 62 rules in 40 ms. Remains 254 /286 variables (removed 32) and now considering 251/281 (removed 30) transitions.
// Phase 1: matrix 251 rows 254 cols
[2023-03-13 17:16:16] [INFO ] Computed 41 place invariants in 19 ms
[2023-03-13 17:16:16] [INFO ] Implicit Places using invariants in 258 ms returned []
[2023-03-13 17:16:16] [INFO ] Invariant cache hit.
[2023-03-13 17:16:16] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2023-03-13 17:16:16] [INFO ] Invariant cache hit.
[2023-03-13 17:16:17] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 254/286 places, 251/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 764 ms. Remains : 254/286 places, 251/281 transitions.
Support contains 122 out of 254 places after structural reductions.
[2023-03-13 17:16:17] [INFO ] Flatten gal took : 50 ms
[2023-03-13 17:16:17] [INFO ] Flatten gal took : 19 ms
[2023-03-13 17:16:17] [INFO ] Input system was already deterministic with 251 transitions.
Support contains 121 out of 254 places (down from 122) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 107 resets, run finished after 634 ms. (steps per millisecond=15 ) properties (out of 89) seen :70
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-13 17:16:18] [INFO ] Invariant cache hit.
[2023-03-13 17:16:18] [INFO ] [Real]Absence check using 18 positive place invariants in 4 ms returned sat
[2023-03-13 17:16:18] [INFO ] [Real]Absence check using 18 positive and 23 generalized place invariants in 7 ms returned sat
[2023-03-13 17:16:18] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:16
[2023-03-13 17:16:18] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2023-03-13 17:16:18] [INFO ] [Nat]Absence check using 18 positive and 23 generalized place invariants in 6 ms returned sat
[2023-03-13 17:16:18] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :15 sat :4
[2023-03-13 17:16:18] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 5 ms to minimize.
[2023-03-13 17:16:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-13 17:16:19] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2023-03-13 17:16:19] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 2 ms to minimize.
[2023-03-13 17:16:19] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 2 ms to minimize.
[2023-03-13 17:16:19] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 1 ms to minimize.
[2023-03-13 17:16:19] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 0 ms to minimize.
[2023-03-13 17:16:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 520 ms
[2023-03-13 17:16:19] [INFO ] After 795ms SMT Verify possible using trap constraints in natural domain returned unsat :16 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-13 17:16:19] [INFO ] After 1016ms SMT Verify possible using all constraints in natural domain returned unsat :16 sat :3
Fused 19 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 15 ms.
Support contains 9 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 251/251 transitions.
Graph (trivial) has 120 edges and 254 vertex of which 6 / 254 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 588 edges and 249 vertex of which 248 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 248 transition count 211
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 216 transition count 211
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 66 place count 216 transition count 166
Deduced a syphon composed of 45 places in 4 ms
Ensure Unique test removed 6 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 162 place count 165 transition count 166
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 180 place count 147 transition count 148
Iterating global reduction 2 with 18 rules applied. Total rules applied 198 place count 147 transition count 148
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 198 place count 147 transition count 144
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 206 place count 143 transition count 144
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 282 place count 105 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 284 place count 104 transition count 109
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 285 place count 104 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 286 place count 103 transition count 108
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 290 place count 103 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 291 place count 102 transition count 107
Applied a total of 291 rules in 64 ms. Remains 102 /254 variables (removed 152) and now considering 107/251 (removed 144) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 102/254 places, 107/251 transitions.
Finished random walk after 1766 steps, including 133 resets, run visited all 1 properties in 5 ms. (steps per millisecond=353 )
Successfully simplified 16 atomic propositions for a total of 16 simplifications.
[2023-03-13 17:16:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-13 17:16:19] [INFO ] Flatten gal took : 14 ms
[2023-03-13 17:16:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-04-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 17:16:19] [INFO ] Flatten gal took : 14 ms
[2023-03-13 17:16:19] [INFO ] Input system was already deterministic with 251 transitions.
Support contains 66 out of 254 places (down from 86) after GAL structural reductions.
Computed a total of 225 stabilizing places and 223 stable transitions
Graph (complete) has 598 edges and 254 vertex of which 253 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 254/254 places, 251/251 transitions.
Graph (trivial) has 121 edges and 254 vertex of which 6 / 254 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 591 edges and 249 vertex of which 248 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 247 transition count 211
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 215 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 214 transition count 210
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 68 place count 214 transition count 162
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 170 place count 160 transition count 162
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 189 place count 141 transition count 143
Iterating global reduction 3 with 19 rules applied. Total rules applied 208 place count 141 transition count 143
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 208 place count 141 transition count 140
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 214 place count 138 transition count 140
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 298 place count 96 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 299 place count 95 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 300 place count 94 transition count 97
Applied a total of 300 rules in 30 ms. Remains 94 /254 variables (removed 160) and now considering 97/251 (removed 154) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 94/254 places, 97/251 transitions.
[2023-03-13 17:16:19] [INFO ] Flatten gal took : 17 ms
[2023-03-13 17:16:19] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:16:19] [INFO ] Input system was already deterministic with 97 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA BusinessProcesses-PT-04-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 251/251 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 228 transition count 225
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 228 transition count 225
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 61 place count 219 transition count 216
Iterating global reduction 0 with 9 rules applied. Total rules applied 70 place count 219 transition count 216
Applied a total of 70 rules in 12 ms. Remains 219 /254 variables (removed 35) and now considering 216/251 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 219/254 places, 216/251 transitions.
[2023-03-13 17:16:19] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:16:19] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:16:19] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 251/251 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 230 transition count 227
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 230 transition count 227
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 221 transition count 218
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 221 transition count 218
Applied a total of 66 rules in 10 ms. Remains 221 /254 variables (removed 33) and now considering 218/251 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 221/254 places, 218/251 transitions.
[2023-03-13 17:16:19] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:16:19] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:16:19] [INFO ] Input system was already deterministic with 218 transitions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 251/251 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 232 transition count 229
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 232 transition count 229
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 226 transition count 223
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 226 transition count 223
Applied a total of 56 rules in 10 ms. Remains 226 /254 variables (removed 28) and now considering 223/251 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 226/254 places, 223/251 transitions.
[2023-03-13 17:16:19] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:16:19] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:16:19] [INFO ] Input system was already deterministic with 223 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 254/254 places, 251/251 transitions.
Graph (trivial) has 126 edges and 254 vertex of which 6 / 254 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 591 edges and 249 vertex of which 248 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 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 37 place count 247 transition count 208
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 72 place count 212 transition count 208
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 72 place count 212 transition count 162
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 170 place count 160 transition count 162
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 189 place count 141 transition count 143
Iterating global reduction 2 with 19 rules applied. Total rules applied 208 place count 141 transition count 143
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 208 place count 141 transition count 139
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 216 place count 137 transition count 139
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 296 place count 97 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 297 place count 96 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 298 place count 95 transition count 98
Applied a total of 298 rules in 25 ms. Remains 95 /254 variables (removed 159) and now considering 98/251 (removed 153) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 95/254 places, 98/251 transitions.
[2023-03-13 17:16:19] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:16:19] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:16:20] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 251/251 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 229 transition count 226
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 229 transition count 226
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 220 transition count 217
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 220 transition count 217
Applied a total of 68 rules in 11 ms. Remains 220 /254 variables (removed 34) and now considering 217/251 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 220/254 places, 217/251 transitions.
[2023-03-13 17:16:20] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:16:20] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:16:20] [INFO ] Input system was already deterministic with 217 transitions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 251/251 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 229 transition count 226
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 229 transition count 226
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 221 transition count 218
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 221 transition count 218
Applied a total of 66 rules in 10 ms. Remains 221 /254 variables (removed 33) and now considering 218/251 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 221/254 places, 218/251 transitions.
[2023-03-13 17:16:20] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:16:20] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:16:20] [INFO ] Input system was already deterministic with 218 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 254/254 places, 251/251 transitions.
Graph (trivial) has 125 edges and 254 vertex of which 6 / 254 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 591 edges and 249 vertex of which 248 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 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 37 place count 247 transition count 208
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 72 place count 212 transition count 208
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 72 place count 212 transition count 163
Deduced a syphon composed of 45 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 168 place count 161 transition count 163
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 186 place count 143 transition count 145
Iterating global reduction 2 with 18 rules applied. Total rules applied 204 place count 143 transition count 145
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 204 place count 143 transition count 141
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 212 place count 139 transition count 141
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 298 place count 96 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 299 place count 95 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 300 place count 94 transition count 97
Applied a total of 300 rules in 25 ms. Remains 94 /254 variables (removed 160) and now considering 97/251 (removed 154) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 94/254 places, 97/251 transitions.
[2023-03-13 17:16:20] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:16:20] [INFO ] Flatten gal took : 4 ms
[2023-03-13 17:16:20] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 251/251 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 230 transition count 227
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 230 transition count 227
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 222 transition count 219
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 222 transition count 219
Applied a total of 64 rules in 12 ms. Remains 222 /254 variables (removed 32) and now considering 219/251 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 222/254 places, 219/251 transitions.
[2023-03-13 17:16:20] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:16:20] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:16:20] [INFO ] Input system was already deterministic with 219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 251/251 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 234 transition count 231
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 234 transition count 231
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 228 transition count 225
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 228 transition count 225
Applied a total of 52 rules in 10 ms. Remains 228 /254 variables (removed 26) and now considering 225/251 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 228/254 places, 225/251 transitions.
[2023-03-13 17:16:20] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:16:20] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:16:20] [INFO ] Input system was already deterministic with 225 transitions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 251/251 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 231 transition count 228
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 231 transition count 228
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 223 transition count 220
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 223 transition count 220
Applied a total of 62 rules in 9 ms. Remains 223 /254 variables (removed 31) and now considering 220/251 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 223/254 places, 220/251 transitions.
[2023-03-13 17:16:20] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:16:20] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:16:20] [INFO ] Input system was already deterministic with 220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 251/251 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 228 transition count 225
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 228 transition count 225
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 61 place count 219 transition count 216
Iterating global reduction 0 with 9 rules applied. Total rules applied 70 place count 219 transition count 216
Applied a total of 70 rules in 10 ms. Remains 219 /254 variables (removed 35) and now considering 216/251 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 219/254 places, 216/251 transitions.
[2023-03-13 17:16:20] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:16:20] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:16:20] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 251/251 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 230 transition count 227
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 230 transition count 227
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 221 transition count 218
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 221 transition count 218
Applied a total of 66 rules in 9 ms. Remains 221 /254 variables (removed 33) and now considering 218/251 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 221/254 places, 218/251 transitions.
[2023-03-13 17:16:20] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:16:20] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:16:20] [INFO ] Input system was already deterministic with 218 transitions.
[2023-03-13 17:16:20] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:16:20] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:16:20] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-13 17:16:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 254 places, 251 transitions and 849 arcs took 2 ms.
Total runtime 4280 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: 254 NrTr: 251 NrArc: 849)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.004sec

net check time: 0m 0.000sec

init dd package: 0m 3.023sec


RS generation: 0m49.283sec


-> reachability set: #nodes 1457840 (1.5e+06) #states 182,634,670,629 (11)



starting MCC model checker
--------------------------

checking: AG [EF [[p121<=1 & 1<=p121]]]
normalized: ~ [E [true U ~ [E [true U [p121<=1 & 1<=p121]]]]]

abstracting: (1<=p121)
states: 56,022,991 (7)
abstracting: (p121<=1)
states: 182,634,670,629 (11)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-04-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m56.687sec

checking: EF [AG [[p152<=1 & 1<=p152]]]
normalized: E [true U ~ [E [true U ~ [[p152<=1 & 1<=p152]]]]]

abstracting: (1<=p152)
states: 43,042,007,232 (10)
abstracting: (p152<=1)
states: 182,634,670,629 (11)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-04-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.150sec

checking: EF [EG [AX [[p95<=1 & 1<=p95]]]]
normalized: E [true U EG [~ [EX [~ [[p95<=1 & 1<=p95]]]]]]

abstracting: (1<=p95)
states: 3,881,645,376 (9)
abstracting: (p95<=1)
states: 182,634,670,629 (11)
...
EG iterations: 2
-> the formula is TRUE

FORMULA BusinessProcesses-PT-04-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m48.371sec

checking: EG [AX [EX [[EX [[p219<=1 & 1<=p219]] | EG [[1<=p226 & p226<=1]]]]]]
normalized: EG [~ [EX [~ [EX [[EG [[1<=p226 & p226<=1]] | EX [[p219<=1 & 1<=p219]]]]]]]]

abstracting: (1<=p219)
states: 8,942,628,364 (9)
abstracting: (p219<=1)
states: 182,634,670,629 (11)
.abstracting: (p226<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p226)
states: 120,593,592 (8)
.........
before gc: list nodes free: 924985

after gc: idd nodes used:2239010, unused:61760990; list nodes free:269209758
......................................
EG iterations: 47
..
before gc: list nodes free: 1604863

after gc: idd nodes used:5248447, unused:58751553; list nodes free:254919418
.....MC time: 6m15.514sec

checking: AX [[AX [AG [[[p92<=0 & 0<=p92] | [p145<=0 & 0<=p145]]]] | EX [EX [EG [[p188<=1 & 1<=p188]]]]]]
normalized: ~ [EX [~ [[EX [EX [EG [[p188<=1 & 1<=p188]]]] | ~ [EX [E [true U ~ [[[p145<=0 & 0<=p145] | [p92<=0 & 0<=p92]]]]]]]]]]

abstracting: (0<=p92)
states: 182,634,670,629 (11)
abstracting: (p92<=0)
states: 178,753,025,397 (11)
abstracting: (0<=p145)
states: 182,634,670,629 (11)
abstracting: (p145<=0)
states: 177,368,509,475 (11)

before gc: list nodes free: 1781515

after gc: idd nodes used:2387859, unused:61612141; list nodes free:268695976
.abstracting: (1<=p188)
states: 1,344,036,064 (9)
abstracting: (p188<=1)
states: 182,634,670,629 (11)
........................................
EG iterations: 40
...-> the formula is FALSE

FORMULA BusinessProcesses-PT-04-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 4.797sec

checking: E [[~ [A [EG [~ [[p168<=1 & 1<=p168]]] U ~ [EF [[p125<=1 & 1<=p125]]]]] & EF [[p22<=1 & 1<=p22]]] U AF [AG [EX [[[p155<=1 & 1<=p155] & [p253<=1 & 1<=p253]]]]]]
normalized: E [[E [true U [p22<=1 & 1<=p22]] & ~ [[~ [EG [E [true U [p125<=1 & 1<=p125]]]] & ~ [E [E [true U [p125<=1 & 1<=p125]] U [~ [EG [~ [[p168<=1 & 1<=p168]]]] & E [true U [p125<=1 & 1<=p125]]]]]]]] U ~ [EG [E [true U ~ [EX [[[p253<=1 & 1<=p253] & [p155<=1 & 1<=p155]]]]]]]]

abstracting: (1<=p155)
states: 19,940,485,998 (10)
abstracting: (p155<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p253)
states: 42,562,080 (7)
abstracting: (p253<=1)
states: 182,634,670,629 (11)
.
EG iterations: 0
abstracting: (1<=p125)
states: 36,750,706,911 (10)
abstracting: (p125<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p168)
states: 104,134,362 (8)
abstracting: (p168<=1)
states: 182,634,670,629 (11)

before gc: list nodes free: 3796006

after gc: idd nodes used:5548114, unused:58451886; list nodes free:254627939
......................
EG iterations: 22
abstracting: (1<=p125)
states: 36,750,706,911 (10)
abstracting: (p125<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p125)
states: 36,750,706,911 (10)
abstracting: (p125<=1)
states: 182,634,670,629 (11)
...MC time: 6m 0.005sec

checking: AG [[[p187<=1 & 1<=p187] | [AG [[[[p99<=0 & 0<=p99] | [p154<=0 & 0<=p154]] | [[p215<=0 & 0<=p215] | [p59<=1 & 1<=p59]]]] | AX [[p61<=0 & 0<=p61]]]]]
normalized: ~ [E [true U ~ [[[~ [EX [~ [[p61<=0 & 0<=p61]]]] | ~ [E [true U ~ [[[[p59<=1 & 1<=p59] | [p215<=0 & 0<=p215]] | [[p154<=0 & 0<=p154] | [p99<=0 & 0<=p99]]]]]]] | [p187<=1 & 1<=p187]]]]]

abstracting: (1<=p187)
states: 428,947,680 (8)
abstracting: (p187<=1)
states: 182,634,670,629 (11)
abstracting: (0<=p99)
states: 182,634,670,629 (11)
abstracting: (p99<=0)
states: 178,813,954,117 (11)
abstracting: (0<=p154)
states: 182,634,670,629 (11)
abstracting: (p154<=0)
states: 121,238,708,727 (11)
abstracting: (0<=p215)
states: 182,634,670,629 (11)
abstracting: (p215<=0)
states: 176,903,595,861 (11)
abstracting: (1<=p59)
states: 42,562,512 (7)
abstracting: (p59<=1)
states: 182,634,670,629 (11)

before gc: list nodes free: 660295

after gc: idd nodes used:4222449, unused:59777551; list nodes free:260853993
abstracting: (0<=p61)
states: 182,634,670,629 (11)
abstracting: (p61<=0)
states: 181,214,264,997 (11)
.-> the formula is TRUE

FORMULA BusinessProcesses-PT-04-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m48.655sec

checking: [AG [EF [[p101<=1 & 1<=p101]]] & [EX [EG [[p2<=0 & 0<=p2]]] | [EF [EX [A [[[p228<=1 & 1<=p228] & [[p231<=1 & 1<=p231] & [p234<=1 & 1<=p234]]] U [p181<=1 & 1<=p181]]]] & AF [[p188<=0 & 0<=p188]]]]]
normalized: [[[~ [EG [~ [[p188<=0 & 0<=p188]]]] & E [true U EX [[~ [EG [~ [[p181<=1 & 1<=p181]]]] & ~ [E [~ [[p181<=1 & 1<=p181]] U [~ [[[[p234<=1 & 1<=p234] & [p231<=1 & 1<=p231]] & [p228<=1 & 1<=p228]]] & ~ [[p181<=1 & 1<=p181]]]]]]]]] | EX [EG [[p2<=0 & 0<=p2]]]] & ~ [E [true U ~ [E [true U [p101<=1 & 1<=p101]]]]]]

abstracting: (1<=p101)
states: 3,820,716,512 (9)
abstracting: (p101<=1)
states: 182,634,670,629 (11)
abstracting: (0<=p2)
states: 182,634,670,629 (11)
abstracting: (p2<=0)
states: 182,633,223,932 (11)

before gc: list nodes free: 2993727

after gc: idd nodes used:6364393, unused:57635607; list nodes free:250711178
..
EG iterations: 2
.abstracting: (1<=p181)
states: 5,304,439,296 (9)
abstracting: (p181<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p228)
states: 83,219,328 (7)
abstracting: (p228<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p231)
states: 83,349,360 (7)
abstracting: (p231<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p234)
states: 125,911,872 (8)
abstracting: (p234<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p181)
states: 5,304,439,296 (9)
abstracting: (p181<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p181)
states: 5,304,439,296 (9)
abstracting: (p181<=1)
states: 182,634,670,629 (11)
MC time: 5m44.115sec

checking: EF [[[p206<=1 & 1<=p206] | [AX [[EX [[p155<=0 & 0<=p155]] & [p48<=1 & 1<=p48]]] & E [[[p202<=1 & 1<=p202] | [[p53<=1 & 1<=p53] & [[p170<=1 & 1<=p170] & [p219<=1 & 1<=p219]]]] U ~ [[[[p87<=1 & 1<=p87] & [[p167<=1 & 1<=p167] & [p210<=1 & 1<=p210]]] | [p205<=1 & 1<=p205]]]]]]]
normalized: E [true U [[E [[[[[p219<=1 & 1<=p219] & [p170<=1 & 1<=p170]] & [p53<=1 & 1<=p53]] | [p202<=1 & 1<=p202]] U ~ [[[p205<=1 & 1<=p205] | [[[p210<=1 & 1<=p210] & [p167<=1 & 1<=p167]] & [p87<=1 & 1<=p87]]]]] & ~ [EX [~ [[[p48<=1 & 1<=p48] & EX [[p155<=0 & 0<=p155]]]]]]] | [p206<=1 & 1<=p206]]]

abstracting: (1<=p206)
states: 21,197,376 (7)
abstracting: (p206<=1)
states: 182,634,670,629 (11)
abstracting: (0<=p155)
states: 182,634,670,629 (11)
abstracting: (p155<=0)
states: 162,694,184,631 (11)

before gc: list nodes free: 17049

after gc: idd nodes used:7191590, unused:56808410; list nodes free:247214883
.abstracting: (1<=p48)
states: 19,374,278,832 (10)
abstracting: (p48<=1)
states: 182,634,670,629 (11)
.abstracting: (1<=p87)
states: 70,825,680 (7)
abstracting: (p87<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p167)
states: 76,725,989,271 (10)
abstracting: (p167<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p210)
states: 21,281,256 (7)
abstracting: (p210<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p205)
states: 42,562,512 (7)
abstracting: (p205<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p202)
states: 14,131,584 (7)
abstracting: (p202<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p53)
states: 21,084,933,964 (10)
abstracting: (p53<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p170)
states: 103,652,132 (8)
abstracting: (p170<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p219)
states: 8,942,628,364 (9)
abstracting: (p219<=1)
states: 182,634,670,629 (11)
-> the formula is TRUE

FORMULA BusinessProcesses-PT-04-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m56.529sec

checking: [AF [EX [~ [A [[[p102<=1 & 1<=p102] & [[p166<=1 & 1<=p166] & [p219<=1 & 1<=p219]]] U [p150<=1 & 1<=p150]]]]] & E [EX [[A [[[p62<=1 & 1<=p62] & [[p144<=1 & 1<=p144] & [p208<=1 & 1<=p208]]] U [p58<=1 & 1<=p58]] & [AX [[p213<=1 & 1<=p213]] & EF [AX [[p45<=1 & 1<=p45]]]]]] U EF [AG [[~ [[p4<=1 & 1<=p4]] | AX [[p196<=1 & 1<=p196]]]]]]]
normalized: [E [EX [[[E [true U ~ [EX [~ [[p45<=1 & 1<=p45]]]]] & ~ [EX [~ [[p213<=1 & 1<=p213]]]]] & [~ [EG [~ [[p58<=1 & 1<=p58]]]] & ~ [E [~ [[p58<=1 & 1<=p58]] U [~ [[[[p208<=1 & 1<=p208] & [p144<=1 & 1<=p144]] & [p62<=1 & 1<=p62]]] & ~ [[p58<=1 & 1<=p58]]]]]]]] U E [true U ~ [E [true U ~ [[~ [EX [~ [[p196<=1 & 1<=p196]]]] | ~ [[p4<=1 & 1<=p4]]]]]]]] & ~ [EG [~ [EX [~ [[~ [EG [~ [[p150<=1 & 1<=p150]]]] & ~ [E [~ [[p150<=1 & 1<=p150]] U [~ [[[[p219<=1 & 1<=p219] & [p166<=1 & 1<=p166]] & [p102<=1 & 1<=p102]]] & ~ [[p150<=1 & 1<=p150]]]]]]]]]]]]

abstracting: (1<=p150)
states: 9,397,874,087 (9)
abstracting: (p150<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p102)
states: 88,778,475,832 (10)
abstracting: (p102<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p166)
states: 18,540,467,136 (10)
abstracting: (p166<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p219)
states: 8,942,628,364 (9)
abstracting: (p219<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p150)
states: 9,397,874,087 (9)
abstracting: (p150<=1)
states: 182,634,670,629 (11)

before gc: list nodes free: 448461

after gc: idd nodes used:7467827, unused:56532173; list nodes free:248983500
abstracting: (1<=p150)
states: 9,397,874,087 (9)
abstracting: (p150<=1)
states: 182,634,670,629 (11)
.....
before gc: list nodes free: 1697290

after gc: idd nodes used:9888173, unused:54111827; list nodes free:239542174
.MC time: 5m 5.727sec

checking: [[~ [E [~ [AX [[p23<=1 & 1<=p23]]] U EX [[p241<=1 & 1<=p241]]]] | EX [AG [~ [[p45<=1 & 1<=p45]]]]] & [EF [[[[p183<=1 & 1<=p183] | [p2<=1 & 1<=p2]] & EG [[p33<=1 & 1<=p33]]]] | [AG [[A [[p191<=1 & 1<=p191] U [[p228<=1 & 1<=p228] & [[p231<=1 & 1<=p231] & [p234<=1 & 1<=p234]]]] & [[[p66<=1 & 1<=p66] & [p211<=1 & 1<=p211]] | [p104<=1 & 1<=p104]]]] | AX [[[[p135<=1 & 1<=p135] & [p106<=1 & 1<=p106]] | AX [[p142<=1 & 1<=p142]]]]]]]
normalized: [[[~ [EX [~ [[~ [EX [~ [[p142<=1 & 1<=p142]]]] | [[p106<=1 & 1<=p106] & [p135<=1 & 1<=p135]]]]]] | ~ [E [true U ~ [[[[p104<=1 & 1<=p104] | [[p211<=1 & 1<=p211] & [p66<=1 & 1<=p66]]] & [~ [EG [~ [[[[p234<=1 & 1<=p234] & [p231<=1 & 1<=p231]] & [p228<=1 & 1<=p228]]]]] & ~ [E [~ [[[[p234<=1 & 1<=p234] & [p231<=1 & 1<=p231]] & [p228<=1 & 1<=p228]]] U [~ [[p191<=1 & 1<=p191]] & ~ [[[[p234<=1 & 1<=p234] & [p231<=1 & 1<=p231]] & [p228<=1 & 1<=p228]]]]]]]]]]]] | E [true U [EG [[p33<=1 & 1<=p33]] & [[p2<=1 & 1<=p2] | [p183<=1 & 1<=p183]]]]] & [EX [~ [E [true U [p45<=1 & 1<=p45]]]] | ~ [E [EX [~ [[p23<=1 & 1<=p23]]] U EX [[p241<=1 & 1<=p241]]]]]]

abstracting: (1<=p241)
states: 42,450,480 (7)
abstracting: (p241<=1)
states: 182,634,670,629 (11)
.abstracting: (1<=p23)
states: 10,885,989,904 (10)
abstracting: (p23<=1)
states: 182,634,670,629 (11)

before gc: list nodes free: 1052025

after gc: idd nodes used:7782699, unused:56217301; list nodes free:249547929
.abstracting: (1<=p45)
states: 16,597,224,468 (10)
abstracting: (p45<=1)
states: 182,634,670,629 (11)

before gc: list nodes free: 5748390

after gc: idd nodes used:7831385, unused:56168615; list nodes free:249421270
MC time: 4m14.014sec

checking: EX [[AG [[[[p87<=0 & 0<=p87] | [[p167<=0 & 0<=p167] | [p233<=0 & 0<=p233]]] & [[[p87<=0 & 0<=p87] | [[p167<=0 & 0<=p167] | [p245<=0 & 0<=p245]]] & [p137<=0 & 0<=p137]]]] | E [[~ [EG [[p247<=1 & 1<=p247]]] & [[[[p13<=1 & 1<=p13] & [p126<=1 & 1<=p126]] & [[p185<=1 & 1<=p185] & [p60<=1 & 1<=p60]]] | ~ [[p5<=1 & 1<=p5]]]] U A [A [[p61<=1 & 1<=p61] U [[p99<=1 & 1<=p99] & [[p154<=1 & 1<=p154] & [p215<=1 & 1<=p215]]]] U AF [[[p66<=1 & 1<=p66] & [p211<=1 & 1<=p211]]]]]]]
normalized: EX [[~ [E [true U ~ [[[[[p233<=0 & 0<=p233] | [p167<=0 & 0<=p167]] | [p87<=0 & 0<=p87]] & [[p137<=0 & 0<=p137] & [[[p245<=0 & 0<=p245] | [p167<=0 & 0<=p167]] | [p87<=0 & 0<=p87]]]]]]] | E [[[~ [[p5<=1 & 1<=p5]] | [[[p60<=1 & 1<=p60] & [p185<=1 & 1<=p185]] & [[p126<=1 & 1<=p126] & [p13<=1 & 1<=p13]]]] & ~ [EG [[p247<=1 & 1<=p247]]]] U [~ [EG [EG [~ [[[p211<=1 & 1<=p211] & [p66<=1 & 1<=p66]]]]]] & ~ [E [EG [~ [[[p211<=1 & 1<=p211] & [p66<=1 & 1<=p66]]]] U [~ [[~ [EG [~ [[[[p215<=1 & 1<=p215] & [p154<=1 & 1<=p154]] & [p99<=1 & 1<=p99]]]]] & ~ [E [~ [[[[p215<=1 & 1<=p215] & [p154<=1 & 1<=p154]] & [p99<=1 & 1<=p99]]] U [~ [[[[p215<=1 & 1<=p215] & [p154<=1 & 1<=p154]] & [p99<=1 & 1<=p99]]] & ~ [[p61<=1 & 1<=p61]]]]]]] & EG [~ [[[p211<=1 & 1<=p211] & [p66<=1 & 1<=p66]]]]]]]]]]]

abstracting: (1<=p66)
states: 42,562,512 (7)
abstracting: (p66<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p211)
states: 42,562,512 (7)
abstracting: (p211<=1)
states: 182,634,670,629 (11)
...........................................
EG iterations: 43
abstracting: (1<=p61)
states: 1,420,405,632 (9)
abstracting: (p61<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p99)
states: 3,820,716,512 (9)
abstracting: (p99<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p154)
states: 61,395,961,902 (10)
abstracting: (p154<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p215)
states: 5,731,074,768 (9)
abstracting: (p215<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p99)
states: 3,820,716,512 (9)
abstracting: (p99<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p154)
states: 61,395,961,902 (10)
abstracting: (p154<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p215)
states: 5,731,074,768 (9)
abstracting: (p215<=1)
states: 182,634,670,629 (11)

before gc: list nodes free: 3966827

after gc: idd nodes used:7301242, unused:56698758; list nodes free:251720448
abstracting: (1<=p99)
states: 3,820,716,512 (9)
abstracting: (p99<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p154)
states: 61,395,961,902 (10)
abstracting: (p154<=1)
states: 182,634,670,629 (11)
abstracting: (1<=p215)
states: 5,731,074,768 (9)
abstracting: (p215<=1)
states: 182,634,670,629 (11)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6142324 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16098764 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:28659 (114), effective:2149 (8)

initing FirstDep: 0m 0.000sec


iterations count:364 (1), effective:8 (0)

iterations count:367 (1), effective:9 (0)

iterations count:254 (1), effective:1 (0)

iterations count:8393 (33), effective:269 (1)

ctl_mc.icc:221: Timeout: after 374 sec


iterations count:2014 (8), effective:94 (0)

iterations count:450 (1), effective:20 (0)

iterations count:376 (1), effective:12 (0)

iterations count:376 (1), effective:12 (0)

iterations count:353 (1), effective:3 (0)

iterations count:376 (1), effective:12 (0)

net_ddint.h:600: Timeout: after 359 sec


iterations count:6102 (24), effective:231 (0)

iterations count:6034 (24), effective:224 (0)

iterations count:4698 (18), effective:158 (0)

iterations count:257 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 343 sec


iterations count:251 (1), effective:0 (0)

iterations count:8379 (33), effective:267 (1)

iterations count:382 (1), effective:14 (0)

net_ddint.h:600: Timeout: after 304 sec


iterations count:2037 (8), effective:88 (0)

sat_reach.icc:155: Timeout: after 253 sec


iterations count:291 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 210 sec

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="BusinessProcesses-PT-04"
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 BusinessProcesses-PT-04, 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-167813695800474"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-04.tgz
mv BusinessProcesses-PT-04 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;