About the Execution of ITS-Tools for BusinessProcesses-PT-16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 877.203 | 101440.00 | 145793.00 | 203.00 | FTFTFTTTFFFTTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918500447.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-16, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500447
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 5.9K Apr 29 23:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 29 23:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 23:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 29 23:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 29 23:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 29 23:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 29 23:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 29 23:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 159K May 10 09:33 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-16-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1654200824868
Running Version 202205111006
[2022-06-02 20:13:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 20:13:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:13:46] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2022-06-02 20:13:46] [INFO ] Transformed 638 places.
[2022-06-02 20:13:46] [INFO ] Transformed 578 transitions.
[2022-06-02 20:13:46] [INFO ] Found NUPN structural information;
[2022-06-02 20:13:46] [INFO ] Parsed PT model containing 638 places and 578 transitions in 259 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 8 places in 11 ms
Reduce places removed 8 places and 8 transitions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 596 ms. (steps per millisecond=16 ) properties (out of 16) seen :7
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 12 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 11 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 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 9 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 9) seen :1
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 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 13 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 570 rows 630 cols
[2022-06-02 20:13:47] [INFO ] Computed 100 place invariants in 33 ms
[2022-06-02 20:13:48] [INFO ] After 366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-02 20:13:48] [INFO ] [Nat]Absence check using 62 positive place invariants in 117 ms returned sat
[2022-06-02 20:13:48] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 18 ms returned sat
[2022-06-02 20:13:49] [INFO ] After 659ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2022-06-02 20:13:49] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 5 ms to minimize.
[2022-06-02 20:13:49] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2022-06-02 20:13:49] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 2 ms to minimize.
[2022-06-02 20:13:50] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2022-06-02 20:13:50] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 1 ms to minimize.
[2022-06-02 20:13:50] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 1 ms to minimize.
[2022-06-02 20:13:50] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 1 ms to minimize.
[2022-06-02 20:13:50] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 1 ms to minimize.
[2022-06-02 20:13:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1194 ms
[2022-06-02 20:13:50] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2022-06-02 20:13:51] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2022-06-02 20:13:51] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 1 ms to minimize.
[2022-06-02 20:13:51] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 0 ms to minimize.
[2022-06-02 20:13:51] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2022-06-02 20:13:51] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2022-06-02 20:13:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 815 ms
[2022-06-02 20:13:51] [INFO ] Deduced a trap composed of 126 places in 140 ms of which 1 ms to minimize.
[2022-06-02 20:13:52] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2022-06-02 20:13:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 301 ms
[2022-06-02 20:13:52] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 1 ms to minimize.
[2022-06-02 20:13:52] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 1 ms to minimize.
[2022-06-02 20:13:52] [INFO ] Deduced a trap composed of 133 places in 123 ms of which 1 ms to minimize.
[2022-06-02 20:13:52] [INFO ] Deduced a trap composed of 132 places in 122 ms of which 1 ms to minimize.
[2022-06-02 20:13:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 681 ms
[2022-06-02 20:13:52] [INFO ] After 4085ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 415 ms.
[2022-06-02 20:13:53] [INFO ] After 4973ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 5 different solutions.
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 1867 ms.
Support contains 66 out of 630 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 630/630 places, 570/570 transitions.
Graph (complete) has 1291 edges and 630 vertex of which 624 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 624 transition count 490
Reduce places removed 79 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 86 rules applied. Total rules applied 166 place count 545 transition count 483
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 173 place count 538 transition count 483
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 118 Pre rules applied. Total rules applied 173 place count 538 transition count 365
Deduced a syphon composed of 118 places in 2 ms
Ensure Unique test removed 12 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 421 place count 408 transition count 365
Discarding 76 places :
Symmetric choice reduction at 3 with 76 rule applications. Total rules 497 place count 332 transition count 289
Iterating global reduction 3 with 76 rules applied. Total rules applied 573 place count 332 transition count 289
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 573 place count 332 transition count 285
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 583 place count 326 transition count 285
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 745 place count 244 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 746 place count 244 transition count 204
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 4 with 2 rules applied. Total rules applied 748 place count 243 transition count 208
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 752 place count 243 transition count 208
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 753 place count 242 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 754 place count 241 transition count 207
Applied a total of 754 rules in 142 ms. Remains 241 /630 variables (removed 389) and now considering 207/570 (removed 363) transitions.
Finished structural reductions, in 1 iterations. Remains : 241/630 places, 207/570 transitions.
Incomplete random walk after 1000000 steps, including 35973 resets, run finished after 11862 ms. (steps per millisecond=84 ) properties (out of 3) seen :1
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4673 resets, run finished after 3137 ms. (steps per millisecond=318 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5045 resets, run finished after 2082 ms. (steps per millisecond=480 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 207 rows 241 cols
[2022-06-02 20:14:12] [INFO ] Computed 78 place invariants in 8 ms
[2022-06-02 20:14:12] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 20:14:12] [INFO ] [Nat]Absence check using 55 positive place invariants in 8 ms returned sat
[2022-06-02 20:14:12] [INFO ] [Nat]Absence check using 55 positive and 23 generalized place invariants in 6 ms returned sat
[2022-06-02 20:14:12] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 20:14:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-02 20:14:12] [INFO ] After 126ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 20:14:13] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2022-06-02 20:14:13] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 0 ms to minimize.
[2022-06-02 20:14:13] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2022-06-02 20:14:13] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2022-06-02 20:14:13] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2022-06-02 20:14:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 509 ms
[2022-06-02 20:14:13] [INFO ] After 792ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 122 ms.
[2022-06-02 20:14:13] [INFO ] After 1231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 170 ms.
Support contains 56 out of 241 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 241/241 places, 207/207 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 241 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 240 transition count 206
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 240 transition count 203
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 235 transition count 203
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 232 transition count 200
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 230 transition count 198
Applied a total of 18 rules in 27 ms. Remains 230 /241 variables (removed 11) and now considering 198/207 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 230/241 places, 198/207 transitions.
Incomplete random walk after 1000000 steps, including 39213 resets, run finished after 4056 ms. (steps per millisecond=246 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 5175 resets, run finished after 2377 ms. (steps per millisecond=420 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 198 rows 230 cols
[2022-06-02 20:14:20] [INFO ] Computed 76 place invariants in 11 ms
[2022-06-02 20:14:20] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:14:20] [INFO ] [Nat]Absence check using 56 positive place invariants in 7 ms returned sat
[2022-06-02 20:14:20] [INFO ] [Nat]Absence check using 56 positive and 20 generalized place invariants in 5 ms returned sat
[2022-06-02 20:14:20] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:14:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-02 20:14:20] [INFO ] After 75ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:14:20] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 0 ms to minimize.
[2022-06-02 20:14:20] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 0 ms to minimize.
[2022-06-02 20:14:21] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 1 ms to minimize.
[2022-06-02 20:14:21] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2022-06-02 20:14:21] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 0 ms to minimize.
[2022-06-02 20:14:21] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2022-06-02 20:14:21] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2022-06-02 20:14:21] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 4 ms to minimize.
[2022-06-02 20:14:21] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 0 ms to minimize.
[2022-06-02 20:14:21] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2022-06-02 20:14:21] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 0 ms to minimize.
[2022-06-02 20:14:21] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2022-06-02 20:14:21] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1100 ms
[2022-06-02 20:14:21] [INFO ] After 1259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 104 ms.
[2022-06-02 20:14:22] [INFO ] After 1563ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 49 out of 230 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 230/230 places, 198/198 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 230 transition count 195
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 227 transition count 195
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 226 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 226 transition count 194
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 224 transition count 192
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 223 transition count 191
Applied a total of 13 rules in 41 ms. Remains 223 /230 variables (removed 7) and now considering 191/198 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 223/230 places, 191/198 transitions.
Incomplete random walk after 1000000 steps, including 44420 resets, run finished after 2350 ms. (steps per millisecond=425 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6175 resets, run finished after 2595 ms. (steps per millisecond=385 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5043330 steps, run timeout after 12001 ms. (steps per millisecond=420 ) properties seen :{}
Probabilistic random walk after 5043330 steps, saw 763453 distinct states, run finished after 12002 ms. (steps per millisecond=420 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 191 rows 223 cols
[2022-06-02 20:14:39] [INFO ] Computed 76 place invariants in 4 ms
[2022-06-02 20:14:39] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:14:39] [INFO ] [Nat]Absence check using 54 positive place invariants in 8 ms returned sat
[2022-06-02 20:14:39] [INFO ] [Nat]Absence check using 54 positive and 22 generalized place invariants in 7 ms returned sat
[2022-06-02 20:14:39] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:14:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-02 20:14:39] [INFO ] After 91ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:14:39] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2022-06-02 20:14:39] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2022-06-02 20:14:39] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-06-02 20:14:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-06-02 20:14:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 213 ms
[2022-06-02 20:14:39] [INFO ] After 387ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2022-06-02 20:14:39] [INFO ] After 680ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 49 out of 223 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 223/223 places, 191/191 transitions.
Applied a total of 0 rules in 7 ms. Remains 223 /223 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 191/191 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 223/223 places, 191/191 transitions.
Applied a total of 0 rules in 8 ms. Remains 223 /223 variables (removed 0) and now considering 191/191 (removed 0) transitions.
// Phase 1: matrix 191 rows 223 cols
[2022-06-02 20:14:39] [INFO ] Computed 76 place invariants in 2 ms
[2022-06-02 20:14:39] [INFO ] Implicit Places using invariants in 146 ms returned [5, 27, 34, 37, 41, 42, 52, 54, 56, 58, 60, 65, 67, 69, 70, 73, 74, 195]
Discarding 18 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 150 ms to find 18 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 205/223 places, 189/191 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 202 transition count 180
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 202 transition count 180
Applied a total of 6 rules in 9 ms. Remains 202 /205 variables (removed 3) and now considering 180/189 (removed 9) transitions.
// Phase 1: matrix 180 rows 202 cols
[2022-06-02 20:14:39] [INFO ] Computed 60 place invariants in 1 ms
[2022-06-02 20:14:40] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 180 rows 202 cols
[2022-06-02 20:14:40] [INFO ] Computed 60 place invariants in 1 ms
[2022-06-02 20:14:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-02 20:14:40] [INFO ] Implicit Places using invariants and state equation in 235 ms returned [34, 37, 55, 68, 69, 70, 72, 74, 76, 81, 87, 89, 91, 99, 106, 107, 109, 111, 113, 115, 130, 132, 134, 136]
Discarding 24 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 412 ms to find 24 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 178/223 places, 179/191 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 178 transition count 173
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 172 transition count 173
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 168 transition count 163
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 168 transition count 163
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 168 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 167 transition count 162
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 30 place count 163 transition count 158
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 35 place count 163 transition count 158
Applied a total of 35 rules in 23 ms. Remains 163 /178 variables (removed 15) and now considering 158/179 (removed 21) transitions.
// Phase 1: matrix 158 rows 163 cols
[2022-06-02 20:14:40] [INFO ] Computed 39 place invariants in 3 ms
[2022-06-02 20:14:40] [INFO ] Implicit Places using invariants in 72 ms returned [28, 141]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 73 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 161/223 places, 158/191 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 160 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 160 transition count 157
Applied a total of 2 rules in 8 ms. Remains 160 /161 variables (removed 1) and now considering 157/158 (removed 1) transitions.
// Phase 1: matrix 157 rows 160 cols
[2022-06-02 20:14:40] [INFO ] Computed 37 place invariants in 2 ms
[2022-06-02 20:14:40] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 157 rows 160 cols
[2022-06-02 20:14:40] [INFO ] Computed 37 place invariants in 1 ms
[2022-06-02 20:14:40] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-06-02 20:14:40] [INFO ] Implicit Places using invariants and state equation in 189 ms returned [10, 11, 12, 14, 23, 26, 99]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 261 ms to find 7 implicit places.
Starting structural reductions in SAFETY mode, iteration 4 : 153/223 places, 157/191 transitions.
Applied a total of 0 rules in 11 ms. Remains 153 /153 variables (removed 0) and now considering 157/157 (removed 0) transitions.
Finished structural reductions, in 5 iterations. Remains : 153/223 places, 157/191 transitions.
Incomplete random walk after 1000000 steps, including 44719 resets, run finished after 1674 ms. (steps per millisecond=597 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6234 resets, run finished after 1870 ms. (steps per millisecond=534 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6292025 steps, run timeout after 9001 ms. (steps per millisecond=699 ) properties seen :{}
Probabilistic random walk after 6292025 steps, saw 921582 distinct states, run finished after 9001 ms. (steps per millisecond=699 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 157 rows 153 cols
[2022-06-02 20:14:53] [INFO ] Computed 30 place invariants in 4 ms
[2022-06-02 20:14:53] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:14:53] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2022-06-02 20:14:53] [INFO ] [Nat]Absence check using 21 positive and 9 generalized place invariants in 1 ms returned sat
[2022-06-02 20:14:53] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:14:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-02 20:14:53] [INFO ] After 56ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:14:53] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2022-06-02 20:14:53] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2022-06-02 20:14:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
[2022-06-02 20:14:53] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2022-06-02 20:14:53] [INFO ] After 382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 49 out of 153 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 153/153 places, 157/157 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 157/157 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 157/157 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 153/153 places, 157/157 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 157/157 (removed 0) transitions.
// Phase 1: matrix 157 rows 153 cols
[2022-06-02 20:14:53] [INFO ] Computed 30 place invariants in 0 ms
[2022-06-02 20:14:53] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 157 rows 153 cols
[2022-06-02 20:14:53] [INFO ] Computed 30 place invariants in 1 ms
[2022-06-02 20:14:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-02 20:14:53] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2022-06-02 20:14:54] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 157 rows 153 cols
[2022-06-02 20:14:54] [INFO ] Computed 30 place invariants in 2 ms
[2022-06-02 20:14:54] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 157/157 transitions.
Incomplete random walk after 1000000 steps, including 44757 resets, run finished after 1546 ms. (steps per millisecond=646 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6210 resets, run finished after 1840 ms. (steps per millisecond=543 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6247999 steps, run timeout after 9001 ms. (steps per millisecond=694 ) properties seen :{}
Probabilistic random walk after 6247999 steps, saw 915505 distinct states, run finished after 9001 ms. (steps per millisecond=694 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 157 rows 153 cols
[2022-06-02 20:15:06] [INFO ] Computed 30 place invariants in 11 ms
[2022-06-02 20:15:06] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:15:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2022-06-02 20:15:06] [INFO ] [Nat]Absence check using 21 positive and 9 generalized place invariants in 2 ms returned sat
[2022-06-02 20:15:06] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:15:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-02 20:15:06] [INFO ] After 49ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:15:06] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2022-06-02 20:15:06] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2022-06-02 20:15:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2022-06-02 20:15:06] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2022-06-02 20:15:07] [INFO ] After 443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 49 out of 153 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 153/153 places, 157/157 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 157/157 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 157/157 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 153/153 places, 157/157 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 157/157 (removed 0) transitions.
// Phase 1: matrix 157 rows 153 cols
[2022-06-02 20:15:07] [INFO ] Computed 30 place invariants in 1 ms
[2022-06-02 20:15:07] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 157 rows 153 cols
[2022-06-02 20:15:07] [INFO ] Computed 30 place invariants in 2 ms
[2022-06-02 20:15:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-02 20:15:07] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2022-06-02 20:15:07] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 157 rows 153 cols
[2022-06-02 20:15:07] [INFO ] Computed 30 place invariants in 6 ms
[2022-06-02 20:15:07] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 157/157 transitions.
Graph (complete) has 389 edges and 153 vertex of which 152 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 152 /153 variables (removed 1) and now considering 157/157 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 157 rows 152 cols
[2022-06-02 20:15:07] [INFO ] Computed 29 place invariants in 3 ms
[2022-06-02 20:15:07] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:15:07] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2022-06-02 20:15:07] [INFO ] [Nat]Absence check using 20 positive and 9 generalized place invariants in 2 ms returned sat
[2022-06-02 20:15:07] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:15:07] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2022-06-02 20:15:07] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 0 ms to minimize.
[2022-06-02 20:15:07] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2022-06-02 20:15:07] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 0 ms to minimize.
[2022-06-02 20:15:08] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2022-06-02 20:15:08] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 3 ms to minimize.
[2022-06-02 20:15:08] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2022-06-02 20:15:08] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2022-06-02 20:15:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 530 ms
[2022-06-02 20:15:08] [INFO ] After 698ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2022-06-02 20:15:08] [INFO ] After 803ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:15:08] [INFO ] Flatten gal took : 47 ms
[2022-06-02 20:15:08] [INFO ] Flatten gal took : 15 ms
[2022-06-02 20:15:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6350492019869309825.gal : 9 ms
[2022-06-02 20:15:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5194518496824975739.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6350492019869309825.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5194518496824975739.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality5194518496824975739.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 68
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :68 after 108
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :108 after 3240
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3240 after 3600
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3600 after 18720
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :18720 after 99972
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :99972 after 135840
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :135840 after 1.31011e+06
Detected timeout of ITS tools.
[2022-06-02 20:15:23] [INFO ] Flatten gal took : 25 ms
[2022-06-02 20:15:23] [INFO ] Applying decomposition
[2022-06-02 20:15:23] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1689053986685861050.txt' '-o' '/tmp/graph1689053986685861050.bin' '-w' '/tmp/graph1689053986685861050.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1689053986685861050.bin' '-l' '-1' '-v' '-w' '/tmp/graph1689053986685861050.weights' '-q' '0' '-e' '0.001'
[2022-06-02 20:15:23] [INFO ] Decomposing Gal with order
[2022-06-02 20:15:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 20:15:23] [INFO ] Removed a total of 60 redundant transitions.
[2022-06-02 20:15:23] [INFO ] Flatten gal took : 59 ms
[2022-06-02 20:15:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 7 ms.
[2022-06-02 20:15:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8490874346458785575.gal : 5 ms
[2022-06-02 20:15:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10986380899653959140.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8490874346458785575.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10986380899653959140.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality10986380899653959140.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 90
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :90 after 480
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :480 after 720
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :720 after 960
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :960 after 1440
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1440 after 2640
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2640 after 420768
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :420768 after 531936
Reachability property BusinessProcesses-PT-16-ReachabilityFireability-06 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 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.48252e+07,0.221126,10232,555,349,8737,7714,481,19527,184,22669,0
Total reachable state count : 34825152
Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-16-ReachabilityFireability-06 is true.
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-16-ReachabilityFireability-06,3072,0.235377,10496,68,82,8737,7714,723,19527,235,22669,0
[2022-06-02 20:15:24] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15694936155473378967
[2022-06-02 20:15:24] [INFO ] Applying decomposition
[2022-06-02 20:15:24] [INFO ] Flatten gal took : 16 ms
[2022-06-02 20:15:24] [INFO ] Computing symmetric may disable matrix : 157 transitions.
[2022-06-02 20:15:24] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 20:15:24] [INFO ] Computing symmetric may enable matrix : 157 transitions.
[2022-06-02 20:15:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 20:15:24] [INFO ] Flatten gal took : 23 ms
[2022-06-02 20:15:24] [INFO ] Computing Do-Not-Accords matrix : 157 transitions.
[2022-06-02 20:15:24] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 20:15:24] [INFO ] Input system was already deterministic with 157 transitions.
[2022-06-02 20:15:24] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15694936155473378967
Running compilation step : cd /tmp/ltsmin15694936155473378967;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18157114976676787816.txt' '-o' '/tmp/graph18157114976676787816.bin' '-w' '/tmp/graph18157114976676787816.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18157114976676787816.bin' '-l' '-1' '-v' '-w' '/tmp/graph18157114976676787816.weights' '-q' '0' '-e' '0.001'
[2022-06-02 20:15:24] [INFO ] Decomposing Gal with order
[2022-06-02 20:15:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 20:15:24] [INFO ] Removed a total of 53 redundant transitions.
[2022-06-02 20:15:24] [INFO ] Flatten gal took : 27 ms
[2022-06-02 20:15:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 3 ms.
[2022-06-02 20:15:24] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14992818557571381325.gal : 4 ms
[2022-06-02 20:15:24] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2830062927002379342.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability14992818557571381325.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2830062927002379342.prop' '--nowitness'
[2022-06-02 20:15:24] [INFO ] Ran tautology test, simplified 0 / 1 in 193 ms.
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityFireability2830062927002379342.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 30
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :30 after 600
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :600 after 720
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :720 after 960
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :960 after 1320
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1320 after 2220
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :218160 after 498960
[2022-06-02 20:15:24] [INFO ] BMC solution for property BusinessProcesses-PT-16-ReachabilityFireability-06(UNSAT) depth K=0 took 25 ms
[2022-06-02 20:15:24] [INFO ] BMC solution for property BusinessProcesses-PT-16-ReachabilityFireability-06(UNSAT) depth K=1 took 3 ms
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :498960 after 883440
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 157 rows 153 cols
[2022-06-02 20:15:24] [INFO ] Computed 30 place invariants in 1 ms
[2022-06-02 20:15:24] [INFO ] Computed 30 place invariants in 2 ms
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :883440 after 2.36674e+06
[2022-06-02 20:15:24] [INFO ] BMC solution for property BusinessProcesses-PT-16-ReachabilityFireability-06(UNSAT) depth K=2 took 276 ms
[2022-06-02 20:15:24] [INFO ] Proved 153 variables to be positive in 213 ms
Compilation finished in 534 ms.
Running link step : cd /tmp/ltsmin15694936155473378967;'gcc' '-shared' '-o' 'gal.so' 'model.o'
[2022-06-02 20:15:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBusinessProcesses-PT-16-ReachabilityFireability-06
[2022-06-02 20:15:24] [INFO ] KInduction solution for property BusinessProcesses-PT-16-ReachabilityFireability-06(SAT) depth K=0 took 12 ms
[2022-06-02 20:15:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBusinessProcesses-PT-16-ReachabilityFireability-06
[2022-06-02 20:15:24] [INFO ] KInduction solution for property BusinessProcesses-PT-16-ReachabilityFireability-06(SAT) depth K=1 took 49 ms
Link finished in 102 ms.
Running LTSmin : cd /tmp/ltsmin15694936155473378967;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BusinessProcessesPT16ReachabilityFireability06==true'
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.36674e+06 after 1.75198e+07
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,2.05553e+08,0.797852,19788,710,642,16020,13906,600,54596,233,70406,0
Total reachable state count : 205553088
Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-16-ReachabilityFireability-06 is true.
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
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-16-ReachabilityFireability-06,384,0.823785,20052,64,66,16020,13906,740,54596,265,70406,4419
[2022-06-02 20:15:26] [WARNING] Interrupting SMT solver.
[2022-06-02 20:15:26] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
[2022-06-02 20:15:26] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-02 20:15:26] [WARNING] Unexpected error occurred while running SMT. Was verifying BusinessProcesses-PT-16-ReachabilityFireability-06 SMT depth 3
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
[2022-06-02 20:15:26] [WARNING] Unexpected error occurred while running SMT. Was verifying BusinessProcesses-PT-16-ReachabilityFireability-06 K-induction depth 2
Exception in thread "Thread-11" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 2 more
[2022-06-02 20:15:26] [INFO ] During BMC, SMT solver timed out at depth 3
[2022-06-02 20:15:26] [INFO ] BMC solving timed out (3600000 secs) at depth 3
[2022-06-02 20:15:26] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 100139 ms.
BK_STOP 1654200926308
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-16"
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-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-16, 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 r024-tall-165251918500447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-16.tgz
mv BusinessProcesses-PT-16 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 ;