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-167813695800497.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695800497
=====================================================================

--------------------
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-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678729097483

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=CTLCardinality
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:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 17:38:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:38:19] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-13 17:38:19] [INFO ] Transformed 386 places.
[2023-03-13 17:38:19] [INFO ] Transformed 360 transitions.
[2023-03-13 17:38:19] [INFO ] Found NUPN structural information;
[2023-03-13 17:38:19] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 117 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Support contains 131 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 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 357 transition count 332
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 357 transition count 332
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 348 transition count 323
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 348 transition count 323
Applied a total of 75 rules in 54 ms. Remains 348 /386 variables (removed 38) and now considering 323/360 (removed 37) transitions.
// Phase 1: matrix 323 rows 348 cols
[2023-03-13 17:38:19] [INFO ] Computed 61 place invariants in 19 ms
[2023-03-13 17:38:19] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-13 17:38:19] [INFO ] Invariant cache hit.
[2023-03-13 17:38:19] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2023-03-13 17:38:19] [INFO ] Invariant cache hit.
[2023-03-13 17:38:20] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 348/386 places, 323/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 880 ms. Remains : 348/386 places, 323/360 transitions.
Support contains 131 out of 348 places after structural reductions.
[2023-03-13 17:38:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 17:38:20] [INFO ] Flatten gal took : 66 ms
[2023-03-13 17:38:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-07-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 17:38:20] [INFO ] Flatten gal took : 24 ms
[2023-03-13 17:38:20] [INFO ] Input system was already deterministic with 323 transitions.
Support contains 119 out of 348 places (down from 131) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 109 resets, run finished after 702 ms. (steps per millisecond=14 ) properties (out of 76) seen :59
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Running SMT prover for 17 properties.
[2023-03-13 17:38:21] [INFO ] Invariant cache hit.
[2023-03-13 17:38:21] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2023-03-13 17:38:21] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 10 ms returned sat
[2023-03-13 17:38:21] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-13 17:38:21] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2023-03-13 17:38:21] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 9 ms returned sat
[2023-03-13 17:38:21] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :16
[2023-03-13 17:38:22] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 12 ms to minimize.
[2023-03-13 17:38:22] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
[2023-03-13 17:38:22] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2023-03-13 17:38:22] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 1 ms to minimize.
[2023-03-13 17:38:22] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2023-03-13 17:38:22] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-03-13 17:38:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 627 ms
[2023-03-13 17:38:22] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 1 ms to minimize.
[2023-03-13 17:38:22] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 1 ms to minimize.
[2023-03-13 17:38:23] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 1 ms to minimize.
[2023-03-13 17:38:23] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 1 ms to minimize.
[2023-03-13 17:38:23] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 1 ms to minimize.
[2023-03-13 17:38:23] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 0 ms to minimize.
[2023-03-13 17:38:23] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 0 ms to minimize.
[2023-03-13 17:38:23] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 0 ms to minimize.
[2023-03-13 17:38:23] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 1 ms to minimize.
[2023-03-13 17:38:23] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 0 ms to minimize.
[2023-03-13 17:38:24] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 1 ms to minimize.
[2023-03-13 17:38:24] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 1 ms to minimize.
[2023-03-13 17:38:24] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 1 ms to minimize.
[2023-03-13 17:38:24] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 1 ms to minimize.
[2023-03-13 17:38:24] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 1 ms to minimize.
[2023-03-13 17:38:24] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 0 ms to minimize.
[2023-03-13 17:38:24] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 0 ms to minimize.
[2023-03-13 17:38:24] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2146 ms
[2023-03-13 17:38:25] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 0 ms to minimize.
[2023-03-13 17:38:25] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 1 ms to minimize.
[2023-03-13 17:38:25] [INFO ] Deduced a trap composed of 71 places in 112 ms of which 0 ms to minimize.
[2023-03-13 17:38:25] [INFO ] Deduced a trap composed of 94 places in 86 ms of which 1 ms to minimize.
[2023-03-13 17:38:25] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 1 ms to minimize.
[2023-03-13 17:38:25] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 0 ms to minimize.
[2023-03-13 17:38:25] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 0 ms to minimize.
[2023-03-13 17:38:25] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 1 ms to minimize.
[2023-03-13 17:38:25] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 0 ms to minimize.
[2023-03-13 17:38:26] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 1 ms to minimize.
[2023-03-13 17:38:26] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 2 ms to minimize.
[2023-03-13 17:38:26] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 5 ms to minimize.
[2023-03-13 17:38:26] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 1 ms to minimize.
[2023-03-13 17:38:26] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 0 ms to minimize.
[2023-03-13 17:38:26] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 0 ms to minimize.
[2023-03-13 17:38:26] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 0 ms to minimize.
[2023-03-13 17:38:27] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 1 ms to minimize.
[2023-03-13 17:38:27] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 1 ms to minimize.
[2023-03-13 17:38:27] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2023-03-13 17:38:27] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 1 ms to minimize.
[2023-03-13 17:38:27] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2023-03-13 17:38:27] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2608 ms
[2023-03-13 17:38:27] [INFO ] After 5974ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :16
Attempting to minimize the solution found.
Minimization took 276 ms.
[2023-03-13 17:38:28] [INFO ] After 6453ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :16
Fused 17 Parikh solutions to 15 different solutions.
Parikh walk visited 8 properties in 242 ms.
Support contains 12 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 323/323 transitions.
Graph (trivial) has 164 edges and 348 vertex of which 7 / 348 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 762 edges and 342 vertex of which 341 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 341 transition count 267
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 294 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 293 transition count 266
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 98 place count 293 transition count 209
Deduced a syphon composed of 57 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 123 rules applied. Total rules applied 221 place count 227 transition count 209
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 242 place count 206 transition count 188
Iterating global reduction 3 with 21 rules applied. Total rules applied 263 place count 206 transition count 188
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 263 place count 206 transition count 184
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 271 place count 202 transition count 184
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 407 place count 133 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 409 place count 132 transition count 120
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 411 place count 132 transition count 118
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 413 place count 130 transition count 118
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 414 place count 130 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 415 place count 129 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 416 place count 128 transition count 117
Applied a total of 416 rules in 78 ms. Remains 128 /348 variables (removed 220) and now considering 117/323 (removed 206) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 128/348 places, 117/323 transitions.
Incomplete random walk after 10000 steps, including 533 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 142 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 128 cols
[2023-03-13 17:38:28] [INFO ] Computed 49 place invariants in 6 ms
[2023-03-13 17:38:28] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 17:38:28] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-13 17:38:28] [INFO ] [Nat]Absence check using 32 positive and 17 generalized place invariants in 3 ms returned sat
[2023-03-13 17:38:28] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 17:38:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 17:38:28] [INFO ] After 10ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 17:38:28] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-13 17:38:28] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 117/117 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 128 transition count 114
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 125 transition count 114
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 125 transition count 112
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 10 place count 123 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 122 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 122 transition count 111
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 2 with 8 rules applied. Total rules applied 20 place count 118 transition count 107
Applied a total of 20 rules in 14 ms. Remains 118 /128 variables (removed 10) and now considering 107/117 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 118/128 places, 107/117 transitions.
Incomplete random walk after 10000 steps, including 520 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 156 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1695629 steps, run timeout after 3001 ms. (steps per millisecond=565 ) properties seen :{}
Probabilistic random walk after 1695629 steps, saw 541955 distinct states, run finished after 3002 ms. (steps per millisecond=564 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 107 rows 118 cols
[2023-03-13 17:38:31] [INFO ] Computed 49 place invariants in 10 ms
[2023-03-13 17:38:31] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 17:38:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-13 17:38:31] [INFO ] [Nat]Absence check using 33 positive and 16 generalized place invariants in 2 ms returned sat
[2023-03-13 17:38:31] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 17:38:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 17:38:31] [INFO ] After 5ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 17:38:31] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-13 17:38:31] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 118 /118 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 118/118 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 118 /118 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2023-03-13 17:38:31] [INFO ] Invariant cache hit.
[2023-03-13 17:38:31] [INFO ] Implicit Places using invariants in 99 ms returned [0, 3, 9, 10, 11, 38, 39, 40, 41, 42, 43, 81]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 104 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 106/118 places, 107/107 transitions.
Applied a total of 0 rules in 8 ms. Remains 106 /106 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 115 ms. Remains : 106/118 places, 107/107 transitions.
Incomplete random walk after 10000 steps, including 539 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 143 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1953499 steps, run timeout after 3001 ms. (steps per millisecond=650 ) properties seen :{}
Probabilistic random walk after 1953499 steps, saw 614664 distinct states, run finished after 3001 ms. (steps per millisecond=650 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 107 rows 106 cols
[2023-03-13 17:38:34] [INFO ] Computed 37 place invariants in 8 ms
[2023-03-13 17:38:34] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 17:38:35] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-03-13 17:38:35] [INFO ] [Nat]Absence check using 21 positive and 16 generalized place invariants in 2 ms returned sat
[2023-03-13 17:38:35] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 17:38:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 17:38:35] [INFO ] After 8ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 17:38:35] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-13 17:38:35] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 107/107 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 106/106 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2023-03-13 17:38:35] [INFO ] Invariant cache hit.
[2023-03-13 17:38:35] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-13 17:38:35] [INFO ] Invariant cache hit.
[2023-03-13 17:38:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 17:38:35] [INFO ] Implicit Places using invariants and state equation in 149 ms returned [11, 34, 57, 59, 65, 67]
Discarding 6 places :
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 228 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 100/106 places, 103/107 transitions.
Graph (complete) has 342 edges and 100 vertex of which 91 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 90 transition count 102
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 13 place count 80 transition count 64
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 80 transition count 64
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 79 transition count 63
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 79 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 77 transition count 61
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 77 transition count 61
Applied a total of 30 rules in 24 ms. Remains 77 /100 variables (removed 23) and now considering 61/103 (removed 42) transitions.
// Phase 1: matrix 61 rows 77 cols
[2023-03-13 17:38:35] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-13 17:38:35] [INFO ] Implicit Places using invariants in 71 ms returned [11, 12, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 72 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 74/106 places, 61/107 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 74 transition count 58
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 71 transition count 58
Applied a total of 6 rules in 8 ms. Remains 71 /74 variables (removed 3) and now considering 58/61 (removed 3) transitions.
// Phase 1: matrix 58 rows 71 cols
[2023-03-13 17:38:35] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-13 17:38:35] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-13 17:38:35] [INFO ] Invariant cache hit.
[2023-03-13 17:38:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-13 17:38:35] [INFO ] Implicit Places using invariants and state equation in 85 ms returned [32, 35, 37]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 142 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 68/106 places, 58/107 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 67 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 67 transition count 56
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 23 rules applied. Total rules applied 26 place count 53 transition count 47
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 50 transition count 44
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 50 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 50 transition count 43
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 35 place count 49 transition count 42
Applied a total of 35 rules in 10 ms. Remains 49 /68 variables (removed 19) and now considering 42/58 (removed 16) transitions.
// Phase 1: matrix 42 rows 49 cols
[2023-03-13 17:38:35] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-13 17:38:35] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-13 17:38:35] [INFO ] Invariant cache hit.
[2023-03-13 17:38:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-13 17:38:35] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 49/106 places, 42/107 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 633 ms. Remains : 49/106 places, 42/107 transitions.
Incomplete random walk after 10000 steps, including 726 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 222 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Probably explored full state space saw : 545976 states, properties seen :0
Probabilistic random walk after 1612337 steps, saw 545976 distinct states, run finished after 1739 ms. (steps per millisecond=927 ) properties seen :0
Explored full state space saw : 546118 states, properties seen :0
Exhaustive walk after 1612745 steps, saw 546118 distinct states, run finished after 1530 ms. (steps per millisecond=1054 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA BusinessProcesses-PT-07-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 15 ms
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 15 ms
[2023-03-13 17:38:39] [INFO ] Input system was already deterministic with 323 transitions.
Computed a total of 215 stabilizing places and 217 stable transitions
Graph (complete) has 770 edges and 348 vertex of which 347 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 323 transition count 298
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 323 transition count 298
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 63 place count 310 transition count 285
Iterating global reduction 0 with 13 rules applied. Total rules applied 76 place count 310 transition count 285
Applied a total of 76 rules in 52 ms. Remains 310 /348 variables (removed 38) and now considering 285/323 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 310/348 places, 285/323 transitions.
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 12 ms
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 13 ms
[2023-03-13 17:38:39] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 317 transition count 292
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 317 transition count 292
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 76 place count 303 transition count 278
Iterating global reduction 0 with 14 rules applied. Total rules applied 90 place count 303 transition count 278
Applied a total of 90 rules in 11 ms. Remains 303 /348 variables (removed 45) and now considering 278/323 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 303/348 places, 278/323 transitions.
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 11 ms
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 11 ms
[2023-03-13 17:38:39] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 318 transition count 293
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 318 transition count 293
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 73 place count 305 transition count 280
Iterating global reduction 0 with 13 rules applied. Total rules applied 86 place count 305 transition count 280
Applied a total of 86 rules in 11 ms. Remains 305 /348 variables (removed 43) and now considering 280/323 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 305/348 places, 280/323 transitions.
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 11 ms
[2023-03-13 17:38:39] [INFO ] Input system was already deterministic with 280 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 321 transition count 296
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 321 transition count 296
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 64 place count 311 transition count 286
Iterating global reduction 0 with 10 rules applied. Total rules applied 74 place count 311 transition count 286
Applied a total of 74 rules in 11 ms. Remains 311 /348 variables (removed 37) and now considering 286/323 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 311/348 places, 286/323 transitions.
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 11 ms
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 11 ms
[2023-03-13 17:38:39] [INFO ] Input system was already deterministic with 286 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 321 transition count 296
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 321 transition count 296
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 65 place count 310 transition count 285
Iterating global reduction 0 with 11 rules applied. Total rules applied 76 place count 310 transition count 285
Applied a total of 76 rules in 11 ms. Remains 310 /348 variables (removed 38) and now considering 285/323 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 310/348 places, 285/323 transitions.
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 11 ms
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 12 ms
[2023-03-13 17:38:39] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 319 transition count 294
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 319 transition count 294
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 71 place count 306 transition count 281
Iterating global reduction 0 with 13 rules applied. Total rules applied 84 place count 306 transition count 281
Applied a total of 84 rules in 12 ms. Remains 306 /348 variables (removed 42) and now considering 281/323 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 306/348 places, 281/323 transitions.
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 11 ms
[2023-03-13 17:38:39] [INFO ] Input system was already deterministic with 281 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 319 transition count 294
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 319 transition count 294
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 71 place count 306 transition count 281
Iterating global reduction 0 with 13 rules applied. Total rules applied 84 place count 306 transition count 281
Applied a total of 84 rules in 18 ms. Remains 306 /348 variables (removed 42) and now considering 281/323 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 306/348 places, 281/323 transitions.
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:38:39] [INFO ] Input system was already deterministic with 281 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 320 transition count 295
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 320 transition count 295
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 66 place count 310 transition count 285
Iterating global reduction 0 with 10 rules applied. Total rules applied 76 place count 310 transition count 285
Applied a total of 76 rules in 21 ms. Remains 310 /348 variables (removed 38) and now considering 285/323 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 310/348 places, 285/323 transitions.
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 11 ms
[2023-03-13 17:38:39] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 320 transition count 295
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 320 transition count 295
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 306 transition count 281
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 306 transition count 281
Applied a total of 84 rules in 19 ms. Remains 306 /348 variables (removed 42) and now considering 281/323 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 306/348 places, 281/323 transitions.
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 11 ms
[2023-03-13 17:38:39] [INFO ] Input system was already deterministic with 281 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Graph (trivial) has 173 edges and 348 vertex of which 7 / 348 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 763 edges and 342 vertex of which 341 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 340 transition count 264
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 290 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 289 transition count 263
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 104 place count 289 transition count 204
Deduced a syphon composed of 59 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 127 rules applied. Total rules applied 231 place count 221 transition count 204
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 256 place count 196 transition count 179
Iterating global reduction 3 with 25 rules applied. Total rules applied 281 place count 196 transition count 179
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 281 place count 196 transition count 175
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 289 place count 192 transition count 175
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 131 rules applied. Total rules applied 420 place count 125 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 421 place count 124 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 422 place count 123 transition count 110
Applied a total of 422 rules in 38 ms. Remains 123 /348 variables (removed 225) and now considering 110/323 (removed 213) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 123/348 places, 110/323 transitions.
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 5 ms
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 5 ms
[2023-03-13 17:38:39] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 317 transition count 292
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 317 transition count 292
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 76 place count 303 transition count 278
Iterating global reduction 0 with 14 rules applied. Total rules applied 90 place count 303 transition count 278
Applied a total of 90 rules in 23 ms. Remains 303 /348 variables (removed 45) and now considering 278/323 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 303/348 places, 278/323 transitions.
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:38:39] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 318 transition count 293
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 318 transition count 293
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 74 place count 304 transition count 279
Iterating global reduction 0 with 14 rules applied. Total rules applied 88 place count 304 transition count 279
Applied a total of 88 rules in 24 ms. Remains 304 /348 variables (removed 44) and now considering 279/323 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 304/348 places, 279/323 transitions.
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:38:39] [INFO ] Input system was already deterministic with 279 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 323/323 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 317 transition count 292
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 317 transition count 292
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 76 place count 303 transition count 278
Iterating global reduction 0 with 14 rules applied. Total rules applied 90 place count 303 transition count 278
Applied a total of 90 rules in 22 ms. Remains 303 /348 variables (removed 45) and now considering 278/323 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 303/348 places, 278/323 transitions.
[2023-03-13 17:38:39] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:38:40] [INFO ] Flatten gal took : 11 ms
[2023-03-13 17:38:40] [INFO ] Input system was already deterministic with 278 transitions.
[2023-03-13 17:38:40] [INFO ] Flatten gal took : 12 ms
[2023-03-13 17:38:40] [INFO ] Flatten gal took : 12 ms
[2023-03-13 17:38:40] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-13 17:38:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 348 places, 323 transitions and 1035 arcs took 1 ms.
Total runtime 21011 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 348 NrTr: 323 NrArc: 1035)

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

net check time: 0m 0.000sec

init dd package: 0m 3.190sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6523552 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16098164 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 CTLCardinality -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-07"
export BK_EXAMINATION="CTLCardinality"
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 CTLCardinality"
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-167813695800497"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;