About the Execution of ITS-Tools for BusinessProcesses-PT-15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 546.760 | 49440.00 | 116244.00 | 378.30 | FTTTTFTFFTFFTTFT | normal |
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.r037-tajo-167813690500567.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 itstools
Input is BusinessProcesses-PT-15, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690500567
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:45 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.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Feb 25 16:47 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 157K 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-15-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1678363632573
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=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-15
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-09 12:07:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 12:07:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 12:07:14] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-09 12:07:14] [INFO ] Transformed 630 places.
[2023-03-09 12:07:14] [INFO ] Transformed 566 transitions.
[2023-03-09 12:07:14] [INFO ] Found NUPN structural information;
[2023-03-09 12:07:14] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 67 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 15) seen :7
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :1
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
[2023-03-09 12:07:15] [INFO ] Flatten gal took : 114 ms
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
[2023-03-09 12:07:15] [INFO ] Flatten gal took : 38 ms
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
[2023-03-09 12:07:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18015789660401138777.gal : 29 ms
[2023-03-09 12:07:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6992224566284920304.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18015789660401138777.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6992224566284920304.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6992224566284920304.prop.
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 7) seen :0
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 19
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :19 after 30
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :30 after 65
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :65 after 113
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :113 after 8179
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :1
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 562 rows 626 cols
[2023-03-09 12:07:15] [INFO ] Computed 102 place invariants in 56 ms
[2023-03-09 12:07:16] [INFO ] [Real]Absence check using 61 positive place invariants in 20 ms returned sat
[2023-03-09 12:07:16] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2023-03-09 12:07:16] [INFO ] After 708ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 12:07:16] [INFO ] [Nat]Absence check using 61 positive place invariants in 23 ms returned sat
[2023-03-09 12:07:16] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 17 ms returned sat
[2023-03-09 12:07:18] [INFO ] After 1177ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-09 12:07:18] [INFO ] Deduced a trap composed of 11 places in 345 ms of which 8 ms to minimize.
[2023-03-09 12:07:18] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 1 ms to minimize.
[2023-03-09 12:07:19] [INFO ] Deduced a trap composed of 21 places in 189 ms of which 2 ms to minimize.
[2023-03-09 12:07:19] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 7 ms to minimize.
[2023-03-09 12:07:19] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 1 ms to minimize.
[2023-03-09 12:07:19] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 0 ms to minimize.
[2023-03-09 12:07:19] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 2 ms to minimize.
[2023-03-09 12:07:20] [INFO ] Deduced a trap composed of 31 places in 251 ms of which 1 ms to minimize.
[2023-03-09 12:07:20] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 0 ms to minimize.
[2023-03-09 12:07:20] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2023-03-09 12:07:20] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2023-03-09 12:07:20] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2023-03-09 12:07:20] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2023-03-09 12:07:20] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 0 ms to minimize.
[2023-03-09 12:07:20] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 0 ms to minimize.
[2023-03-09 12:07:20] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 0 ms to minimize.
[2023-03-09 12:07:21] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2734 ms
[2023-03-09 12:07:21] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2023-03-09 12:07:21] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2023-03-09 12:07:21] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2023-03-09 12:07:21] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2023-03-09 12:07:21] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2023-03-09 12:07:21] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2023-03-09 12:07:21] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 0 ms to minimize.
[2023-03-09 12:07:21] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
[2023-03-09 12:07:21] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 0 ms to minimize.
[2023-03-09 12:07:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 781 ms
[2023-03-09 12:07:22] [INFO ] Deduced a trap composed of 157 places in 96 ms of which 1 ms to minimize.
[2023-03-09 12:07:22] [INFO ] Deduced a trap composed of 146 places in 91 ms of which 0 ms to minimize.
[2023-03-09 12:07:22] [INFO ] Deduced a trap composed of 130 places in 93 ms of which 1 ms to minimize.
[2023-03-09 12:07:22] [INFO ] Deduced a trap composed of 143 places in 145 ms of which 0 ms to minimize.
[2023-03-09 12:07:22] [INFO ] Deduced a trap composed of 145 places in 101 ms of which 0 ms to minimize.
[2023-03-09 12:07:22] [INFO ] Deduced a trap composed of 145 places in 122 ms of which 0 ms to minimize.
[2023-03-09 12:07:22] [INFO ] Deduced a trap composed of 142 places in 98 ms of which 0 ms to minimize.
[2023-03-09 12:07:22] [INFO ] Deduced a trap composed of 144 places in 109 ms of which 1 ms to minimize.
[2023-03-09 12:07:23] [INFO ] Deduced a trap composed of 139 places in 106 ms of which 4 ms to minimize.
[2023-03-09 12:07:23] [INFO ] Deduced a trap composed of 143 places in 115 ms of which 0 ms to minimize.
[2023-03-09 12:07:23] [INFO ] Deduced a trap composed of 145 places in 149 ms of which 1 ms to minimize.
[2023-03-09 12:07:23] [INFO ] Deduced a trap composed of 147 places in 145 ms of which 0 ms to minimize.
[2023-03-09 12:07:23] [INFO ] Deduced a trap composed of 153 places in 112 ms of which 1 ms to minimize.
[2023-03-09 12:07:23] [INFO ] Deduced a trap composed of 153 places in 131 ms of which 1 ms to minimize.
[2023-03-09 12:07:23] [INFO ] Deduced a trap composed of 140 places in 131 ms of which 1 ms to minimize.
[2023-03-09 12:07:24] [INFO ] Deduced a trap composed of 145 places in 127 ms of which 1 ms to minimize.
[2023-03-09 12:07:24] [INFO ] Deduced a trap composed of 141 places in 156 ms of which 0 ms to minimize.
[2023-03-09 12:07:24] [INFO ] Deduced a trap composed of 138 places in 142 ms of which 1 ms to minimize.
[2023-03-09 12:07:24] [INFO ] Deduced a trap composed of 143 places in 159 ms of which 1 ms to minimize.
[2023-03-09 12:07:24] [INFO ] Deduced a trap composed of 146 places in 129 ms of which 1 ms to minimize.
[2023-03-09 12:07:25] [INFO ] Deduced a trap composed of 150 places in 126 ms of which 0 ms to minimize.
[2023-03-09 12:07:25] [INFO ] Deduced a trap composed of 149 places in 123 ms of which 0 ms to minimize.
[2023-03-09 12:07:25] [INFO ] Deduced a trap composed of 142 places in 126 ms of which 1 ms to minimize.
[2023-03-09 12:07:25] [INFO ] Deduced a trap composed of 141 places in 120 ms of which 1 ms to minimize.
[2023-03-09 12:07:25] [INFO ] Deduced a trap composed of 151 places in 136 ms of which 0 ms to minimize.
[2023-03-09 12:07:25] [INFO ] Deduced a trap composed of 134 places in 159 ms of which 2 ms to minimize.
[2023-03-09 12:07:26] [INFO ] Deduced a trap composed of 148 places in 159 ms of which 1 ms to minimize.
[2023-03-09 12:07:26] [INFO ] Deduced a trap composed of 150 places in 135 ms of which 1 ms to minimize.
[2023-03-09 12:07:26] [INFO ] Deduced a trap composed of 150 places in 139 ms of which 1 ms to minimize.
[2023-03-09 12:07:26] [INFO ] Deduced a trap composed of 139 places in 146 ms of which 0 ms to minimize.
[2023-03-09 12:07:26] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 11 ms to minimize.
[2023-03-09 12:07:27] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 1 ms to minimize.
[2023-03-09 12:07:27] [INFO ] Deduced a trap composed of 128 places in 164 ms of which 1 ms to minimize.
[2023-03-09 12:07:27] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 1 ms to minimize.
[2023-03-09 12:07:27] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 1 ms to minimize.
[2023-03-09 12:07:27] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 1 ms to minimize.
[2023-03-09 12:07:28] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 1 ms to minimize.
[2023-03-09 12:07:28] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 1 ms to minimize.
[2023-03-09 12:07:28] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 1 ms to minimize.
[2023-03-09 12:07:28] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 1 ms to minimize.
[2023-03-09 12:07:28] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 10 ms to minimize.
[2023-03-09 12:07:29] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 1 ms to minimize.
[2023-03-09 12:07:29] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 8 ms to minimize.
[2023-03-09 12:07:29] [INFO ] Deduced a trap composed of 127 places in 143 ms of which 0 ms to minimize.
[2023-03-09 12:07:29] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 2 ms to minimize.
[2023-03-09 12:07:29] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 1 ms to minimize.
[2023-03-09 12:07:29] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 1 ms to minimize.
[2023-03-09 12:07:30] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 1 ms to minimize.
[2023-03-09 12:07:30] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 1 ms to minimize.
[2023-03-09 12:07:30] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 1 ms to minimize.
[2023-03-09 12:07:30] [INFO ] Deduced a trap composed of 130 places in 151 ms of which 1 ms to minimize.
[2023-03-09 12:07:30] [INFO ] Deduced a trap composed of 143 places in 166 ms of which 1 ms to minimize.
[2023-03-09 12:07:30] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 1 ms to minimize.
[2023-03-09 12:07:31] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 1 ms to minimize.
[2023-03-09 12:07:31] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 0 ms to minimize.
[2023-03-09 12:07:31] [INFO ] Deduced a trap composed of 130 places in 132 ms of which 0 ms to minimize.
[2023-03-09 12:07:31] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 0 ms to minimize.
[2023-03-09 12:07:31] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 1 ms to minimize.
[2023-03-09 12:07:31] [INFO ] Deduced a trap composed of 129 places in 127 ms of which 0 ms to minimize.
[2023-03-09 12:07:32] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 0 ms to minimize.
[2023-03-09 12:07:32] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 1 ms to minimize.
[2023-03-09 12:07:32] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 0 ms to minimize.
[2023-03-09 12:07:32] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 1 ms to minimize.
[2023-03-09 12:07:32] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 0 ms to minimize.
[2023-03-09 12:07:33] [INFO ] Deduced a trap composed of 136 places in 125 ms of which 0 ms to minimize.
[2023-03-09 12:07:33] [INFO ] Deduced a trap composed of 120 places in 122 ms of which 0 ms to minimize.
[2023-03-09 12:07:33] [INFO ] Deduced a trap composed of 122 places in 127 ms of which 1 ms to minimize.
[2023-03-09 12:07:33] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 0 ms to minimize.
[2023-03-09 12:07:33] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 0 ms to minimize.
[2023-03-09 12:07:33] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 1 ms to minimize.
[2023-03-09 12:07:33] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 0 ms to minimize.
[2023-03-09 12:07:34] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 1 ms to minimize.
[2023-03-09 12:07:34] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 0 ms to minimize.
[2023-03-09 12:07:34] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 1 ms to minimize.
[2023-03-09 12:07:34] [INFO ] Deduced a trap composed of 126 places in 130 ms of which 1 ms to minimize.
[2023-03-09 12:07:34] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 0 ms to minimize.
[2023-03-09 12:07:34] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 0 ms to minimize.
[2023-03-09 12:07:34] [INFO ] Deduced a trap composed of 125 places in 107 ms of which 1 ms to minimize.
[2023-03-09 12:07:35] [INFO ] Deduced a trap composed of 125 places in 145 ms of which 1 ms to minimize.
[2023-03-09 12:07:35] [INFO ] Deduced a trap composed of 130 places in 116 ms of which 1 ms to minimize.
[2023-03-09 12:07:35] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 0 ms to minimize.
[2023-03-09 12:07:35] [INFO ] Deduced a trap composed of 126 places in 128 ms of which 1 ms to minimize.
[2023-03-09 12:07:35] [INFO ] Deduced a trap composed of 148 places in 124 ms of which 0 ms to minimize.
[2023-03-09 12:07:35] [INFO ] Deduced a trap composed of 123 places in 154 ms of which 1 ms to minimize.
[2023-03-09 12:07:36] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 0 ms to minimize.
[2023-03-09 12:07:36] [INFO ] Deduced a trap composed of 122 places in 130 ms of which 1 ms to minimize.
[2023-03-09 12:07:36] [INFO ] Deduced a trap composed of 129 places in 154 ms of which 0 ms to minimize.
[2023-03-09 12:07:36] [INFO ] Deduced a trap composed of 139 places in 132 ms of which 0 ms to minimize.
[2023-03-09 12:07:36] [INFO ] Deduced a trap composed of 145 places in 159 ms of which 1 ms to minimize.
[2023-03-09 12:07:37] [INFO ] Deduced a trap composed of 124 places in 127 ms of which 1 ms to minimize.
[2023-03-09 12:07:37] [INFO ] Deduced a trap composed of 129 places in 159 ms of which 1 ms to minimize.
[2023-03-09 12:07:37] [INFO ] Deduced a trap composed of 121 places in 129 ms of which 1 ms to minimize.
[2023-03-09 12:07:37] [INFO ] Deduced a trap composed of 127 places in 153 ms of which 1 ms to minimize.
[2023-03-09 12:07:37] [INFO ] Deduced a trap composed of 142 places in 144 ms of which 0 ms to minimize.
[2023-03-09 12:07:37] [INFO ] Deduced a trap composed of 132 places in 115 ms of which 0 ms to minimize.
[2023-03-09 12:07:38] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 0 ms to minimize.
[2023-03-09 12:07:38] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 0 ms to minimize.
[2023-03-09 12:07:38] [INFO ] Deduced a trap composed of 123 places in 124 ms of which 1 ms to minimize.
[2023-03-09 12:07:38] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 1 ms to minimize.
[2023-03-09 12:07:38] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 1 ms to minimize.
[2023-03-09 12:07:38] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 0 ms to minimize.
[2023-03-09 12:07:39] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 0 ms to minimize.
[2023-03-09 12:07:39] [INFO ] Deduced a trap composed of 126 places in 145 ms of which 1 ms to minimize.
[2023-03-09 12:07:39] [INFO ] Deduced a trap composed of 117 places in 113 ms of which 1 ms to minimize.
[2023-03-09 12:07:39] [INFO ] Deduced a trap composed of 120 places in 110 ms of which 0 ms to minimize.
[2023-03-09 12:07:39] [INFO ] Deduced a trap composed of 119 places in 113 ms of which 1 ms to minimize.
[2023-03-09 12:07:39] [INFO ] Deduced a trap composed of 117 places in 143 ms of which 1 ms to minimize.
[2023-03-09 12:07:40] [INFO ] Deduced a trap composed of 118 places in 152 ms of which 1 ms to minimize.
[2023-03-09 12:07:40] [INFO ] Deduced a trap composed of 112 places in 122 ms of which 1 ms to minimize.
[2023-03-09 12:07:40] [INFO ] Deduced a trap composed of 130 places in 122 ms of which 0 ms to minimize.
[2023-03-09 12:07:40] [INFO ] Deduced a trap composed of 117 places in 121 ms of which 1 ms to minimize.
[2023-03-09 12:07:40] [INFO ] Deduced a trap composed of 118 places in 122 ms of which 0 ms to minimize.
[2023-03-09 12:07:40] [INFO ] Deduced a trap composed of 114 places in 124 ms of which 1 ms to minimize.
[2023-03-09 12:07:41] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 0 ms to minimize.
[2023-03-09 12:07:41] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 0 ms to minimize.
[2023-03-09 12:07:41] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 0 ms to minimize.
[2023-03-09 12:07:41] [INFO ] Trap strengthening (SAT) tested/added 116/116 trap constraints in 19720 ms
[2023-03-09 12:07:41] [INFO ] After 24686ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-09 12:07:41] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 37 ms.
Support contains 123 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 562/562 transitions.
Graph (complete) has 1275 edges and 626 vertex of which 622 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 622 transition count 500
Reduce places removed 61 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 74 rules applied. Total rules applied 136 place count 561 transition count 487
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 149 place count 548 transition count 487
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 149 place count 548 transition count 387
Deduced a syphon composed of 100 places in 2 ms
Ensure Unique test removed 11 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 211 rules applied. Total rules applied 360 place count 437 transition count 387
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 418 place count 379 transition count 329
Iterating global reduction 3 with 58 rules applied. Total rules applied 476 place count 379 transition count 329
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 476 place count 379 transition count 326
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 482 place count 376 transition count 326
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 604 place count 315 transition count 265
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 606 place count 315 transition count 263
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 608 place count 313 transition count 263
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 612 place count 313 transition count 263
Applied a total of 612 rules in 148 ms. Remains 313 /626 variables (removed 313) and now considering 263/562 (removed 299) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 313/626 places, 263/562 transitions.
Incomplete random walk after 10000 steps, including 173 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 829122 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 829122 steps, saw 119862 distinct states, run finished after 3004 ms. (steps per millisecond=276 ) properties seen :2
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 263 rows 313 cols
[2023-03-09 12:07:45] [INFO ] Computed 88 place invariants in 26 ms
[2023-03-09 12:07:45] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 12:07:45] [INFO ] [Nat]Absence check using 58 positive place invariants in 13 ms returned sat
[2023-03-09 12:07:45] [INFO ] [Nat]Absence check using 58 positive and 30 generalized place invariants in 8 ms returned sat
[2023-03-09 12:07:45] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 12:07:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 12:07:45] [INFO ] After 228ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 12:07:46] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 2 ms to minimize.
[2023-03-09 12:07:46] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2023-03-09 12:07:46] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2023-03-09 12:07:46] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2023-03-09 12:07:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 591 ms
[2023-03-09 12:07:46] [INFO ] After 974ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-09 12:07:46] [INFO ] After 1568ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 35 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 263/263 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 313 transition count 255
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 305 transition count 255
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 16 place count 305 transition count 224
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 6 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 84 place count 268 transition count 224
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 98 place count 254 transition count 210
Iterating global reduction 2 with 14 rules applied. Total rules applied 112 place count 254 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 112 place count 254 transition count 209
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 253 transition count 209
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 188 place count 215 transition count 173
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 189 place count 215 transition count 172
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 190 place count 215 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 191 place count 214 transition count 171
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 194 place count 214 transition count 171
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 195 place count 213 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 196 place count 212 transition count 170
Applied a total of 196 rules in 115 ms. Remains 212 /313 variables (removed 101) and now considering 170/263 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 212/313 places, 170/263 transitions.
Incomplete random walk after 10000 steps, including 377 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 79 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1427512 steps, run timeout after 3001 ms. (steps per millisecond=475 ) properties seen :{}
Probabilistic random walk after 1427512 steps, saw 239791 distinct states, run finished after 3002 ms. (steps per millisecond=475 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 170 rows 212 cols
[2023-03-09 12:07:50] [INFO ] Computed 79 place invariants in 17 ms
[2023-03-09 12:07:50] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 12:07:50] [INFO ] [Nat]Absence check using 57 positive place invariants in 6 ms returned sat
[2023-03-09 12:07:50] [INFO ] [Nat]Absence check using 57 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-09 12:07:50] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 12:07:50] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 12:07:50] [INFO ] After 60ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 12:07:50] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 0 ms to minimize.
[2023-03-09 12:07:50] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 0 ms to minimize.
[2023-03-09 12:07:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 225 ms
[2023-03-09 12:07:50] [INFO ] After 346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-09 12:07:50] [INFO ] After 570ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 35 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 170/170 transitions.
Applied a total of 0 rules in 9 ms. Remains 212 /212 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 212/212 places, 170/170 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 170/170 transitions.
Applied a total of 0 rules in 9 ms. Remains 212 /212 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2023-03-09 12:07:50] [INFO ] Invariant cache hit.
[2023-03-09 12:07:50] [INFO ] Implicit Places using invariants in 107 ms returned [23, 28, 30, 32, 34, 39, 41, 44, 58, 60, 63, 64, 72]
Discarding 13 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT only with invariants took 109 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 199/212 places, 169/170 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 194 transition count 155
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 194 transition count 155
Applied a total of 10 rules in 12 ms. Remains 194 /199 variables (removed 5) and now considering 155/169 (removed 14) transitions.
// Phase 1: matrix 155 rows 194 cols
[2023-03-09 12:07:50] [INFO ] Computed 67 place invariants in 1 ms
[2023-03-09 12:07:50] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-09 12:07:50] [INFO ] Invariant cache hit.
[2023-03-09 12:07:50] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 12:07:51] [INFO ] Implicit Places using invariants and state equation in 179 ms returned [10, 48, 50, 123, 129, 131]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 267 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 188/212 places, 155/170 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 188 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 187 transition count 154
Applied a total of 2 rules in 6 ms. Remains 187 /188 variables (removed 1) and now considering 154/155 (removed 1) transitions.
// Phase 1: matrix 154 rows 187 cols
[2023-03-09 12:07:51] [INFO ] Computed 61 place invariants in 3 ms
[2023-03-09 12:07:51] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-09 12:07:51] [INFO ] Invariant cache hit.
[2023-03-09 12:07:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 12:07:51] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 187/212 places, 154/170 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 663 ms. Remains : 187/212 places, 154/170 transitions.
Incomplete random walk after 10000 steps, including 397 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1735898 steps, run timeout after 3001 ms. (steps per millisecond=578 ) properties seen :{}
Probabilistic random walk after 1735898 steps, saw 284852 distinct states, run finished after 3001 ms. (steps per millisecond=578 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 12:07:54] [INFO ] Invariant cache hit.
[2023-03-09 12:07:54] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 12:07:54] [INFO ] [Nat]Absence check using 47 positive place invariants in 5 ms returned sat
[2023-03-09 12:07:54] [INFO ] [Nat]Absence check using 47 positive and 14 generalized place invariants in 2 ms returned sat
[2023-03-09 12:07:54] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 12:07:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 12:07:54] [INFO ] After 61ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 12:07:54] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 0 ms to minimize.
[2023-03-09 12:07:54] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2023-03-09 12:07:54] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2023-03-09 12:07:55] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 2 ms to minimize.
[2023-03-09 12:07:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 364 ms
[2023-03-09 12:07:55] [INFO ] After 478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-09 12:07:55] [INFO ] After 674ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 35 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 154/154 transitions.
Applied a total of 0 rules in 10 ms. Remains 187 /187 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 187/187 places, 154/154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 154/154 transitions.
Applied a total of 0 rules in 9 ms. Remains 187 /187 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2023-03-09 12:07:55] [INFO ] Invariant cache hit.
[2023-03-09 12:07:55] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-09 12:07:55] [INFO ] Invariant cache hit.
[2023-03-09 12:07:55] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 12:07:55] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-09 12:07:55] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-09 12:07:55] [INFO ] Invariant cache hit.
[2023-03-09 12:07:55] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 463 ms. Remains : 187/187 places, 154/154 transitions.
Graph (complete) has 582 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 186 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 153
Applied a total of 3 rules in 14 ms. Remains 185 /187 variables (removed 2) and now considering 153/154 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 185 cols
[2023-03-09 12:07:55] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-09 12:07:55] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 12:07:55] [INFO ] [Nat]Absence check using 46 positive place invariants in 7 ms returned sat
[2023-03-09 12:07:55] [INFO ] [Nat]Absence check using 46 positive and 14 generalized place invariants in 3 ms returned sat
[2023-03-09 12:07:55] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 12:07:55] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-09 12:07:56] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-09 12:07:56] [INFO ] Flatten gal took : 33 ms
[2023-03-09 12:07:56] [INFO ] Flatten gal took : 23 ms
[2023-03-09 12:07:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12745974426162057297.gal : 2 ms
[2023-03-09 12:07:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10217409971609093525.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12745974426162057297.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10217409971609093525.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10217409971609093525.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 11
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :12 after 21
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :21 after 123
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :123 after 518
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :518 after 3844
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3844 after 25532
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :491882 after 495165
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.25689e+06,3.13536,15644,2,6207,16,36778,7,0,939,39432,0
Total reachable state count : 2256890
Verifying 1 reachability properties.
Invariant property BusinessProcesses-PT-15-ReachabilityFireability-07 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-15-ReachabilityFireability-07,1152,3.14226,15644,2,404,16,36778,7,0,986,39432,0
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 12:07:59] [INFO ] Flatten gal took : 30 ms
[2023-03-09 12:07:59] [INFO ] Applying decomposition
[2023-03-09 12:07:59] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16810141398342395236.txt' '-o' '/tmp/graph16810141398342395236.bin' '-w' '/tmp/graph16810141398342395236.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16810141398342395236.bin' '-l' '-1' '-v' '-w' '/tmp/graph16810141398342395236.weights' '-q' '0' '-e' '0.001'
[2023-03-09 12:07:59] [INFO ] Decomposing Gal with order
[2023-03-09 12:07:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 12:07:59] [INFO ] Removed a total of 275 redundant transitions.
[2023-03-09 12:07:59] [INFO ] Flatten gal took : 92 ms
[2023-03-09 12:07:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 15 ms.
[2023-03-09 12:07:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12397673212388404980.gal : 9 ms
[2023-03-09 12:07:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1218545164961765924.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12397673212388404980.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1218545164961765924.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality1218545164961765924.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :12 after 1.28968e+11
Invariant property BusinessProcesses-PT-15-ReachabilityFireability-07 does not hold.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.13221e+20,1.45208,32248,4956,68,60059,943,1204,112191,76,2297,0
Total reachable state count : 313220877888851242304
Verifying 1 reachability properties.
Invariant property BusinessProcesses-PT-15-ReachabilityFireability-07 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-15-ReachabilityFireability-07,1.41712e+17,1.83525,32512,393,24,60059,943,1404,112191,93,2297,0
All properties solved without resorting to model-checking.
Total runtime 46999 ms.
BK_STOP 1678363682013
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-15"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-15, 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 r037-tajo-167813690500567"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-15.tgz
mv BusinessProcesses-PT-15 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 '
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 ;