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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:49 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.5K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:50 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 192K 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-20-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678735753082

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:29:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 19:29:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:29:14] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-13 19:29:14] [INFO ] Transformed 782 places.
[2023-03-13 19:29:14] [INFO ] Transformed 697 transitions.
[2023-03-13 19:29:14] [INFO ] Found NUPN structural information;
[2023-03-13 19:29:14] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 63 places in 16 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 50 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 15) seen :4
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :2
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :2
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 638 rows 719 cols
[2023-03-13 19:29:16] [INFO ] Computed 121 place invariants in 41 ms
[2023-03-13 19:29:16] [INFO ] [Real]Absence check using 78 positive place invariants in 32 ms returned sat
[2023-03-13 19:29:16] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 16 ms returned sat
[2023-03-13 19:29:16] [INFO ] After 594ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-13 19:29:17] [INFO ] [Nat]Absence check using 78 positive place invariants in 44 ms returned sat
[2023-03-13 19:29:17] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 28 ms returned sat
[2023-03-13 19:29:18] [INFO ] After 851ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-13 19:29:18] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 7 ms to minimize.
[2023-03-13 19:29:18] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 1 ms to minimize.
[2023-03-13 19:29:18] [INFO ] Deduced a trap composed of 74 places in 138 ms of which 0 ms to minimize.
[2023-03-13 19:29:18] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 0 ms to minimize.
[2023-03-13 19:29:18] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2023-03-13 19:29:18] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 2 ms to minimize.
[2023-03-13 19:29:19] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2023-03-13 19:29:19] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 1 ms to minimize.
[2023-03-13 19:29:19] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2023-03-13 19:29:19] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 0 ms to minimize.
[2023-03-13 19:29:19] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 1 ms to minimize.
[2023-03-13 19:29:19] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 1 ms to minimize.
[2023-03-13 19:29:19] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 0 ms to minimize.
[2023-03-13 19:29:19] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 0 ms to minimize.
[2023-03-13 19:29:19] [INFO ] Deduced a trap composed of 73 places in 81 ms of which 0 ms to minimize.
[2023-03-13 19:29:20] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 1 ms to minimize.
[2023-03-13 19:29:20] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 0 ms to minimize.
[2023-03-13 19:29:20] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 0 ms to minimize.
[2023-03-13 19:29:20] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 0 ms to minimize.
[2023-03-13 19:29:20] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 1 ms to minimize.
[2023-03-13 19:29:20] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 1 ms to minimize.
[2023-03-13 19:29:20] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 1 ms to minimize.
[2023-03-13 19:29:21] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 1 ms to minimize.
[2023-03-13 19:29:21] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3047 ms
[2023-03-13 19:29:21] [INFO ] Deduced a trap composed of 128 places in 265 ms of which 0 ms to minimize.
[2023-03-13 19:29:21] [INFO ] Deduced a trap composed of 142 places in 250 ms of which 0 ms to minimize.
[2023-03-13 19:29:22] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 1 ms to minimize.
[2023-03-13 19:29:22] [INFO ] Deduced a trap composed of 157 places in 236 ms of which 0 ms to minimize.
[2023-03-13 19:29:22] [INFO ] Deduced a trap composed of 155 places in 241 ms of which 1 ms to minimize.
[2023-03-13 19:29:22] [INFO ] Deduced a trap composed of 155 places in 283 ms of which 1 ms to minimize.
[2023-03-13 19:29:23] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 0 ms to minimize.
[2023-03-13 19:29:23] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 1 ms to minimize.
[2023-03-13 19:29:23] [INFO ] Deduced a trap composed of 54 places in 145 ms of which 1 ms to minimize.
[2023-03-13 19:29:23] [INFO ] Deduced a trap composed of 56 places in 139 ms of which 0 ms to minimize.
[2023-03-13 19:29:23] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2698 ms
[2023-03-13 19:29:24] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 1 ms to minimize.
[2023-03-13 19:29:24] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 4 ms to minimize.
[2023-03-13 19:29:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 377 ms
[2023-03-13 19:29:24] [INFO ] Deduced a trap composed of 159 places in 196 ms of which 1 ms to minimize.
[2023-03-13 19:29:24] [INFO ] Deduced a trap composed of 153 places in 166 ms of which 1 ms to minimize.
[2023-03-13 19:29:25] [INFO ] Deduced a trap composed of 155 places in 195 ms of which 0 ms to minimize.
[2023-03-13 19:29:25] [INFO ] Deduced a trap composed of 151 places in 173 ms of which 1 ms to minimize.
[2023-03-13 19:29:25] [INFO ] Deduced a trap composed of 161 places in 184 ms of which 1 ms to minimize.
[2023-03-13 19:29:25] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 1 ms to minimize.
[2023-03-13 19:29:26] [INFO ] Deduced a trap composed of 161 places in 184 ms of which 0 ms to minimize.
[2023-03-13 19:29:26] [INFO ] Deduced a trap composed of 154 places in 204 ms of which 0 ms to minimize.
[2023-03-13 19:29:26] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 0 ms to minimize.
[2023-03-13 19:29:26] [INFO ] Deduced a trap composed of 147 places in 196 ms of which 1 ms to minimize.
[2023-03-13 19:29:26] [INFO ] Deduced a trap composed of 154 places in 186 ms of which 1 ms to minimize.
[2023-03-13 19:29:27] [INFO ] Deduced a trap composed of 149 places in 196 ms of which 1 ms to minimize.
[2023-03-13 19:29:27] [INFO ] Deduced a trap composed of 150 places in 202 ms of which 0 ms to minimize.
[2023-03-13 19:29:27] [INFO ] Deduced a trap composed of 154 places in 181 ms of which 1 ms to minimize.
[2023-03-13 19:29:27] [INFO ] Deduced a trap composed of 149 places in 180 ms of which 0 ms to minimize.
[2023-03-13 19:29:28] [INFO ] Deduced a trap composed of 169 places in 173 ms of which 1 ms to minimize.
[2023-03-13 19:29:28] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 1 ms to minimize.
[2023-03-13 19:29:28] [INFO ] Deduced a trap composed of 157 places in 193 ms of which 1 ms to minimize.
[2023-03-13 19:29:28] [INFO ] Deduced a trap composed of 155 places in 168 ms of which 0 ms to minimize.
[2023-03-13 19:29:28] [INFO ] Deduced a trap composed of 153 places in 197 ms of which 0 ms to minimize.
[2023-03-13 19:29:29] [INFO ] Deduced a trap composed of 147 places in 196 ms of which 1 ms to minimize.
[2023-03-13 19:29:29] [INFO ] Deduced a trap composed of 145 places in 192 ms of which 1 ms to minimize.
[2023-03-13 19:29:29] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2023-03-13 19:29:29] [INFO ] Deduced a trap composed of 151 places in 177 ms of which 1 ms to minimize.
[2023-03-13 19:29:30] [INFO ] Deduced a trap composed of 154 places in 208 ms of which 1 ms to minimize.
[2023-03-13 19:29:30] [INFO ] Deduced a trap composed of 161 places in 189 ms of which 0 ms to minimize.
[2023-03-13 19:29:30] [INFO ] Deduced a trap composed of 154 places in 188 ms of which 0 ms to minimize.
[2023-03-13 19:29:30] [INFO ] Deduced a trap composed of 146 places in 190 ms of which 1 ms to minimize.
[2023-03-13 19:29:30] [INFO ] Deduced a trap composed of 148 places in 190 ms of which 1 ms to minimize.
[2023-03-13 19:29:31] [INFO ] Deduced a trap composed of 146 places in 163 ms of which 1 ms to minimize.
[2023-03-13 19:29:31] [INFO ] Deduced a trap composed of 152 places in 192 ms of which 0 ms to minimize.
[2023-03-13 19:29:31] [INFO ] Deduced a trap composed of 150 places in 172 ms of which 0 ms to minimize.
[2023-03-13 19:29:31] [INFO ] Deduced a trap composed of 153 places in 188 ms of which 0 ms to minimize.
[2023-03-13 19:29:32] [INFO ] Deduced a trap composed of 147 places in 173 ms of which 1 ms to minimize.
[2023-03-13 19:29:32] [INFO ] Deduced a trap composed of 147 places in 177 ms of which 0 ms to minimize.
[2023-03-13 19:29:32] [INFO ] Deduced a trap composed of 165 places in 223 ms of which 1 ms to minimize.
[2023-03-13 19:29:32] [INFO ] Deduced a trap composed of 153 places in 153 ms of which 0 ms to minimize.
[2023-03-13 19:29:32] [INFO ] Deduced a trap composed of 166 places in 187 ms of which 0 ms to minimize.
[2023-03-13 19:29:33] [INFO ] Deduced a trap composed of 175 places in 208 ms of which 0 ms to minimize.
[2023-03-13 19:29:33] [INFO ] Deduced a trap composed of 148 places in 172 ms of which 0 ms to minimize.
[2023-03-13 19:29:33] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 0 ms to minimize.
[2023-03-13 19:29:33] [INFO ] Deduced a trap composed of 152 places in 167 ms of which 1 ms to minimize.
[2023-03-13 19:29:34] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 1 ms to minimize.
[2023-03-13 19:29:34] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-13 19:29:34] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 1 ms to minimize.
[2023-03-13 19:29:34] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 0 ms to minimize.
[2023-03-13 19:29:34] [INFO ] Deduced a trap composed of 158 places in 163 ms of which 1 ms to minimize.
[2023-03-13 19:29:35] [INFO ] Deduced a trap composed of 153 places in 186 ms of which 1 ms to minimize.
[2023-03-13 19:29:35] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 0 ms to minimize.
[2023-03-13 19:29:35] [INFO ] Deduced a trap composed of 161 places in 198 ms of which 1 ms to minimize.
[2023-03-13 19:29:35] [INFO ] Deduced a trap composed of 155 places in 187 ms of which 1 ms to minimize.
[2023-03-13 19:29:36] [INFO ] Deduced a trap composed of 159 places in 230 ms of which 1 ms to minimize.
[2023-03-13 19:29:36] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 1 ms to minimize.
[2023-03-13 19:29:36] [INFO ] Deduced a trap composed of 156 places in 192 ms of which 0 ms to minimize.
[2023-03-13 19:29:36] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 0 ms to minimize.
[2023-03-13 19:29:37] [INFO ] Deduced a trap composed of 145 places in 211 ms of which 1 ms to minimize.
[2023-03-13 19:29:37] [INFO ] Deduced a trap composed of 160 places in 165 ms of which 1 ms to minimize.
[2023-03-13 19:29:37] [INFO ] Deduced a trap composed of 155 places in 177 ms of which 1 ms to minimize.
[2023-03-13 19:29:38] [INFO ] Deduced a trap composed of 128 places in 269 ms of which 1 ms to minimize.
[2023-03-13 19:29:38] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 0 ms to minimize.
[2023-03-13 19:29:38] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 1 ms to minimize.
[2023-03-13 19:29:38] [INFO ] Trap strengthening (SAT) tested/added 62/61 trap constraints in 14075 ms
[2023-03-13 19:29:38] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 0 ms to minimize.
[2023-03-13 19:29:39] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 1 ms to minimize.
[2023-03-13 19:29:39] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 0 ms to minimize.
[2023-03-13 19:29:39] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 0 ms to minimize.
[2023-03-13 19:29:39] [INFO ] Deduced a trap composed of 74 places in 189 ms of which 1 ms to minimize.
[2023-03-13 19:29:39] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 1 ms to minimize.
[2023-03-13 19:29:40] [INFO ] Deduced a trap composed of 64 places in 180 ms of which 1 ms to minimize.
[2023-03-13 19:29:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 1506 ms
[2023-03-13 19:29:40] [INFO ] After 23010ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 483 ms.
[2023-03-13 19:29:40] [INFO ] After 23935ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 144 ms.
Support contains 39 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (complete) has 1418 edges and 719 vertex of which 694 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.4 ms
Discarding 25 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 694 transition count 523
Reduce places removed 104 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 111 rules applied. Total rules applied 216 place count 590 transition count 516
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 223 place count 583 transition count 516
Performed 139 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 139 Pre rules applied. Total rules applied 223 place count 583 transition count 377
Deduced a syphon composed of 139 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 296 rules applied. Total rules applied 519 place count 426 transition count 377
Discarding 85 places :
Symmetric choice reduction at 3 with 85 rule applications. Total rules 604 place count 341 transition count 292
Iterating global reduction 3 with 85 rules applied. Total rules applied 689 place count 341 transition count 292
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 689 place count 341 transition count 286
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 702 place count 334 transition count 286
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 894 place count 237 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 895 place count 237 transition count 190
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 899 place count 235 transition count 197
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 903 place count 235 transition count 197
Applied a total of 903 rules in 158 ms. Remains 235 /719 variables (removed 484) and now considering 197/638 (removed 441) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 235/719 places, 197/638 transitions.
Incomplete random walk after 10000 steps, including 349 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 77 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 509298 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :{}
Probabilistic random walk after 509298 steps, saw 89909 distinct states, run finished after 3004 ms. (steps per millisecond=169 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 19:29:44] [INFO ] Flow matrix only has 196 transitions (discarded 1 similar events)
// Phase 1: matrix 196 rows 235 cols
[2023-03-13 19:29:44] [INFO ] Computed 86 place invariants in 4 ms
[2023-03-13 19:29:44] [INFO ] [Real]Absence check using 63 positive place invariants in 11 ms returned sat
[2023-03-13 19:29:44] [INFO ] [Real]Absence check using 63 positive and 23 generalized place invariants in 6 ms returned sat
[2023-03-13 19:29:44] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 19:29:44] [INFO ] [Nat]Absence check using 63 positive place invariants in 9 ms returned sat
[2023-03-13 19:29:44] [INFO ] [Nat]Absence check using 63 positive and 23 generalized place invariants in 5 ms returned sat
[2023-03-13 19:29:44] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 19:29:44] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-13 19:29:45] [INFO ] After 97ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 19:29:45] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2023-03-13 19:29:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-13 19:29:45] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 1 ms to minimize.
[2023-03-13 19:29:45] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2023-03-13 19:29:45] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2023-03-13 19:29:45] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2023-03-13 19:29:45] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2023-03-13 19:29:45] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 1 ms to minimize.
[2023-03-13 19:29:45] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
[2023-03-13 19:29:45] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 0 ms to minimize.
[2023-03-13 19:29:45] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 0 ms to minimize.
[2023-03-13 19:29:46] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 1 ms to minimize.
[2023-03-13 19:29:46] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2023-03-13 19:29:46] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2023-03-13 19:29:46] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1144 ms
[2023-03-13 19:29:46] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 1 ms to minimize.
[2023-03-13 19:29:46] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 0 ms to minimize.
[2023-03-13 19:29:46] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 0 ms to minimize.
[2023-03-13 19:29:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 285 ms
[2023-03-13 19:29:46] [INFO ] After 1775ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-13 19:29:46] [INFO ] After 2208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 75 ms.
Support contains 39 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 197/197 transitions.
Applied a total of 0 rules in 16 ms. Remains 235 /235 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 235/235 places, 197/197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 197/197 transitions.
Applied a total of 0 rules in 12 ms. Remains 235 /235 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2023-03-13 19:29:46] [INFO ] Flow matrix only has 196 transitions (discarded 1 similar events)
[2023-03-13 19:29:46] [INFO ] Invariant cache hit.
[2023-03-13 19:29:47] [INFO ] Implicit Places using invariants in 186 ms returned [17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 56, 185, 207]
Discarding 13 places :
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Implicit Place search using SMT only with invariants took 191 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 222/235 places, 194/197 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 218 transition count 178
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 218 transition count 178
Applied a total of 8 rules in 15 ms. Remains 218 /222 variables (removed 4) and now considering 178/194 (removed 16) transitions.
[2023-03-13 19:29:47] [INFO ] Flow matrix only has 177 transitions (discarded 1 similar events)
// Phase 1: matrix 177 rows 218 cols
[2023-03-13 19:29:47] [INFO ] Computed 76 place invariants in 3 ms
[2023-03-13 19:29:47] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-13 19:29:47] [INFO ] Flow matrix only has 177 transitions (discarded 1 similar events)
[2023-03-13 19:29:47] [INFO ] Invariant cache hit.
[2023-03-13 19:29:47] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-13 19:29:47] [INFO ] Implicit Places using invariants and state equation in 259 ms returned [48, 49, 50, 51, 52, 54, 55, 58, 62, 136, 138, 140, 142, 147, 151]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 399 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 203/235 places, 178/197 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 203 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 202 transition count 177
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 200 transition count 175
Applied a total of 6 rules in 31 ms. Remains 200 /203 variables (removed 3) and now considering 175/178 (removed 3) transitions.
[2023-03-13 19:29:47] [INFO ] Flow matrix only has 174 transitions (discarded 1 similar events)
// Phase 1: matrix 174 rows 200 cols
[2023-03-13 19:29:47] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-13 19:29:47] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-13 19:29:47] [INFO ] Flow matrix only has 174 transitions (discarded 1 similar events)
[2023-03-13 19:29:47] [INFO ] Invariant cache hit.
[2023-03-13 19:29:47] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-13 19:29:47] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 200/235 places, 175/197 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 956 ms. Remains : 200/235 places, 175/197 transitions.
Incomplete random walk after 10000 steps, including 351 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 728446 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 728446 steps, saw 128977 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 19:29:51] [INFO ] Flow matrix only has 174 transitions (discarded 1 similar events)
[2023-03-13 19:29:51] [INFO ] Invariant cache hit.
[2023-03-13 19:29:51] [INFO ] [Real]Absence check using 51 positive place invariants in 12 ms returned sat
[2023-03-13 19:29:51] [INFO ] [Real]Absence check using 51 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-13 19:29:51] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 19:29:51] [INFO ] [Nat]Absence check using 51 positive place invariants in 10 ms returned sat
[2023-03-13 19:29:51] [INFO ] [Nat]Absence check using 51 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-13 19:29:51] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 19:29:51] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-13 19:29:51] [INFO ] After 72ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 19:29:51] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2023-03-13 19:29:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-13 19:29:51] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 1 ms to minimize.
[2023-03-13 19:29:52] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2023-03-13 19:29:52] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2023-03-13 19:29:52] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2023-03-13 19:29:52] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2023-03-13 19:29:52] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2023-03-13 19:29:52] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2023-03-13 19:29:52] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2023-03-13 19:29:52] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 0 ms to minimize.
[2023-03-13 19:29:52] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 0 ms to minimize.
[2023-03-13 19:29:52] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2023-03-13 19:29:52] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2023-03-13 19:29:52] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 0 ms to minimize.
[2023-03-13 19:29:53] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 0 ms to minimize.
[2023-03-13 19:29:53] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 0 ms to minimize.
[2023-03-13 19:29:53] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 0 ms to minimize.
[2023-03-13 19:29:53] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1403 ms
[2023-03-13 19:29:53] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2023-03-13 19:29:53] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2023-03-13 19:29:53] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2023-03-13 19:29:53] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 3 ms to minimize.
[2023-03-13 19:29:53] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2023-03-13 19:29:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 420 ms
[2023-03-13 19:29:53] [INFO ] After 2147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-13 19:29:53] [INFO ] After 2476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 114 ms.
Support contains 39 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 175/175 transitions.
Applied a total of 0 rules in 9 ms. Remains 200 /200 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 200/200 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 175/175 transitions.
Applied a total of 0 rules in 8 ms. Remains 200 /200 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2023-03-13 19:29:53] [INFO ] Flow matrix only has 174 transitions (discarded 1 similar events)
[2023-03-13 19:29:53] [INFO ] Invariant cache hit.
[2023-03-13 19:29:54] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-13 19:29:54] [INFO ] Flow matrix only has 174 transitions (discarded 1 similar events)
[2023-03-13 19:29:54] [INFO ] Invariant cache hit.
[2023-03-13 19:29:54] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-13 19:29:54] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-13 19:29:54] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-13 19:29:54] [INFO ] Flow matrix only has 174 transitions (discarded 1 similar events)
[2023-03-13 19:29:54] [INFO ] Invariant cache hit.
[2023-03-13 19:29:54] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 502 ms. Remains : 200/200 places, 175/175 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 200 transition count 174
Applied a total of 1 rules in 7 ms. Remains 200 /200 variables (removed 0) and now considering 174/175 (removed 1) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 174 rows 200 cols
[2023-03-13 19:29:54] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-13 19:29:54] [INFO ] [Real]Absence check using 51 positive place invariants in 15 ms returned sat
[2023-03-13 19:29:54] [INFO ] [Real]Absence check using 51 positive and 10 generalized place invariants in 3 ms returned sat
[2023-03-13 19:29:54] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 19:29:54] [INFO ] [Nat]Absence check using 51 positive place invariants in 10 ms returned sat
[2023-03-13 19:29:54] [INFO ] [Nat]Absence check using 51 positive and 10 generalized place invariants in 3 ms returned sat
[2023-03-13 19:29:54] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 19:29:54] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2023-03-13 19:29:54] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2023-03-13 19:29:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2023-03-13 19:29:55] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 0 ms to minimize.
[2023-03-13 19:29:55] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 0 ms to minimize.
[2023-03-13 19:29:55] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 1 ms to minimize.
[2023-03-13 19:29:55] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 0 ms to minimize.
[2023-03-13 19:29:55] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2023-03-13 19:29:55] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 0 ms to minimize.
[2023-03-13 19:29:55] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2023-03-13 19:29:55] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 1 ms to minimize.
[2023-03-13 19:29:55] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 0 ms to minimize.
[2023-03-13 19:29:55] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2023-03-13 19:29:55] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 0 ms to minimize.
[2023-03-13 19:29:56] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2023-03-13 19:29:56] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1064 ms
[2023-03-13 19:29:56] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2023-03-13 19:29:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-13 19:29:56] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 0 ms to minimize.
[2023-03-13 19:29:56] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 0 ms to minimize.
[2023-03-13 19:29:56] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 0 ms to minimize.
[2023-03-13 19:29:56] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 0 ms to minimize.
[2023-03-13 19:29:56] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 1 ms to minimize.
[2023-03-13 19:29:56] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 0 ms to minimize.
[2023-03-13 19:29:56] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 0 ms to minimize.
[2023-03-13 19:29:56] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 0 ms to minimize.
[2023-03-13 19:29:56] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2023-03-13 19:29:57] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 0 ms to minimize.
[2023-03-13 19:29:57] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 0 ms to minimize.
[2023-03-13 19:29:57] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 0 ms to minimize.
[2023-03-13 19:29:57] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2023-03-13 19:29:57] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 0 ms to minimize.
[2023-03-13 19:29:57] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2023-03-13 19:29:57] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1224 ms
[2023-03-13 19:29:57] [INFO ] After 2769ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-13 19:29:57] [INFO ] After 2973ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-13 19:29:57] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-13 19:29:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 200 places, 175 transitions and 764 arcs took 4 ms.
[2023-03-13 19:29:57] [INFO ] Flatten gal took : 58 ms
Total runtime 43118 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: BusinessProcesses_PT_20
(NrP: 200 NrTr: 175 NrArc: 764)

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

