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-167813694800498.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-07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694800498
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 16:42 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.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K 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 100K 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-07-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678640511065

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-07
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:01:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 17:01:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:01:52] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-12 17:01:52] [INFO ] Transformed 386 places.
[2023-03-12 17:01:52] [INFO ] Transformed 360 transitions.
[2023-03-12 17:01:52] [INFO ] Found NUPN structural information;
[2023-03-12 17:01:52] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 137 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 95 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 360/360 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 385 transition count 360
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 44 place count 342 transition count 317
Iterating global reduction 1 with 43 rules applied. Total rules applied 87 place count 342 transition count 317
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 102 place count 327 transition count 302
Iterating global reduction 1 with 15 rules applied. Total rules applied 117 place count 327 transition count 302
Applied a total of 117 rules in 72 ms. Remains 327 /386 variables (removed 59) and now considering 302/360 (removed 58) transitions.
// Phase 1: matrix 302 rows 327 cols
[2023-03-12 17:01:53] [INFO ] Computed 61 place invariants in 22 ms
[2023-03-12 17:01:53] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-12 17:01:53] [INFO ] Invariant cache hit.
[2023-03-12 17:01:53] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2023-03-12 17:01:53] [INFO ] Invariant cache hit.
[2023-03-12 17:01:53] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 327/386 places, 302/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 875 ms. Remains : 327/386 places, 302/360 transitions.
Support contains 95 out of 327 places after structural reductions.
[2023-03-12 17:01:54] [INFO ] Flatten gal took : 53 ms
[2023-03-12 17:01:54] [INFO ] Flatten gal took : 23 ms
[2023-03-12 17:01:54] [INFO ] Input system was already deterministic with 302 transitions.
Incomplete random walk after 10000 steps, including 105 resets, run finished after 595 ms. (steps per millisecond=16 ) properties (out of 61) seen :42
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) 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 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) 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 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 8 ms. (steps per millisecond=125 ) 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 2 resets, run finished after 8 ms. (steps per millisecond=125 ) 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 2 resets, run finished after 8 ms. (steps per millisecond=125 ) 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 2 resets, run finished after 8 ms. (steps per millisecond=125 ) 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 2 resets, run finished after 8 ms. (steps per millisecond=125 ) 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 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-12 17:01:55] [INFO ] Invariant cache hit.
[2023-03-12 17:01:55] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-12 17:01:55] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 9 ms returned sat
[2023-03-12 17:01:55] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-12 17:01:55] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-12 17:01:55] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 9 ms returned sat
[2023-03-12 17:01:55] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :10
[2023-03-12 17:01:55] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 5 ms to minimize.
[2023-03-12 17:01:55] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2023-03-12 17:01:56] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2023-03-12 17:01:56] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2023-03-12 17:01:56] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2023-03-12 17:01:56] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2023-03-12 17:01:56] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2023-03-12 17:01:56] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2023-03-12 17:01:56] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2023-03-12 17:01:56] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 0 ms to minimize.
[2023-03-12 17:01:56] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2023-03-12 17:01:56] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 873 ms
[2023-03-12 17:01:56] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2023-03-12 17:01:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-12 17:01:57] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 1 ms to minimize.
[2023-03-12 17:01:57] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 1 ms to minimize.
[2023-03-12 17:01:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2023-03-12 17:01:57] [INFO ] After 1673ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :10
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-12 17:01:57] [INFO ] After 2079ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :10
Fused 19 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 174 ms.
Support contains 18 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 302/302 transitions.
Graph (complete) has 747 edges and 327 vertex of which 326 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 326 transition count 274
Reduce places removed 27 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 299 transition count 272
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 297 transition count 272
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 59 place count 297 transition count 207
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 197 place count 224 transition count 207
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 210 place count 211 transition count 194
Iterating global reduction 3 with 13 rules applied. Total rules applied 223 place count 211 transition count 194
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 223 place count 211 transition count 193
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 225 place count 210 transition count 193
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 133 rules applied. Total rules applied 358 place count 143 transition count 127
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 359 place count 143 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 360 place count 142 transition count 126
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 370 place count 142 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 371 place count 141 transition count 125
Applied a total of 371 rules in 91 ms. Remains 141 /327 variables (removed 186) and now considering 125/302 (removed 177) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 141/327 places, 125/302 transitions.
Incomplete random walk after 10000 steps, including 827 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 191 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 222 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 212 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 231 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 204 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 212 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 234 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 218 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 125 rows 141 cols
[2023-03-12 17:01:58] [INFO ] Computed 52 place invariants in 5 ms
[2023-03-12 17:01:58] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-12 17:01:58] [INFO ] [Real]Absence check using 34 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-12 17:01:58] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 17:01:58] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-12 17:01:58] [INFO ] [Nat]Absence check using 34 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-12 17:01:58] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 17:01:58] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2023-03-12 17:01:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-12 17:01:59] [INFO ] Deduced a trap composed of 39 places in 360 ms of which 26 ms to minimize.
[2023-03-12 17:01:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 392 ms
[2023-03-12 17:01:59] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2023-03-12 17:01:59] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 0 ms to minimize.
[2023-03-12 17:01:59] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 0 ms to minimize.
[2023-03-12 17:01:59] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2023-03-12 17:01:59] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2023-03-12 17:01:59] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 0 ms to minimize.
[2023-03-12 17:01:59] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2023-03-12 17:01:59] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 0 ms to minimize.
[2023-03-12 17:02:00] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 0 ms to minimize.
[2023-03-12 17:02:00] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 840 ms
[2023-03-12 17:02:00] [INFO ] After 1397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-12 17:02:00] [INFO ] After 1534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 38 ms.
Support contains 15 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 125/125 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 141 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 140 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 140 transition count 123
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 4 place count 139 transition count 123
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 138 transition count 122
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 138 transition count 122
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 135 transition count 120
Applied a total of 11 rules in 41 ms. Remains 135 /141 variables (removed 6) and now considering 120/125 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 135/141 places, 120/125 transitions.
Incomplete random walk after 10000 steps, including 805 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 205 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 225 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 230 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 201 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 238 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 223 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 250 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 7) seen :0
Finished probabilistic random walk after 18786 steps, run visited all 7 properties in 197 ms. (steps per millisecond=95 )
Probabilistic random walk after 18786 steps, saw 5462 distinct states, run finished after 197 ms. (steps per millisecond=95 ) properties seen :7
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2023-03-12 17:02:01] [INFO ] Flatten gal took : 24 ms
[2023-03-12 17:02:01] [INFO ] Flatten gal took : 30 ms
[2023-03-12 17:02:01] [INFO ] Input system was already deterministic with 302 transitions.
Support contains 74 out of 327 places (down from 81) after GAL structural reductions.
Computed a total of 202 stabilizing places and 204 stable transitions
Graph (complete) has 747 edges and 327 vertex of which 326 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 309 transition count 284
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 309 transition count 284
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 303 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 303 transition count 278
Applied a total of 48 rules in 42 ms. Remains 303 /327 variables (removed 24) and now considering 278/302 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 303/327 places, 278/302 transitions.
[2023-03-12 17:02:01] [INFO ] Flatten gal took : 27 ms
[2023-03-12 17:02:01] [INFO ] Flatten gal took : 26 ms
[2023-03-12 17:02:01] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 309 transition count 284
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 309 transition count 284
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 303 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 303 transition count 278
Applied a total of 48 rules in 63 ms. Remains 303 /327 variables (removed 24) and now considering 278/302 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 303/327 places, 278/302 transitions.
[2023-03-12 17:02:01] [INFO ] Flatten gal took : 26 ms
[2023-03-12 17:02:01] [INFO ] Flatten gal took : 26 ms
[2023-03-12 17:02:01] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Graph (trivial) has 156 edges and 327 vertex of which 6 / 327 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 741 edges and 322 vertex of which 321 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 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 320 transition count 256
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 282 transition count 256
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 78 place count 282 transition count 193
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 135 rules applied. Total rules applied 213 place count 210 transition count 193
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 228 place count 195 transition count 178
Iterating global reduction 2 with 15 rules applied. Total rules applied 243 place count 195 transition count 178
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 243 place count 195 transition count 176
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 247 place count 193 transition count 176
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 145 rules applied. Total rules applied 392 place count 119 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 118 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 394 place count 117 transition count 104
Applied a total of 394 rules in 71 ms. Remains 117 /327 variables (removed 210) and now considering 104/302 (removed 198) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 71 ms. Remains : 117/327 places, 104/302 transitions.
[2023-03-12 17:02:01] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:02:01] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:02:02] [INFO ] Input system was already deterministic with 104 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
FORMULA BusinessProcesses-PT-07-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Graph (complete) has 747 edges and 327 vertex of which 326 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 325 transition count 269
Reduce places removed 31 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 294 transition count 267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 292 transition count 267
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 67 place count 292 transition count 198
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 147 rules applied. Total rules applied 214 place count 214 transition count 198
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 230 place count 198 transition count 182
Iterating global reduction 3 with 16 rules applied. Total rules applied 246 place count 198 transition count 182
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 246 place count 198 transition count 181
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 248 place count 197 transition count 181
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 135 rules applied. Total rules applied 383 place count 128 transition count 115
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 389 place count 128 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 390 place count 127 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 391 place count 126 transition count 114
Applied a total of 391 rules in 95 ms. Remains 126 /327 variables (removed 201) and now considering 114/302 (removed 188) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 95 ms. Remains : 126/327 places, 114/302 transitions.
[2023-03-12 17:02:02] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:02:02] [INFO ] Flatten gal took : 20 ms
[2023-03-12 17:02:02] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 309 transition count 284
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 309 transition count 284
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 303 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 303 transition count 278
Applied a total of 48 rules in 51 ms. Remains 303 /327 variables (removed 24) and now considering 278/302 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 303/327 places, 278/302 transitions.
[2023-03-12 17:02:02] [INFO ] Flatten gal took : 24 ms
[2023-03-12 17:02:02] [INFO ] Flatten gal took : 24 ms
[2023-03-12 17:02:02] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Graph (trivial) has 156 edges and 327 vertex of which 6 / 327 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 741 edges and 322 vertex of which 321 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 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 320 transition count 256
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 282 transition count 256
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 78 place count 282 transition count 192
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 215 place count 209 transition count 192
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 231 place count 193 transition count 176
Iterating global reduction 2 with 16 rules applied. Total rules applied 247 place count 193 transition count 176
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 247 place count 193 transition count 174
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 251 place count 191 transition count 174
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 141 rules applied. Total rules applied 392 place count 119 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 118 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 394 place count 117 transition count 104
Applied a total of 394 rules in 51 ms. Remains 117 /327 variables (removed 210) and now considering 104/302 (removed 198) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 117/327 places, 104/302 transitions.
[2023-03-12 17:02:02] [INFO ] Flatten gal took : 19 ms
[2023-03-12 17:02:02] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:02:02] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 309 transition count 284
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 309 transition count 284
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 303 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 303 transition count 278
Applied a total of 48 rules in 25 ms. Remains 303 /327 variables (removed 24) and now considering 278/302 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 303/327 places, 278/302 transitions.
[2023-03-12 17:02:02] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:02:02] [INFO ] Flatten gal took : 24 ms
[2023-03-12 17:02:02] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 316 transition count 291
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 316 transition count 291
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 313 transition count 288
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 313 transition count 288
Applied a total of 28 rules in 27 ms. Remains 313 /327 variables (removed 14) and now considering 288/302 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 313/327 places, 288/302 transitions.
[2023-03-12 17:02:02] [INFO ] Flatten gal took : 28 ms
[2023-03-12 17:02:02] [INFO ] Flatten gal took : 19 ms
[2023-03-12 17:02:02] [INFO ] Input system was already deterministic with 288 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 311 transition count 286
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 311 transition count 286
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 306 transition count 281
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 306 transition count 281
Applied a total of 42 rules in 8 ms. Remains 306 /327 variables (removed 21) and now considering 281/302 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 306/327 places, 281/302 transitions.
[2023-03-12 17:02:02] [INFO ] Flatten gal took : 27 ms
[2023-03-12 17:02:02] [INFO ] Flatten gal took : 21 ms
[2023-03-12 17:02:02] [INFO ] Input system was already deterministic with 281 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Graph (trivial) has 155 edges and 327 vertex of which 6 / 327 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 741 edges and 322 vertex of which 321 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 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 320 transition count 256
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 282 transition count 256
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 78 place count 282 transition count 194
Deduced a syphon composed of 62 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 210 place count 212 transition count 194
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 226 place count 196 transition count 178
Iterating global reduction 2 with 16 rules applied. Total rules applied 242 place count 196 transition count 178
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 242 place count 196 transition count 176
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 246 place count 194 transition count 176
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 143 rules applied. Total rules applied 389 place count 121 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 390 place count 120 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 391 place count 119 transition count 105
Applied a total of 391 rules in 39 ms. Remains 119 /327 variables (removed 208) and now considering 105/302 (removed 197) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 119/327 places, 105/302 transitions.
[2023-03-12 17:02:02] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:02:02] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:02:02] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 311 transition count 286
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 311 transition count 286
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 307 transition count 282
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 307 transition count 282
Applied a total of 40 rules in 11 ms. Remains 307 /327 variables (removed 20) and now considering 282/302 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 307/327 places, 282/302 transitions.
[2023-03-12 17:02:02] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:02:02] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:02:02] [INFO ] Input system was already deterministic with 282 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 310 transition count 285
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 310 transition count 285
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 304 transition count 279
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 304 transition count 279
Applied a total of 46 rules in 12 ms. Remains 304 /327 variables (removed 23) and now considering 279/302 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 304/327 places, 279/302 transitions.
[2023-03-12 17:02:02] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:02:02] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:02:02] [INFO ] Input system was already deterministic with 279 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Graph (trivial) has 153 edges and 327 vertex of which 6 / 327 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 741 edges and 322 vertex of which 321 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 320 transition count 258
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 284 transition count 258
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 74 place count 284 transition count 193
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 213 place count 210 transition count 193
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 227 place count 196 transition count 179
Iterating global reduction 2 with 14 rules applied. Total rules applied 241 place count 196 transition count 179
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 241 place count 196 transition count 177
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 245 place count 194 transition count 177
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 141 rules applied. Total rules applied 386 place count 122 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 387 place count 121 transition count 107
Applied a total of 387 rules in 27 ms. Remains 121 /327 variables (removed 206) and now considering 107/302 (removed 195) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 121/327 places, 107/302 transitions.
[2023-03-12 17:02:03] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:02:03] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:02:03] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 309 transition count 284
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 309 transition count 284
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 303 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 303 transition count 278
Applied a total of 48 rules in 11 ms. Remains 303 /327 variables (removed 24) and now considering 278/302 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 303/327 places, 278/302 transitions.
[2023-03-12 17:02:03] [INFO ] Flatten gal took : 9 ms
[2023-03-12 17:02:03] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:02:03] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 309 transition count 284
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 309 transition count 284
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 303 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 303 transition count 278
Applied a total of 48 rules in 11 ms. Remains 303 /327 variables (removed 24) and now considering 278/302 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 303/327 places, 278/302 transitions.
[2023-03-12 17:02:03] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:02:03] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:02:03] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 311 transition count 286
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 311 transition count 286
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 305 transition count 280
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 305 transition count 280
Applied a total of 44 rules in 11 ms. Remains 305 /327 variables (removed 22) and now considering 280/302 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 305/327 places, 280/302 transitions.
[2023-03-12 17:02:03] [INFO ] Flatten gal took : 9 ms
[2023-03-12 17:02:03] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:02:03] [INFO ] Input system was already deterministic with 280 transitions.
[2023-03-12 17:02:03] [INFO ] Flatten gal took : 9 ms
[2023-03-12 17:02:03] [INFO ] Flatten gal took : 9 ms
[2023-03-12 17:02:03] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-12 17:02:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 327 places, 302 transitions and 993 arcs took 2 ms.
Total runtime 10432 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/568/ctl_0_ --ctl=/tmp/568/ctl_1_ --ctl=/tmp/568/ctl_2_ --ctl=/tmp/568/ctl_3_ --ctl=/tmp/568/ctl_4_ --ctl=/tmp/568/ctl_5_ --ctl=/tmp/568/ctl_6_ --ctl=/tmp/568/ctl_7_ --ctl=/tmp/568/ctl_8_ --ctl=/tmp/568/ctl_9_ --ctl=/tmp/568/ctl_10_ --ctl=/tmp/568/ctl_11_ --ctl=/tmp/568/ctl_12_ --ctl=/tmp/568/ctl_13_ --ctl=/tmp/568/ctl_14_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393356 kB
MemFree: 13116712 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16098520 kB
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-00
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-01
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-03
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-04
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-05
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-06
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-07
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-08
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-09
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-10
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-11
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-12
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-13
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-14
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-15

