About the Execution of ITS-Tools for BusinessProcesses-PT-17
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2531.775 | 231850.00 | 578847.00 | 487.00 | FTFFFFFFFFFFTFFF | 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/mcc2021-input.r026-tajo-162038143900453.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900453
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 161K May 5 16:51 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-17-00
FORMULA_NAME BusinessProcesses-PT-17-01
FORMULA_NAME BusinessProcesses-PT-17-02
FORMULA_NAME BusinessProcesses-PT-17-03
FORMULA_NAME BusinessProcesses-PT-17-04
FORMULA_NAME BusinessProcesses-PT-17-05
FORMULA_NAME BusinessProcesses-PT-17-06
FORMULA_NAME BusinessProcesses-PT-17-07
FORMULA_NAME BusinessProcesses-PT-17-08
FORMULA_NAME BusinessProcesses-PT-17-09
FORMULA_NAME BusinessProcesses-PT-17-10
FORMULA_NAME BusinessProcesses-PT-17-11
FORMULA_NAME BusinessProcesses-PT-17-12
FORMULA_NAME BusinessProcesses-PT-17-13
FORMULA_NAME BusinessProcesses-PT-17-14
FORMULA_NAME BusinessProcesses-PT-17-15
=== Now, execution of the tool begins
BK_START 1620548293961
Running Version 0
[2021-05-09 08:18:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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]
[2021-05-09 08:18:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:18:15] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2021-05-09 08:18:15] [INFO ] Transformed 650 places.
[2021-05-09 08:18:15] [INFO ] Transformed 580 transitions.
[2021-05-09 08:18:15] [INFO ] Found NUPN structural information;
[2021-05-09 08:18:15] [INFO ] Parsed PT model containing 650 places and 580 transitions in 123 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 08:18:15] [INFO ] Initial state test concluded for 1 properties.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 646 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 643 transition count 576
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 93 place count 553 transition count 486
Iterating global reduction 1 with 90 rules applied. Total rules applied 183 place count 553 transition count 486
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 226 place count 510 transition count 443
Iterating global reduction 1 with 43 rules applied. Total rules applied 269 place count 510 transition count 443
Applied a total of 269 rules in 113 ms. Remains 510 /646 variables (removed 136) and now considering 443/576 (removed 133) transitions.
// Phase 1: matrix 443 rows 510 cols
[2021-05-09 08:18:16] [INFO ] Computed 105 place invariants in 30 ms
[2021-05-09 08:18:16] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 443 rows 510 cols
[2021-05-09 08:18:16] [INFO ] Computed 105 place invariants in 6 ms
[2021-05-09 08:18:16] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
// Phase 1: matrix 443 rows 510 cols
[2021-05-09 08:18:16] [INFO ] Computed 105 place invariants in 17 ms
[2021-05-09 08:18:17] [INFO ] Dead Transitions using invariants and state equation in 252 ms returned []
Finished structural reductions, in 1 iterations. Remains : 510/646 places, 443/576 transitions.
[2021-05-09 08:18:17] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 08:18:17] [INFO ] Flatten gal took : 62 ms
FORMULA BusinessProcesses-PT-17-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 08:18:17] [INFO ] Flatten gal took : 27 ms
[2021-05-09 08:18:17] [INFO ] Input system was already deterministic with 443 transitions.
Incomplete random walk after 100000 steps, including 652 resets, run finished after 287 ms. (steps per millisecond=348 ) properties (out of 30) seen :20
Running SMT prover for 10 properties.
// Phase 1: matrix 443 rows 510 cols
[2021-05-09 08:18:17] [INFO ] Computed 105 place invariants in 7 ms
[2021-05-09 08:18:17] [INFO ] [Real]Absence check using 59 positive place invariants in 13 ms returned sat
[2021-05-09 08:18:17] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 8 ms returned sat
[2021-05-09 08:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:17] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2021-05-09 08:18:18] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 3 ms to minimize.
[2021-05-09 08:18:18] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:18:18] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 1 ms to minimize.
[2021-05-09 08:18:18] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 1 ms to minimize.
[2021-05-09 08:18:18] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 0 ms to minimize.
[2021-05-09 08:18:18] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 0 ms to minimize.
[2021-05-09 08:18:18] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2021-05-09 08:18:18] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2021-05-09 08:18:19] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 5 ms to minimize.
[2021-05-09 08:18:19] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2021-05-09 08:18:19] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1123 ms
[2021-05-09 08:18:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:18:19] [INFO ] [Nat]Absence check using 59 positive place invariants in 21 ms returned sat
[2021-05-09 08:18:19] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 12 ms returned sat
[2021-05-09 08:18:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:19] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2021-05-09 08:18:19] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 0 ms to minimize.
[2021-05-09 08:18:19] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:18:19] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:18:19] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2021-05-09 08:18:20] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 1 ms to minimize.
[2021-05-09 08:18:20] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 0 ms to minimize.
[2021-05-09 08:18:20] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2021-05-09 08:18:20] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2021-05-09 08:18:20] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 0 ms to minimize.
[2021-05-09 08:18:20] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 0 ms to minimize.
[2021-05-09 08:18:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1187 ms
[2021-05-09 08:18:20] [INFO ] Computed and/alt/rep : 437/813/437 causal constraints (skipped 5 transitions) in 30 ms.
[2021-05-09 08:18:22] [INFO ] Added : 290 causal constraints over 58 iterations in 1736 ms. Result :sat
[2021-05-09 08:18:22] [INFO ] [Real]Absence check using 59 positive place invariants in 29 ms returned sat
[2021-05-09 08:18:22] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 15 ms returned sat
[2021-05-09 08:18:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:22] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2021-05-09 08:18:22] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 0 ms to minimize.
[2021-05-09 08:18:22] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:18:23] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 1 ms to minimize.
[2021-05-09 08:18:23] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 0 ms to minimize.
[2021-05-09 08:18:23] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 1 ms to minimize.
[2021-05-09 08:18:23] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 1 ms to minimize.
[2021-05-09 08:18:23] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 1 ms to minimize.
[2021-05-09 08:18:23] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:18:23] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 1 ms to minimize.
[2021-05-09 08:18:23] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 1 ms to minimize.
[2021-05-09 08:18:24] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 1 ms to minimize.
[2021-05-09 08:18:24] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 1 ms to minimize.
[2021-05-09 08:18:24] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 1 ms to minimize.
[2021-05-09 08:18:24] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2021-05-09 08:18:24] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 5 ms to minimize.
[2021-05-09 08:18:24] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2021-05-09 08:18:24] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 0 ms to minimize.
[2021-05-09 08:18:24] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 0 ms to minimize.
[2021-05-09 08:18:24] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2021-05-09 08:18:25] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 0 ms to minimize.
[2021-05-09 08:18:25] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 0 ms to minimize.
[2021-05-09 08:18:25] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2021-05-09 08:18:25] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 0 ms to minimize.
[2021-05-09 08:18:25] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2021-05-09 08:18:25] [INFO ] Deduced a trap composed of 40 places in 23 ms of which 1 ms to minimize.
[2021-05-09 08:18:25] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2889 ms
[2021-05-09 08:18:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:18:25] [INFO ] [Nat]Absence check using 59 positive place invariants in 19 ms returned sat
[2021-05-09 08:18:25] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 10 ms returned sat
[2021-05-09 08:18:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:25] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2021-05-09 08:18:25] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2021-05-09 08:18:26] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:18:26] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:18:26] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 0 ms to minimize.
[2021-05-09 08:18:26] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 0 ms to minimize.
[2021-05-09 08:18:26] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 1 ms to minimize.
[2021-05-09 08:18:26] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 1 ms to minimize.
[2021-05-09 08:18:26] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 0 ms to minimize.
[2021-05-09 08:18:26] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 0 ms to minimize.
[2021-05-09 08:18:26] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 0 ms to minimize.
[2021-05-09 08:18:27] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 8 ms to minimize.
[2021-05-09 08:18:27] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 0 ms to minimize.
[2021-05-09 08:18:27] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 0 ms to minimize.
[2021-05-09 08:18:27] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2021-05-09 08:18:27] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 0 ms to minimize.
[2021-05-09 08:18:27] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:18:27] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 0 ms to minimize.
[2021-05-09 08:18:28] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 0 ms to minimize.
[2021-05-09 08:18:28] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:18:28] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 1 ms to minimize.
[2021-05-09 08:18:28] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 0 ms to minimize.
[2021-05-09 08:18:28] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 0 ms to minimize.
[2021-05-09 08:18:28] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2021-05-09 08:18:28] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 0 ms to minimize.
[2021-05-09 08:18:28] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 0 ms to minimize.
[2021-05-09 08:18:28] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2021-05-09 08:18:28] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 1 ms to minimize.
[2021-05-09 08:18:28] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3167 ms
[2021-05-09 08:18:28] [INFO ] Computed and/alt/rep : 437/813/437 causal constraints (skipped 5 transitions) in 30 ms.
[2021-05-09 08:18:30] [INFO ] Added : 301 causal constraints over 61 iterations in 1657 ms. Result :sat
[2021-05-09 08:18:30] [INFO ] [Real]Absence check using 59 positive place invariants in 18 ms returned sat
[2021-05-09 08:18:30] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 11 ms returned sat
[2021-05-09 08:18:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:30] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2021-05-09 08:18:30] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2021-05-09 08:18:31] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2021-05-09 08:18:31] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2021-05-09 08:18:31] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:18:31] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
[2021-05-09 08:18:31] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2021-05-09 08:18:31] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2021-05-09 08:18:31] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 0 ms to minimize.
[2021-05-09 08:18:31] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2021-05-09 08:18:31] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2021-05-09 08:18:31] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 0 ms to minimize.
[2021-05-09 08:18:31] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2021-05-09 08:18:32] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2021-05-09 08:18:32] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 0 ms to minimize.
[2021-05-09 08:18:32] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1193 ms
[2021-05-09 08:18:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:18:32] [INFO ] [Nat]Absence check using 59 positive place invariants in 21 ms returned sat
[2021-05-09 08:18:32] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 11 ms returned sat
[2021-05-09 08:18:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:32] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2021-05-09 08:18:32] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2021-05-09 08:18:32] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2021-05-09 08:18:32] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2021-05-09 08:18:32] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2021-05-09 08:18:32] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 1 ms to minimize.
[2021-05-09 08:18:32] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2021-05-09 08:18:32] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2021-05-09 08:18:33] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 0 ms to minimize.
[2021-05-09 08:18:33] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2021-05-09 08:18:33] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2021-05-09 08:18:33] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2021-05-09 08:18:33] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2021-05-09 08:18:33] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2021-05-09 08:18:33] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2021-05-09 08:18:33] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1087 ms
[2021-05-09 08:18:33] [INFO ] Computed and/alt/rep : 437/813/437 causal constraints (skipped 5 transitions) in 21 ms.
[2021-05-09 08:18:34] [INFO ] Added : 273 causal constraints over 55 iterations in 1422 ms. Result :sat
[2021-05-09 08:18:34] [INFO ] [Real]Absence check using 59 positive place invariants in 14 ms returned sat
[2021-05-09 08:18:34] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 8 ms returned sat
[2021-05-09 08:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:35] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2021-05-09 08:18:35] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 0 ms to minimize.
[2021-05-09 08:18:35] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 1 ms to minimize.
[2021-05-09 08:18:35] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2021-05-09 08:18:35] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 1 ms to minimize.
[2021-05-09 08:18:35] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:18:35] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 1 ms to minimize.
[2021-05-09 08:18:36] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 0 ms to minimize.
[2021-05-09 08:18:36] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2021-05-09 08:18:36] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 0 ms to minimize.
[2021-05-09 08:18:36] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 0 ms to minimize.
[2021-05-09 08:18:36] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 0 ms to minimize.
[2021-05-09 08:18:36] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2021-05-09 08:18:36] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2021-05-09 08:18:36] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2021-05-09 08:18:36] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2021-05-09 08:18:36] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2021-05-09 08:18:36] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 0 ms to minimize.
[2021-05-09 08:18:37] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2021-05-09 08:18:37] [INFO ] Deduced a trap composed of 30 places in 16 ms of which 0 ms to minimize.
[2021-05-09 08:18:37] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2019 ms
[2021-05-09 08:18:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:18:37] [INFO ] [Nat]Absence check using 59 positive place invariants in 24 ms returned sat
[2021-05-09 08:18:37] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 13 ms returned sat
[2021-05-09 08:18:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:37] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2021-05-09 08:18:37] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 1 ms to minimize.
[2021-05-09 08:18:37] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 1 ms to minimize.
[2021-05-09 08:18:37] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2021-05-09 08:18:38] [INFO ] Deduced a trap composed of 88 places in 155 ms of which 1 ms to minimize.
[2021-05-09 08:18:38] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 1 ms to minimize.
[2021-05-09 08:18:38] [INFO ] Deduced a trap composed of 85 places in 149 ms of which 1 ms to minimize.
[2021-05-09 08:18:38] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 0 ms to minimize.
[2021-05-09 08:18:38] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 1 ms to minimize.
[2021-05-09 08:18:38] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 0 ms to minimize.
[2021-05-09 08:18:38] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:18:39] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2021-05-09 08:18:39] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2021-05-09 08:18:39] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2021-05-09 08:18:39] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2021-05-09 08:18:39] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 0 ms to minimize.
[2021-05-09 08:18:39] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 0 ms to minimize.
[2021-05-09 08:18:39] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2021-05-09 08:18:39] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2021-05-09 08:18:39] [INFO ] Deduced a trap composed of 30 places in 19 ms of which 0 ms to minimize.
[2021-05-09 08:18:39] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2351 ms
[2021-05-09 08:18:39] [INFO ] Computed and/alt/rep : 437/813/437 causal constraints (skipped 5 transitions) in 25 ms.
[2021-05-09 08:18:41] [INFO ] Added : 319 causal constraints over 64 iterations in 1843 ms. Result :sat
[2021-05-09 08:18:41] [INFO ] [Real]Absence check using 59 positive place invariants in 22 ms returned sat
[2021-05-09 08:18:41] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 13 ms returned sat
[2021-05-09 08:18:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:41] [INFO ] [Real]Absence check using state equation in 185 ms returned unsat
[2021-05-09 08:18:41] [INFO ] [Real]Absence check using 59 positive place invariants in 25 ms returned sat
[2021-05-09 08:18:42] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 14 ms returned sat
[2021-05-09 08:18:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:42] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2021-05-09 08:18:42] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:18:42] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 1 ms to minimize.
[2021-05-09 08:18:42] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 0 ms to minimize.
[2021-05-09 08:18:42] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:18:42] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:18:43] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:18:43] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 0 ms to minimize.
[2021-05-09 08:18:43] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:18:43] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:18:43] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2021-05-09 08:18:43] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 0 ms to minimize.
[2021-05-09 08:18:43] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 1 ms to minimize.
[2021-05-09 08:18:43] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2021-05-09 08:18:43] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2021-05-09 08:18:44] [INFO ] Deduced a trap composed of 35 places in 23 ms of which 0 ms to minimize.
[2021-05-09 08:18:44] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1852 ms
[2021-05-09 08:18:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:18:44] [INFO ] [Nat]Absence check using 59 positive place invariants in 20 ms returned sat
[2021-05-09 08:18:44] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 12 ms returned sat
[2021-05-09 08:18:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:44] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2021-05-09 08:18:44] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2021-05-09 08:18:44] [INFO ] Deduced a trap composed of 69 places in 145 ms of which 1 ms to minimize.
[2021-05-09 08:18:44] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:18:44] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 0 ms to minimize.
[2021-05-09 08:18:45] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 0 ms to minimize.
[2021-05-09 08:18:45] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 1 ms to minimize.
[2021-05-09 08:18:45] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:18:45] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 1 ms to minimize.
[2021-05-09 08:18:45] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 0 ms to minimize.
[2021-05-09 08:18:45] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 0 ms to minimize.
[2021-05-09 08:18:45] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:18:46] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 0 ms to minimize.
[2021-05-09 08:18:46] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 4 ms to minimize.
[2021-05-09 08:18:46] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2021-05-09 08:18:46] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2021-05-09 08:18:46] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1940 ms
[2021-05-09 08:18:46] [INFO ] Computed and/alt/rep : 437/813/437 causal constraints (skipped 5 transitions) in 42 ms.
[2021-05-09 08:18:48] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:18:48] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 1 ms to minimize.
[2021-05-09 08:18:48] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:18:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 592 ms
[2021-05-09 08:18:48] [INFO ] Added : 310 causal constraints over 62 iterations in 2479 ms. Result :sat
[2021-05-09 08:18:48] [INFO ] [Real]Absence check using 59 positive place invariants in 19 ms returned sat
[2021-05-09 08:18:48] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 12 ms returned sat
[2021-05-09 08:18:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:49] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2021-05-09 08:18:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:18:49] [INFO ] [Nat]Absence check using 59 positive place invariants in 22 ms returned sat
[2021-05-09 08:18:49] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 13 ms returned sat
[2021-05-09 08:18:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:49] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2021-05-09 08:18:49] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2021-05-09 08:18:49] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2021-05-09 08:18:49] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2021-05-09 08:18:49] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2021-05-09 08:18:49] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2021-05-09 08:18:49] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2021-05-09 08:18:49] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2021-05-09 08:18:49] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2021-05-09 08:18:49] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2021-05-09 08:18:50] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2021-05-09 08:18:50] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2021-05-09 08:18:50] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2021-05-09 08:18:50] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 0 ms to minimize.
[2021-05-09 08:18:50] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2021-05-09 08:18:50] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2021-05-09 08:18:50] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2021-05-09 08:18:50] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1212 ms
[2021-05-09 08:18:50] [INFO ] Computed and/alt/rep : 437/813/437 causal constraints (skipped 5 transitions) in 29 ms.
[2021-05-09 08:18:52] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:18:52] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 0 ms to minimize.
[2021-05-09 08:18:52] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:18:52] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:18:53] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:18:53] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 1 ms to minimize.
[2021-05-09 08:18:53] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 1 ms to minimize.
[2021-05-09 08:18:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1166 ms
[2021-05-09 08:18:53] [INFO ] Added : 306 causal constraints over 62 iterations in 2944 ms. Result :sat
[2021-05-09 08:18:53] [INFO ] [Real]Absence check using 59 positive place invariants in 22 ms returned sat
[2021-05-09 08:18:53] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 12 ms returned sat
[2021-05-09 08:18:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:53] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2021-05-09 08:18:53] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 0 ms to minimize.
[2021-05-09 08:18:53] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2021-05-09 08:18:54] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:18:54] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:18:54] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 1 ms to minimize.
[2021-05-09 08:18:54] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:18:54] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 1 ms to minimize.
[2021-05-09 08:18:54] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 0 ms to minimize.
[2021-05-09 08:18:54] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 0 ms to minimize.
[2021-05-09 08:18:55] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 1 ms to minimize.
[2021-05-09 08:18:55] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 1 ms to minimize.
[2021-05-09 08:18:55] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2021-05-09 08:18:55] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 0 ms to minimize.
[2021-05-09 08:18:55] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 0 ms to minimize.
[2021-05-09 08:18:55] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 0 ms to minimize.
[2021-05-09 08:18:55] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:18:55] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 1 ms to minimize.
[2021-05-09 08:18:56] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:18:56] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 1 ms to minimize.
[2021-05-09 08:18:56] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2021-05-09 08:18:56] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
[2021-05-09 08:18:56] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2530 ms
[2021-05-09 08:18:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:18:56] [INFO ] [Nat]Absence check using 59 positive place invariants in 13 ms returned sat
[2021-05-09 08:18:56] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 8 ms returned sat
[2021-05-09 08:18:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:56] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2021-05-09 08:18:56] [INFO ] Deduced a trap composed of 67 places in 145 ms of which 0 ms to minimize.
[2021-05-09 08:18:56] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 6 ms to minimize.
[2021-05-09 08:18:56] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:18:57] [INFO ] Deduced a trap composed of 71 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:18:57] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:18:57] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 1 ms to minimize.
[2021-05-09 08:18:57] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 0 ms to minimize.
[2021-05-09 08:18:57] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 1 ms to minimize.
[2021-05-09 08:18:57] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 0 ms to minimize.
[2021-05-09 08:18:57] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:18:58] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:18:58] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:18:58] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 0 ms to minimize.
[2021-05-09 08:18:58] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 0 ms to minimize.
[2021-05-09 08:18:58] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:18:58] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:18:58] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:18:58] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2021-05-09 08:18:59] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 0 ms to minimize.
[2021-05-09 08:18:59] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 0 ms to minimize.
[2021-05-09 08:18:59] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 0 ms to minimize.
[2021-05-09 08:18:59] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2021-05-09 08:18:59] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2021-05-09 08:18:59] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2021-05-09 08:18:59] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2021-05-09 08:18:59] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2021-05-09 08:18:59] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2021-05-09 08:18:59] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2021-05-09 08:18:59] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2021-05-09 08:18:59] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2021-05-09 08:18:59] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 0 ms to minimize.
[2021-05-09 08:19:00] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2021-05-09 08:19:00] [INFO ] Deduced a trap composed of 34 places in 18 ms of which 0 ms to minimize.
[2021-05-09 08:19:00] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 3588 ms
[2021-05-09 08:19:00] [INFO ] Computed and/alt/rep : 437/813/437 causal constraints (skipped 5 transitions) in 33 ms.
[2021-05-09 08:19:01] [INFO ] Added : 315 causal constraints over 63 iterations in 1686 ms. Result :sat
[2021-05-09 08:19:01] [INFO ] [Real]Absence check using 59 positive place invariants in 14 ms returned sat
[2021-05-09 08:19:01] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 9 ms returned sat
[2021-05-09 08:19:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:01] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-09 08:19:02] [INFO ] Deduced a trap composed of 81 places in 159 ms of which 1 ms to minimize.
[2021-05-09 08:19:02] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:19:02] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:19:02] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:19:02] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 1 ms to minimize.
[2021-05-09 08:19:02] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 0 ms to minimize.
[2021-05-09 08:19:02] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 0 ms to minimize.
[2021-05-09 08:19:03] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:19:03] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:19:03] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 1 ms to minimize.
[2021-05-09 08:19:03] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 0 ms to minimize.
[2021-05-09 08:19:03] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:19:03] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 0 ms to minimize.
[2021-05-09 08:19:03] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2021-05-09 08:19:03] [INFO ] Deduced a trap composed of 34 places in 20 ms of which 0 ms to minimize.
[2021-05-09 08:19:03] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1816 ms
[2021-05-09 08:19:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:19:03] [INFO ] [Nat]Absence check using 59 positive place invariants in 19 ms returned sat
[2021-05-09 08:19:03] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 11 ms returned sat
[2021-05-09 08:19:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:04] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2021-05-09 08:19:04] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 1 ms to minimize.
[2021-05-09 08:19:04] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 0 ms to minimize.
[2021-05-09 08:19:04] [INFO ] Deduced a trap composed of 81 places in 144 ms of which 0 ms to minimize.
[2021-05-09 08:19:04] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2021-05-09 08:19:04] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:19:04] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:19:04] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 1 ms to minimize.
[2021-05-09 08:19:05] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 1 ms to minimize.
[2021-05-09 08:19:05] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 0 ms to minimize.
[2021-05-09 08:19:05] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 0 ms to minimize.
[2021-05-09 08:19:05] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 1 ms to minimize.
[2021-05-09 08:19:05] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2021-05-09 08:19:05] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 0 ms to minimize.
[2021-05-09 08:19:05] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 0 ms to minimize.
[2021-05-09 08:19:05] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 1 ms to minimize.
[2021-05-09 08:19:05] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2021-05-09 08:19:05] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2021-05-09 08:19:06] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1928 ms
[2021-05-09 08:19:06] [INFO ] Computed and/alt/rep : 437/813/437 causal constraints (skipped 5 transitions) in 22 ms.
[2021-05-09 08:19:07] [INFO ] Added : 301 causal constraints over 61 iterations in 1456 ms. Result :sat
[2021-05-09 08:19:07] [INFO ] [Real]Absence check using 59 positive place invariants in 14 ms returned sat
[2021-05-09 08:19:07] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 10 ms returned sat
[2021-05-09 08:19:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:07] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2021-05-09 08:19:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:19:07] [INFO ] [Nat]Absence check using 59 positive place invariants in 16 ms returned sat
[2021-05-09 08:19:07] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 9 ms returned sat
[2021-05-09 08:19:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:07] [INFO ] [Nat]Absence check using state equation in 131 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-17-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F((G(p0)&&X(F(p1))))&&X(X(G(p0)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 510 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 510/510 places, 443/443 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 503 transition count 436
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 503 transition count 436
Applied a total of 14 rules in 40 ms. Remains 503 /510 variables (removed 7) and now considering 436/443 (removed 7) transitions.
// Phase 1: matrix 436 rows 503 cols
[2021-05-09 08:19:08] [INFO ] Computed 105 place invariants in 4 ms
[2021-05-09 08:19:08] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 436 rows 503 cols
[2021-05-09 08:19:08] [INFO ] Computed 105 place invariants in 8 ms
[2021-05-09 08:19:08] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
// Phase 1: matrix 436 rows 503 cols
[2021-05-09 08:19:08] [INFO ] Computed 105 place invariants in 3 ms
[2021-05-09 08:19:08] [INFO ] Dead Transitions using invariants and state equation in 204 ms returned []
Finished structural reductions, in 1 iterations. Remains : 503/510 places, 436/443 transitions.
Stuttering acceptance computed with spot in 387 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-17-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 8}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 8}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=p0, acceptance={} source=8 dest: 2}, { cond=(NOT p0), acceptance={} source=8 dest: 7}]], initial=6, aps=[p0:(OR (NEQ s189 1) (NEQ s370 1) (NEQ s464 1)), p1:(NEQ s84 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18789 steps with 123 reset in 101 ms.
FORMULA BusinessProcesses-PT-17-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-00 finished in 1448 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(G((p1 U X(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 510 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 510/510 places, 443/443 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 503 transition count 436
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 503 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 502 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 502 transition count 435
Applied a total of 16 rules in 32 ms. Remains 502 /510 variables (removed 8) and now considering 435/443 (removed 8) transitions.
// Phase 1: matrix 435 rows 502 cols
[2021-05-09 08:19:09] [INFO ] Computed 105 place invariants in 6 ms
[2021-05-09 08:19:09] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 435 rows 502 cols
[2021-05-09 08:19:09] [INFO ] Computed 105 place invariants in 9 ms
[2021-05-09 08:19:10] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
// Phase 1: matrix 435 rows 502 cols
[2021-05-09 08:19:10] [INFO ] Computed 105 place invariants in 3 ms
[2021-05-09 08:19:10] [INFO ] Dead Transitions using invariants and state equation in 272 ms returned []
Finished structural reductions, in 1 iterations. Remains : 502/510 places, 435/443 transitions.
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-17-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(EQ s458 0), p1:(EQ s37 1), p2:(AND (EQ s145 1) (EQ s338 1) (EQ s401 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 612 ms.
Product exploration explored 100000 steps with 50000 reset in 470 ms.
Graph (complete) has 1138 edges and 502 vertex of which 501 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Knowledge obtained : [p0, (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 476 ms.
Product exploration explored 100000 steps with 50000 reset in 408 ms.
[2021-05-09 08:19:13] [INFO ] Flatten gal took : 27 ms
[2021-05-09 08:19:13] [INFO ] Flatten gal took : 43 ms
[2021-05-09 08:19:13] [INFO ] Time to serialize gal into /tmp/LTL568985706758956876.gal : 38 ms
[2021-05-09 08:19:13] [INFO ] Time to serialize properties into /tmp/LTL16833494273142944379.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL568985706758956876.gal, -t, CGAL, -LTL, /tmp/LTL16833494273142944379.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL568985706758956876.gal -t CGAL -LTL /tmp/LTL16833494273142944379.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(p598==0)")||(F(G(("(p38==1)")U(X("(((p168==1)&&(p386==1))&&(p467==1))"))))))))
Formula 0 simplified : !X("(p598==0)" | FG("(p38==1)" U X"(((p168==1)&&(p386==1))&&(p467==1))"))
Detected timeout of ITS tools.
[2021-05-09 08:19:28] [INFO ] Flatten gal took : 48 ms
[2021-05-09 08:19:28] [INFO ] Applying decomposition
[2021-05-09 08:19:28] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2855060381272636758.txt, -o, /tmp/graph2855060381272636758.bin, -w, /tmp/graph2855060381272636758.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2855060381272636758.bin, -l, -1, -v, -w, /tmp/graph2855060381272636758.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:19:28] [INFO ] Decomposing Gal with order
[2021-05-09 08:19:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:19:28] [INFO ] Removed a total of 270 redundant transitions.
[2021-05-09 08:19:28] [INFO ] Flatten gal took : 106 ms
[2021-05-09 08:19:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 20 ms.
[2021-05-09 08:19:28] [INFO ] Time to serialize gal into /tmp/LTL9751063254163381476.gal : 11 ms
[2021-05-09 08:19:28] [INFO ] Time to serialize properties into /tmp/LTL9430824951669464066.ltl : 13 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9751063254163381476.gal, -t, CGAL, -LTL, /tmp/LTL9430824951669464066.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9751063254163381476.gal -t CGAL -LTL /tmp/LTL9430824951669464066.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i1.i1.u163.p598==0)")||(F(G(("(i5.i0.u15.p38==1)")U(X("(((i7.i1.u57.p168==1)&&(i7.i2.u121.p386==1))&&(i15.u138.p467==1))"))))))))
Formula 0 simplified : !X("(i1.i1.u163.p598==0)" | FG("(i5.i0.u15.p38==1)" U X"(((i7.i1.u57.p168==1)&&(i7.i2.u121.p386==1))&&(i15.u138.p467==1))"))
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t174, t186, t275, t288, t423, t424, t425, t427, t428, t436, i0.i0.u88.t169, i0.i1.u86.t172, i0.i2.u84.t177, i0.i2.u132.t81, i0.i2.u135.t72, i0.i2.u136.t69, i1.t182, i1.i0.t178, i1.i0.u78.t189, i1.i0.u82.t181, i1.i0.u134.t75, i1.i1.u80.t185, i1.i1.u133.t78, i2.t194, i2.u74.t197, i2.u76.t193, i3.u29.t270, i3.u47.t246, i4.i0.t284, i4.i0.u21.t287, i4.i1.u19.t291, i4.i1.u20.t290, i5.i0.t297, i5.i0.u13.t305, i5.i0.u14.t304, i5.i0.u15.t299, i5.i0.u15.t300, i5.i0.u15.t301, i5.i1.u17.t296, i5.i1.u104.t166, i5.i1.u105.t163, i5.i1.u106.t160, i6.i0.t283, i6.i1.u27.t274, i7.i0.u55.t229, i7.i2.u53.t233, i7.i2.u120.t117, i7.i2.u121.t114, i8.i0.u60.t221, i8.i0.u62.t217, i8.i2.u122.t111, i8.i2.u123.t108, i8.i2.u124.t105, i8.i2.u125.t102, i9.i0.u64.t213, i9.i0.u66.t209, i9.i2.u126.t99, i9.i2.u127.t96, i10.i0.u72.t201, i10.i1.u128.t93, i10.i1.u129.t90, i10.i1.u130.t87, i10.i1.u131.t84, i11.i0.u49.t242, i11.i0.u51.t238, i11.i1.u118.t124, i11.i1.u119.t121, i12.u113.t139, i12.u116.t130, i12.u117.t127, i13.i0.u111.t145, i13.i0.u112.t142, i13.i1.u107.t157, i13.i1.u108.t154, i14.t3, i14.t2, i14.t0, i14.i0.t1, i14.i0.u31.t250, i14.i0.u31.t266, i14.i0.u109.t151, i14.i0.u114.t136, i14.i1.u115.t133, i15.t10, i15.u137.t65, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/309/89/434
Computing Next relation with stutter on 1312 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
806 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.11707,228012,1,0,357779,553,7065,924982,241,1365,788176
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-17-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-17-01 finished in 28524 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((((p0||G(p1)||F(p2)) U p3)&&F(p4)))], workingDir=/home/mcc/execution]
Support contains 5 out of 510 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 510/510 places, 443/443 transitions.
Graph (trivial) has 228 edges and 510 vertex of which 6 / 510 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 504 transition count 388
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 456 transition count 387
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 455 transition count 387
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 99 place count 455 transition count 278
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 337 place count 326 transition count 278
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 344 place count 319 transition count 271
Ensure Unique test removed 1 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 352 place count 318 transition count 271
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 614 place count 185 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 615 place count 184 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 616 place count 183 transition count 141
Applied a total of 616 rules in 79 ms. Remains 183 /510 variables (removed 327) and now considering 141/443 (removed 302) transitions.
// Phase 1: matrix 141 rows 183 cols
[2021-05-09 08:19:37] [INFO ] Computed 79 place invariants in 1 ms
[2021-05-09 08:19:38] [INFO ] Implicit Places using invariants in 106 ms returned [0, 1, 2, 3, 4, 9, 10, 33, 34, 35, 36, 43, 44, 45, 50, 51, 55, 56, 57, 58]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 108 ms to find 20 implicit places.
[2021-05-09 08:19:38] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 141 rows 163 cols
[2021-05-09 08:19:38] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-09 08:19:38] [INFO ] Dead Transitions using invariants and state equation in 235 ms returned []
Starting structural reductions, iteration 1 : 163/510 places, 141/443 transitions.
Applied a total of 0 rules in 5 ms. Remains 163 /163 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2021-05-09 08:19:38] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 141 rows 163 cols
[2021-05-09 08:19:38] [INFO ] Computed 59 place invariants in 2 ms
[2021-05-09 08:19:38] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Finished structural reductions, in 2 iterations. Remains : 163/510 places, 141/443 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p3) (NOT p4)), (NOT p2), (NOT p3), (NOT p4), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-17-02 automaton TGBA [mat=[[{ cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(NOT p4), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p4), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s74 1), p0:(EQ s48 1), p1:(EQ s37 1), p2:(EQ s3 1), p4:(EQ s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-02 finished in 806 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 510 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 510/510 places, 443/443 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 503 transition count 436
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 503 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 502 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 502 transition count 435
Applied a total of 16 rules in 30 ms. Remains 502 /510 variables (removed 8) and now considering 435/443 (removed 8) transitions.
// Phase 1: matrix 435 rows 502 cols
[2021-05-09 08:19:38] [INFO ] Computed 105 place invariants in 3 ms
[2021-05-09 08:19:38] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 435 rows 502 cols
[2021-05-09 08:19:38] [INFO ] Computed 105 place invariants in 7 ms
[2021-05-09 08:19:39] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
// Phase 1: matrix 435 rows 502 cols
[2021-05-09 08:19:39] [INFO ] Computed 105 place invariants in 6 ms
[2021-05-09 08:19:39] [INFO ] Dead Transitions using invariants and state equation in 179 ms returned []
Finished structural reductions, in 1 iterations. Remains : 502/510 places, 435/443 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-17-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s334 0), p1:(OR (AND (NEQ s72 0) (NEQ s312 0) (NEQ s463 0) (NEQ s334 0)) (NEQ s162 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 661 reset in 215 ms.
Product exploration explored 100000 steps with 655 reset in 269 ms.
Graph (complete) has 1136 edges and 502 vertex of which 501 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 654 reset in 250 ms.
Product exploration explored 100000 steps with 654 reset in 239 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Support contains 5 out of 502 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 502/502 places, 435/435 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 502 transition count 435
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 104 Pre rules applied. Total rules applied 50 place count 502 transition count 668
Deduced a syphon composed of 154 places in 1 ms
Iterating global reduction 1 with 104 rules applied. Total rules applied 154 place count 502 transition count 668
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 171 place count 485 transition count 607
Deduced a syphon composed of 137 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 188 place count 485 transition count 607
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 274 places in 0 ms
Iterating global reduction 1 with 137 rules applied. Total rules applied 325 place count 485 transition count 607
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 357 place count 453 transition count 575
Deduced a syphon composed of 242 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 389 place count 453 transition count 575
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 245 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 392 place count 453 transition count 589
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 393 place count 453 transition count 588
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 396 place count 450 transition count 582
Deduced a syphon composed of 242 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 399 place count 450 transition count 582
Deduced a syphon composed of 242 places in 1 ms
Applied a total of 399 rules in 150 ms. Remains 450 /502 variables (removed 52) and now considering 582/435 (removed -147) transitions.
[2021-05-09 08:19:41] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 582 rows 450 cols
[2021-05-09 08:19:41] [INFO ] Computed 105 place invariants in 8 ms
[2021-05-09 08:19:41] [INFO ] Dead Transitions using invariants and state equation in 321 ms returned []
Finished structural reductions, in 1 iterations. Remains : 450/502 places, 582/435 transitions.
Product exploration explored 100000 steps with 9128 reset in 675 ms.
Product exploration explored 100000 steps with 9142 reset in 566 ms.
[2021-05-09 08:19:42] [INFO ] Flatten gal took : 19 ms
[2021-05-09 08:19:42] [INFO ] Flatten gal took : 16 ms
[2021-05-09 08:19:42] [INFO ] Time to serialize gal into /tmp/LTL13769258485850299959.gal : 3 ms
[2021-05-09 08:19:42] [INFO ] Time to serialize properties into /tmp/LTL1490538484958905662.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13769258485850299959.gal, -t, CGAL, -LTL, /tmp/LTL1490538484958905662.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13769258485850299959.gal -t CGAL -LTL /tmp/LTL1490538484958905662.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(p382==0)")&&(G(F("(((((p86!=0)&&(p355!=0))&&(p611!=0))&&(p382!=0))||(p186!=1))"))))))
Formula 0 simplified : !X("(p382==0)" & GF"(((((p86!=0)&&(p355!=0))&&(p611!=0))&&(p382!=0))||(p186!=1))")
Detected timeout of ITS tools.
[2021-05-09 08:19:58] [INFO ] Flatten gal took : 29 ms
[2021-05-09 08:19:58] [INFO ] Applying decomposition
[2021-05-09 08:19:58] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10490065942612015582.txt, -o, /tmp/graph10490065942612015582.bin, -w, /tmp/graph10490065942612015582.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10490065942612015582.bin, -l, -1, -v, -w, /tmp/graph10490065942612015582.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:19:58] [INFO ] Decomposing Gal with order
[2021-05-09 08:19:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:19:58] [INFO ] Removed a total of 271 redundant transitions.
[2021-05-09 08:19:58] [INFO ] Flatten gal took : 62 ms
[2021-05-09 08:19:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 27 ms.
[2021-05-09 08:19:58] [INFO ] Time to serialize gal into /tmp/LTL17827011150787600067.gal : 18 ms
[2021-05-09 08:19:58] [INFO ] Time to serialize properties into /tmp/LTL14357446591700194589.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17827011150787600067.gal, -t, CGAL, -LTL, /tmp/LTL14357446591700194589.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17827011150787600067.gal -t CGAL -LTL /tmp/LTL14357446591700194589.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i15.i1.u119.p382==0)")&&(G(F("(((((i3.u29.p86!=0)&&(i14.i2.u113.p355!=0))&&(i17.u136.p611!=0))&&(i15.i1.u119.p382!=0))||(i10.i0.u62.p186!=1))"))))))
Formula 0 simplified : !X("(i15.i1.u119.p382==0)" & GF"(((((i3.u29.p86!=0)&&(i14.i2.u113.p355!=0))&&(i17.u136.p611!=0))&&(i15.i1.u119.p382!=0))||(i10.i0.u62.p186!=1))")
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t174, t182, t284, t297, t423, t424, t425, t427, t428, t436, i0.t186, i0.u76.t193, i0.u78.t189, i1.i0.u64.t213, i1.i0.u66.t209, i2.i0.u47.t246, i2.i1.u49.t242, i2.i1.u51.t238, i3.u27.t274, i3.u29.t270, i4.t275, i4.i0.u21.t287, i4.i1.t283, i4.i2.u109.t145, i4.i2.u110.t142, i5.i0.u53.t233, i5.i0.u55.t229, i6.u121.t111, i6.u122.t108, i7.t178, i7.u80.t185, i7.u82.t181, i7.u132.t78, i8.i0.u88.t169, i8.i1.u84.t177, i8.i1.u86.t172, i8.i2.u133.t75, i8.i2.u134.t72, i8.i2.u135.t69, i9.i0.t194, i9.i0.u72.t201, i9.i0.u74.t197, i9.i1.u128.t90, i9.i1.u129.t87, i9.i1.u130.t84, i9.i1.u131.t81, i10.i0.u60.t221, i10.i0.u62.t217, i10.i1.u123.t105, i10.i1.u124.t102, i10.i1.u125.t99, i11.i0.u114.t130, i11.i1.u111.t139, i12.i0.u17.t296, i12.i0.u102.t166, i12.i0.u103.t163, i12.i0.u104.t160, i12.i0.u105.t157, i12.i1.u106.t154, i13.t288, i13.u15.t301, i13.u19.t291, i13.u20.t290, i14.t3, i14.t0, i14.i0.t1, i14.i0.t2, i14.i0.u31.t250, i14.i0.u31.t266, i14.i0.u107.t151, i14.i1.u112.t136, i14.i2.u113.t133, i15.i0.u115.t127, i15.i0.u116.t124, i15.i0.u117.t121, i15.i0.u120.t114, i15.i1.t118, i15.i1.u118.t119, i16.i0.u13.t305, i16.i0.u14.t304, i16.i1.u126.t96, i16.i1.u127.t93, i17.t10, i17.u136.t65, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/309/88/433
Computing Next relation with stutter on 1312 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15725067661584135704
[2021-05-09 08:20:13] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15725067661584135704
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15725067661584135704]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15725067661584135704] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15725067661584135704] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property BusinessProcesses-PT-17-03 finished in 35690 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 510 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 510/510 places, 443/443 transitions.
Graph (trivial) has 235 edges and 510 vertex of which 6 / 510 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 504 transition count 386
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 454 transition count 385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 103 place count 453 transition count 385
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 103 place count 453 transition count 275
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 343 place count 323 transition count 275
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 351 place count 315 transition count 267
Ensure Unique test removed 1 places
Iterating global reduction 3 with 9 rules applied. Total rules applied 360 place count 314 transition count 267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 360 place count 314 transition count 266
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 362 place count 313 transition count 266
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 626 place count 179 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 628 place count 178 transition count 140
Applied a total of 628 rules in 47 ms. Remains 178 /510 variables (removed 332) and now considering 140/443 (removed 303) transitions.
// Phase 1: matrix 140 rows 178 cols
[2021-05-09 08:20:14] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-09 08:20:14] [INFO ] Implicit Places using invariants in 146 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 43, 44, 45, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 148 ms to find 21 implicit places.
[2021-05-09 08:20:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 140 rows 157 cols
[2021-05-09 08:20:14] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-09 08:20:14] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Starting structural reductions, iteration 1 : 157/510 places, 140/443 transitions.
Applied a total of 0 rules in 6 ms. Remains 157 /157 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2021-05-09 08:20:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 140 rows 157 cols
[2021-05-09 08:20:14] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-09 08:20:14] [INFO ] Dead Transitions using invariants and state equation in 210 ms returned []
Finished structural reductions, in 2 iterations. Remains : 157/510 places, 140/443 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-17-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s62 1), p1:(NEQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 1 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-05 finished in 684 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 510 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 510/510 places, 443/443 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 502 transition count 435
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 502 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 501 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 501 transition count 434
Applied a total of 18 rules in 55 ms. Remains 501 /510 variables (removed 9) and now considering 434/443 (removed 9) transitions.
// Phase 1: matrix 434 rows 501 cols
[2021-05-09 08:20:15] [INFO ] Computed 105 place invariants in 3 ms
[2021-05-09 08:20:15] [INFO ] Implicit Places using invariants in 330 ms returned []
// Phase 1: matrix 434 rows 501 cols
[2021-05-09 08:20:15] [INFO ] Computed 105 place invariants in 4 ms
[2021-05-09 08:20:15] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
// Phase 1: matrix 434 rows 501 cols
[2021-05-09 08:20:16] [INFO ] Computed 105 place invariants in 3 ms
[2021-05-09 08:20:16] [INFO ] Dead Transitions using invariants and state equation in 292 ms returned []
Finished structural reductions, in 1 iterations. Remains : 501/510 places, 434/443 transitions.
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-17-06 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s478 0), p1:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-06 finished in 1296 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((p0 U p1)&&F(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 510 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 510/510 places, 443/443 transitions.
Graph (trivial) has 234 edges and 510 vertex of which 6 / 510 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 504 transition count 386
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 454 transition count 386
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 108 Pre rules applied. Total rules applied 101 place count 454 transition count 278
Deduced a syphon composed of 108 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 235 rules applied. Total rules applied 336 place count 327 transition count 278
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 343 place count 320 transition count 271
Iterating global reduction 2 with 7 rules applied. Total rules applied 350 place count 320 transition count 271
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 350 place count 320 transition count 270
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 352 place count 319 transition count 270
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 624 place count 181 transition count 136
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 2 with 2 rules applied. Total rules applied 626 place count 180 transition count 140
Applied a total of 626 rules in 71 ms. Remains 180 /510 variables (removed 330) and now considering 140/443 (removed 303) transitions.
// Phase 1: matrix 140 rows 180 cols
[2021-05-09 08:20:16] [INFO ] Computed 82 place invariants in 1 ms
[2021-05-09 08:20:16] [INFO ] Implicit Places using invariants in 125 ms returned [1, 4, 5, 6, 7, 10, 11, 34, 35, 36, 37, 44, 45, 46, 51, 55, 56, 57, 58, 59, 60, 61, 131, 148]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 127 ms to find 24 implicit places.
[2021-05-09 08:20:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 140 rows 156 cols
[2021-05-09 08:20:16] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-09 08:20:16] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 156/510 places, 140/443 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2021-05-09 08:20:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 140 rows 156 cols
[2021-05-09 08:20:16] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-09 08:20:16] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 2 iterations. Remains : 156/510 places, 140/443 transitions.
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-17-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s38 0), p2:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-07 finished in 413 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 510 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 510/510 places, 443/443 transitions.
Graph (trivial) has 236 edges and 510 vertex of which 6 / 510 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 504 transition count 385
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 453 transition count 385
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 103 place count 453 transition count 276
Deduced a syphon composed of 109 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 341 place count 324 transition count 276
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 349 place count 316 transition count 268
Ensure Unique test removed 1 places
Iterating global reduction 2 with 9 rules applied. Total rules applied 358 place count 315 transition count 268
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 358 place count 315 transition count 267
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 360 place count 314 transition count 267
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 270 rules applied. Total rules applied 630 place count 177 transition count 134
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 2 with 2 rules applied. Total rules applied 632 place count 176 transition count 138
Applied a total of 632 rules in 68 ms. Remains 176 /510 variables (removed 334) and now considering 138/443 (removed 305) transitions.
// Phase 1: matrix 138 rows 176 cols
[2021-05-09 08:20:16] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-09 08:20:17] [INFO ] Implicit Places using invariants in 328 ms returned [1, 2, 3, 4, 5, 8, 9, 33, 34, 35, 36, 43, 44, 45, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 330 ms to find 22 implicit places.
[2021-05-09 08:20:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 138 rows 154 cols
[2021-05-09 08:20:17] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-09 08:20:17] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Starting structural reductions, iteration 1 : 154/510 places, 138/443 transitions.
Applied a total of 0 rules in 10 ms. Remains 154 /154 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2021-05-09 08:20:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 138 rows 154 cols
[2021-05-09 08:20:17] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-09 08:20:17] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 2 iterations. Remains : 154/510 places, 138/443 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-09 finished in 599 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 510 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 510/510 places, 443/443 transitions.
Graph (trivial) has 236 edges and 510 vertex of which 6 / 510 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 504 transition count 385
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 453 transition count 385
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 103 place count 453 transition count 276
Deduced a syphon composed of 109 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 341 place count 324 transition count 276
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 349 place count 316 transition count 268
Ensure Unique test removed 1 places
Iterating global reduction 2 with 9 rules applied. Total rules applied 358 place count 315 transition count 268
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 358 place count 315 transition count 267
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 360 place count 314 transition count 267
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 270 rules applied. Total rules applied 630 place count 177 transition count 134
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 2 with 2 rules applied. Total rules applied 632 place count 176 transition count 138
Applied a total of 632 rules in 27 ms. Remains 176 /510 variables (removed 334) and now considering 138/443 (removed 305) transitions.
// Phase 1: matrix 138 rows 176 cols
[2021-05-09 08:20:17] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-09 08:20:17] [INFO ] Implicit Places using invariants in 124 ms returned [1, 2, 3, 4, 5, 8, 9, 33, 34, 35, 36, 43, 44, 45, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 125 ms to find 22 implicit places.
[2021-05-09 08:20:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 138 rows 154 cols
[2021-05-09 08:20:17] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-09 08:20:17] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Starting structural reductions, iteration 1 : 154/510 places, 138/443 transitions.
Applied a total of 0 rules in 7 ms. Remains 154 /154 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2021-05-09 08:20:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 138 rows 154 cols
[2021-05-09 08:20:17] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-09 08:20:17] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Finished structural reductions, in 2 iterations. Remains : 154/510 places, 138/443 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-10 finished in 418 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 510 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 510/510 places, 443/443 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 502 transition count 435
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 502 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 501 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 501 transition count 434
Applied a total of 18 rules in 22 ms. Remains 501 /510 variables (removed 9) and now considering 434/443 (removed 9) transitions.
// Phase 1: matrix 434 rows 501 cols
[2021-05-09 08:20:17] [INFO ] Computed 105 place invariants in 6 ms
[2021-05-09 08:20:17] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 434 rows 501 cols
[2021-05-09 08:20:17] [INFO ] Computed 105 place invariants in 3 ms
[2021-05-09 08:20:18] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
// Phase 1: matrix 434 rows 501 cols
[2021-05-09 08:20:18] [INFO ] Computed 105 place invariants in 3 ms
[2021-05-09 08:20:18] [INFO ] Dead Transitions using invariants and state equation in 175 ms returned []
Finished structural reductions, in 1 iterations. Remains : 501/510 places, 434/443 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s246 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1961 reset in 160 ms.
Stack based approach found an accepted trace after 324 steps with 6 reset with depth 10 and stack size 10 in 1 ms.
FORMULA BusinessProcesses-PT-17-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-11 finished in 1067 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 510 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 510/510 places, 443/443 transitions.
Graph (trivial) has 236 edges and 510 vertex of which 6 / 510 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 504 transition count 385
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 453 transition count 385
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 103 place count 453 transition count 275
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 343 place count 323 transition count 275
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 351 place count 315 transition count 267
Ensure Unique test removed 1 places
Iterating global reduction 2 with 9 rules applied. Total rules applied 360 place count 314 transition count 267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 360 place count 314 transition count 266
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 362 place count 313 transition count 266
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 628 place count 178 transition count 135
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 2 with 2 rules applied. Total rules applied 630 place count 177 transition count 139
Applied a total of 630 rules in 68 ms. Remains 177 /510 variables (removed 333) and now considering 139/443 (removed 304) transitions.
// Phase 1: matrix 139 rows 177 cols
[2021-05-09 08:20:18] [INFO ] Computed 80 place invariants in 2 ms
[2021-05-09 08:20:19] [INFO ] Implicit Places using invariants in 153 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 42, 43, 44, 49, 50, 51, 52, 53, 54, 55, 56]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 154 ms to find 22 implicit places.
[2021-05-09 08:20:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 139 rows 155 cols
[2021-05-09 08:20:19] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-09 08:20:19] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Starting structural reductions, iteration 1 : 155/510 places, 139/443 transitions.
Applied a total of 0 rules in 3 ms. Remains 155 /155 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2021-05-09 08:20:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 139 rows 155 cols
[2021-05-09 08:20:19] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-09 08:20:19] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 2 iterations. Remains : 155/510 places, 139/443 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s80 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-14 finished in 416 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 510 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 510/510 places, 443/443 transitions.
Graph (trivial) has 235 edges and 510 vertex of which 6 / 510 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 504 transition count 387
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 455 transition count 385
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 453 transition count 385
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 103 place count 453 transition count 275
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 343 place count 323 transition count 275
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 351 place count 315 transition count 267
Ensure Unique test removed 1 places
Iterating global reduction 3 with 9 rules applied. Total rules applied 360 place count 314 transition count 267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 360 place count 314 transition count 266
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 362 place count 313 transition count 266
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 628 place count 178 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 630 place count 177 transition count 139
Applied a total of 630 rules in 28 ms. Remains 177 /510 variables (removed 333) and now considering 139/443 (removed 304) transitions.
// Phase 1: matrix 139 rows 177 cols
[2021-05-09 08:20:19] [INFO ] Computed 80 place invariants in 2 ms
[2021-05-09 08:20:19] [INFO ] Implicit Places using invariants in 100 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 42, 43, 44, 49, 52, 53, 56, 57, 58]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 101 ms to find 20 implicit places.
[2021-05-09 08:20:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 139 rows 157 cols
[2021-05-09 08:20:19] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-09 08:20:19] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Starting structural reductions, iteration 1 : 157/510 places, 139/443 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2021-05-09 08:20:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 139 rows 157 cols
[2021-05-09 08:20:19] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-09 08:20:19] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Finished structural reductions, in 2 iterations. Remains : 157/510 places, 139/443 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-17-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s36 1), p1:(EQ s38 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 764 steps with 158 reset in 1 ms.
FORMULA BusinessProcesses-PT-17-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-15 finished in 344 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9749364575733829505
[2021-05-09 08:20:19] [INFO ] Computing symmetric may disable matrix : 443 transitions.
[2021-05-09 08:20:19] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:20:19] [INFO ] Computing symmetric may enable matrix : 443 transitions.
[2021-05-09 08:20:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:20:19] [INFO ] Applying decomposition
[2021-05-09 08:20:19] [INFO ] Flatten gal took : 36 ms
[2021-05-09 08:20:19] [INFO ] Computing Do-Not-Accords matrix : 443 transitions.
[2021-05-09 08:20:19] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:20:19] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9749364575733829505
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9749364575733829505]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5408463082550600998.txt, -o, /tmp/graph5408463082550600998.bin, -w, /tmp/graph5408463082550600998.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5408463082550600998.bin, -l, -1, -v, -w, /tmp/graph5408463082550600998.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:20:19] [INFO ] Decomposing Gal with order
[2021-05-09 08:20:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:20:19] [INFO ] Removed a total of 267 redundant transitions.
[2021-05-09 08:20:19] [INFO ] Flatten gal took : 27 ms
[2021-05-09 08:20:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-09 08:20:19] [INFO ] Time to serialize gal into /tmp/LTLFireability3645037690358594739.gal : 2 ms
[2021-05-09 08:20:19] [INFO ] Time to serialize properties into /tmp/LTLFireability15483572768936770043.ltl : 32 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability3645037690358594739.gal, -t, CGAL, -LTL, /tmp/LTLFireability15483572768936770043.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability3645037690358594739.gal -t CGAL -LTL /tmp/LTLFireability15483572768936770043.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i16.i1.i2.u125.p382==0)")&&(G(F(!("(((((i4.u32.p86==0)||(i14.u119.p355==0))||(i17.u166.p611==0))||(i16.i1.i2.u125.p382==0))&&(i2.u66.p186==1))")))))))
Formula 0 simplified : !X("(i16.i1.i2.u125.p382==0)" & GF!"(((((i4.u32.p86==0)||(i14.u119.p355==0))||(i17.u166.p611==0))||(i16.i1.i2.u125.p382==0))&&(i2.u66.p186==1))")
Compilation finished in 2541 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9749364575733829505]
Link finished in 57 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)&&[](<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9749364575733829505]
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t290, t400, t422, t560, t561, t564, t565, i0.u140.t156, i0.u141.t152, i0.u88.t293, i0.u92.t283, i0.u90.t286, i1.t312, i1.u76.t319, i1.u78.t315, i2.u66.t335, i2.u68.t331, i3.u51.t365, i3.u53.t361, i4.u30.t399, i4.u32.t395, i5.t418, i5.u22.t426, i5.u23.t425, i5.u24.t421, i6.t442, i6.t432, i6.t277, i6.u17.t438, i6.u18.t434, i6.u18.t436, i6.u18.t437, i6.u16.t440, i6.u20.t431, i6.u107.t279, i6.u108.t278, i6.u110.t272, i7.u70.t327, i8.t304, i8.t300, i8.t294, i8.u86.t299, i8.u82.t307, i8.u84.t303, i8.u136.t172, i8.u137.t168, i8.u138.t164, i8.u139.t160, i9.u80.t311, i10.u134.t180, i10.u135.t176, i10.u131.t192, i10.u132.t188, i10.u133.t184, i11.i0.i0.u59.t347, i11.i0.i0.u64.t339, i11.i1.i0.u129.t200, i11.i1.i0.u130.t196, i11.i1.i1.u127.t208, i11.i1.i1.u128.t204, i12.u115.t252, i12.u116.t248, i12.u111.t268, i12.u112.t264, i13.t412, i13.u26.t417, i13.u28.t410, i14.t391, i14.t3, i14.t2, i14.t1, i14.t0, i14.u34.t370, i14.u118.t240, i14.u37.t373, i14.u113.t260, i14.u119.t236, i15.u117.t244, i15.u120.t232, i15.u121.t228, i16.i0.i0.u55.t354, i16.i0.i0.u55.t356, i16.i0.i0.u55.t357, i16.i0.i1.u122.t224, i16.i0.i1.u123.t220, i16.i1.i0.u57.t351, i16.i1.i1.u126.t212, i16.i1.i2.t217, i16.i1.i2.u124.t218, i17.t10, i17.u166.t24, i17.u166.t146, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/311/96/443
Computing Next relation with stutter on 1312 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
4418 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,44.2334,619656,1,0,910832,669,7967,2.86786e+06,230,2259,1492696
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-17-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
BK_STOP 1620548525811
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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-17"
export BK_EXAMINATION="LTLFireability"
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-17, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-tajo-162038143900453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-17.tgz
mv BusinessProcesses-PT-17 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;