fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r041-tajo-167813694700450
Last Updated
May 14, 2023

About the Execution of LTSMin+red for BusinessProcesses-PT-01

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15857.896 354020.00 1407954.00 60.70 TTTTFFFFFFFTTTTT 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.r041-tajo-167813694700450.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 ltsminxred
Input is BusinessProcesses-PT-01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694700450
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:46 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.3K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 47K 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-01-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678639221796

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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-01
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:40:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:40:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:40:23] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-03-12 16:40:23] [INFO ] Transformed 200 places.
[2023-03-12 16:40:23] [INFO ] Transformed 178 transitions.
[2023-03-12 16:40:23] [INFO ] Found NUPN structural information;
[2023-03-12 16:40:23] [INFO ] Parsed PT model containing 200 places and 178 transitions and 487 arcs in 105 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-01-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 88 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 177/177 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 197 transition count 177
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 179 transition count 159
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 179 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 179 transition count 158
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 43 place count 175 transition count 154
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 175 transition count 154
Applied a total of 47 rules in 30 ms. Remains 175 /199 variables (removed 24) and now considering 154/177 (removed 23) transitions.
// Phase 1: matrix 154 rows 175 cols
[2023-03-12 16:40:23] [INFO ] Computed 28 place invariants in 17 ms
[2023-03-12 16:40:23] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-12 16:40:23] [INFO ] Invariant cache hit.
[2023-03-12 16:40:23] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-12 16:40:23] [INFO ] Invariant cache hit.
[2023-03-12 16:40:24] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 175/199 places, 154/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 490 ms. Remains : 175/199 places, 154/177 transitions.
Support contains 88 out of 175 places after structural reductions.
[2023-03-12 16:40:24] [INFO ] Flatten gal took : 38 ms
[2023-03-12 16:40:24] [INFO ] Flatten gal took : 12 ms
[2023-03-12 16:40:24] [INFO ] Input system was already deterministic with 154 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 68) seen :60
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
[2023-03-12 16:40:25] [INFO ] Invariant cache hit.
[2023-03-12 16:40:25] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2023-03-12 16:40:25] [INFO ] [Real]Absence check using 18 positive and 10 generalized place invariants in 6 ms returned sat
[2023-03-12 16:40:25] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 16 ms
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 8 ms
[2023-03-12 16:40:25] [INFO ] Input system was already deterministic with 154 transitions.
Computed a total of 150 stabilizing places and 130 stable transitions
Graph (complete) has 355 edges and 175 vertex of which 174 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 154/154 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 156 transition count 135
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 156 transition count 135
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 149 transition count 128
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 149 transition count 128
Applied a total of 52 rules in 20 ms. Remains 149 /175 variables (removed 26) and now considering 128/154 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 149/175 places, 128/154 transitions.
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 6 ms
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 6 ms
[2023-03-12 16:40:25] [INFO ] Input system was already deterministic with 128 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 154/154 transitions.
Graph (trivial) has 94 edges and 175 vertex of which 6 / 175 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 349 edges and 170 vertex of which 169 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 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 27 place count 168 transition count 121
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 53 place count 143 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 142 transition count 120
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 54 place count 142 transition count 93
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 114 place count 109 transition count 93
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 129 place count 94 transition count 78
Iterating global reduction 3 with 15 rules applied. Total rules applied 144 place count 94 transition count 78
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 144 place count 94 transition count 76
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 148 place count 92 transition count 76
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 214 place count 59 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 215 place count 58 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 216 place count 57 transition count 42
Applied a total of 216 rules in 33 ms. Remains 57 /175 variables (removed 118) and now considering 42/154 (removed 112) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 57/175 places, 42/154 transitions.
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:40:25] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 154/154 transitions.
Graph (trivial) has 97 edges and 175 vertex of which 6 / 175 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 349 edges and 170 vertex of which 169 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 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 30 place count 168 transition count 118
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 140 transition count 118
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 58 place count 140 transition count 90
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 120 place count 106 transition count 90
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 139 place count 87 transition count 71
Iterating global reduction 2 with 19 rules applied. Total rules applied 158 place count 87 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 158 place count 87 transition count 70
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 160 place count 86 transition count 70
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 214 place count 59 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 215 place count 58 transition count 42
Applied a total of 215 rules in 25 ms. Remains 58 /175 variables (removed 117) and now considering 42/154 (removed 112) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 58/175 places, 42/154 transitions.
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:40:25] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 154/154 transitions.
Graph (complete) has 355 edges and 175 vertex of which 174 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 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 22 place count 173 transition count 131
Reduce places removed 21 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 152 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 150 transition count 129
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 47 place count 150 transition count 97
Deduced a syphon composed of 32 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 117 place count 112 transition count 97
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 134 place count 95 transition count 80
Iterating global reduction 3 with 17 rules applied. Total rules applied 151 place count 95 transition count 80
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 151 place count 95 transition count 78
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 155 place count 93 transition count 78
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 219 place count 61 transition count 46
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 61 transition count 45
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 61 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 222 place count 60 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 223 place count 59 transition count 44
Applied a total of 223 rules in 24 ms. Remains 59 /175 variables (removed 116) and now considering 44/154 (removed 110) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 59/175 places, 44/154 transitions.
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:40:25] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 154/154 transitions.
Graph (trivial) has 99 edges and 175 vertex of which 6 / 175 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 349 edges and 170 vertex of which 169 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 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 30 place count 168 transition count 118
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 140 transition count 118
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 58 place count 140 transition count 90
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 120 place count 106 transition count 90
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 138 place count 88 transition count 72
Iterating global reduction 2 with 18 rules applied. Total rules applied 156 place count 88 transition count 72
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 156 place count 88 transition count 70
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 160 place count 86 transition count 70
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 224 place count 54 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 225 place count 53 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 226 place count 52 transition count 37
Applied a total of 226 rules in 18 ms. Remains 52 /175 variables (removed 123) and now considering 37/154 (removed 117) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 52/175 places, 37/154 transitions.
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:40:25] [INFO ] Input system was already deterministic with 37 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 154/154 transitions.
Graph (trivial) has 100 edges and 175 vertex of which 6 / 175 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 349 edges and 170 vertex of which 169 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 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 30 place count 168 transition count 118
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 140 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 139 transition count 117
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 60 place count 139 transition count 89
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 122 place count 105 transition count 89
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 141 place count 86 transition count 70
Iterating global reduction 3 with 19 rules applied. Total rules applied 160 place count 86 transition count 70
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 160 place count 86 transition count 68
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 164 place count 84 transition count 68
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 226 place count 53 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 227 place count 52 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 228 place count 51 transition count 36
Applied a total of 228 rules in 17 ms. Remains 51 /175 variables (removed 124) and now considering 36/154 (removed 118) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 51/175 places, 36/154 transitions.
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:40:25] [INFO ] Input system was already deterministic with 36 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
FORMULA BusinessProcesses-PT-01-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 154/154 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 157 transition count 136
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 157 transition count 136
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 149 transition count 128
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 149 transition count 128
Applied a total of 52 rules in 7 ms. Remains 149 /175 variables (removed 26) and now considering 128/154 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 149/175 places, 128/154 transitions.
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 6 ms
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 6 ms
[2023-03-12 16:40:25] [INFO ] Input system was already deterministic with 128 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 154/154 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 154 transition count 133
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 154 transition count 133
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 146 transition count 125
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 146 transition count 125
Applied a total of 58 rules in 7 ms. Remains 146 /175 variables (removed 29) and now considering 125/154 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 146/175 places, 125/154 transitions.
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 5 ms
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 5 ms
[2023-03-12 16:40:25] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 154/154 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 157 transition count 136
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 157 transition count 136
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 148 transition count 127
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 148 transition count 127
Applied a total of 54 rules in 6 ms. Remains 148 /175 variables (removed 27) and now considering 127/154 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 148/175 places, 127/154 transitions.
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 6 ms
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 6 ms
[2023-03-12 16:40:25] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 154/154 transitions.
Graph (trivial) has 99 edges and 175 vertex of which 6 / 175 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 349 edges and 170 vertex of which 169 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 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 30 place count 168 transition count 118
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 140 transition count 118
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 58 place count 140 transition count 90
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 120 place count 106 transition count 90
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 138 place count 88 transition count 72
Iterating global reduction 2 with 18 rules applied. Total rules applied 156 place count 88 transition count 72
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 156 place count 88 transition count 70
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 160 place count 86 transition count 70
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 224 place count 54 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 225 place count 53 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 226 place count 52 transition count 37
Applied a total of 226 rules in 15 ms. Remains 52 /175 variables (removed 123) and now considering 37/154 (removed 117) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 52/175 places, 37/154 transitions.
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:40:25] [INFO ] Input system was already deterministic with 37 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 154/154 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 157 transition count 136
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 157 transition count 136
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 149 transition count 128
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 149 transition count 128
Applied a total of 52 rules in 6 ms. Remains 149 /175 variables (removed 26) and now considering 128/154 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 149/175 places, 128/154 transitions.
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 5 ms
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 5 ms
[2023-03-12 16:40:25] [INFO ] Input system was already deterministic with 128 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 154/154 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 154 transition count 133
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 154 transition count 133
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 145 transition count 124
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 145 transition count 124
Applied a total of 60 rules in 7 ms. Remains 145 /175 variables (removed 30) and now considering 124/154 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 145/175 places, 124/154 transitions.
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 5 ms
[2023-03-12 16:40:25] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 154/154 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 154 transition count 133
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 154 transition count 133
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 146 transition count 125
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 146 transition count 125
Applied a total of 58 rules in 6 ms. Remains 146 /175 variables (removed 29) and now considering 125/154 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 146/175 places, 125/154 transitions.
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 5 ms
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 5 ms
[2023-03-12 16:40:25] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 154/154 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 155 transition count 134
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 155 transition count 134
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 147 transition count 126
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 147 transition count 126
Applied a total of 56 rules in 6 ms. Remains 147 /175 variables (removed 28) and now considering 126/154 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 147/175 places, 126/154 transitions.
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 6 ms
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 5 ms
[2023-03-12 16:40:25] [INFO ] Input system was already deterministic with 126 transitions.
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 6 ms
[2023-03-12 16:40:25] [INFO ] Flatten gal took : 6 ms
[2023-03-12 16:40:25] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-12 16:40:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 175 places, 154 transitions and 437 arcs took 1 ms.
Total runtime 2439 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/472/ctl_0_ --ctl=/tmp/472/ctl_1_ --ctl=/tmp/472/ctl_2_ --ctl=/tmp/472/ctl_3_ --ctl=/tmp/472/ctl_4_ --ctl=/tmp/472/ctl_5_ --ctl=/tmp/472/ctl_6_ --ctl=/tmp/472/ctl_7_ --ctl=/tmp/472/ctl_8_ --ctl=/tmp/472/ctl_9_ --ctl=/tmp/472/ctl_10_ --ctl=/tmp/472/ctl_11_ --ctl=/tmp/472/ctl_12_ --mu-par --mu-opt
FORMULA BusinessProcesses-PT-01-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678639575816