BK_STOP 1678644094761

--------------------
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-07-CTLFireability-00
ctl formula formula --ctl=/tmp/568/ctl_0_
ctl formula name BusinessProcesses-PT-07-CTLFireability-01
ctl formula formula --ctl=/tmp/568/ctl_1_
ctl formula name BusinessProcesses-PT-07-CTLFireability-03
ctl formula formula --ctl=/tmp/568/ctl_2_
ctl formula name BusinessProcesses-PT-07-CTLFireability-04
ctl formula formula --ctl=/tmp/568/ctl_3_
ctl formula name BusinessProcesses-PT-07-CTLFireability-05
ctl formula formula --ctl=/tmp/568/ctl_4_
ctl formula name BusinessProcesses-PT-07-CTLFireability-06
ctl formula formula --ctl=/tmp/568/ctl_5_
ctl formula name BusinessProcesses-PT-07-CTLFireability-07
ctl formula formula --ctl=/tmp/568/ctl_6_
ctl formula name BusinessProcesses-PT-07-CTLFireability-08
ctl formula formula --ctl=/tmp/568/ctl_7_
ctl formula name BusinessProcesses-PT-07-CTLFireability-09
ctl formula formula --ctl=/tmp/568/ctl_8_
ctl formula name BusinessProcesses-PT-07-CTLFireability-10
ctl formula formula --ctl=/tmp/568/ctl_9_
ctl formula name BusinessProcesses-PT-07-CTLFireability-11
ctl formula formula --ctl=/tmp/568/ctl_10_
ctl formula name BusinessProcesses-PT-07-CTLFireability-12
ctl formula formula --ctl=/tmp/568/ctl_11_
ctl formula name BusinessProcesses-PT-07-CTLFireability-13
ctl formula formula --ctl=/tmp/568/ctl_12_
ctl formula name BusinessProcesses-PT-07-CTLFireability-14
ctl formula formula --ctl=/tmp/568/ctl_13_
ctl formula name BusinessProcesses-PT-07-CTLFireability-15
ctl formula formula --ctl=/tmp/568/ctl_14_
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 327 places, 302 transitions and 993 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.000 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: 302->301 groups
pnml2lts-sym: Regrouping took 0.070 real 0.070 user 0.000 sys
pnml2lts-sym: state vector length is 327; there are 301 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: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
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
Killing (15) : 574
Killing (9) : 574

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-07"
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-07, 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-167813694800498"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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