net check time: 0m 0.000sec

init dd package: 0m 3.144sec


RS generation: 0m25.558sec


-> reachability set: #nodes 55159 (5.5e+04) #states 81,098,490,182,137 (13)



starting MCC model checker
--------------------------

checking: EF [[p99<=1 & 1<=p99]]
normalized: E [true U [p99<=1 & 1<=p99]]

abstracting: (1<=p99)
states: 26,029,062,094,848 (13)
abstracting: (p99<=1)
states: 81,098,490,182,137 (13)
-> the formula is TRUE

FORMULA BusinessProcesses-PT-20-ReachabilityFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.431sec

checking: AG [[[p154<=0 & 0<=p154] & [[p19<=0 & 0<=p19] | [[p81<=0 & 0<=p81] | [p176<=0 & 0<=p176]]]]]
normalized: ~ [E [true U ~ [[[[[p176<=0 & 0<=p176] | [p81<=0 & 0<=p81]] | [p19<=0 & 0<=p19]] & [p154<=0 & 0<=p154]]]]]

abstracting: (0<=p154)
states: 81,098,490,182,137 (13)
abstracting: (p154<=0)
states: 80,151,449,893,369 (13)
abstracting: (0<=p19)
states: 81,098,490,182,137 (13)
abstracting: (p19<=0)
states: 80,715,617,326,585 (13)
abstracting: (0<=p81)
states: 81,098,490,182,137 (13)
abstracting: (p81<=0)
states: 46,822,795,681,273 (13)
abstracting: (0<=p176)
states: 81,098,490,182,137 (13)
abstracting: (p176<=0)
states: 80,237,026,257,145 (13)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-20-ReachabilityFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.674sec

