Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813695900538.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is BusinessProcesses-PT-12, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695900538
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:48 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.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 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 146K 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-12-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678731612681

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:20:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 18:20:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:20:14] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2023-03-13 18:20:14] [INFO ] Transformed 586 places.
[2023-03-13 18:20:14] [INFO ] Transformed 525 transitions.
[2023-03-13 18:20:14] [INFO ] Found NUPN structural information;
[2023-03-13 18:20:14] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 261 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
Support contains 128 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 579 transition count 521
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 59 place count 523 transition count 465
Iterating global reduction 1 with 56 rules applied. Total rules applied 115 place count 523 transition count 465
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 136 place count 502 transition count 444
Iterating global reduction 1 with 21 rules applied. Total rules applied 157 place count 502 transition count 444
Applied a total of 157 rules in 254 ms. Remains 502 /582 variables (removed 80) and now considering 444/521 (removed 77) transitions.
// Phase 1: matrix 444 rows 502 cols
[2023-03-13 18:20:15] [INFO ] Computed 95 place invariants in 45 ms
[2023-03-13 18:20:22] [INFO ] Implicit Places using invariants in 7517 ms returned []
[2023-03-13 18:20:22] [INFO ] Invariant cache hit.
[2023-03-13 18:20:23] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 8323 ms to find 0 implicit places.
[2023-03-13 18:20:23] [INFO ] Invariant cache hit.
[2023-03-13 18:20:24] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 502/582 places, 444/521 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9021 ms. Remains : 502/582 places, 444/521 transitions.
Support contains 128 out of 502 places after structural reductions.
[2023-03-13 18:20:24] [INFO ] Flatten gal took : 77 ms
[2023-03-13 18:20:24] [INFO ] Flatten gal took : 45 ms
[2023-03-13 18:20:24] [INFO ] Input system was already deterministic with 444 transitions.
Support contains 111 out of 502 places (down from 128) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 742 ms. (steps per millisecond=13 ) properties (out of 71) seen :34
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) 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 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 37) 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 37) 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 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) 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 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 37) 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 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) 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 37) 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 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Running SMT prover for 37 properties.
[2023-03-13 18:20:25] [INFO ] Invariant cache hit.
[2023-03-13 18:20:26] [INFO ] [Real]Absence check using 54 positive place invariants in 32 ms returned sat
[2023-03-13 18:20:26] [INFO ] [Real]Absence check using 54 positive and 41 generalized place invariants in 19 ms returned sat
[2023-03-13 18:20:26] [INFO ] After 613ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:37
[2023-03-13 18:20:26] [INFO ] [Nat]Absence check using 54 positive place invariants in 13 ms returned sat
[2023-03-13 18:20:26] [INFO ] [Nat]Absence check using 54 positive and 41 generalized place invariants in 18 ms returned sat
[2023-03-13 18:20:28] [INFO ] After 1104ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :34
[2023-03-13 18:20:28] [INFO ] Deduced a trap composed of 20 places in 201 ms of which 5 ms to minimize.
[2023-03-13 18:20:28] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2023-03-13 18:20:28] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
[2023-03-13 18:20:28] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 10 ms to minimize.
[2023-03-13 18:20:29] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 1 ms to minimize.
[2023-03-13 18:20:29] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 1 ms to minimize.
[2023-03-13 18:20:29] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 2 ms to minimize.
[2023-03-13 18:20:29] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 1 ms to minimize.
[2023-03-13 18:20:29] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 0 ms to minimize.
[2023-03-13 18:20:29] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 1 ms to minimize.
[2023-03-13 18:20:29] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1644 ms
[2023-03-13 18:20:30] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 1 ms to minimize.
[2023-03-13 18:20:30] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 1 ms to minimize.
[2023-03-13 18:20:30] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2023-03-13 18:20:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 333 ms
[2023-03-13 18:20:30] [INFO ] Deduced a trap composed of 106 places in 168 ms of which 1 ms to minimize.
[2023-03-13 18:20:30] [INFO ] Deduced a trap composed of 114 places in 127 ms of which 1 ms to minimize.
[2023-03-13 18:20:31] [INFO ] Deduced a trap composed of 104 places in 158 ms of which 1 ms to minimize.
[2023-03-13 18:20:31] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 1 ms to minimize.
[2023-03-13 18:20:31] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 1 ms to minimize.
[2023-03-13 18:20:31] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 1 ms to minimize.
[2023-03-13 18:20:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1012 ms
[2023-03-13 18:20:32] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2023-03-13 18:20:32] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2023-03-13 18:20:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 253 ms
[2023-03-13 18:20:32] [INFO ] Deduced a trap composed of 111 places in 177 ms of which 0 ms to minimize.
[2023-03-13 18:20:32] [INFO ] Deduced a trap composed of 111 places in 186 ms of which 1 ms to minimize.
[2023-03-13 18:20:32] [INFO ] Deduced a trap composed of 101 places in 169 ms of which 1 ms to minimize.
[2023-03-13 18:20:33] [INFO ] Deduced a trap composed of 95 places in 160 ms of which 0 ms to minimize.
[2023-03-13 18:20:33] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 1 ms to minimize.
[2023-03-13 18:20:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 943 ms
[2023-03-13 18:20:33] [INFO ] Deduced a trap composed of 105 places in 151 ms of which 0 ms to minimize.
[2023-03-13 18:20:33] [INFO ] Deduced a trap composed of 117 places in 196 ms of which 1 ms to minimize.
[2023-03-13 18:20:33] [INFO ] Deduced a trap composed of 108 places in 170 ms of which 1 ms to minimize.
[2023-03-13 18:20:34] [INFO ] Deduced a trap composed of 114 places in 172 ms of which 13 ms to minimize.
[2023-03-13 18:20:34] [INFO ] Deduced a trap composed of 109 places in 174 ms of which 1 ms to minimize.
[2023-03-13 18:20:34] [INFO ] Deduced a trap composed of 109 places in 182 ms of which 1 ms to minimize.
[2023-03-13 18:20:34] [INFO ] Deduced a trap composed of 124 places in 195 ms of which 0 ms to minimize.
[2023-03-13 18:20:34] [INFO ] Deduced a trap composed of 120 places in 141 ms of which 1 ms to minimize.
[2023-03-13 18:20:35] [INFO ] Deduced a trap composed of 123 places in 128 ms of which 4 ms to minimize.
[2023-03-13 18:20:35] [INFO ] Deduced a trap composed of 111 places in 160 ms of which 0 ms to minimize.
[2023-03-13 18:20:35] [INFO ] Deduced a trap composed of 118 places in 157 ms of which 0 ms to minimize.
[2023-03-13 18:20:35] [INFO ] Deduced a trap composed of 116 places in 107 ms of which 0 ms to minimize.
[2023-03-13 18:20:40] [INFO ] Deduced a trap composed of 110 places in 5039 ms of which 21 ms to minimize.
[2023-03-13 18:20:40] [INFO ] Deduced a trap composed of 97 places in 175 ms of which 2 ms to minimize.
[2023-03-13 18:20:40] [INFO ] Deduced a trap composed of 107 places in 145 ms of which 0 ms to minimize.
[2023-03-13 18:20:41] [INFO ] Deduced a trap composed of 121 places in 119 ms of which 5 ms to minimize.
[2023-03-13 18:20:41] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 10 ms to minimize.
[2023-03-13 18:20:41] [INFO ] Deduced a trap composed of 108 places in 105 ms of which 1 ms to minimize.
[2023-03-13 18:20:41] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 1 ms to minimize.
[2023-03-13 18:20:41] [INFO ] Deduced a trap composed of 100 places in 140 ms of which 1 ms to minimize.
[2023-03-13 18:20:42] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 0 ms to minimize.
[2023-03-13 18:20:42] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 8925 ms
[2023-03-13 18:20:42] [INFO ] After 15575ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :34
Attempting to minimize the solution found.
Minimization took 973 ms.
[2023-03-13 18:20:43] [INFO ] After 17209ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :34
Fused 37 Parikh solutions to 34 different solutions.
Parikh walk visited 7 properties in 665 ms.
Support contains 46 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 444/444 transitions.
Graph (complete) has 1093 edges and 502 vertex of which 501 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 501 transition count 396
Reduce places removed 47 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 55 rules applied. Total rules applied 103 place count 454 transition count 388
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 111 place count 446 transition count 388
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 111 place count 446 transition count 296
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 307 place count 342 transition count 296
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 329 place count 320 transition count 274
Iterating global reduction 3 with 22 rules applied. Total rules applied 351 place count 320 transition count 274
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 351 place count 320 transition count 273
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 353 place count 319 transition count 273
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 199 rules applied. Total rules applied 552 place count 218 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 553 place count 218 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 555 place count 217 transition count 178
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 561 place count 217 transition count 178
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 562 place count 216 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 563 place count 215 transition count 177
Applied a total of 563 rules in 207 ms. Remains 215 /502 variables (removed 287) and now considering 177/444 (removed 267) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 215/502 places, 177/444 transitions.
Incomplete random walk after 10000 steps, including 747 resets, run finished after 516 ms. (steps per millisecond=19 ) properties (out of 27) seen :2
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 15 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Interrupted probabilistic random walk after 624494 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1}
Probabilistic random walk after 624494 steps, saw 98609 distinct states, run finished after 3006 ms. (steps per millisecond=207 ) properties seen :23
Running SMT prover for 2 properties.
// Phase 1: matrix 177 rows 215 cols
[2023-03-13 18:20:48] [INFO ] Computed 79 place invariants in 4 ms
[2023-03-13 18:20:48] [INFO ] [Real]Absence check using 51 positive place invariants in 6 ms returned sat
[2023-03-13 18:20:48] [INFO ] [Real]Absence check using 51 positive and 28 generalized place invariants in 5 ms returned sat
[2023-03-13 18:20:48] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 18:20:48] [INFO ] [Nat]Absence check using 51 positive place invariants in 7 ms returned sat
[2023-03-13 18:20:48] [INFO ] [Nat]Absence check using 51 positive and 28 generalized place invariants in 5 ms returned sat
[2023-03-13 18:20:48] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 18:20:48] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 18:20:48] [INFO ] After 36ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 18:20:48] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2023-03-13 18:20:48] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2023-03-13 18:20:49] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2023-03-13 18:20:49] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2023-03-13 18:20:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 320 ms
[2023-03-13 18:20:49] [INFO ] After 399ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-13 18:20:49] [INFO ] After 578ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 177/177 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 215 transition count 172
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 210 transition count 172
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 10 place count 210 transition count 158
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 44 place count 190 transition count 158
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 188 transition count 156
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 188 transition count 156
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 89 place count 167 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 166 transition count 135
Applied a total of 90 rules in 47 ms. Remains 166 /215 variables (removed 49) and now considering 135/177 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 166/215 places, 135/177 transitions.
Incomplete random walk after 10000 steps, including 1111 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 287 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 316 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Finished probabilistic random walk after 19548 steps, run visited all 2 properties in 73 ms. (steps per millisecond=267 )
Probabilistic random walk after 19548 steps, saw 5929 distinct states, run finished after 73 ms. (steps per millisecond=267 ) properties seen :2
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-13 18:20:49] [INFO ] Flatten gal took : 30 ms
[2023-03-13 18:20:49] [INFO ] Flatten gal took : 30 ms
[2023-03-13 18:20:49] [INFO ] Input system was already deterministic with 444 transitions.
Support contains 105 out of 502 places (down from 106) after GAL structural reductions.
Computed a total of 487 stabilizing places and 429 stable transitions
Graph (complete) has 1093 edges and 502 vertex of which 501 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 444/444 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 472 transition count 414
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 472 transition count 414
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 76 place count 456 transition count 398
Iterating global reduction 0 with 16 rules applied. Total rules applied 92 place count 456 transition count 398
Applied a total of 92 rules in 29 ms. Remains 456 /502 variables (removed 46) and now considering 398/444 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 456/502 places, 398/444 transitions.
[2023-03-13 18:20:49] [INFO ] Flatten gal took : 22 ms
[2023-03-13 18:20:49] [INFO ] Flatten gal took : 23 ms
[2023-03-13 18:20:49] [INFO ] Input system was already deterministic with 398 transitions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 444/444 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 472 transition count 414
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 472 transition count 414
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 75 place count 457 transition count 399
Iterating global reduction 0 with 15 rules applied. Total rules applied 90 place count 457 transition count 399
Applied a total of 90 rules in 28 ms. Remains 457 /502 variables (removed 45) and now considering 399/444 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 457/502 places, 399/444 transitions.
[2023-03-13 18:20:49] [INFO ] Flatten gal took : 22 ms
[2023-03-13 18:20:49] [INFO ] Flatten gal took : 23 ms
[2023-03-13 18:20:49] [INFO ] Input system was already deterministic with 399 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 502/502 places, 444/444 transitions.
Graph (trivial) has 252 edges and 502 vertex of which 6 / 502 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1087 edges and 497 vertex of which 496 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 495 transition count 365
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 144 place count 424 transition count 365
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 144 place count 424 transition count 268
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 356 place count 309 transition count 268
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 387 place count 278 transition count 237
Iterating global reduction 2 with 31 rules applied. Total rules applied 418 place count 278 transition count 237
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 418 place count 278 transition count 236
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 420 place count 277 transition count 236
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 642 place count 164 transition count 127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 643 place count 163 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 644 place count 162 transition count 126
Applied a total of 644 rules in 59 ms. Remains 162 /502 variables (removed 340) and now considering 126/444 (removed 318) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 162/502 places, 126/444 transitions.
[2023-03-13 18:20:49] [INFO ] Flatten gal took : 8 ms
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:20:50] [INFO ] Input system was already deterministic with 126 transitions.
Incomplete random walk after 10000 steps, including 2058 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 593 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 304 steps, run visited all 1 properties in 6 ms. (steps per millisecond=50 )
Probabilistic random walk after 304 steps, saw 159 distinct states, run finished after 6 ms. (steps per millisecond=50 ) properties seen :1
FORMULA BusinessProcesses-PT-12-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 444/444 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 471 transition count 413
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 471 transition count 413
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 78 place count 455 transition count 397
Iterating global reduction 0 with 16 rules applied. Total rules applied 94 place count 455 transition count 397
Applied a total of 94 rules in 22 ms. Remains 455 /502 variables (removed 47) and now considering 397/444 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 455/502 places, 397/444 transitions.
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 14 ms
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 17 ms
[2023-03-13 18:20:50] [INFO ] Input system was already deterministic with 397 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 502/502 places, 444/444 transitions.
Graph (trivial) has 251 edges and 502 vertex of which 6 / 502 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 1087 edges and 497 vertex of which 496 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 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 495 transition count 365
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 144 place count 424 transition count 365
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 144 place count 424 transition count 268
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 356 place count 309 transition count 268
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 386 place count 279 transition count 238
Iterating global reduction 2 with 30 rules applied. Total rules applied 416 place count 279 transition count 238
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 416 place count 279 transition count 237
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 418 place count 278 transition count 237
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 640 place count 165 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 641 place count 164 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 642 place count 163 transition count 127
Applied a total of 642 rules in 45 ms. Remains 163 /502 variables (removed 339) and now considering 127/444 (removed 317) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 163/502 places, 127/444 transitions.
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:20:50] [INFO ] Input system was already deterministic with 127 transitions.
Finished random walk after 14 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
FORMULA BusinessProcesses-PT-12-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 502/502 places, 444/444 transitions.
Graph (trivial) has 244 edges and 502 vertex of which 6 / 502 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 1087 edges and 497 vertex of which 496 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 495 transition count 370
Reduce places removed 66 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 429 transition count 369
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 428 transition count 369
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 136 place count 428 transition count 272
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 348 place count 313 transition count 272
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 377 place count 284 transition count 243
Iterating global reduction 3 with 29 rules applied. Total rules applied 406 place count 284 transition count 243
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 406 place count 284 transition count 242
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 408 place count 283 transition count 242
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 211 rules applied. Total rules applied 619 place count 177 transition count 137
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 625 place count 177 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 626 place count 176 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 627 place count 175 transition count 136
Applied a total of 627 rules in 46 ms. Remains 175 /502 variables (removed 327) and now considering 136/444 (removed 308) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 175/502 places, 136/444 transitions.
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:20:50] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 502/502 places, 444/444 transitions.
Graph (complete) has 1093 edges and 502 vertex of which 501 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 500 transition count 382
Reduce places removed 60 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 62 rules applied. Total rules applied 123 place count 440 transition count 380
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 125 place count 438 transition count 380
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 125 place count 438 transition count 272
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 359 place count 312 transition count 272
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 389 place count 282 transition count 242
Iterating global reduction 3 with 30 rules applied. Total rules applied 419 place count 282 transition count 242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 419 place count 282 transition count 241
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 421 place count 281 transition count 241
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 641 place count 169 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 642 place count 168 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 643 place count 167 transition count 132
Applied a total of 643 rules in 36 ms. Remains 167 /502 variables (removed 335) and now considering 132/444 (removed 312) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 167/502 places, 132/444 transitions.
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:20:50] [INFO ] Input system was already deterministic with 132 transitions.
Incomplete random walk after 10000 steps, including 742 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 233 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 13985 steps, run visited all 1 properties in 35 ms. (steps per millisecond=399 )
Probabilistic random walk after 13985 steps, saw 4191 distinct states, run finished after 35 ms. (steps per millisecond=399 ) properties seen :1
FORMULA BusinessProcesses-PT-12-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 502/502 places, 444/444 transitions.
Graph (trivial) has 250 edges and 502 vertex of which 6 / 502 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 1087 edges and 497 vertex of which 496 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 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 495 transition count 365
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 144 place count 424 transition count 365
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 144 place count 424 transition count 270
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 351 place count 312 transition count 270
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 381 place count 282 transition count 240
Iterating global reduction 2 with 30 rules applied. Total rules applied 411 place count 282 transition count 240
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 411 place count 282 transition count 239
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 413 place count 281 transition count 239
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 637 place count 167 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 638 place count 166 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 639 place count 165 transition count 128
Applied a total of 639 rules in 37 ms. Remains 165 /502 variables (removed 337) and now considering 128/444 (removed 316) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 165/502 places, 128/444 transitions.
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:20:50] [INFO ] Input system was already deterministic with 128 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 502/502 places, 444/444 transitions.
Graph (trivial) has 252 edges and 502 vertex of which 6 / 502 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 1087 edges and 497 vertex of which 496 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 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 495 transition count 365
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 424 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 423 transition count 364
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 146 place count 423 transition count 268
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 355 place count 310 transition count 268
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 386 place count 279 transition count 237
Iterating global reduction 3 with 31 rules applied. Total rules applied 417 place count 279 transition count 237
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 417 place count 279 transition count 236
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 419 place count 278 transition count 236
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 641 place count 165 transition count 127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 642 place count 164 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 643 place count 163 transition count 126
Applied a total of 643 rules in 35 ms. Remains 163 /502 variables (removed 339) and now considering 126/444 (removed 318) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 163/502 places, 126/444 transitions.
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:20:50] [INFO ] Input system was already deterministic with 126 transitions.
Finished random walk after 8930 steps, including 1830 resets, run visited all 1 properties in 19 ms. (steps per millisecond=470 )
FORMULA BusinessProcesses-PT-12-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 502/502 places, 444/444 transitions.
Graph (trivial) has 250 edges and 502 vertex of which 6 / 502 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 1087 edges and 497 vertex of which 496 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 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 495 transition count 366
Reduce places removed 70 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 425 transition count 364
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 146 place count 423 transition count 364
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 146 place count 423 transition count 267
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 358 place count 308 transition count 267
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 386 place count 280 transition count 239
Iterating global reduction 3 with 28 rules applied. Total rules applied 414 place count 280 transition count 239
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 638 place count 166 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 639 place count 165 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 640 place count 164 transition count 128
Applied a total of 640 rules in 34 ms. Remains 164 /502 variables (removed 338) and now considering 128/444 (removed 316) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 164/502 places, 128/444 transitions.
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:20:50] [INFO ] Input system was already deterministic with 128 transitions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 444/444 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 478 transition count 420
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 478 transition count 420
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 467 transition count 409
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 467 transition count 409
Applied a total of 70 rules in 24 ms. Remains 467 /502 variables (removed 35) and now considering 409/444 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 467/502 places, 409/444 transitions.
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:20:50] [INFO ] Input system was already deterministic with 409 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 502/502 places, 444/444 transitions.
Graph (trivial) has 251 edges and 502 vertex of which 6 / 502 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 1087 edges and 497 vertex of which 496 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 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 495 transition count 365
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 144 place count 424 transition count 365
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 144 place count 424 transition count 268
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 356 place count 309 transition count 268
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 386 place count 279 transition count 238
Iterating global reduction 2 with 30 rules applied. Total rules applied 416 place count 279 transition count 238
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 640 place count 165 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 641 place count 164 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 642 place count 163 transition count 127
Applied a total of 642 rules in 29 ms. Remains 163 /502 variables (removed 339) and now considering 127/444 (removed 317) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 163/502 places, 127/444 transitions.
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:20:50] [INFO ] Input system was already deterministic with 127 transitions.
Finished random walk after 29 steps, including 8 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
FORMULA BusinessProcesses-PT-12-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 444/444 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 472 transition count 414
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 472 transition count 414
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 74 place count 458 transition count 400
Iterating global reduction 0 with 14 rules applied. Total rules applied 88 place count 458 transition count 400
Applied a total of 88 rules in 24 ms. Remains 458 /502 variables (removed 44) and now considering 400/444 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 458/502 places, 400/444 transitions.
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:20:50] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 444/444 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 473 transition count 415
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 473 transition count 415
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 72 place count 459 transition count 401
Iterating global reduction 0 with 14 rules applied. Total rules applied 86 place count 459 transition count 401
Applied a total of 86 rules in 19 ms. Remains 459 /502 variables (removed 43) and now considering 401/444 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 459/502 places, 401/444 transitions.
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:20:50] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 502/502 places, 444/444 transitions.
Graph (trivial) has 253 edges and 502 vertex of which 6 / 502 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 1087 edges and 497 vertex of which 496 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 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 495 transition count 364
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 423 transition count 364
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 146 place count 423 transition count 267
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 358 place count 308 transition count 267
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 389 place count 277 transition count 236
Iterating global reduction 2 with 31 rules applied. Total rules applied 420 place count 277 transition count 236
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 420 place count 277 transition count 235
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 422 place count 276 transition count 235
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 640 place count 165 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 641 place count 164 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 642 place count 163 transition count 127
Applied a total of 642 rules in 33 ms. Remains 163 /502 variables (removed 339) and now considering 127/444 (removed 317) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 163/502 places, 127/444 transitions.
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:20:50] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:20:50] [INFO ] Input system was already deterministic with 127 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
FORMULA BusinessProcesses-PT-12-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 444/444 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 470 transition count 412
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 470 transition count 412
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 80 place count 454 transition count 396
Iterating global reduction 0 with 16 rules applied. Total rules applied 96 place count 454 transition count 396
Applied a total of 96 rules in 19 ms. Remains 454 /502 variables (removed 48) and now considering 396/444 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 454/502 places, 396/444 transitions.
[2023-03-13 18:20:51] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:20:51] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:20:51] [INFO ] Input system was already deterministic with 396 transitions.
[2023-03-13 18:20:51] [INFO ] Flatten gal took : 13 ms
[2023-03-13 18:20:51] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:20:51] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-13 18:20:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 502 places, 444 transitions and 1395 arcs took 2 ms.
Total runtime 36426 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 502 NrTr: 444 NrArc: 1395)

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

net check time: 0m 0.000sec

init dd package: 0m 2.977sec


before gc: list nodes free: 1804003

after gc: idd nodes used:39625842, unused:24374158; list nodes free:101751508

RS generation: 24m35.003sec


-> last computed set: #nodes 39625756 (4.0e+07) #states 19,578,287,192 (10)


CANNOT_COMPUTE


BK_STOP 1678733153084

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec

idd.cc:820: DD Exception: No free nodes

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-12"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is BusinessProcesses-PT-12, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813695900538"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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