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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:50 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.3K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 131K 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-10-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678730853691

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-10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:07:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 18:07:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:07:35] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2023-03-13 18:07:35] [INFO ] Transformed 518 places.
[2023-03-13 18:07:35] [INFO ] Transformed 471 transitions.
[2023-03-13 18:07:35] [INFO ] Found NUPN structural information;
[2023-03-13 18:07:35] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 138 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 471/471 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 471
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 52 place count 466 transition count 420
Iterating global reduction 1 with 51 rules applied. Total rules applied 103 place count 466 transition count 420
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 122 place count 447 transition count 401
Iterating global reduction 1 with 19 rules applied. Total rules applied 141 place count 447 transition count 401
Applied a total of 141 rules in 76 ms. Remains 447 /518 variables (removed 71) and now considering 401/471 (removed 70) transitions.
// Phase 1: matrix 401 rows 447 cols
[2023-03-13 18:07:35] [INFO ] Computed 84 place invariants in 31 ms
[2023-03-13 18:07:35] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-13 18:07:35] [INFO ] Invariant cache hit.
[2023-03-13 18:07:36] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
[2023-03-13 18:07:36] [INFO ] Invariant cache hit.
[2023-03-13 18:07:36] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/518 places, 401/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1010 ms. Remains : 447/518 places, 401/471 transitions.
Support contains 138 out of 447 places after structural reductions.
[2023-03-13 18:07:36] [INFO ] Flatten gal took : 60 ms
[2023-03-13 18:07:36] [INFO ] Flatten gal took : 24 ms
[2023-03-13 18:07:36] [INFO ] Input system was already deterministic with 401 transitions.
Support contains 137 out of 447 places (down from 138) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 79) seen :46
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) seen :0
Running SMT prover for 33 properties.
[2023-03-13 18:07:37] [INFO ] Invariant cache hit.
[2023-03-13 18:07:37] [INFO ] [Real]Absence check using 47 positive place invariants in 10 ms returned sat
[2023-03-13 18:07:37] [INFO ] [Real]Absence check using 47 positive and 37 generalized place invariants in 13 ms returned sat
[2023-03-13 18:07:37] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:33
[2023-03-13 18:07:38] [INFO ] [Nat]Absence check using 47 positive place invariants in 11 ms returned sat
[2023-03-13 18:07:38] [INFO ] [Nat]Absence check using 47 positive and 37 generalized place invariants in 17 ms returned sat
[2023-03-13 18:07:38] [INFO ] After 548ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :22
[2023-03-13 18:07:39] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 8 ms to minimize.
[2023-03-13 18:07:39] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2023-03-13 18:07:39] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2023-03-13 18:07:39] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2023-03-13 18:07:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 358 ms
[2023-03-13 18:07:39] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 0 ms to minimize.
[2023-03-13 18:07:39] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 1 ms to minimize.
[2023-03-13 18:07:39] [INFO ] Deduced a trap composed of 80 places in 147 ms of which 1 ms to minimize.
[2023-03-13 18:07:39] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 1 ms to minimize.
[2023-03-13 18:07:40] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 0 ms to minimize.
[2023-03-13 18:07:40] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2023-03-13 18:07:40] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 0 ms to minimize.
[2023-03-13 18:07:40] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 1 ms to minimize.
[2023-03-13 18:07:40] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 1 ms to minimize.
[2023-03-13 18:07:40] [INFO ] Deduced a trap composed of 85 places in 149 ms of which 0 ms to minimize.
[2023-03-13 18:07:41] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1704 ms
[2023-03-13 18:07:41] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 0 ms to minimize.
[2023-03-13 18:07:41] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 0 ms to minimize.
[2023-03-13 18:07:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 233 ms
[2023-03-13 18:07:41] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2023-03-13 18:07:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-13 18:07:41] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 1 ms to minimize.
[2023-03-13 18:07:41] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 1 ms to minimize.
[2023-03-13 18:07:42] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 1 ms to minimize.
[2023-03-13 18:07:42] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 0 ms to minimize.
[2023-03-13 18:07:42] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 1 ms to minimize.
[2023-03-13 18:07:42] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 0 ms to minimize.
[2023-03-13 18:07:42] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 0 ms to minimize.
[2023-03-13 18:07:42] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 0 ms to minimize.
[2023-03-13 18:07:42] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 1 ms to minimize.
[2023-03-13 18:07:42] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 1 ms to minimize.
[2023-03-13 18:07:43] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 1 ms to minimize.
[2023-03-13 18:07:43] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 0 ms to minimize.
[2023-03-13 18:07:43] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 0 ms to minimize.
[2023-03-13 18:07:43] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 1 ms to minimize.
[2023-03-13 18:07:43] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 1 ms to minimize.
[2023-03-13 18:07:43] [INFO ] Deduced a trap composed of 87 places in 159 ms of which 0 ms to minimize.
[2023-03-13 18:07:44] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2023-03-13 18:07:44] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 1 ms to minimize.
[2023-03-13 18:07:44] [INFO ] Deduced a trap composed of 102 places in 160 ms of which 0 ms to minimize.
[2023-03-13 18:07:44] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 0 ms to minimize.
[2023-03-13 18:07:44] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 0 ms to minimize.
[2023-03-13 18:07:44] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 1 ms to minimize.
[2023-03-13 18:07:45] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 2 ms to minimize.
[2023-03-13 18:07:45] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 1 ms to minimize.
[2023-03-13 18:07:45] [INFO ] Deduced a trap composed of 90 places in 151 ms of which 1 ms to minimize.
[2023-03-13 18:07:45] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 0 ms to minimize.
[2023-03-13 18:07:45] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 1 ms to minimize.
[2023-03-13 18:07:45] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 0 ms to minimize.
[2023-03-13 18:07:46] [INFO ] Deduced a trap composed of 108 places in 144 ms of which 1 ms to minimize.
[2023-03-13 18:07:46] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 1 ms to minimize.
[2023-03-13 18:07:46] [INFO ] Deduced a trap composed of 84 places in 155 ms of which 1 ms to minimize.
[2023-03-13 18:07:46] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 0 ms to minimize.
[2023-03-13 18:07:46] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5206 ms
[2023-03-13 18:07:47] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 0 ms to minimize.
[2023-03-13 18:07:47] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2023-03-13 18:07:47] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2023-03-13 18:07:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 357 ms
[2023-03-13 18:07:47] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2023-03-13 18:07:47] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2023-03-13 18:07:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2023-03-13 18:07:47] [INFO ] After 9414ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :22
Attempting to minimize the solution found.
Minimization took 1069 ms.
[2023-03-13 18:07:48] [INFO ] After 10974ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :22
Fused 33 Parikh solutions to 21 different solutions.
Parikh walk visited 6 properties in 424 ms.
Support contains 27 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 401/401 transitions.
Graph (complete) has 988 edges and 447 vertex of which 446 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 446 transition count 358
Reduce places removed 42 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 46 rules applied. Total rules applied 89 place count 404 transition count 354
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 93 place count 400 transition count 354
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 93 place count 400 transition count 270
Deduced a syphon composed of 84 places in 2 ms
Ensure Unique test removed 12 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 273 place count 304 transition count 270
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 293 place count 284 transition count 250
Iterating global reduction 3 with 20 rules applied. Total rules applied 313 place count 284 transition count 250
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 313 place count 284 transition count 247
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 319 place count 281 transition count 247
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 515 place count 181 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 516 place count 181 transition count 150
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 4 with 2 rules applied. Total rules applied 518 place count 180 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 526 place count 180 transition count 153
Applied a total of 526 rules in 127 ms. Remains 180 /447 variables (removed 267) and now considering 153/401 (removed 248) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 180/447 places, 153/401 transitions.
Incomplete random walk after 10000 steps, including 962 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 280 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 254 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 262 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 259 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 263 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 266 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 272 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 275 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 260 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 263 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 268 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 271 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 272 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 258 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 153 rows 180 cols
[2023-03-13 18:07:51] [INFO ] Computed 68 place invariants in 12 ms
[2023-03-13 18:07:51] [INFO ] [Real]Absence check using 47 positive place invariants in 6 ms returned sat
[2023-03-13 18:07:51] [INFO ] [Real]Absence check using 47 positive and 21 generalized place invariants in 4 ms returned sat
[2023-03-13 18:07:51] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-13 18:07:51] [INFO ] [Nat]Absence check using 47 positive place invariants in 8 ms returned sat
[2023-03-13 18:07:51] [INFO ] [Nat]Absence check using 47 positive and 21 generalized place invariants in 5 ms returned sat
[2023-03-13 18:07:51] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-13 18:07:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 18:07:51] [INFO ] After 88ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-13 18:07:51] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2023-03-13 18:07:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-13 18:07:51] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 1 ms to minimize.
[2023-03-13 18:07:52] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 0 ms to minimize.
[2023-03-13 18:07:52] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2023-03-13 18:07:52] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 0 ms to minimize.
[2023-03-13 18:07:52] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 0 ms to minimize.
[2023-03-13 18:07:52] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 0 ms to minimize.
[2023-03-13 18:07:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 512 ms
[2023-03-13 18:07:52] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2023-03-13 18:07:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-13 18:07:52] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2023-03-13 18:07:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-13 18:07:52] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 0 ms to minimize.
[2023-03-13 18:07:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-13 18:07:52] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2023-03-13 18:07:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-13 18:07:52] [INFO ] After 1202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-13 18:07:53] [INFO ] After 1632ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 197 ms.
Support contains 25 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 153/153 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 180 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 178 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 177 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 177 transition count 150
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 8 place count 176 transition count 149
Applied a total of 8 rules in 21 ms. Remains 176 /180 variables (removed 4) and now considering 149/153 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 176/180 places, 149/153 transitions.
Incomplete random walk after 10000 steps, including 947 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 270 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 272 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 253 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 268 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 271 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 255 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 258 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 273 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 265 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 260 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 255 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 266 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 260 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 267 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Finished probabilistic random walk after 20433 steps, run visited all 13 properties in 71 ms. (steps per millisecond=287 )
Probabilistic random walk after 20433 steps, saw 5507 distinct states, run finished after 71 ms. (steps per millisecond=287 ) properties seen :13
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-10-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 18:07:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 18:07:54] [INFO ] Flatten gal took : 19 ms
FORMULA BusinessProcesses-PT-10-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 18:07:54] [INFO ] Flatten gal took : 25 ms
[2023-03-13 18:07:54] [INFO ] Input system was already deterministic with 401 transitions.
Support contains 99 out of 447 places (down from 102) after GAL structural reductions.
Computed a total of 219 stabilizing places and 224 stable transitions
Graph (complete) has 988 edges and 447 vertex of which 446 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 401/401 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 418 transition count 372
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 418 transition count 372
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 69 place count 407 transition count 361
Iterating global reduction 0 with 11 rules applied. Total rules applied 80 place count 407 transition count 361
Applied a total of 80 rules in 19 ms. Remains 407 /447 variables (removed 40) and now considering 361/401 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 407/447 places, 361/401 transitions.
[2023-03-13 18:07:54] [INFO ] Flatten gal took : 13 ms
[2023-03-13 18:07:54] [INFO ] Flatten gal took : 14 ms
[2023-03-13 18:07:54] [INFO ] Input system was already deterministic with 361 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 447/447 places, 401/401 transitions.
Graph (trivial) has 207 edges and 447 vertex of which 7 / 447 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 981 edges and 441 vertex of which 440 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 439 transition count 343
Reduce places removed 49 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 52 rules applied. Total rules applied 103 place count 390 transition count 340
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 106 place count 387 transition count 340
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 106 place count 387 transition count 260
Deduced a syphon composed of 80 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 276 place count 297 transition count 260
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 301 place count 272 transition count 235
Iterating global reduction 3 with 25 rules applied. Total rules applied 326 place count 272 transition count 235
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 326 place count 272 transition count 232
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 332 place count 269 transition count 232
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 520 place count 173 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 521 place count 172 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 522 place count 171 transition count 139
Applied a total of 522 rules in 45 ms. Remains 171 /447 variables (removed 276) and now considering 139/401 (removed 262) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 171/447 places, 139/401 transitions.
[2023-03-13 18:07:54] [INFO ] Flatten gal took : 8 ms
[2023-03-13 18:07:54] [INFO ] Flatten gal took : 8 ms
[2023-03-13 18:07:54] [INFO ] Input system was already deterministic with 139 transitions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 401/401 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 414 transition count 368
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 414 transition count 368
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 77 place count 403 transition count 357
Iterating global reduction 0 with 11 rules applied. Total rules applied 88 place count 403 transition count 357
Applied a total of 88 rules in 16 ms. Remains 403 /447 variables (removed 44) and now considering 357/401 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 403/447 places, 357/401 transitions.
[2023-03-13 18:07:54] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:07:54] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:07:54] [INFO ] Input system was already deterministic with 357 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 447/447 places, 401/401 transitions.
Graph (trivial) has 214 edges and 447 vertex of which 7 / 447 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 981 edges and 441 vertex of which 440 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 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 439 transition count 336
Reduce places removed 56 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 383 transition count 335
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 382 transition count 335
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 116 place count 382 transition count 254
Deduced a syphon composed of 81 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 175 rules applied. Total rules applied 291 place count 288 transition count 254
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 317 place count 262 transition count 228
Iterating global reduction 3 with 26 rules applied. Total rules applied 343 place count 262 transition count 228
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 343 place count 262 transition count 224
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 352 place count 257 transition count 224
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 540 place count 162 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 541 place count 161 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 542 place count 160 transition count 130
Applied a total of 542 rules in 38 ms. Remains 160 /447 variables (removed 287) and now considering 130/401 (removed 271) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 160/447 places, 130/401 transitions.
[2023-03-13 18:07:54] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:07:54] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:07:55] [INFO ] Input system was already deterministic with 130 transitions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 401/401 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 413 transition count 367
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 413 transition count 367
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 80 place count 401 transition count 355
Iterating global reduction 0 with 12 rules applied. Total rules applied 92 place count 401 transition count 355
Applied a total of 92 rules in 18 ms. Remains 401 /447 variables (removed 46) and now considering 355/401 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 401/447 places, 355/401 transitions.
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:07:55] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 401/401 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 415 transition count 369
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 415 transition count 369
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 75 place count 404 transition count 358
Iterating global reduction 0 with 11 rules applied. Total rules applied 86 place count 404 transition count 358
Applied a total of 86 rules in 22 ms. Remains 404 /447 variables (removed 43) and now considering 358/401 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 404/447 places, 358/401 transitions.
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:07:55] [INFO ] Input system was already deterministic with 358 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 447/447 places, 401/401 transitions.
Graph (trivial) has 221 edges and 447 vertex of which 7 / 447 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 981 edges and 441 vertex of which 440 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 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 439 transition count 336
Reduce places removed 56 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 383 transition count 335
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 382 transition count 335
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 116 place count 382 transition count 249
Deduced a syphon composed of 86 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 185 rules applied. Total rules applied 301 place count 283 transition count 249
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 331 place count 253 transition count 219
Iterating global reduction 3 with 30 rules applied. Total rules applied 361 place count 253 transition count 219
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 361 place count 253 transition count 216
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 368 place count 249 transition count 216
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 552 place count 155 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 553 place count 154 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 554 place count 153 transition count 125
Applied a total of 554 rules in 33 ms. Remains 153 /447 variables (removed 294) and now considering 125/401 (removed 276) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 153/447 places, 125/401 transitions.
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:07:55] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 447/447 places, 401/401 transitions.
Graph (trivial) has 223 edges and 447 vertex of which 7 / 447 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 981 edges and 441 vertex of which 440 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 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 439 transition count 333
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 120 place count 380 transition count 333
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 83 Pre rules applied. Total rules applied 120 place count 380 transition count 250
Deduced a syphon composed of 83 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 179 rules applied. Total rules applied 299 place count 284 transition count 250
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 330 place count 253 transition count 219
Iterating global reduction 2 with 31 rules applied. Total rules applied 361 place count 253 transition count 219
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 361 place count 253 transition count 215
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 370 place count 248 transition count 215
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 560 place count 151 transition count 122
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 566 place count 151 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 567 place count 150 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 568 place count 149 transition count 121
Applied a total of 568 rules in 32 ms. Remains 149 /447 variables (removed 298) and now considering 121/401 (removed 280) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 149/447 places, 121/401 transitions.
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:07:55] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 447/447 places, 401/401 transitions.
Graph (complete) has 988 edges and 447 vertex of which 446 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 445 transition count 350
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 396 transition count 348
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 394 transition count 348
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 103 place count 394 transition count 256
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 299 place count 290 transition count 256
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 330 place count 259 transition count 225
Iterating global reduction 3 with 31 rules applied. Total rules applied 361 place count 259 transition count 225
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 361 place count 259 transition count 221
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 370 place count 254 transition count 221
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 556 place count 159 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 557 place count 158 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 558 place count 157 transition count 129
Applied a total of 558 rules in 31 ms. Remains 157 /447 variables (removed 290) and now considering 129/401 (removed 272) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 157/447 places, 129/401 transitions.
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:07:55] [INFO ] Input system was already deterministic with 129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 401/401 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 413 transition count 367
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 413 transition count 367
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 78 place count 403 transition count 357
Iterating global reduction 0 with 10 rules applied. Total rules applied 88 place count 403 transition count 357
Applied a total of 88 rules in 15 ms. Remains 403 /447 variables (removed 44) and now considering 357/401 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 403/447 places, 357/401 transitions.
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:07:55] [INFO ] Input system was already deterministic with 357 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 447/447 places, 401/401 transitions.
Graph (trivial) has 220 edges and 447 vertex of which 4 / 447 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 985 edges and 444 vertex of which 443 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 442 transition count 336
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 382 transition count 336
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 83 Pre rules applied. Total rules applied 122 place count 382 transition count 253
Deduced a syphon composed of 83 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 179 rules applied. Total rules applied 301 place count 286 transition count 253
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 331 place count 256 transition count 223
Iterating global reduction 2 with 30 rules applied. Total rules applied 361 place count 256 transition count 223
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 361 place count 256 transition count 219
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 370 place count 251 transition count 219
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 556 place count 156 transition count 128
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 557 place count 156 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 558 place count 155 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 559 place count 154 transition count 127
Applied a total of 559 rules in 35 ms. Remains 154 /447 variables (removed 293) and now considering 127/401 (removed 274) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 154/447 places, 127/401 transitions.
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:07:55] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 401/401 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 413 transition count 367
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 413 transition count 367
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 402 transition count 356
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 402 transition count 356
Applied a total of 90 rules in 15 ms. Remains 402 /447 variables (removed 45) and now considering 356/401 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 402/447 places, 356/401 transitions.
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:07:55] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 401/401 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 412 transition count 366
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 412 transition count 366
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 82 place count 400 transition count 354
Iterating global reduction 0 with 12 rules applied. Total rules applied 94 place count 400 transition count 354
Applied a total of 94 rules in 20 ms. Remains 400 /447 variables (removed 47) and now considering 354/401 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 400/447 places, 354/401 transitions.
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:07:55] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 401/401 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 417 transition count 371
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 417 transition count 371
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 407 transition count 361
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 407 transition count 361
Applied a total of 80 rules in 14 ms. Remains 407 /447 variables (removed 40) and now considering 361/401 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 407/447 places, 361/401 transitions.
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:07:55] [INFO ] Input system was already deterministic with 361 transitions.
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:07:55] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:07:55] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-13 18:07:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 447 places, 401 transitions and 1274 arcs took 2 ms.
Total runtime 20342 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: 447 NrTr: 401 NrArc: 1274)

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

net check time: 0m 0.000sec

init dd package: 0m 2.860sec


before gc: list nodes free: 1283372

after gc: idd nodes used:58106963, unused:5893037; list nodes free:25136261

RS generation: 38m25.892sec


-> last computed set: #nodes 58106869 (5.8e+07) #states 8,437,157,759 (9)


CANNOT_COMPUTE


BK_STOP 1678733217143

--------------------
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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-10"
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-10, 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-167813695900522"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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