checking: EF [[[p159<=1 & 1<=p159] | [[p180<=1 & 1<=p180] & [[[p140<=0 & 0<=p140] | [[[p189<=0 & 0<=p189] & [[p94<=0 & 0<=p94] | [p150<=0 & 0<=p150]]] | [[p48<=0 & 0<=p48] & [[p114<=0 & 0<=p114] | [p0<=0 & 0<=p0]]]]] & [[p5<=1 & 1<=p5] | [p54<=1 & 1<=p54]]]]]]
normalized: E [true U [[[[[p54<=1 & 1<=p54] | [p5<=1 & 1<=p5]] & [[[[[p0<=0 & 0<=p0] | [p114<=0 & 0<=p114]] & [p48<=0 & 0<=p48]] | [[[p150<=0 & 0<=p150] | [p94<=0 & 0<=p94]] & [p189<=0 & 0<=p189]]] | [p140<=0 & 0<=p140]]] & [p180<=1 & 1<=p180]] | [p159<=1 & 1<=p159]]]

abstracting: (1<=p159)
states: 1,172,702,232,576 (12)
abstracting: (p159<=1)
states: 81,098,490,182,137 (13)
abstracting: (1<=p180)
states: 430,731,962,496 (11)
abstracting: (p180<=1)
states: 81,098,490,182,137 (13)
abstracting: (0<=p140)
states: 81,098,490,182,137 (13)
abstracting: (p140<=0)
states: 79,566,998,796,793 (13)
abstracting: (0<=p189)
states: 81,098,490,182,137 (13)
abstracting: (p189<=0)
states: 80,954,912,861,305 (13)
abstracting: (0<=p94)
states: 81,098,490,182,137 (13)
abstracting: (p94<=0)
states: 70,961,178,761,145 (13)
abstracting: (0<=p150)
states: 81,098,490,182,137 (13)
abstracting: (p150<=0)
states: 78,753,393,998,329 (13)
abstracting: (0<=p48)
states: 81,098,490,182,137 (13)
abstracting: (p48<=0)
states: 41,082,053,372,197 (13)
abstracting: (0<=p114)
states: 81,098,490,182,137 (13)
abstracting: (p114<=0)
states: 50,869,781,366,425 (13)
abstracting: (0<=p0)
states: 81,098,490,182,137 (13)
abstracting: (p0<=0)
states: 81,098,490,182,136 (13)
abstracting: (1<=p5)
states: 173,502 (5)
abstracting: (p5<=1)
states: 81,098,490,182,137 (13)
abstracting: (1<=p54)
states: 20,274,622,365,696 (13)
abstracting: (p54<=1)
states: 81,098,490,182,137 (13)
-> the formula is TRUE

