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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 16:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 100K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678729131914

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-07
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 17:38:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 17:38:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:38:53] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-13 17:38:53] [INFO ] Transformed 386 places.
[2023-03-13 17:38:53] [INFO ] Transformed 360 transitions.
[2023-03-13 17:38:53] [INFO ] Found NUPN structural information;
[2023-03-13 17:38:53] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 95 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 360/360 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 385 transition count 360
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 44 place count 342 transition count 317
Iterating global reduction 1 with 43 rules applied. Total rules applied 87 place count 342 transition count 317
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 102 place count 327 transition count 302
Iterating global reduction 1 with 15 rules applied. Total rules applied 117 place count 327 transition count 302
Applied a total of 117 rules in 66 ms. Remains 327 /386 variables (removed 59) and now considering 302/360 (removed 58) transitions.
// Phase 1: matrix 302 rows 327 cols
[2023-03-13 17:38:53] [INFO ] Computed 61 place invariants in 16 ms
[2023-03-13 17:38:54] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-13 17:38:54] [INFO ] Invariant cache hit.
[2023-03-13 17:38:54] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2023-03-13 17:38:54] [INFO ] Invariant cache hit.
[2023-03-13 17:38:54] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 327/386 places, 302/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 778 ms. Remains : 327/386 places, 302/360 transitions.
Support contains 95 out of 327 places after structural reductions.
[2023-03-13 17:38:54] [INFO ] Flatten gal took : 57 ms
[2023-03-13 17:38:54] [INFO ] Flatten gal took : 22 ms
[2023-03-13 17:38:54] [INFO ] Input system was already deterministic with 302 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 505 ms. (steps per millisecond=19 ) properties (out of 61) seen :34
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 27) 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 27) 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 27) 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 27) 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 27) 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 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) 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 27) 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 27) 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 27) 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 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) 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 27) 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 27) 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 27) 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 27) seen :0
Running SMT prover for 27 properties.
[2023-03-13 17:38:55] [INFO ] Invariant cache hit.
[2023-03-13 17:38:55] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-13 17:38:55] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 18 ms returned sat
[2023-03-13 17:38:55] [INFO ] After 151ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:26
[2023-03-13 17:38:56] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 5 ms to minimize.
[2023-03-13 17:38:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-13 17:38:56] [INFO ] After 271ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-13 17:38:56] [INFO ] After 517ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-13 17:38:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-13 17:38:56] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-13 17:38:56] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :18
[2023-03-13 17:38:56] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2023-03-13 17:38:56] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 5 ms to minimize.
[2023-03-13 17:38:56] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2023-03-13 17:38:57] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2023-03-13 17:38:57] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2023-03-13 17:38:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 341 ms
[2023-03-13 17:38:57] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2023-03-13 17:38:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-13 17:38:57] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 0 ms to minimize.
[2023-03-13 17:38:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-13 17:38:57] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2023-03-13 17:38:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-13 17:38:57] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2023-03-13 17:38:57] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2023-03-13 17:38:57] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2023-03-13 17:38:57] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2023-03-13 17:38:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 275 ms
[2023-03-13 17:38:57] [INFO ] After 1470ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :18
Attempting to minimize the solution found.
Minimization took 237 ms.
[2023-03-13 17:38:58] [INFO ] After 2027ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :18
Fused 27 Parikh solutions to 18 different solutions.
Parikh walk visited 2 properties in 219 ms.
Support contains 28 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 302/302 transitions.
Graph (complete) has 747 edges and 327 vertex of which 326 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 326 transition count 276
Reduce places removed 25 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 28 rules applied. Total rules applied 54 place count 301 transition count 273
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 57 place count 298 transition count 273
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 57 place count 298 transition count 213
Deduced a syphon composed of 60 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 185 place count 230 transition count 213
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 194 place count 221 transition count 204
Iterating global reduction 3 with 9 rules applied. Total rules applied 203 place count 221 transition count 204
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 133 rules applied. Total rules applied 336 place count 154 transition count 138
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 337 place count 154 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 338 place count 153 transition count 137
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 347 place count 153 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 348 place count 152 transition count 136
Applied a total of 348 rules in 76 ms. Remains 152 /327 variables (removed 175) and now considering 136/302 (removed 166) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 152/327 places, 136/302 transitions.
Incomplete random walk after 10000 steps, including 755 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10000 steps, including 162 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 186 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 192 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 192 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 156 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 189 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 195 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 187 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 190 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 195 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 136 rows 152 cols
[2023-03-13 17:38:59] [INFO ] Computed 52 place invariants in 5 ms
[2023-03-13 17:38:59] [INFO ] [Real]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-13 17:38:59] [INFO ] [Real]Absence check using 32 positive and 20 generalized place invariants in 4 ms returned sat
[2023-03-13 17:38:59] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-13 17:38:59] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-13 17:38:59] [INFO ] [Nat]Absence check using 32 positive and 20 generalized place invariants in 4 ms returned sat
[2023-03-13 17:38:59] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-13 17:38:59] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
[2023-03-13 17:38:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-13 17:38:59] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2023-03-13 17:38:59] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2023-03-13 17:38:59] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
[2023-03-13 17:38:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 196 ms
[2023-03-13 17:38:59] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 0 ms to minimize.
[2023-03-13 17:39:00] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 0 ms to minimize.
[2023-03-13 17:39:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2023-03-13 17:39:00] [INFO ] After 561ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-13 17:39:00] [INFO ] After 768ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 64 ms.
Support contains 18 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 136/136 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 2 place count 152 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 150 transition count 134
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 150 transition count 130
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 146 transition count 130
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 145 transition count 129
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 145 transition count 129
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 27 place count 138 transition count 123
Applied a total of 27 rules in 28 ms. Remains 138 /152 variables (removed 14) and now considering 123/136 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 138/152 places, 123/136 transitions.
Incomplete random walk after 10000 steps, including 835 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 196 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 220 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 221 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 199 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 243 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 214 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 228 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 214 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 218 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 123 rows 138 cols
[2023-03-13 17:39:01] [INFO ] Computed 51 place invariants in 3 ms
[2023-03-13 17:39:01] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2023-03-13 17:39:01] [INFO ] [Real]Absence check using 31 positive and 20 generalized place invariants in 3 ms returned sat
[2023-03-13 17:39:01] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 17:39:01] [INFO ] [Nat]Absence check using 31 positive place invariants in 5 ms returned sat
[2023-03-13 17:39:01] [INFO ] [Nat]Absence check using 31 positive and 20 generalized place invariants in 4 ms returned sat
[2023-03-13 17:39:01] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-13 17:39:01] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-13 17:39:01] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 17:39:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2023-03-13 17:39:02] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 0 ms to minimize.
[2023-03-13 17:39:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-13 17:39:02] [INFO ] After 435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-13 17:39:02] [INFO ] After 604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 27 ms.
Support contains 17 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 123/123 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 137 transition count 122
Applied a total of 2 rules in 8 ms. Remains 137 /138 variables (removed 1) and now considering 122/123 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 137/138 places, 122/123 transitions.
Incomplete random walk after 10000 steps, including 821 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 221 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 232 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 223 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 203 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 216 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 219 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 224 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 223 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 219 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Finished probabilistic random walk after 34815 steps, run visited all 9 properties in 105 ms. (steps per millisecond=331 )
Probabilistic random walk after 34815 steps, saw 9732 distinct states, run finished after 105 ms. (steps per millisecond=331 ) properties seen :9
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 15 ms
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 15 ms
[2023-03-13 17:39:03] [INFO ] Input system was already deterministic with 302 transitions.
Support contains 74 out of 327 places (down from 81) after GAL structural reductions.
Computed a total of 202 stabilizing places and 204 stable transitions
Graph (complete) has 747 edges and 327 vertex of which 326 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 309 transition count 284
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 309 transition count 284
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 303 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 303 transition count 278
Applied a total of 48 rules in 11 ms. Remains 303 /327 variables (removed 24) and now considering 278/302 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 303/327 places, 278/302 transitions.
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 13 ms
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 13 ms
[2023-03-13 17:39:03] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 309 transition count 284
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 309 transition count 284
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 303 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 303 transition count 278
Applied a total of 48 rules in 10 ms. Remains 303 /327 variables (removed 24) and now considering 278/302 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 303/327 places, 278/302 transitions.
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:39:03] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Graph (trivial) has 156 edges and 327 vertex of which 6 / 327 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 741 edges and 322 vertex of which 321 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 320 transition count 256
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 282 transition count 256
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 78 place count 282 transition count 193
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 135 rules applied. Total rules applied 213 place count 210 transition count 193
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 228 place count 195 transition count 178
Iterating global reduction 2 with 15 rules applied. Total rules applied 243 place count 195 transition count 178
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 243 place count 195 transition count 176
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 247 place count 193 transition count 176
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 145 rules applied. Total rules applied 392 place count 119 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 118 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 394 place count 117 transition count 104
Applied a total of 394 rules in 33 ms. Remains 117 /327 variables (removed 210) and now considering 104/302 (removed 198) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 117/327 places, 104/302 transitions.
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 11 ms
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:39:03] [INFO ] Input system was already deterministic with 104 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
FORMULA BusinessProcesses-PT-07-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Graph (complete) has 747 edges and 327 vertex of which 326 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 325 transition count 269
Reduce places removed 31 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 294 transition count 267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 292 transition count 267
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 67 place count 292 transition count 198
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 147 rules applied. Total rules applied 214 place count 214 transition count 198
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 230 place count 198 transition count 182
Iterating global reduction 3 with 16 rules applied. Total rules applied 246 place count 198 transition count 182
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 246 place count 198 transition count 181
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 248 place count 197 transition count 181
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 135 rules applied. Total rules applied 383 place count 128 transition count 115
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 389 place count 128 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 390 place count 127 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 391 place count 126 transition count 114
Applied a total of 391 rules in 32 ms. Remains 126 /327 variables (removed 201) and now considering 114/302 (removed 188) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 126/327 places, 114/302 transitions.
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 5 ms
[2023-03-13 17:39:03] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 309 transition count 284
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 309 transition count 284
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 303 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 303 transition count 278
Applied a total of 48 rules in 12 ms. Remains 303 /327 variables (removed 24) and now considering 278/302 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 303/327 places, 278/302 transitions.
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:39:03] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Graph (trivial) has 156 edges and 327 vertex of which 6 / 327 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 741 edges and 322 vertex of which 321 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 320 transition count 256
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 282 transition count 256
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 78 place count 282 transition count 192
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 215 place count 209 transition count 192
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 231 place count 193 transition count 176
Iterating global reduction 2 with 16 rules applied. Total rules applied 247 place count 193 transition count 176
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 247 place count 193 transition count 174
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 251 place count 191 transition count 174
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 141 rules applied. Total rules applied 392 place count 119 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 118 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 394 place count 117 transition count 104
Applied a total of 394 rules in 24 ms. Remains 117 /327 variables (removed 210) and now considering 104/302 (removed 198) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 117/327 places, 104/302 transitions.
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 5 ms
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:39:03] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 309 transition count 284
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 309 transition count 284
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 303 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 303 transition count 278
Applied a total of 48 rules in 9 ms. Remains 303 /327 variables (removed 24) and now considering 278/302 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 303/327 places, 278/302 transitions.
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:39:03] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 316 transition count 291
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 316 transition count 291
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 313 transition count 288
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 313 transition count 288
Applied a total of 28 rules in 9 ms. Remains 313 /327 variables (removed 14) and now considering 288/302 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 313/327 places, 288/302 transitions.
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:39:03] [INFO ] Input system was already deterministic with 288 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 311 transition count 286
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 311 transition count 286
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 306 transition count 281
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 306 transition count 281
Applied a total of 42 rules in 9 ms. Remains 306 /327 variables (removed 21) and now considering 281/302 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 306/327 places, 281/302 transitions.
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:39:03] [INFO ] Input system was already deterministic with 281 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Graph (trivial) has 155 edges and 327 vertex of which 6 / 327 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 741 edges and 322 vertex of which 321 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 320 transition count 256
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 282 transition count 256
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 78 place count 282 transition count 194
Deduced a syphon composed of 62 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 210 place count 212 transition count 194
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 226 place count 196 transition count 178
Iterating global reduction 2 with 16 rules applied. Total rules applied 242 place count 196 transition count 178
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 242 place count 196 transition count 176
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 246 place count 194 transition count 176
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 143 rules applied. Total rules applied 389 place count 121 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 390 place count 120 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 391 place count 119 transition count 105
Applied a total of 391 rules in 22 ms. Remains 119 /327 variables (removed 208) and now considering 105/302 (removed 197) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 119/327 places, 105/302 transitions.
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 5 ms
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 5 ms
[2023-03-13 17:39:03] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 311 transition count 286
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 311 transition count 286
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 307 transition count 282
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 307 transition count 282
Applied a total of 40 rules in 11 ms. Remains 307 /327 variables (removed 20) and now considering 282/302 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 307/327 places, 282/302 transitions.
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:39:03] [INFO ] Input system was already deterministic with 282 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 310 transition count 285
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 310 transition count 285
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 304 transition count 279
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 304 transition count 279
Applied a total of 46 rules in 10 ms. Remains 304 /327 variables (removed 23) and now considering 279/302 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 304/327 places, 279/302 transitions.
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:39:03] [INFO ] Input system was already deterministic with 279 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Graph (trivial) has 153 edges and 327 vertex of which 6 / 327 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 741 edges and 322 vertex of which 321 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 320 transition count 258
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 284 transition count 258
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 74 place count 284 transition count 193
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 213 place count 210 transition count 193
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 227 place count 196 transition count 179
Iterating global reduction 2 with 14 rules applied. Total rules applied 241 place count 196 transition count 179
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 241 place count 196 transition count 177
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 245 place count 194 transition count 177
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 141 rules applied. Total rules applied 386 place count 122 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 387 place count 121 transition count 107
Applied a total of 387 rules in 18 ms. Remains 121 /327 variables (removed 206) and now considering 107/302 (removed 195) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 121/327 places, 107/302 transitions.
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 4 ms
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 4 ms
[2023-03-13 17:39:03] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 309 transition count 284
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 309 transition count 284
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 303 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 303 transition count 278
Applied a total of 48 rules in 8 ms. Remains 303 /327 variables (removed 24) and now considering 278/302 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 303/327 places, 278/302 transitions.
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:39:03] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 309 transition count 284
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 309 transition count 284
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 303 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 303 transition count 278
Applied a total of 48 rules in 8 ms. Remains 303 /327 variables (removed 24) and now considering 278/302 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 303/327 places, 278/302 transitions.
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:39:03] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 311 transition count 286
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 311 transition count 286
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 305 transition count 280
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 305 transition count 280
Applied a total of 44 rules in 9 ms. Remains 305 /327 variables (removed 22) and now considering 280/302 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 305/327 places, 280/302 transitions.
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:39:03] [INFO ] Input system was already deterministic with 280 transitions.
[2023-03-13 17:39:03] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:39:04] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:39:04] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-13 17:39:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 327 places, 302 transitions and 993 arcs took 1 ms.
Total runtime 10491 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: 327 NrTr: 302 NrArc: 993)

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

net check time: 0m 0.000sec

init dd package: 0m 2.992sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6460500 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16100080 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.001sec

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-07"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="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-07, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813695800498"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-07.tgz
mv BusinessProcesses-PT-07 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;