--------------------
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
mcc2023
ctl formula name BusinessProcesses-PT-01-CTLFireability-00
ctl formula formula --ctl=/tmp/472/ctl_0_
ctl formula name BusinessProcesses-PT-01-CTLFireability-01
ctl formula formula --ctl=/tmp/472/ctl_1_
ctl formula name BusinessProcesses-PT-01-CTLFireability-02
ctl formula formula --ctl=/tmp/472/ctl_2_
ctl formula name BusinessProcesses-PT-01-CTLFireability-03
ctl formula formula --ctl=/tmp/472/ctl_3_
ctl formula name BusinessProcesses-PT-01-CTLFireability-04
ctl formula formula --ctl=/tmp/472/ctl_4_
ctl formula name BusinessProcesses-PT-01-CTLFireability-06
ctl formula formula --ctl=/tmp/472/ctl_5_
ctl formula name BusinessProcesses-PT-01-CTLFireability-07
ctl formula formula --ctl=/tmp/472/ctl_6_
ctl formula name BusinessProcesses-PT-01-CTLFireability-08
ctl formula formula --ctl=/tmp/472/ctl_7_
ctl formula name BusinessProcesses-PT-01-CTLFireability-09
ctl formula formula --ctl=/tmp/472/ctl_8_
ctl formula name BusinessProcesses-PT-01-CTLFireability-10
ctl formula formula --ctl=/tmp/472/ctl_9_
ctl formula name BusinessProcesses-PT-01-CTLFireability-11
ctl formula formula --ctl=/tmp/472/ctl_10_
ctl formula name BusinessProcesses-PT-01-CTLFireability-12
ctl formula formula --ctl=/tmp/472/ctl_11_
ctl formula name BusinessProcesses-PT-01-CTLFireability-15
ctl formula formula --ctl=/tmp/472/ctl_12_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 175 places, 154 transitions and 437 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 154->153 groups
pnml2lts-sym: Regrouping took 0.020 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 175; there are 153 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 374275 group checks and 0 next state calls
pnml2lts-sym: reachability took 3.310 real 13.210 user 0.030 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.030 real 0.110 user 0.000 sys
pnml2lts-sym: state space has 18381671166 states, 194127 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/472/ctl_2_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/472/ctl_3_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/472/ctl_12_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/472/ctl_1_ holds for the initial state
pnml2lts-sym: Formula /tmp/472/ctl_0_ holds for the initial state
pnml2lts-sym: Formula /tmp/472/ctl_11_ holds for the initial state
pnml2lts-sym: Formula /tmp/472/ctl_10_ holds for the initial state
pnml2lts-sym: Formula /tmp/472/ctl_4_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/472/ctl_5_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/472/ctl_6_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/472/ctl_8_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/472/ctl_9_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/472/ctl_7_ does not hold for the initial state
pnml2lts-sym: group_next: 999 nodes total
pnml2lts-sym: group_explored: 1242 nodes, 834 short vectors total
pnml2lts-sym: max token count: 1

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-01"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-01, 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 r041-tajo-167813694700450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-01.tgz
mv BusinessProcesses-PT-01 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 ;