FORMULA BusinessProcesses-PT-20-ReachabilityFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.164sec

checking: EF [[[[[[[[p181<=1 & 1<=p181] & [p134<=0 & 0<=p134]] & [[p20<=1 & 1<=p20] & [p86<=1 & 1<=p86]]] | [[p25<=1 & 1<=p25] & [[[p51<=0 & 0<=p51] | [p66<=0 & 0<=p66]] | [[p56<=1 & 1<=p56] | [[p15<=1 & 1<=p15] & [[p86<=1 & 1<=p86] & [p194<=1 & 1<=p194]]]]]]] & [[p146<=0 & 0<=p146] | [[p121<=0 & 0<=p121] | [[p61<=1 & 1<=p61] & [[[p29<=1 & 1<=p29] | [[[p49<=1 & 1<=p49] & [[p132<=1 & 1<=p132] & [p172<=1 & 1<=p172]]] | [[p189<=0 & 0<=p189] & [[p41<=0 & 0<=p41] | [[p115<=0 & 0<=p115] | [p174<=0 & 0<=p174]]]]]] & [[p155<=1 & 1<=p155] | [[p49<=1 & 1<=p49] & [[p132<=1 & 1<=p132] & [p172<=1 & 1<=p172]]]]]]]]] & [p174<=1 & 1<=p174]] & [[p37<=1 & 1<=p37] & [p109<=1 & 1<=p109]]]]
normalized: E [true U [[[[[[[p61<=1 & 1<=p61] & [[[[[p172<=1 & 1<=p172] & [p132<=1 & 1<=p132]] & [p49<=1 & 1<=p49]] | [p155<=1 & 1<=p155]] & [[[[[[p174<=0 & 0<=p174] | [p115<=0 & 0<=p115]] | [p41<=0 & 0<=p41]] & [p189<=0 & 0<=p189]] | [[[p172<=1 & 1<=p172] & [p132<=1 & 1<=p132]] & [p49<=1 & 1<=p49]]] | [p29<=1 & 1<=p29]]]] | [p121<=0 & 0<=p121]] | [p146<=0 & 0<=p146]] & [[[[[[[p194<=1 & 1<=p194] & [p86<=1 & 1<=p86]] & [p15<=1 & 1<=p15]] | [p56<=1 & 1<=p56]] | [[p66<=0 & 0<=p66] | [p51<=0 & 0<=p51]]] & [p25<=1 & 1<=p25]] | [[[p86<=1 & 1<=p86] & [p20<=1 & 1<=p20]] & [[p134<=0 & 0<=p134] & [p181<=1 & 1<=p181]]]]] & [p174<=1 & 1<=p174]] & [[p109<=1 & 1<=p109] & [p37<=1 & 1<=p37]]]]

