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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 59K 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-02-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678726841868

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-02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 17:00:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 17:00:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:00:44] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-13 17:00:44] [INFO ] Transformed 262 places.
[2023-03-13 17:00:44] [INFO ] Transformed 219 transitions.
[2023-03-13 17:00:44] [INFO ] Found NUPN structural information;
[2023-03-13 17:00:44] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 91 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 204/204 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 239 transition count 204
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 22 place count 223 transition count 188
Iterating global reduction 1 with 16 rules applied. Total rules applied 38 place count 223 transition count 188
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 219 transition count 184
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 219 transition count 184
Applied a total of 46 rules in 74 ms. Remains 219 /245 variables (removed 26) and now considering 184/204 (removed 20) transitions.
// Phase 1: matrix 184 rows 219 cols
[2023-03-13 17:00:44] [INFO ] Computed 37 place invariants in 9 ms
[2023-03-13 17:00:44] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-13 17:00:44] [INFO ] Invariant cache hit.
[2023-03-13 17:00:45] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
[2023-03-13 17:00:45] [INFO ] Invariant cache hit.
[2023-03-13 17:00:45] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 219/245 places, 184/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1187 ms. Remains : 219/245 places, 184/204 transitions.
Support contains 91 out of 219 places after structural reductions.
[2023-03-13 17:00:45] [INFO ] Flatten gal took : 67 ms
[2023-03-13 17:00:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-02-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 17:00:45] [INFO ] Flatten gal took : 27 ms
[2023-03-13 17:00:45] [INFO ] Input system was already deterministic with 184 transitions.
Support contains 86 out of 219 places (down from 91) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 676 ms. (steps per millisecond=14 ) properties (out of 65) seen :45
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-13 17:00:46] [INFO ] Invariant cache hit.
[2023-03-13 17:00:47] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-13 17:00:47] [INFO ] [Nat]Absence check using 28 positive place invariants in 10 ms returned sat
[2023-03-13 17:00:47] [INFO ] [Nat]Absence check using 28 positive and 9 generalized place invariants in 2 ms returned sat
[2023-03-13 17:00:47] [INFO ] After 372ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :19
[2023-03-13 17:00:47] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 3 ms to minimize.
[2023-03-13 17:00:47] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2023-03-13 17:00:47] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2023-03-13 17:00:48] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2023-03-13 17:00:48] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2023-03-13 17:00:48] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2023-03-13 17:00:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 480 ms
[2023-03-13 17:00:48] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 0 ms to minimize.
[2023-03-13 17:00:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-13 17:00:48] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2023-03-13 17:00:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-13 17:00:48] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2023-03-13 17:00:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-13 17:00:48] [INFO ] After 1394ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :18
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-13 17:00:48] [INFO ] After 1860ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :18
Fused 20 Parikh solutions to 18 different solutions.
Parikh walk visited 2 properties in 168 ms.
Support contains 19 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 184/184 transitions.
Graph (complete) has 416 edges and 219 vertex of which 213 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 213 transition count 149
Reduce places removed 28 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 185 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 183 transition count 147
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 62 place count 183 transition count 109
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 144 place count 139 transition count 109
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 157 place count 126 transition count 96
Iterating global reduction 3 with 13 rules applied. Total rules applied 170 place count 126 transition count 96
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 256 place count 82 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 257 place count 82 transition count 53
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 259 place count 82 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 260 place count 81 transition count 52
Applied a total of 260 rules in 57 ms. Remains 81 /219 variables (removed 138) and now considering 52/184 (removed 132) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 81/219 places, 52/184 transitions.
Incomplete random walk after 10000 steps, including 1093 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10001 steps, including 440 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 439 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 426 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 427 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 447 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 400 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 421 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 414 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 52 rows 81 cols
[2023-03-13 17:00:50] [INFO ] Computed 30 place invariants in 3 ms
[2023-03-13 17:00:50] [INFO ] [Real]Absence check using 24 positive place invariants in 4 ms returned sat
[2023-03-13 17:00:50] [INFO ] [Real]Absence check using 24 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-13 17:00:50] [INFO ] After 42ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:5
[2023-03-13 17:00:50] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2023-03-13 17:00:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-13 17:00:50] [INFO ] After 139ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 17:00:50] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 17:00:50] [INFO ] [Nat]Absence check using 24 positive place invariants in 5 ms returned sat
[2023-03-13 17:00:50] [INFO ] [Nat]Absence check using 24 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-13 17:00:50] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 17:00:50] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2023-03-13 17:00:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-13 17:00:50] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-13 17:00:50] [INFO ] After 290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 7 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 52/52 transitions.
Graph (trivial) has 14 edges and 81 vertex of which 2 / 81 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 80 transition count 48
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 78 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 77 transition count 47
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 7 place count 77 transition count 45
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 13 place count 73 transition count 45
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 71 transition count 43
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 71 transition count 43
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 25 place count 67 transition count 39
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 67 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 66 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 65 transition count 37
Applied a total of 28 rules in 18 ms. Remains 65 /81 variables (removed 16) and now considering 37/52 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 65/81 places, 37/52 transitions.
Finished random walk after 9866 steps, including 429 resets, run visited all 7 properties in 28 ms. (steps per millisecond=352 )
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2023-03-13 17:00:50] [INFO ] Flatten gal took : 13 ms
[2023-03-13 17:00:50] [INFO ] Flatten gal took : 14 ms
[2023-03-13 17:00:50] [INFO ] Input system was already deterministic with 184 transitions.
Computed a total of 211 stabilizing places and 174 stable transitions
Graph (complete) has 416 edges and 219 vertex of which 213 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 184/184 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 196 transition count 161
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 196 transition count 161
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 190 transition count 155
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 190 transition count 155
Applied a total of 58 rules in 16 ms. Remains 190 /219 variables (removed 29) and now considering 155/184 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 190/219 places, 155/184 transitions.
[2023-03-13 17:00:50] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:00:50] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:00:50] [INFO ] Input system was already deterministic with 155 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 184/184 transitions.
Graph (trivial) has 118 edges and 219 vertex of which 7 / 219 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 409 edges and 213 vertex of which 207 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 39 place count 206 transition count 133
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 169 transition count 133
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 76 place count 169 transition count 97
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 79 rules applied. Total rules applied 155 place count 126 transition count 97
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 175 place count 106 transition count 77
Iterating global reduction 2 with 20 rules applied. Total rules applied 195 place count 106 transition count 77
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 281 place count 62 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 283 place count 61 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 284 place count 60 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 285 place count 59 transition count 33
Applied a total of 285 rules in 27 ms. Remains 59 /219 variables (removed 160) and now considering 33/184 (removed 151) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 59/219 places, 33/184 transitions.
[2023-03-13 17:00:50] [INFO ] Flatten gal took : 3 ms
[2023-03-13 17:00:50] [INFO ] Flatten gal took : 4 ms
[2023-03-13 17:00:50] [INFO ] Input system was already deterministic with 33 transitions.
Finished random walk after 788 steps, including 268 resets, run visited all 1 properties in 6 ms. (steps per millisecond=131 )
FORMULA BusinessProcesses-PT-02-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 184/184 transitions.
Graph (trivial) has 115 edges and 219 vertex of which 7 / 219 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 409 edges and 213 vertex of which 207 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 206 transition count 136
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 172 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 171 transition count 135
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 72 place count 171 transition count 101
Deduced a syphon composed of 34 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 148 place count 129 transition count 101
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 167 place count 110 transition count 82
Iterating global reduction 3 with 19 rules applied. Total rules applied 186 place count 110 transition count 82
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 272 place count 66 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 274 place count 65 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 275 place count 64 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 276 place count 63 transition count 38
Applied a total of 276 rules in 29 ms. Remains 63 /219 variables (removed 156) and now considering 38/184 (removed 146) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 63/219 places, 38/184 transitions.
[2023-03-13 17:00:50] [INFO ] Flatten gal took : 4 ms
[2023-03-13 17:00:50] [INFO ] Flatten gal took : 4 ms
[2023-03-13 17:00:50] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 184/184 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 199 transition count 164
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 199 transition count 164
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 194 transition count 159
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 194 transition count 159
Applied a total of 50 rules in 14 ms. Remains 194 /219 variables (removed 25) and now considering 159/184 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 194/219 places, 159/184 transitions.
[2023-03-13 17:00:50] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:00:50] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:00:50] [INFO ] Input system was already deterministic with 159 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 184/184 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 196 transition count 161
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 196 transition count 161
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 190 transition count 155
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 190 transition count 155
Applied a total of 58 rules in 20 ms. Remains 190 /219 variables (removed 29) and now considering 155/184 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 190/219 places, 155/184 transitions.
[2023-03-13 17:00:50] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:00:50] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:00:50] [INFO ] Input system was already deterministic with 155 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 184/184 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 195 transition count 160
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 195 transition count 160
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 188 transition count 153
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 188 transition count 153
Applied a total of 62 rules in 13 ms. Remains 188 /219 variables (removed 31) and now considering 153/184 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 188/219 places, 153/184 transitions.
[2023-03-13 17:00:50] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:00:50] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:00:50] [INFO ] Input system was already deterministic with 153 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 184/184 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 195 transition count 160
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 195 transition count 160
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 188 transition count 153
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 188 transition count 153
Applied a total of 62 rules in 13 ms. Remains 188 /219 variables (removed 31) and now considering 153/184 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 188/219 places, 153/184 transitions.
[2023-03-13 17:00:51] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:00:51] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:00:51] [INFO ] Input system was already deterministic with 153 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 184/184 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 199 transition count 164
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 199 transition count 164
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 194 transition count 159
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 194 transition count 159
Applied a total of 50 rules in 15 ms. Remains 194 /219 variables (removed 25) and now considering 159/184 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 194/219 places, 159/184 transitions.
[2023-03-13 17:00:51] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:00:51] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:00:51] [INFO ] Input system was already deterministic with 159 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 184/184 transitions.
Graph (trivial) has 119 edges and 219 vertex of which 7 / 219 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 409 edges and 213 vertex of which 207 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 39 place count 206 transition count 133
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 169 transition count 133
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 76 place count 169 transition count 96
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 158 place count 124 transition count 96
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 178 place count 104 transition count 76
Iterating global reduction 2 with 20 rules applied. Total rules applied 198 place count 104 transition count 76
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 284 place count 60 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 286 place count 59 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 287 place count 58 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 288 place count 57 transition count 32
Applied a total of 288 rules in 21 ms. Remains 57 /219 variables (removed 162) and now considering 32/184 (removed 152) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 57/219 places, 32/184 transitions.
[2023-03-13 17:00:51] [INFO ] Flatten gal took : 3 ms
[2023-03-13 17:00:51] [INFO ] Flatten gal took : 2 ms
[2023-03-13 17:00:51] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 10000 steps, including 3562 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1312 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 105 steps, run visited all 1 properties in 6 ms. (steps per millisecond=17 )
Probabilistic random walk after 105 steps, saw 63 distinct states, run finished after 6 ms. (steps per millisecond=17 ) properties seen :1
FORMULA BusinessProcesses-PT-02-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 184/184 transitions.
Graph (trivial) has 115 edges and 219 vertex of which 4 / 219 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 413 edges and 216 vertex of which 210 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 209 transition count 138
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 173 transition count 138
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 74 place count 173 transition count 101
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 156 place count 128 transition count 101
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 175 place count 109 transition count 82
Iterating global reduction 2 with 19 rules applied. Total rules applied 194 place count 109 transition count 82
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 282 place count 64 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 284 place count 63 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 285 place count 62 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 286 place count 61 transition count 37
Applied a total of 286 rules in 16 ms. Remains 61 /219 variables (removed 158) and now considering 37/184 (removed 147) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 61/219 places, 37/184 transitions.
[2023-03-13 17:00:51] [INFO ] Flatten gal took : 2 ms
[2023-03-13 17:00:51] [INFO ] Flatten gal took : 2 ms
[2023-03-13 17:00:51] [INFO ] Input system was already deterministic with 37 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 184/184 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 195 transition count 160
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 195 transition count 160
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 188 transition count 153
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 188 transition count 153
Applied a total of 62 rules in 6 ms. Remains 188 /219 variables (removed 31) and now considering 153/184 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 188/219 places, 153/184 transitions.
[2023-03-13 17:00:51] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:00:51] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:00:51] [INFO ] Input system was already deterministic with 153 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 184/184 transitions.
Graph (trivial) has 110 edges and 219 vertex of which 4 / 219 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 413 edges and 216 vertex of which 213 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 212 transition count 143
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 178 transition count 143
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 70 place count 178 transition count 106
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 152 place count 133 transition count 106
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 169 place count 116 transition count 89
Iterating global reduction 2 with 17 rules applied. Total rules applied 186 place count 116 transition count 89
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 264 place count 76 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 266 place count 75 transition count 50
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 267 place count 75 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 268 place count 74 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 269 place count 73 transition count 49
Applied a total of 269 rules in 15 ms. Remains 73 /219 variables (removed 146) and now considering 49/184 (removed 135) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 73/219 places, 49/184 transitions.
[2023-03-13 17:00:51] [INFO ] Flatten gal took : 2 ms
[2023-03-13 17:00:51] [INFO ] Flatten gal took : 2 ms
[2023-03-13 17:00:51] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 184/184 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 197 transition count 162
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 197 transition count 162
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 192 transition count 157
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 192 transition count 157
Applied a total of 54 rules in 5 ms. Remains 192 /219 variables (removed 27) and now considering 157/184 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 192/219 places, 157/184 transitions.
[2023-03-13 17:00:51] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:00:51] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:00:51] [INFO ] Input system was already deterministic with 157 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 184/184 transitions.
Graph (complete) has 416 edges and 219 vertex of which 214 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 213 transition count 147
Reduce places removed 31 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 34 rules applied. Total rules applied 66 place count 182 transition count 144
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 179 transition count 144
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 69 place count 179 transition count 102
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 161 place count 129 transition count 102
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 181 place count 109 transition count 82
Iterating global reduction 3 with 20 rules applied. Total rules applied 201 place count 109 transition count 82
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 281 place count 69 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 282 place count 68 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 283 place count 67 transition count 41
Applied a total of 283 rules in 12 ms. Remains 67 /219 variables (removed 152) and now considering 41/184 (removed 143) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 67/219 places, 41/184 transitions.
[2023-03-13 17:00:51] [INFO ] Flatten gal took : 3 ms
[2023-03-13 17:00:51] [INFO ] Flatten gal took : 3 ms
[2023-03-13 17:00:51] [INFO ] Input system was already deterministic with 41 transitions.
[2023-03-13 17:00:51] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:00:51] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:00:51] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-13 17:00:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 219 places, 184 transitions and 500 arcs took 1 ms.
Total runtime 7266 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: 219 NrTr: 184 NrArc: 500)

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

net check time: 0m 0.000sec

init dd package: 0m 3.213sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 8526332 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16097220 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.000sec

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

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