Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414900339.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BusinessProcesses-PT-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414900339
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 16:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 146K May 18 16:42 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-12-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716651106222

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=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-25 15:31:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 15:31:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:31:48] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-05-25 15:31:48] [INFO ] Transformed 586 places.
[2024-05-25 15:31:48] [INFO ] Transformed 525 transitions.
[2024-05-25 15:31:48] [INFO ] Found NUPN structural information;
[2024-05-25 15:31:48] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 71 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 14) seen :5
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 521 rows 582 cols
[2024-05-25 15:31:49] [INFO ] Computed 98 invariants in 29 ms
[2024-05-25 15:31:49] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-25 15:31:50] [INFO ] [Nat]Absence check using 55 positive place invariants in 19 ms returned sat
[2024-05-25 15:31:50] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2024-05-25 15:31:50] [INFO ] After 695ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2024-05-25 15:31:51] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 7 ms to minimize.
[2024-05-25 15:31:51] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2024-05-25 15:31:51] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2024-05-25 15:31:51] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 1 ms to minimize.
[2024-05-25 15:31:51] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 1 ms to minimize.
[2024-05-25 15:31:51] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2024-05-25 15:31:51] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2024-05-25 15:31:52] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2024-05-25 15:31:52] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 0 ms to minimize.
[2024-05-25 15:31:52] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2024-05-25 15:31:52] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-25 15:31:52] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1402 ms
[2024-05-25 15:31:52] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-25 15:31:52] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 3 ms to minimize.
[2024-05-25 15:31:52] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2024-05-25 15:31:52] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 0 ms to minimize.
[2024-05-25 15:31:52] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2024-05-25 15:31:53] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
[2024-05-25 15:31:53] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 0 ms to minimize.
[2024-05-25 15:31:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 751 ms
[2024-05-25 15:31:53] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 1 ms to minimize.
[2024-05-25 15:31:53] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 0 ms to minimize.
[2024-05-25 15:31:53] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 0 ms to minimize.
[2024-05-25 15:31:53] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 1 ms to minimize.
[2024-05-25 15:31:54] [INFO ] Deduced a trap composed of 122 places in 146 ms of which 0 ms to minimize.
[2024-05-25 15:31:54] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 1 ms to minimize.
[2024-05-25 15:31:54] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
[2024-05-25 15:31:54] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2024-05-25 15:31:54] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 0 ms to minimize.
[2024-05-25 15:31:54] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 1 ms to minimize.
[2024-05-25 15:31:54] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 0 ms to minimize.
[2024-05-25 15:31:55] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 0 ms to minimize.
[2024-05-25 15:31:55] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 1 ms to minimize.
[2024-05-25 15:31:55] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1914 ms
[2024-05-25 15:31:55] [INFO ] Deduced a trap composed of 126 places in 173 ms of which 1 ms to minimize.
[2024-05-25 15:31:55] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 1 ms to minimize.
[2024-05-25 15:31:55] [INFO ] Deduced a trap composed of 134 places in 139 ms of which 5 ms to minimize.
[2024-05-25 15:31:55] [INFO ] Deduced a trap composed of 135 places in 138 ms of which 1 ms to minimize.
[2024-05-25 15:31:56] [INFO ] Deduced a trap composed of 127 places in 129 ms of which 0 ms to minimize.
[2024-05-25 15:31:56] [INFO ] Deduced a trap composed of 126 places in 133 ms of which 1 ms to minimize.
[2024-05-25 15:31:56] [INFO ] Deduced a trap composed of 124 places in 124 ms of which 1 ms to minimize.
[2024-05-25 15:31:56] [INFO ] Deduced a trap composed of 126 places in 122 ms of which 1 ms to minimize.
[2024-05-25 15:31:56] [INFO ] Deduced a trap composed of 132 places in 116 ms of which 1 ms to minimize.
[2024-05-25 15:31:56] [INFO ] Deduced a trap composed of 142 places in 104 ms of which 1 ms to minimize.
[2024-05-25 15:31:56] [INFO ] Deduced a trap composed of 121 places in 98 ms of which 1 ms to minimize.
[2024-05-25 15:31:57] [INFO ] Deduced a trap composed of 133 places in 102 ms of which 1 ms to minimize.
[2024-05-25 15:31:57] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 1 ms to minimize.
[2024-05-25 15:31:57] [INFO ] Deduced a trap composed of 137 places in 99 ms of which 1 ms to minimize.
[2024-05-25 15:31:57] [INFO ] Deduced a trap composed of 126 places in 100 ms of which 1 ms to minimize.
[2024-05-25 15:31:57] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 1 ms to minimize.
[2024-05-25 15:31:57] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 1 ms to minimize.
[2024-05-25 15:31:57] [INFO ] Deduced a trap composed of 131 places in 99 ms of which 0 ms to minimize.
[2024-05-25 15:31:57] [INFO ] Deduced a trap composed of 129 places in 101 ms of which 1 ms to minimize.
[2024-05-25 15:31:58] [INFO ] Deduced a trap composed of 146 places in 99 ms of which 1 ms to minimize.
[2024-05-25 15:31:58] [INFO ] Deduced a trap composed of 140 places in 101 ms of which 0 ms to minimize.
[2024-05-25 15:31:58] [INFO ] Deduced a trap composed of 134 places in 103 ms of which 0 ms to minimize.
[2024-05-25 15:31:58] [INFO ] Deduced a trap composed of 132 places in 110 ms of which 1 ms to minimize.
[2024-05-25 15:31:58] [INFO ] Deduced a trap composed of 132 places in 107 ms of which 1 ms to minimize.
[2024-05-25 15:31:58] [INFO ] Deduced a trap composed of 124 places in 100 ms of which 3 ms to minimize.
[2024-05-25 15:31:58] [INFO ] Deduced a trap composed of 135 places in 102 ms of which 0 ms to minimize.
[2024-05-25 15:31:58] [INFO ] Deduced a trap composed of 129 places in 101 ms of which 1 ms to minimize.
[2024-05-25 15:31:59] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 1 ms to minimize.
[2024-05-25 15:31:59] [INFO ] Deduced a trap composed of 130 places in 104 ms of which 1 ms to minimize.
[2024-05-25 15:31:59] [INFO ] Deduced a trap composed of 137 places in 105 ms of which 0 ms to minimize.
[2024-05-25 15:31:59] [INFO ] Deduced a trap composed of 126 places in 102 ms of which 0 ms to minimize.
[2024-05-25 15:31:59] [INFO ] Deduced a trap composed of 129 places in 99 ms of which 0 ms to minimize.
[2024-05-25 15:31:59] [INFO ] Deduced a trap composed of 143 places in 105 ms of which 1 ms to minimize.
[2024-05-25 15:31:59] [INFO ] Deduced a trap composed of 123 places in 97 ms of which 0 ms to minimize.
[2024-05-25 15:31:59] [INFO ] Deduced a trap composed of 132 places in 93 ms of which 1 ms to minimize.
[2024-05-25 15:32:00] [INFO ] Deduced a trap composed of 134 places in 94 ms of which 0 ms to minimize.
[2024-05-25 15:32:00] [INFO ] Deduced a trap composed of 134 places in 95 ms of which 0 ms to minimize.
[2024-05-25 15:32:00] [INFO ] Deduced a trap composed of 144 places in 99 ms of which 3 ms to minimize.
[2024-05-25 15:32:00] [INFO ] Deduced a trap composed of 133 places in 100 ms of which 1 ms to minimize.
[2024-05-25 15:32:00] [INFO ] Deduced a trap composed of 140 places in 142 ms of which 1 ms to minimize.
[2024-05-25 15:32:00] [INFO ] Deduced a trap composed of 133 places in 119 ms of which 1 ms to minimize.
[2024-05-25 15:32:00] [INFO ] Deduced a trap composed of 145 places in 105 ms of which 1 ms to minimize.
[2024-05-25 15:32:01] [INFO ] Deduced a trap composed of 126 places in 126 ms of which 1 ms to minimize.
[2024-05-25 15:32:01] [INFO ] Deduced a trap composed of 127 places in 95 ms of which 0 ms to minimize.
[2024-05-25 15:32:01] [INFO ] Deduced a trap composed of 124 places in 96 ms of which 1 ms to minimize.
[2024-05-25 15:32:01] [INFO ] Deduced a trap composed of 127 places in 89 ms of which 1 ms to minimize.
[2024-05-25 15:32:01] [INFO ] Deduced a trap composed of 124 places in 112 ms of which 0 ms to minimize.
[2024-05-25 15:32:01] [INFO ] Deduced a trap composed of 141 places in 93 ms of which 0 ms to minimize.
[2024-05-25 15:32:01] [INFO ] Deduced a trap composed of 146 places in 92 ms of which 0 ms to minimize.
[2024-05-25 15:32:01] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 6607 ms
[2024-05-25 15:32:02] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:32:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2024-05-25 15:32:02] [INFO ] Deduced a trap composed of 138 places in 100 ms of which 1 ms to minimize.
[2024-05-25 15:32:02] [INFO ] Deduced a trap composed of 125 places in 100 ms of which 0 ms to minimize.
[2024-05-25 15:32:02] [INFO ] Deduced a trap composed of 126 places in 130 ms of which 1 ms to minimize.
[2024-05-25 15:32:02] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 0 ms to minimize.
[2024-05-25 15:32:02] [INFO ] Deduced a trap composed of 130 places in 146 ms of which 1 ms to minimize.
[2024-05-25 15:32:03] [INFO ] Deduced a trap composed of 136 places in 105 ms of which 0 ms to minimize.
[2024-05-25 15:32:03] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 1 ms to minimize.
[2024-05-25 15:32:03] [INFO ] Deduced a trap composed of 121 places in 109 ms of which 1 ms to minimize.
[2024-05-25 15:32:03] [INFO ] Deduced a trap composed of 131 places in 107 ms of which 0 ms to minimize.
[2024-05-25 15:32:03] [INFO ] Deduced a trap composed of 136 places in 103 ms of which 0 ms to minimize.
[2024-05-25 15:32:03] [INFO ] Deduced a trap composed of 129 places in 101 ms of which 0 ms to minimize.
[2024-05-25 15:32:03] [INFO ] Deduced a trap composed of 132 places in 96 ms of which 1 ms to minimize.
[2024-05-25 15:32:03] [INFO ] Deduced a trap composed of 139 places in 85 ms of which 0 ms to minimize.
[2024-05-25 15:32:04] [INFO ] Deduced a trap composed of 136 places in 80 ms of which 1 ms to minimize.
[2024-05-25 15:32:04] [INFO ] Deduced a trap composed of 138 places in 86 ms of which 0 ms to minimize.
[2024-05-25 15:32:04] [INFO ] Deduced a trap composed of 128 places in 88 ms of which 1 ms to minimize.
[2024-05-25 15:32:04] [INFO ] Deduced a trap composed of 127 places in 92 ms of which 0 ms to minimize.
[2024-05-25 15:32:04] [INFO ] Deduced a trap composed of 129 places in 92 ms of which 1 ms to minimize.
[2024-05-25 15:32:04] [INFO ] Deduced a trap composed of 137 places in 88 ms of which 1 ms to minimize.
[2024-05-25 15:32:04] [INFO ] Deduced a trap composed of 127 places in 85 ms of which 0 ms to minimize.
[2024-05-25 15:32:04] [INFO ] Deduced a trap composed of 140 places in 88 ms of which 1 ms to minimize.
[2024-05-25 15:32:05] [INFO ] Deduced a trap composed of 142 places in 86 ms of which 0 ms to minimize.
[2024-05-25 15:32:05] [INFO ] Deduced a trap composed of 131 places in 84 ms of which 0 ms to minimize.
[2024-05-25 15:32:05] [INFO ] Deduced a trap composed of 147 places in 85 ms of which 1 ms to minimize.
[2024-05-25 15:32:05] [INFO ] Deduced a trap composed of 145 places in 82 ms of which 1 ms to minimize.
[2024-05-25 15:32:05] [INFO ] Deduced a trap composed of 139 places in 80 ms of which 0 ms to minimize.
[2024-05-25 15:32:05] [INFO ] Deduced a trap composed of 134 places in 81 ms of which 0 ms to minimize.
[2024-05-25 15:32:05] [INFO ] Deduced a trap composed of 132 places in 85 ms of which 0 ms to minimize.
[2024-05-25 15:32:05] [INFO ] Deduced a trap composed of 133 places in 81 ms of which 1 ms to minimize.
[2024-05-25 15:32:05] [INFO ] Deduced a trap composed of 139 places in 89 ms of which 1 ms to minimize.
[2024-05-25 15:32:05] [INFO ] Deduced a trap composed of 127 places in 80 ms of which 0 ms to minimize.
[2024-05-25 15:32:06] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 3791 ms
[2024-05-25 15:32:06] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 0 ms to minimize.
[2024-05-25 15:32:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-05-25 15:32:06] [INFO ] After 16004ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 1082 ms.
[2024-05-25 15:32:07] [INFO ] After 17406ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 125 ms.
Support contains 86 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 521/521 transitions.
Graph (trivial) has 240 edges and 582 vertex of which 4 / 582 are part of one of the 1 SCC in 10 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1182 edges and 579 vertex of which 576 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 576 transition count 436
Reduce places removed 80 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 92 rules applied. Total rules applied 174 place count 496 transition count 424
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 186 place count 484 transition count 424
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 186 place count 484 transition count 349
Deduced a syphon composed of 75 places in 2 ms
Ensure Unique test removed 6 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 342 place count 403 transition count 349
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 394 place count 351 transition count 297
Iterating global reduction 3 with 52 rules applied. Total rules applied 446 place count 351 transition count 297
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 446 place count 351 transition count 295
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 451 place count 348 transition count 295
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 133 rules applied. Total rules applied 584 place count 281 transition count 229
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 586 place count 280 transition count 233
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 587 place count 280 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 588 place count 279 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 589 place count 278 transition count 231
Applied a total of 589 rules in 152 ms. Remains 278 /582 variables (removed 304) and now considering 231/521 (removed 290) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 278/582 places, 231/521 transitions.
Incomplete random walk after 10000 steps, including 262 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 1013169 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :{2=1, 3=1, 4=1, 5=1, 6=1}
Probabilistic random walk after 1013169 steps, saw 153627 distinct states, run finished after 3001 ms. (steps per millisecond=337 ) properties seen :5
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 231 rows 278 cols
[2024-05-25 15:32:11] [INFO ] Computed 88 invariants in 7 ms
[2024-05-25 15:32:11] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:32:11] [INFO ] [Nat]Absence check using 53 positive place invariants in 12 ms returned sat
[2024-05-25 15:32:11] [INFO ] [Nat]Absence check using 53 positive and 35 generalized place invariants in 7 ms returned sat
[2024-05-25 15:32:11] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:32:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 15:32:11] [INFO ] After 156ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 15:32:12] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 0 ms to minimize.
[2024-05-25 15:32:12] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:32:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2024-05-25 15:32:12] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2024-05-25 15:32:12] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
[2024-05-25 15:32:12] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-05-25 15:32:12] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 0 ms to minimize.
[2024-05-25 15:32:12] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 1 ms to minimize.
[2024-05-25 15:32:12] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 0 ms to minimize.
[2024-05-25 15:32:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 499 ms
[2024-05-25 15:32:12] [INFO ] After 950ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 278 ms.
[2024-05-25 15:32:13] [INFO ] After 1552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 ms.
Support contains 53 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 231/231 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 278 transition count 226
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 273 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 272 transition count 225
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 12 place count 272 transition count 216
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 34 place count 259 transition count 216
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 258 transition count 215
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 258 transition count 215
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 79 place count 235 transition count 195
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 83 place count 235 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 234 transition count 194
Applied a total of 84 rules in 78 ms. Remains 234 /278 variables (removed 44) and now considering 194/231 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 234/278 places, 194/231 transitions.
Incomplete random walk after 10000 steps, including 373 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 97 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 928066 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :{0=1}
Probabilistic random walk after 928066 steps, saw 139762 distinct states, run finished after 3001 ms. (steps per millisecond=309 ) properties seen :1
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 194 rows 234 cols
[2024-05-25 15:32:16] [INFO ] Computed 81 invariants in 3 ms
[2024-05-25 15:32:16] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:32:16] [INFO ] [Nat]Absence check using 54 positive place invariants in 6 ms returned sat
[2024-05-25 15:32:16] [INFO ] [Nat]Absence check using 54 positive and 27 generalized place invariants in 4 ms returned sat
[2024-05-25 15:32:16] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:32:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:32:17] [INFO ] After 164ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 15:32:17] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 0 ms to minimize.
[2024-05-25 15:32:17] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 0 ms to minimize.
[2024-05-25 15:32:17] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2024-05-25 15:32:17] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 0 ms to minimize.
[2024-05-25 15:32:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 266 ms
[2024-05-25 15:32:17] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 0 ms to minimize.
[2024-05-25 15:32:17] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 0 ms to minimize.
[2024-05-25 15:32:17] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2024-05-25 15:32:17] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:32:17] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-05-25 15:32:17] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-25 15:32:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 387 ms
[2024-05-25 15:32:17] [INFO ] After 902ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 145 ms.
[2024-05-25 15:32:17] [INFO ] After 1283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 50 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 194/194 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 234 transition count 192
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 230 transition count 192
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 229 transition count 191
Applied a total of 8 rules in 15 ms. Remains 229 /234 variables (removed 5) and now considering 191/194 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 229/234 places, 191/194 transitions.
Incomplete random walk after 10000 steps, including 364 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1011336 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :{}
Probabilistic random walk after 1011336 steps, saw 151540 distinct states, run finished after 3004 ms. (steps per millisecond=336 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 191 rows 229 cols
[2024-05-25 15:32:21] [INFO ] Computed 79 invariants in 9 ms
[2024-05-25 15:32:21] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:32:21] [INFO ] [Nat]Absence check using 52 positive place invariants in 8 ms returned sat
[2024-05-25 15:32:21] [INFO ] [Nat]Absence check using 52 positive and 27 generalized place invariants in 6 ms returned sat
[2024-05-25 15:32:21] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:32:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:32:21] [INFO ] After 95ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 15:32:21] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-25 15:32:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-25 15:32:21] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2024-05-25 15:32:21] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2024-05-25 15:32:22] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:32:22] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-05-25 15:32:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 362 ms
[2024-05-25 15:32:22] [INFO ] After 693ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 107 ms.
[2024-05-25 15:32:22] [INFO ] After 1005ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 50 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 191/191 transitions.
Applied a total of 0 rules in 14 ms. Remains 229 /229 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 229/229 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 191/191 transitions.
Applied a total of 0 rules in 13 ms. Remains 229 /229 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-25 15:32:22] [INFO ] Invariant cache hit.
[2024-05-25 15:32:22] [INFO ] Implicit Places using invariants in 159 ms returned [20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 71, 162, 184, 196]
Discarding 14 places :
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Implicit Place search using SMT only with invariants took 163 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/229 places, 188/191 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 209 transition count 164
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 209 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 208 transition count 169
Applied a total of 14 rules in 23 ms. Remains 208 /215 variables (removed 7) and now considering 169/188 (removed 19) transitions.
// Phase 1: matrix 169 rows 208 cols
[2024-05-25 15:32:22] [INFO ] Computed 68 invariants in 3 ms
[2024-05-25 15:32:22] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-25 15:32:22] [INFO ] Invariant cache hit.
[2024-05-25 15:32:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:32:22] [INFO ] Implicit Places using invariants and state equation in 192 ms returned [137]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 309 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/229 places, 169/191 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 168
Applied a total of 2 rules in 17 ms. Remains 206 /207 variables (removed 1) and now considering 168/169 (removed 1) transitions.
// Phase 1: matrix 168 rows 206 cols
[2024-05-25 15:32:22] [INFO ] Computed 67 invariants in 2 ms
[2024-05-25 15:32:22] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-25 15:32:22] [INFO ] Invariant cache hit.
[2024-05-25 15:32:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:32:23] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 206/229 places, 168/191 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 883 ms. Remains : 206/229 places, 168/191 transitions.
Incomplete random walk after 10000 steps, including 384 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 89 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 751381 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :{}
Probabilistic random walk after 751381 steps, saw 120206 distinct states, run finished after 3001 ms. (steps per millisecond=250 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 15:32:26] [INFO ] Invariant cache hit.
[2024-05-25 15:32:26] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:32:26] [INFO ] [Nat]Absence check using 51 positive place invariants in 14 ms returned sat
[2024-05-25 15:32:26] [INFO ] [Nat]Absence check using 51 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-25 15:32:26] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:32:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:32:26] [INFO ] After 95ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 15:32:26] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 0 ms to minimize.
[2024-05-25 15:32:26] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-25 15:32:27] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:32:27] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 0 ms to minimize.
[2024-05-25 15:32:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 324 ms
[2024-05-25 15:32:27] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-25 15:32:27] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-25 15:32:27] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:32:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 168 ms
[2024-05-25 15:32:27] [INFO ] After 706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 115 ms.
[2024-05-25 15:32:27] [INFO ] After 1045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 50 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 168/168 transitions.
Applied a total of 0 rules in 9 ms. Remains 206 /206 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 206/206 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 168/168 transitions.
Applied a total of 0 rules in 9 ms. Remains 206 /206 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-25 15:32:27] [INFO ] Invariant cache hit.
[2024-05-25 15:32:27] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-25 15:32:27] [INFO ] Invariant cache hit.
[2024-05-25 15:32:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:32:27] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-05-25 15:32:27] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-25 15:32:27] [INFO ] Invariant cache hit.
[2024-05-25 15:32:27] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 484 ms. Remains : 206/206 places, 168/168 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 206 transition count 168
Applied a total of 1 rules in 12 ms. Remains 206 /206 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 168 rows 206 cols
[2024-05-25 15:32:28] [INFO ] Computed 67 invariants in 2 ms
[2024-05-25 15:32:28] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:32:28] [INFO ] [Nat]Absence check using 51 positive place invariants in 8 ms returned sat
[2024-05-25 15:32:28] [INFO ] [Nat]Absence check using 51 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-25 15:32:28] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:32:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:32:28] [INFO ] After 85ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 15:32:28] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2024-05-25 15:32:28] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
[2024-05-25 15:32:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2024-05-25 15:32:28] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 0 ms to minimize.
[2024-05-25 15:32:28] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2024-05-25 15:32:28] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-25 15:32:28] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-05-25 15:32:28] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 2 ms to minimize.
[2024-05-25 15:32:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 252 ms
[2024-05-25 15:32:28] [INFO ] After 502ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-05-25 15:32:28] [INFO ] After 827ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-25 15:32:28] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2024-05-25 15:32:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 206 places, 168 transitions and 748 arcs took 2 ms.
[2024-05-25 15:32:29] [INFO ] Flatten gal took : 56 ms
Total runtime 41146 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-12
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
ReachabilityCardinality

FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-2024-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716651149450

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 10 (type EXCL) for 0 BusinessProcesses-PT-12-ReachabilityCardinality-2024-09
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 0 BusinessProcesses-PT-12-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 0 BusinessProcesses-PT-12-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 9 (type SRCH) for 0 BusinessProcesses-PT-12-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 10 (type EXCL) for BusinessProcesses-PT-12-ReachabilityCardinality-2024-09
lola: result : true
lola: markings : 2957
lola: fired transitions : 3180
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 9 (type SRCH) for BusinessProcesses-PT-12-ReachabilityCardinality-2024-09
lola: result : true
lola: markings : 627
lola: fired transitions : 870
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 6 (type FNDP) for BusinessProcesses-PT-12-ReachabilityCardinality-2024-09 (obsolete)
lola: CANCELED task # 7 (type EQUN) for BusinessProcesses-PT-12-ReachabilityCardinality-2024-09 (obsolete)
lola: LAUNCH task # 16 (type EXCL) for 3 BusinessProcesses-PT-12-ReachabilityCardinality-2024-15
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 3 BusinessProcesses-PT-12-ReachabilityCardinality-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 3 BusinessProcesses-PT-12-ReachabilityCardinality-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SRCH) for 3 BusinessProcesses-PT-12-ReachabilityCardinality-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 6 (type FNDP) for BusinessProcesses-PT-12-ReachabilityCardinality-2024-09
lola: result : unknown
lola: fired transitions : 2207
lola: tried executions : 129
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 12 (type FNDP) for BusinessProcesses-PT-12-ReachabilityCardinality-2024-15
lola: result : true
lola: fired transitions : 61
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 13 (type EQUN) for BusinessProcesses-PT-12-ReachabilityCardinality-2024-15 (obsolete)
lola: CANCELED task # 15 (type SRCH) for BusinessProcesses-PT-12-ReachabilityCardinality-2024-15 (obsolete)
lola: CANCELED task # 16 (type EXCL) for BusinessProcesses-PT-12-ReachabilityCardinality-2024-15 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-12-ReachabilityCardinality-2024-09: EF true tandem / insertion
BusinessProcesses-PT-12-ReachabilityCardinality-2024-15: EF true findpath


Time elapsed: 0 secs. Pages in use: 2
lola: rewrite Frontend/Parser/formula_rewrite.k:711

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-12"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is BusinessProcesses-PT-12, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r065-tajo-171620414900339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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