abstracting: (1<=p37)
states: 39,404,778,137,892 (13)
abstracting: (p37<=1)
states: 81,098,490,182,137 (13)
abstracting: (1<=p109)
states: 39,026,382,864,384 (13)
abstracting: (p109<=1)
states: 81,098,490,182,137 (13)
abstracting: (1<=p174)
states: 4,690,192,482,870 (12)
abstracting: (p174<=1)
states: 81,098,490,182,137 (13)
abstracting: (1<=p181)
states: 1,052,900,352,768 (12)
abstracting: (p181<=1)
states: 81,098,490,182,137 (13)
abstracting: (0<=p134)
states: 81,098,490,182,137 (13)
abstracting: (p134<=0)
states: 42,393,073,097,593 (13)
abstracting: (1<=p20)
states: 574,309,283,328 (11)
abstracting: (p20<=1)
states: 81,098,490,182,137 (13)
abstracting: (1<=p86)
states: 33,940,680,759,168 (13)
abstracting: (p86<=1)
states: 81,098,490,182,137 (13)
abstracting: (1<=p25)
states: 20,146,047,418,368 (13)
abstracting: (p25<=1)
states: 81,098,490,182,137 (13)
abstracting: (0<=p51)
states: 81,098,490,182,137 (13)
abstracting: (p51<=0)
states: 81,002,771,964,217 (13)
abstracting: (0<=p66)
states: 81,098,490,182,137 (13)
abstracting: (p66<=0)
states: 54,065,660,136,185 (13)
abstracting: (1<=p56)
states: 347,229,002,136 (11)
abstracting: (p56<=1)
states: 81,098,490,182,137 (13)
abstracting: (1<=p15)
states: 191,436,427,776 (11)
abstracting: (p15<=1)
states: 81,098,490,182,137 (13)
abstracting: (1<=p86)
states: 33,940,680,759,168 (13)
abstracting: (p86<=1)
states: 81,098,490,182,137 (13)
abstracting: (1<=p194)
states: 574,309,283,328 (11)
abstracting: (p194<=1)
states: 81,098,490,182,137 (13)
abstracting: (0<=p146)
states: 81,098,490,182,137 (13)
abstracting: (p146<=0)
states: 81,002,771,968,249 (13)
abstracting: (0<=p121)
states: 81,098,490,182,137 (13)
abstracting: (p121<=0)
states: 61,336,866,881,585 (13)
abstracting: (1<=p29)
states: 2,367,600,721,920 (12)
abstracting: (p29<=1)
states: 81,098,490,182,137 (13)
abstracting: (1<=p49)
states: 95,718,217,920 (10)
abstracting: (p49<=1)
states: 81,098,490,182,137 (13)
abstracting: (1<=p132)
states: 40,375,630,590,000 (13)
abstracting: (p132<=1)
states: 81,098,490,182,137 (13)
abstracting: (1<=p172)
states: 95,718,217,920 (10)
abstracting: (p172<=1)
states: 81,098,490,182,137 (13)
abstracting: (0<=p189)
states: 81,098,490,182,137 (13)
abstracting: (p189<=0)
states: 80,954,912,861,305 (13)
abstracting: (0<=p41)
states: 81,098,490,182,137 (13)
abstracting: (p41<=0)
states: 42,451,138,685,719 (13)
abstracting: (0<=p115)
states: 81,098,490,182,137 (13)
abstracting: (p115<=0)
states: 60,750,593,194,489 (13)
abstracting: (0<=p174)
states: 81,098,490,182,137 (13)
abstracting: (p174<=0)
states: 76,408,297,699,267 (13)
abstracting: (1<=p155)
states: 947,040,288,768 (11)
abstracting: (p155<=1)
states: 81,098,490,182,137 (13)
abstracting: (1<=p49)
states: 95,718,217,920 (10)
abstracting: (p49<=1)
states: 81,098,490,182,137 (13)
abstracting: (1<=p132)
states: 40,375,630,590,000 (13)
abstracting: (p132<=1)
states: 81,098,490,182,137 (13)
abstracting: (1<=p172)
states: 95,718,217,920 (10)
abstracting: (p172<=1)
states: 81,098,490,182,137 (13)
abstracting: (1<=p61)
states: 19,680 (4)
abstracting: (p61<=1)
states: 81,098,490,182,137 (13)
-> the formula is TRUE

FORMULA BusinessProcesses-PT-20-ReachabilityFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m24.078sec

totally nodes used: 44679901 (4.5e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 57418136 230122783 287540919
used/not used/entry size/cache size: 65908045 1200819 16 1024MB
basic ops cache: hits/miss/sum: 11332404 43014985 54347389
used/not used/entry size/cache size: 16651543 125673 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 80371 476758 557129
used/not used/entry size/cache size: 464653 7923955 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 35519956
1 21524266
2 7611874
3 1970330
4 403601
5 67955
6 9610
7 1123
8 144
9 5
>= 10 0

Total processing time: 1m39.207sec


BK_STOP 1678735897332

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

48639
iterations count:128630 (735), effective:5891 (33)

initing FirstDep: 0m 0.000sec


iterations count:13034 (74), effective:547 (3)

iterations count:13663 (78), effective:571 (3)

iterations count:13997 (79), effective:539 (3)

iterations count:23680 (135), effective:1165 (6)

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-20"
export BK_EXAMINATION="ReachabilityFireability"
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-20, examination is ReachabilityFireability"
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-167813696000607"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-20.tgz
mv BusinessProcesses-PT-20 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;