Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918500396.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 5.5K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 30 00:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 30 00:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 131K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652628710703

Running Version 202205111006
[2022-05-15 15:31:51] [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]
[2022-05-15 15:31:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:31:52] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2022-05-15 15:31:52] [INFO ] Transformed 518 places.
[2022-05-15 15:31:52] [INFO ] Transformed 471 transitions.
[2022-05-15 15:31:52] [INFO ] Found NUPN structural information;
[2022-05-15 15:31:52] [INFO ] Parsed PT model containing 518 places and 471 transitions in 212 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 471/471 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 471
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 69 place count 449 transition count 403
Iterating global reduction 1 with 68 rules applied. Total rules applied 137 place count 449 transition count 403
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 171 place count 415 transition count 369
Iterating global reduction 1 with 34 rules applied. Total rules applied 205 place count 415 transition count 369
Applied a total of 205 rules in 100 ms. Remains 415 /518 variables (removed 103) and now considering 369/471 (removed 102) transitions.
// Phase 1: matrix 369 rows 415 cols
[2022-05-15 15:31:52] [INFO ] Computed 84 place invariants in 26 ms
[2022-05-15 15:31:52] [INFO ] Implicit Places using invariants in 378 ms returned []
// Phase 1: matrix 369 rows 415 cols
[2022-05-15 15:31:52] [INFO ] Computed 84 place invariants in 36 ms
[2022-05-15 15:31:53] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
// Phase 1: matrix 369 rows 415 cols
[2022-05-15 15:31:53] [INFO ] Computed 84 place invariants in 8 ms
[2022-05-15 15:31:53] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 415/518 places, 369/471 transitions.
Finished structural reductions, in 1 iterations. Remains : 415/518 places, 369/471 transitions.
Support contains 39 out of 415 places after structural reductions.
[2022-05-15 15:31:53] [INFO ] Flatten gal took : 72 ms
[2022-05-15 15:31:54] [INFO ] Flatten gal took : 43 ms
[2022-05-15 15:31:54] [INFO ] Input system was already deterministic with 369 transitions.
Support contains 38 out of 415 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 82 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 33) seen :16
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 369 rows 415 cols
[2022-05-15 15:31:54] [INFO ] Computed 84 place invariants in 4 ms
[2022-05-15 15:31:55] [INFO ] [Real]Absence check using 45 positive place invariants in 17 ms returned sat
[2022-05-15 15:31:55] [INFO ] [Real]Absence check using 45 positive and 39 generalized place invariants in 13 ms returned sat
[2022-05-15 15:31:55] [INFO ] After 371ms SMT Verify possible using state equation in real domain returned unsat :4 sat :4 real:9
[2022-05-15 15:31:55] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 6 ms to minimize.
[2022-05-15 15:31:55] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 9 ms to minimize.
[2022-05-15 15:31:56] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2022-05-15 15:31:56] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 2 ms to minimize.
[2022-05-15 15:31:56] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2022-05-15 15:31:56] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 0 ms to minimize.
[2022-05-15 15:31:56] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
[2022-05-15 15:31:56] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2022-05-15 15:31:56] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 0 ms to minimize.
[2022-05-15 15:31:56] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2022-05-15 15:31:56] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 4 ms to minimize.
[2022-05-15 15:31:56] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 0 ms to minimize.
[2022-05-15 15:31:56] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 0 ms to minimize.
[2022-05-15 15:31:57] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 0 ms to minimize.
[2022-05-15 15:31:57] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2022-05-15 15:31:57] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 0 ms to minimize.
[2022-05-15 15:31:57] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2022-05-15 15:31:57] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2022-05-15 15:31:57] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 0 ms to minimize.
[2022-05-15 15:31:57] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 0 ms to minimize.
[2022-05-15 15:31:57] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 0 ms to minimize.
[2022-05-15 15:31:57] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2022-05-15 15:31:57] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 0 ms to minimize.
[2022-05-15 15:31:57] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2022-05-15 15:31:58] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2022-05-15 15:31:58] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 0 ms to minimize.
[2022-05-15 15:31:58] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 0 ms to minimize.
[2022-05-15 15:31:58] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2022-05-15 15:31:58] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 0 ms to minimize.
[2022-05-15 15:31:58] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 0 ms to minimize.
[2022-05-15 15:31:58] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 2825 ms
[2022-05-15 15:31:58] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 0 ms to minimize.
[2022-05-15 15:31:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2022-05-15 15:31:58] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2022-05-15 15:31:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2022-05-15 15:31:58] [INFO ] Deduced a trap composed of 114 places in 88 ms of which 0 ms to minimize.
[2022-05-15 15:31:58] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 1 ms to minimize.
[2022-05-15 15:31:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2022-05-15 15:31:59] [INFO ] After 3740ms SMT Verify possible using trap constraints in real domain returned unsat :4 sat :0 real:13
[2022-05-15 15:31:59] [INFO ] After 4125ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:13
[2022-05-15 15:31:59] [INFO ] [Nat]Absence check using 45 positive place invariants in 24 ms returned sat
[2022-05-15 15:31:59] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 11 ms returned sat
[2022-05-15 15:31:59] [INFO ] After 376ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :12
[2022-05-15 15:31:59] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 4 ms to minimize.
[2022-05-15 15:31:59] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2022-05-15 15:32:00] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 0 ms to minimize.
[2022-05-15 15:32:00] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2022-05-15 15:32:00] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 0 ms to minimize.
[2022-05-15 15:32:00] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 1 ms to minimize.
[2022-05-15 15:32:00] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 1 ms to minimize.
[2022-05-15 15:32:00] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
[2022-05-15 15:32:00] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 0 ms to minimize.
[2022-05-15 15:32:00] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2022-05-15 15:32:01] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 0 ms to minimize.
[2022-05-15 15:32:01] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 1 ms to minimize.
[2022-05-15 15:32:01] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 1 ms to minimize.
[2022-05-15 15:32:01] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2022-05-15 15:32:01] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 1 ms to minimize.
[2022-05-15 15:32:01] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 0 ms to minimize.
[2022-05-15 15:32:01] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 1 ms to minimize.
[2022-05-15 15:32:01] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2022-05-15 15:32:01] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 0 ms to minimize.
[2022-05-15 15:32:02] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 0 ms to minimize.
[2022-05-15 15:32:02] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 0 ms to minimize.
[2022-05-15 15:32:02] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 0 ms to minimize.
[2022-05-15 15:32:02] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 5 ms to minimize.
[2022-05-15 15:32:02] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 0 ms to minimize.
[2022-05-15 15:32:02] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 0 ms to minimize.
[2022-05-15 15:32:02] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 0 ms to minimize.
[2022-05-15 15:32:02] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 0 ms to minimize.
[2022-05-15 15:32:02] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 1 ms to minimize.
[2022-05-15 15:32:03] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 1 ms to minimize.
[2022-05-15 15:32:03] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 1 ms to minimize.
[2022-05-15 15:32:03] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 0 ms to minimize.
[2022-05-15 15:32:03] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2022-05-15 15:32:03] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 1 ms to minimize.
[2022-05-15 15:32:03] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 2 ms to minimize.
[2022-05-15 15:32:03] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2022-05-15 15:32:03] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 1 ms to minimize.
[2022-05-15 15:32:03] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 1 ms to minimize.
[2022-05-15 15:32:04] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 1 ms to minimize.
[2022-05-15 15:32:04] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 1 ms to minimize.
[2022-05-15 15:32:04] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 0 ms to minimize.
[2022-05-15 15:32:04] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 0 ms to minimize.
[2022-05-15 15:32:04] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 1 ms to minimize.
[2022-05-15 15:32:04] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 1 ms to minimize.
[2022-05-15 15:32:04] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 0 ms to minimize.
[2022-05-15 15:32:04] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 0 ms to minimize.
[2022-05-15 15:32:05] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 0 ms to minimize.
[2022-05-15 15:32:05] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 1 ms to minimize.
[2022-05-15 15:32:05] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 1 ms to minimize.
[2022-05-15 15:32:05] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 0 ms to minimize.
[2022-05-15 15:32:05] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 0 ms to minimize.
[2022-05-15 15:32:05] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 0 ms to minimize.
[2022-05-15 15:32:05] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 1 ms to minimize.
[2022-05-15 15:32:05] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 0 ms to minimize.
[2022-05-15 15:32:05] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 6150 ms
[2022-05-15 15:32:05] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2022-05-15 15:32:06] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 0 ms to minimize.
[2022-05-15 15:32:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2022-05-15 15:32:06] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 1 ms to minimize.
[2022-05-15 15:32:06] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 0 ms to minimize.
[2022-05-15 15:32:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 284 ms
[2022-05-15 15:32:06] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 1 ms to minimize.
[2022-05-15 15:32:06] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 1 ms to minimize.
[2022-05-15 15:32:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 249 ms
[2022-05-15 15:32:06] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2022-05-15 15:32:06] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2022-05-15 15:32:06] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2022-05-15 15:32:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 308 ms
[2022-05-15 15:32:07] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 0 ms to minimize.
[2022-05-15 15:32:07] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 0 ms to minimize.
[2022-05-15 15:32:07] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 0 ms to minimize.
[2022-05-15 15:32:07] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 1 ms to minimize.
[2022-05-15 15:32:07] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 0 ms to minimize.
[2022-05-15 15:32:07] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 1 ms to minimize.
[2022-05-15 15:32:07] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 1 ms to minimize.
[2022-05-15 15:32:08] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 0 ms to minimize.
[2022-05-15 15:32:08] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 0 ms to minimize.
[2022-05-15 15:32:08] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 1 ms to minimize.
[2022-05-15 15:32:08] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 1 ms to minimize.
[2022-05-15 15:32:08] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 1 ms to minimize.
[2022-05-15 15:32:08] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 0 ms to minimize.
[2022-05-15 15:32:08] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 1 ms to minimize.
[2022-05-15 15:32:08] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 0 ms to minimize.
[2022-05-15 15:32:08] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 1 ms to minimize.
[2022-05-15 15:32:09] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 1 ms to minimize.
[2022-05-15 15:32:09] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 0 ms to minimize.
[2022-05-15 15:32:09] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 0 ms to minimize.
[2022-05-15 15:32:09] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 0 ms to minimize.
[2022-05-15 15:32:09] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 0 ms to minimize.
[2022-05-15 15:32:09] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 0 ms to minimize.
[2022-05-15 15:32:09] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 1 ms to minimize.
[2022-05-15 15:32:09] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 0 ms to minimize.
[2022-05-15 15:32:09] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 1 ms to minimize.
[2022-05-15 15:32:10] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 0 ms to minimize.
[2022-05-15 15:32:10] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 0 ms to minimize.
[2022-05-15 15:32:10] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 0 ms to minimize.
[2022-05-15 15:32:10] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 0 ms to minimize.
[2022-05-15 15:32:10] [INFO ] Deduced a trap composed of 85 places in 89 ms of which 0 ms to minimize.
[2022-05-15 15:32:10] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 0 ms to minimize.
[2022-05-15 15:32:10] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 0 ms to minimize.
[2022-05-15 15:32:10] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 0 ms to minimize.
[2022-05-15 15:32:10] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 0 ms to minimize.
[2022-05-15 15:32:11] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 1 ms to minimize.
[2022-05-15 15:32:11] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 0 ms to minimize.
[2022-05-15 15:32:11] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 1 ms to minimize.
[2022-05-15 15:32:11] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 1 ms to minimize.
[2022-05-15 15:32:11] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 1 ms to minimize.
[2022-05-15 15:32:11] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 0 ms to minimize.
[2022-05-15 15:32:11] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 1 ms to minimize.
[2022-05-15 15:32:11] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 1 ms to minimize.
[2022-05-15 15:32:11] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 1 ms to minimize.
[2022-05-15 15:32:11] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 1 ms to minimize.
[2022-05-15 15:32:12] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 4920 ms
[2022-05-15 15:32:12] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 0 ms to minimize.
[2022-05-15 15:32:12] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 0 ms to minimize.
[2022-05-15 15:32:12] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 0 ms to minimize.
[2022-05-15 15:32:12] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 0 ms to minimize.
[2022-05-15 15:32:12] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 1 ms to minimize.
[2022-05-15 15:32:12] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 0 ms to minimize.
[2022-05-15 15:32:12] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 0 ms to minimize.
[2022-05-15 15:32:12] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 1 ms to minimize.
[2022-05-15 15:32:13] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 1 ms to minimize.
[2022-05-15 15:32:13] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 0 ms to minimize.
[2022-05-15 15:32:13] [INFO ] Deduced a trap composed of 88 places in 83 ms of which 0 ms to minimize.
[2022-05-15 15:32:13] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2022-05-15 15:32:13] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 0 ms to minimize.
[2022-05-15 15:32:13] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 0 ms to minimize.
[2022-05-15 15:32:13] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 0 ms to minimize.
[2022-05-15 15:32:13] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 0 ms to minimize.
[2022-05-15 15:32:13] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 1 ms to minimize.
[2022-05-15 15:32:14] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 0 ms to minimize.
[2022-05-15 15:32:14] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 0 ms to minimize.
[2022-05-15 15:32:14] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 1 ms to minimize.
[2022-05-15 15:32:14] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 0 ms to minimize.
[2022-05-15 15:32:14] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 0 ms to minimize.
[2022-05-15 15:32:14] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 0 ms to minimize.
[2022-05-15 15:32:14] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 1 ms to minimize.
[2022-05-15 15:32:14] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 0 ms to minimize.
[2022-05-15 15:32:14] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 0 ms to minimize.
[2022-05-15 15:32:15] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 0 ms to minimize.
[2022-05-15 15:32:15] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 1 ms to minimize.
[2022-05-15 15:32:15] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 0 ms to minimize.
[2022-05-15 15:32:15] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 0 ms to minimize.
[2022-05-15 15:32:15] [INFO ] Deduced a trap composed of 85 places in 89 ms of which 0 ms to minimize.
[2022-05-15 15:32:15] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 1 ms to minimize.
[2022-05-15 15:32:15] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 0 ms to minimize.
[2022-05-15 15:32:15] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 0 ms to minimize.
[2022-05-15 15:32:16] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 1 ms to minimize.
[2022-05-15 15:32:16] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 0 ms to minimize.
[2022-05-15 15:32:16] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 4063 ms
[2022-05-15 15:32:16] [INFO ] After 16861ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :12
Attempting to minimize the solution found.
Minimization took 334 ms.
[2022-05-15 15:32:16] [INFO ] After 17522ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :12
Fused 17 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 176 ms.
Support contains 14 out of 415 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 415/415 places, 369/369 transitions.
Graph (complete) has 947 edges and 415 vertex of which 414 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 414 transition count 332
Reduce places removed 36 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 378 transition count 330
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 376 transition count 330
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 77 place count 376 transition count 245
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 259 place count 279 transition count 245
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 263 place count 275 transition count 241
Iterating global reduction 3 with 4 rules applied. Total rules applied 267 place count 275 transition count 241
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 476 place count 168 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 477 place count 168 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 479 place count 167 transition count 141
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 487 place count 167 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 488 place count 166 transition count 140
Applied a total of 488 rules in 85 ms. Remains 166 /415 variables (removed 249) and now considering 140/369 (removed 229) transitions.
Finished structural reductions, in 1 iterations. Remains : 166/415 places, 140/369 transitions.
Incomplete random walk after 10000 steps, including 1360 resets, run finished after 521 ms. (steps per millisecond=19 ) properties (out of 12) seen :5
Incomplete Best-First random walk after 10000 steps, including 445 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 417 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 410 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 386 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 418 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 421 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 140 rows 166 cols
[2022-05-15 15:32:17] [INFO ] Computed 67 place invariants in 3 ms
[2022-05-15 15:32:17] [INFO ] [Real]Absence check using 49 positive place invariants in 8 ms returned sat
[2022-05-15 15:32:17] [INFO ] [Real]Absence check using 49 positive and 18 generalized place invariants in 7 ms returned sat
[2022-05-15 15:32:17] [INFO ] After 104ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:3
[2022-05-15 15:32:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 15:32:18] [INFO ] After 24ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-15 15:32:18] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-15 15:32:18] [INFO ] [Nat]Absence check using 49 positive place invariants in 7 ms returned sat
[2022-05-15 15:32:18] [INFO ] [Nat]Absence check using 49 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 15:32:18] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-15 15:32:18] [INFO ] After 65ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-15 15:32:18] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2022-05-15 15:32:18] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2022-05-15 15:32:18] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2022-05-15 15:32:18] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2022-05-15 15:32:18] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 0 ms to minimize.
[2022-05-15 15:32:18] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2022-05-15 15:32:18] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2022-05-15 15:32:18] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 0 ms to minimize.
[2022-05-15 15:32:18] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 0 ms to minimize.
[2022-05-15 15:32:18] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2022-05-15 15:32:18] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 582 ms
[2022-05-15 15:32:18] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2022-05-15 15:32:18] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2022-05-15 15:32:19] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2022-05-15 15:32:19] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2022-05-15 15:32:19] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 0 ms to minimize.
[2022-05-15 15:32:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 355 ms
[2022-05-15 15:32:19] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2022-05-15 15:32:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2022-05-15 15:32:19] [INFO ] After 1120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 56 ms.
[2022-05-15 15:32:19] [INFO ] After 1347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 78 ms.
Support contains 8 out of 166 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 166/166 places, 140/140 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 166 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 165 transition count 139
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 165 transition count 136
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 162 transition count 136
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 160 transition count 134
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 160 transition count 134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 158 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 18 place count 157 transition count 149
Applied a total of 18 rules in 26 ms. Remains 157 /166 variables (removed 9) and now considering 149/140 (removed -9) transitions.
Finished structural reductions, in 1 iterations. Remains : 157/166 places, 149/140 transitions.
Incomplete random walk after 10000 steps, including 1252 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 400 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 392 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 397 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 417 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 397 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 436 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :0
Finished probabilistic random walk after 176240 steps, run visited all 6 properties in 597 ms. (steps per millisecond=295 )
Probabilistic random walk after 176240 steps, saw 50472 distinct states, run finished after 597 ms. (steps per millisecond=295 ) properties seen :6
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
FORMULA BusinessProcesses-PT-10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 205 stabilizing places and 210 stable transitions
Graph (complete) has 947 edges and 415 vertex of which 414 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(X(p1)&&p2))))'
Support contains 4 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 404 transition count 358
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 404 transition count 358
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 400 transition count 354
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 400 transition count 354
Applied a total of 30 rules in 22 ms. Remains 400 /415 variables (removed 15) and now considering 354/369 (removed 15) transitions.
// Phase 1: matrix 354 rows 400 cols
[2022-05-15 15:32:21] [INFO ] Computed 84 place invariants in 9 ms
[2022-05-15 15:32:21] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 354 rows 400 cols
[2022-05-15 15:32:21] [INFO ] Computed 84 place invariants in 2 ms
[2022-05-15 15:32:21] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
// Phase 1: matrix 354 rows 400 cols
[2022-05-15 15:32:21] [INFO ] Computed 84 place invariants in 2 ms
[2022-05-15 15:32:21] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 400/415 places, 354/369 transitions.
Finished structural reductions, in 1 iterations. Remains : 400/415 places, 354/369 transitions.
Stuttering acceptance computed with spot in 423 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s13 1), p2:(EQ s219 1), p1:(AND (EQ s381 1) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1892 reset in 277 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-00 finished in 1517 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Graph (trivial) has 191 edges and 415 vertex of which 4 / 415 are part of one of the 1 SCC in 8 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 944 edges and 412 vertex of which 411 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 410 transition count 318
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 364 transition count 318
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 94 place count 364 transition count 232
Deduced a syphon composed of 86 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 279 place count 265 transition count 232
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 287 place count 257 transition count 224
Iterating global reduction 2 with 8 rules applied. Total rules applied 295 place count 257 transition count 224
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 506 place count 149 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 508 place count 148 transition count 124
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 509 place count 148 transition count 124
Applied a total of 509 rules in 50 ms. Remains 148 /415 variables (removed 267) and now considering 124/369 (removed 245) transitions.
// Phase 1: matrix 124 rows 148 cols
[2022-05-15 15:32:22] [INFO ] Computed 66 place invariants in 3 ms
[2022-05-15 15:32:22] [INFO ] Implicit Places using invariants in 101 ms returned [1, 2, 3, 4, 5, 6, 7, 20, 21, 22, 23, 24, 25, 48, 49]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 102 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/415 places, 124/369 transitions.
Applied a total of 0 rules in 7 ms. Remains 133 /133 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 133/415 places, 124/369 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s86 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-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-01 finished in 207 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!F(X(F(X(X(p0)))))) U p1))'
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 404 transition count 358
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 404 transition count 358
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 400 transition count 354
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 400 transition count 354
Applied a total of 30 rules in 23 ms. Remains 400 /415 variables (removed 15) and now considering 354/369 (removed 15) transitions.
// Phase 1: matrix 354 rows 400 cols
[2022-05-15 15:32:22] [INFO ] Computed 84 place invariants in 7 ms
[2022-05-15 15:32:23] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 354 rows 400 cols
[2022-05-15 15:32:23] [INFO ] Computed 84 place invariants in 4 ms
[2022-05-15 15:32:23] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
// Phase 1: matrix 354 rows 400 cols
[2022-05-15 15:32:23] [INFO ] Computed 84 place invariants in 6 ms
[2022-05-15 15:32:23] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 400/415 places, 354/369 transitions.
Finished structural reductions, in 1 iterations. Remains : 400/415 places, 354/369 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (OR (NOT p1) p0), p0, p0, p0, true]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s42 1), p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 398 steps with 3 reset in 3 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-02 finished in 978 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((false U (p0 U X(p1))))'
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 406 transition count 360
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 406 transition count 360
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 403 transition count 357
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 403 transition count 357
Applied a total of 24 rules in 24 ms. Remains 403 /415 variables (removed 12) and now considering 357/369 (removed 12) transitions.
// Phase 1: matrix 357 rows 403 cols
[2022-05-15 15:32:23] [INFO ] Computed 84 place invariants in 3 ms
[2022-05-15 15:32:24] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 357 rows 403 cols
[2022-05-15 15:32:24] [INFO ] Computed 84 place invariants in 5 ms
[2022-05-15 15:32:24] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
// Phase 1: matrix 357 rows 403 cols
[2022-05-15 15:32:24] [INFO ] Computed 84 place invariants in 10 ms
[2022-05-15 15:32:24] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 403/415 places, 357/369 transitions.
Finished structural reductions, in 1 iterations. Remains : 403/415 places, 357/369 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(EQ s239 1), p1:(EQ s326 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-03 finished in 861 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(F(p0))&&F(G(X(p1)))))))'
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Graph (trivial) has 191 edges and 415 vertex of which 7 / 415 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 940 edges and 409 vertex of which 408 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 407 transition count 316
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 363 transition count 316
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 90 place count 363 transition count 230
Deduced a syphon composed of 86 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 275 place count 264 transition count 230
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 283 place count 256 transition count 222
Iterating global reduction 2 with 8 rules applied. Total rules applied 291 place count 256 transition count 222
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 2 with 205 rules applied. Total rules applied 496 place count 151 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 498 place count 150 transition count 125
Applied a total of 498 rules in 38 ms. Remains 150 /415 variables (removed 265) and now considering 125/369 (removed 244) transitions.
// Phase 1: matrix 125 rows 150 cols
[2022-05-15 15:32:24] [INFO ] Computed 66 place invariants in 2 ms
[2022-05-15 15:32:24] [INFO ] Implicit Places using invariants in 113 ms returned [1, 2, 3, 4, 5, 6, 7, 20, 21, 22, 23, 24, 25, 51]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 114 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/415 places, 125/369 transitions.
Applied a total of 0 rules in 5 ms. Remains 136 /136 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 136/415 places, 125/369 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-04 automaton TGBA Formula[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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s36 0), p1:(EQ s40 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-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-04 finished in 285 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U p1))||(p2 U G(p2)))))'
Support contains 3 out of 415 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Graph (trivial) has 190 edges and 415 vertex of which 7 / 415 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 940 edges and 409 vertex of which 408 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 407 transition count 316
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 363 transition count 316
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 90 place count 363 transition count 230
Deduced a syphon composed of 86 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 275 place count 264 transition count 230
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 282 place count 257 transition count 223
Iterating global reduction 2 with 7 rules applied. Total rules applied 289 place count 257 transition count 223
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 203 rules applied. Total rules applied 492 place count 153 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 494 place count 152 transition count 127
Applied a total of 494 rules in 38 ms. Remains 152 /415 variables (removed 263) and now considering 127/369 (removed 242) transitions.
// Phase 1: matrix 127 rows 152 cols
[2022-05-15 15:32:25] [INFO ] Computed 66 place invariants in 3 ms
[2022-05-15 15:32:25] [INFO ] Implicit Places using invariants in 100 ms returned [1, 2, 3, 4, 5, 6, 7, 20, 21, 22, 23, 24, 25, 48, 49]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 101 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/415 places, 127/369 transitions.
Applied a total of 0 rules in 5 ms. Remains 137 /137 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 137/415 places, 127/369 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s38 1), p1:(EQ s61 1), p0:(EQ s100 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-05 finished in 240 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(F(p1) U X(X(p2))))))'
Support contains 5 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 404 transition count 358
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 404 transition count 358
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 400 transition count 354
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 400 transition count 354
Applied a total of 30 rules in 24 ms. Remains 400 /415 variables (removed 15) and now considering 354/369 (removed 15) transitions.
// Phase 1: matrix 354 rows 400 cols
[2022-05-15 15:32:25] [INFO ] Computed 84 place invariants in 6 ms
[2022-05-15 15:32:25] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 354 rows 400 cols
[2022-05-15 15:32:25] [INFO ] Computed 84 place invariants in 2 ms
[2022-05-15 15:32:25] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
// Phase 1: matrix 354 rows 400 cols
[2022-05-15 15:32:25] [INFO ] Computed 84 place invariants in 4 ms
[2022-05-15 15:32:25] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 400/415 places, 354/369 transitions.
Finished structural reductions, in 1 iterations. Remains : 400/415 places, 354/369 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-08 automaton TGBA Formula[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=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}, { cond=true, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s62 0) (OR (EQ s180 0) (EQ s213 0) (EQ s361 0))), p1:(EQ s194 1), p2:(AND (EQ s180 1) (EQ s213 1) (EQ s361 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2945 reset in 170 ms.
Stack based approach found an accepted trace after 223 steps with 7 reset with depth 9 and stack size 9 in 1 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-08 finished in 1221 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&((p1 U F(p1))||G(p1))))'
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 405 transition count 359
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 405 transition count 359
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 401 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 401 transition count 355
Applied a total of 28 rules in 20 ms. Remains 401 /415 variables (removed 14) and now considering 355/369 (removed 14) transitions.
// Phase 1: matrix 355 rows 401 cols
[2022-05-15 15:32:26] [INFO ] Computed 84 place invariants in 3 ms
[2022-05-15 15:32:26] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 355 rows 401 cols
[2022-05-15 15:32:26] [INFO ] Computed 84 place invariants in 2 ms
[2022-05-15 15:32:27] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
// Phase 1: matrix 355 rows 401 cols
[2022-05-15 15:32:27] [INFO ] Computed 84 place invariants in 6 ms
[2022-05-15 15:32:27] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 401/415 places, 355/369 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/415 places, 355/369 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s139 1), p1:(EQ s244 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-09 finished in 920 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F(G(X(p0)))))))'
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Graph (trivial) has 192 edges and 415 vertex of which 7 / 415 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 940 edges and 409 vertex of which 408 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 407 transition count 315
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 362 transition count 315
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 92 place count 362 transition count 230
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 274 place count 265 transition count 230
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 282 place count 257 transition count 222
Iterating global reduction 2 with 8 rules applied. Total rules applied 290 place count 257 transition count 222
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 497 place count 151 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 499 place count 150 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 500 place count 149 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 501 place count 148 transition count 123
Applied a total of 501 rules in 39 ms. Remains 148 /415 variables (removed 267) and now considering 123/369 (removed 246) transitions.
// Phase 1: matrix 123 rows 148 cols
[2022-05-15 15:32:27] [INFO ] Computed 66 place invariants in 2 ms
[2022-05-15 15:32:27] [INFO ] Implicit Places using invariants in 101 ms returned [21, 22, 23, 24, 25, 26, 27, 50]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 102 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/415 places, 123/369 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 140/415 places, 123/369 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s110 1) (EQ s1 0))], 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-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-10 finished in 187 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 405 transition count 359
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 405 transition count 359
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 401 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 401 transition count 355
Applied a total of 28 rules in 17 ms. Remains 401 /415 variables (removed 14) and now considering 355/369 (removed 14) transitions.
// Phase 1: matrix 355 rows 401 cols
[2022-05-15 15:32:27] [INFO ] Computed 84 place invariants in 2 ms
[2022-05-15 15:32:27] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 355 rows 401 cols
[2022-05-15 15:32:27] [INFO ] Computed 84 place invariants in 2 ms
[2022-05-15 15:32:28] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
// Phase 1: matrix 355 rows 401 cols
[2022-05-15 15:32:28] [INFO ] Computed 84 place invariants in 2 ms
[2022-05-15 15:32:28] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 401/415 places, 355/369 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/415 places, 355/369 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s352 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-11 finished in 824 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U !(G(!G(p1))&&(X(F(p0)) U p2))))'
Support contains 3 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 406 transition count 360
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 406 transition count 360
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 403 transition count 357
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 403 transition count 357
Applied a total of 24 rules in 23 ms. Remains 403 /415 variables (removed 12) and now considering 357/369 (removed 12) transitions.
// Phase 1: matrix 357 rows 403 cols
[2022-05-15 15:32:28] [INFO ] Computed 84 place invariants in 6 ms
[2022-05-15 15:32:28] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 357 rows 403 cols
[2022-05-15 15:32:28] [INFO ] Computed 84 place invariants in 6 ms
[2022-05-15 15:32:28] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
// Phase 1: matrix 357 rows 403 cols
[2022-05-15 15:32:28] [INFO ] Computed 84 place invariants in 5 ms
[2022-05-15 15:32:29] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 403/415 places, 357/369 transitions.
Finished structural reductions, in 1 iterations. Remains : 403/415 places, 357/369 transitions.
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p0) (NOT p1)), (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p2 p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={1, 2} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p2 p0), acceptance={1, 2} source=1 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=1 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(AND p1 p2 p0), acceptance={1, 2} source=5 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={2} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 2} source=5 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND p2 p0), acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=5 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=5 dest: 5}], [{ cond=p1, acceptance={1, 2} source=6 dest: 6}, { cond=(NOT p1), acceptance={0, 1, 2} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s139 1), p2:(EQ s337 1), p0:(EQ s174 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25043 reset in 236 ms.
Product exploration explored 100000 steps with 24988 reset in 291 ms.
Computed a total of 196 stabilizing places and 201 stable transitions
Graph (complete) has 931 edges and 403 vertex of which 402 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Computed a total of 196 stabilizing places and 201 stable transitions
Detected a total of 196/403 stabilizing places and 201/357 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2 p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 39 factoid took 2792 ms. Reduced automaton from 7 states, 33 edges and 3 AP to 7 states, 35 edges and 3 AP.
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p1) p2), (AND (NOT p1) p0 p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0 p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 85 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 554839 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{3=1, 5=1, 6=1, 8=1, 12=1}
Probabilistic random walk after 554839 steps, saw 83913 distinct states, run finished after 3002 ms. (steps per millisecond=184 ) properties seen :5
Running SMT prover for 11 properties.
// Phase 1: matrix 357 rows 403 cols
[2022-05-15 15:32:36] [INFO ] Computed 84 place invariants in 4 ms
[2022-05-15 15:32:36] [INFO ] [Real]Absence check using 45 positive place invariants in 12 ms returned sat
[2022-05-15 15:32:36] [INFO ] [Real]Absence check using 45 positive and 39 generalized place invariants in 11 ms returned sat
[2022-05-15 15:32:36] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2022-05-15 15:32:36] [INFO ] [Nat]Absence check using 45 positive place invariants in 12 ms returned sat
[2022-05-15 15:32:36] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 10 ms returned sat
[2022-05-15 15:32:37] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2022-05-15 15:32:37] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 1 ms to minimize.
[2022-05-15 15:32:37] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2022-05-15 15:32:37] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2022-05-15 15:32:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 287 ms
[2022-05-15 15:32:37] [INFO ] After 847ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 158 ms.
[2022-05-15 15:32:37] [INFO ] After 1197ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 6 properties in 44 ms.
Support contains 3 out of 403 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 403/403 places, 357/357 transitions.
Graph (trivial) has 177 edges and 403 vertex of which 6 / 403 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 924 edges and 398 vertex of which 397 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 397 transition count 313
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 361 transition count 313
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 74 place count 361 transition count 228
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 183 rules applied. Total rules applied 257 place count 263 transition count 228
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 476 place count 151 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 478 place count 150 transition count 124
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 480 place count 150 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 482 place count 148 transition count 122
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 483 place count 148 transition count 122
Applied a total of 483 rules in 29 ms. Remains 148 /403 variables (removed 255) and now considering 122/357 (removed 235) transitions.
Finished structural reductions, in 1 iterations. Remains : 148/403 places, 122/357 transitions.
Incomplete random walk after 10000 steps, including 470 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 3) seen :1
Finished Best-First random walk after 1367 steps, including 26 resets, run visited all 2 properties in 10 ms. (steps per millisecond=136 )
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2 p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 p0 (NOT p2)))), (G (NOT (AND p1 p0 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND p1 (NOT p0) (NOT p2))), (F p1), (F (AND p0 p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p2))), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p0 p2)), (F (AND p1 (NOT p0) p2)), (F (AND (NOT p1) p0 (NOT p2)))]
Knowledge based reduction with 41 factoid took 2568 ms. Reduced automaton from 7 states, 35 edges and 3 AP to 7 states, 30 edges and 3 AP.
Stuttering acceptance computed with spot in 268 ms :[(OR (AND (NOT p1) p2) (AND p0 p2)), (AND p0 p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2), (NOT p1)]
Stuttering acceptance computed with spot in 303 ms :[(OR (AND (NOT p1) p2) (AND p0 p2)), (AND p0 p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2), (NOT p1)]
Support contains 3 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 357/357 transitions.
Applied a total of 0 rules in 14 ms. Remains 403 /403 variables (removed 0) and now considering 357/357 (removed 0) transitions.
// Phase 1: matrix 357 rows 403 cols
[2022-05-15 15:32:41] [INFO ] Computed 84 place invariants in 4 ms
[2022-05-15 15:32:41] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 357 rows 403 cols
[2022-05-15 15:32:41] [INFO ] Computed 84 place invariants in 5 ms
[2022-05-15 15:32:41] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
// Phase 1: matrix 357 rows 403 cols
[2022-05-15 15:32:41] [INFO ] Computed 84 place invariants in 2 ms
[2022-05-15 15:32:42] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 357/357 transitions.
Computed a total of 196 stabilizing places and 201 stable transitions
Graph (complete) has 931 edges and 403 vertex of which 402 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 196 stabilizing places and 201 stable transitions
Detected a total of 196/403 stabilizing places and 201/357 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 29 factoid took 1963 ms. Reduced automaton from 7 states, 30 edges and 3 AP to 7 states, 30 edges and 3 AP.
Stuttering acceptance computed with spot in 299 ms :[(OR (AND (NOT p1) p2) (AND p0 p2)), (AND p0 p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 81 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :10
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 357 rows 403 cols
[2022-05-15 15:32:44] [INFO ] Computed 84 place invariants in 2 ms
[2022-05-15 15:32:45] [INFO ] [Real]Absence check using 45 positive place invariants in 12 ms returned sat
[2022-05-15 15:32:45] [INFO ] [Real]Absence check using 45 positive and 39 generalized place invariants in 18 ms returned sat
[2022-05-15 15:32:45] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 15:32:45] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-15 15:32:45] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 10 ms returned sat
[2022-05-15 15:32:45] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 15:32:45] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 1 ms to minimize.
[2022-05-15 15:32:45] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 1 ms to minimize.
[2022-05-15 15:32:45] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2022-05-15 15:32:45] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2022-05-15 15:32:46] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 1 ms to minimize.
[2022-05-15 15:32:46] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 0 ms to minimize.
[2022-05-15 15:32:46] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 0 ms to minimize.
[2022-05-15 15:32:46] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 0 ms to minimize.
[2022-05-15 15:32:46] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2022-05-15 15:32:46] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 1 ms to minimize.
[2022-05-15 15:32:46] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 1 ms to minimize.
[2022-05-15 15:32:46] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 0 ms to minimize.
[2022-05-15 15:32:46] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 1 ms to minimize.
[2022-05-15 15:32:46] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1456 ms
[2022-05-15 15:32:47] [INFO ] After 1742ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 66 ms.
[2022-05-15 15:32:47] [INFO ] After 1929ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 60 ms.
Support contains 3 out of 403 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 403/403 places, 357/357 transitions.
Graph (trivial) has 177 edges and 403 vertex of which 6 / 403 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 924 edges and 398 vertex of which 397 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 397 transition count 313
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 361 transition count 313
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 74 place count 361 transition count 228
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 183 rules applied. Total rules applied 257 place count 263 transition count 228
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 476 place count 151 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 478 place count 150 transition count 124
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 480 place count 150 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 482 place count 148 transition count 122
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 483 place count 148 transition count 122
Applied a total of 483 rules in 25 ms. Remains 148 /403 variables (removed 255) and now considering 122/357 (removed 235) transitions.
Finished structural reductions, in 1 iterations. Remains : 148/403 places, 122/357 transitions.
Incomplete random walk after 10000 steps, including 444 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :2
Finished Best-First random walk after 1289 steps, including 27 resets, run visited all 2 properties in 7 ms. (steps per millisecond=184 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p2 p1)), (F (AND (NOT p2) p0)), (F (AND p2 (NOT p1) (NOT p0))), (F (AND p2 (NOT p0))), (F (NOT (AND (NOT p2) (NOT p0)))), (F p1), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0))), (F (AND (NOT p2) p1 (NOT p0))), (F (AND p2 p0)), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1)), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 29 factoid took 2319 ms. Reduced automaton from 7 states, 30 edges and 3 AP to 7 states, 30 edges and 3 AP.
Stuttering acceptance computed with spot in 251 ms :[(OR (AND (NOT p1) p2) (AND p0 p2)), (AND p0 p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2), (NOT p1)]
Stuttering acceptance computed with spot in 250 ms :[(OR (AND (NOT p1) p2) (AND p0 p2)), (AND p0 p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2), (NOT p1)]
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p1) p2) (AND p0 p2)), (AND p0 p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2), (NOT p1)]
Product exploration explored 100000 steps with 33263 reset in 238 ms.
Product exploration explored 100000 steps with 33438 reset in 257 ms.
Applying partial POR strategy [false, false, true, false, true, false, true]
Stuttering acceptance computed with spot in 258 ms :[(OR (AND (NOT p1) p2) (AND p0 p2)), (AND p0 p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2), (NOT p1)]
Support contains 3 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 357/357 transitions.
Graph (trivial) has 177 edges and 403 vertex of which 6 / 403 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.
Graph (complete) has 925 edges and 398 vertex of which 397 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 397 transition count 350
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 59 Pre rules applied. Total rules applied 38 place count 397 transition count 390
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 1 with 59 rules applied. Total rules applied 97 place count 397 transition count 390
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 109 place count 385 transition count 367
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 121 place count 385 transition count 367
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 1 with 132 rules applied. Total rules applied 253 place count 385 transition count 367
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 282 place count 356 transition count 338
Deduced a syphon composed of 186 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 311 place count 356 transition count 338
Deduced a syphon composed of 186 places in 0 ms
Applied a total of 311 rules in 46 ms. Remains 356 /403 variables (removed 47) and now considering 338/357 (removed 19) transitions.
[2022-05-15 15:32:51] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 338 rows 356 cols
[2022-05-15 15:32:51] [INFO ] Computed 84 place invariants in 6 ms
[2022-05-15 15:32:51] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 356/403 places, 338/357 transitions.
Finished structural reductions, in 1 iterations. Remains : 356/403 places, 338/357 transitions.
Product exploration explored 100000 steps with 33383 reset in 295 ms.
Product exploration explored 100000 steps with 33246 reset in 275 ms.
Built C files in :
/tmp/ltsmin8632412186268219295
[2022-05-15 15:32:52] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8632412186268219295
Running compilation step : cd /tmp/ltsmin8632412186268219295;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 697 ms.
Running link step : cd /tmp/ltsmin8632412186268219295;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8632412186268219295;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17867167642206725363.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 357/357 transitions.
Applied a total of 0 rules in 13 ms. Remains 403 /403 variables (removed 0) and now considering 357/357 (removed 0) transitions.
// Phase 1: matrix 357 rows 403 cols
[2022-05-15 15:33:07] [INFO ] Computed 84 place invariants in 3 ms
[2022-05-15 15:33:07] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 357 rows 403 cols
[2022-05-15 15:33:07] [INFO ] Computed 84 place invariants in 5 ms
[2022-05-15 15:33:08] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
// Phase 1: matrix 357 rows 403 cols
[2022-05-15 15:33:08] [INFO ] Computed 84 place invariants in 9 ms
[2022-05-15 15:33:08] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 357/357 transitions.
Built C files in :
/tmp/ltsmin9385196365031198552
[2022-05-15 15:33:08] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9385196365031198552
Running compilation step : cd /tmp/ltsmin9385196365031198552;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 514 ms.
Running link step : cd /tmp/ltsmin9385196365031198552;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin9385196365031198552;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12906388149615297440.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 15:33:23] [INFO ] Flatten gal took : 24 ms
[2022-05-15 15:33:23] [INFO ] Flatten gal took : 20 ms
[2022-05-15 15:33:23] [INFO ] Time to serialize gal into /tmp/LTL9962963833620517814.gal : 5 ms
[2022-05-15 15:33:23] [INFO ] Time to serialize properties into /tmp/LTL14730867081438385294.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9962963833620517814.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14730867081438385294.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9962963...267
Read 1 LTL properties
Checking formula 0 : !(((X("(p197==1)"))U(!((G(!(G("(p157==1)"))))&&((X(F("(p197==1)")))U("(p419==1)"))))))
Formula 0 simplified : !(X"(p197==1)" U !(G!G"(p157==1)" & (XF"(p197==1)" U "(p419==1)")))
Detected timeout of ITS tools.
[2022-05-15 15:33:39] [INFO ] Flatten gal took : 36 ms
[2022-05-15 15:33:39] [INFO ] Applying decomposition
[2022-05-15 15:33:39] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7288417983386931267.txt' '-o' '/tmp/graph7288417983386931267.bin' '-w' '/tmp/graph7288417983386931267.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7288417983386931267.bin' '-l' '-1' '-v' '-w' '/tmp/graph7288417983386931267.weights' '-q' '0' '-e' '0.001'
[2022-05-15 15:33:39] [INFO ] Decomposing Gal with order
[2022-05-15 15:33:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 15:33:39] [INFO ] Removed a total of 249 redundant transitions.
[2022-05-15 15:33:39] [INFO ] Flatten gal took : 67 ms
[2022-05-15 15:33:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 12 ms.
[2022-05-15 15:33:39] [INFO ] Time to serialize gal into /tmp/LTL10413668422685086768.gal : 8 ms
[2022-05-15 15:33:39] [INFO ] Time to serialize properties into /tmp/LTL3083172223543127483.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10413668422685086768.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3083172223543127483.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1041366...246
Read 1 LTL properties
Checking formula 0 : !(((X("(i9.i0.u65.p197==1)"))U(!((G(!(G("(i9.i0.u51.p157==1)"))))&&((X(F("(i9.i0.u65.p197==1)")))U("(i16.u116.p419==1)"))))))
Formula 0 simplified : !(X"(i9.i0.u65.p197==1)" U !(G!G"(i9.i0.u51.p157==1)" & (XF"(i9.i0.u65.p197==1)" U "(i16.u116.p419==1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8656845591014701589
[2022-05-15 15:33:54] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8656845591014701589
Running compilation step : cd /tmp/ltsmin8656845591014701589;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 514 ms.
Running link step : cd /tmp/ltsmin8656845591014701589;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8656845591014701589;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp0==true)) U !([]())&&(X(<>((LTLAPp0==true))) U (LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-10-LTLFireability-12 finished in 101171 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 405 transition count 359
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 405 transition count 359
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 401 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 401 transition count 355
Applied a total of 28 rules in 29 ms. Remains 401 /415 variables (removed 14) and now considering 355/369 (removed 14) transitions.
// Phase 1: matrix 355 rows 401 cols
[2022-05-15 15:34:09] [INFO ] Computed 84 place invariants in 3 ms
[2022-05-15 15:34:09] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 355 rows 401 cols
[2022-05-15 15:34:09] [INFO ] Computed 84 place invariants in 2 ms
[2022-05-15 15:34:10] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
// Phase 1: matrix 355 rows 401 cols
[2022-05-15 15:34:10] [INFO ] Computed 84 place invariants in 2 ms
[2022-05-15 15:34:10] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 401/415 places, 355/369 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/415 places, 355/369 transitions.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s354 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-13 finished in 982 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(G(p1))))))'
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 405 transition count 359
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 405 transition count 359
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 401 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 401 transition count 355
Applied a total of 28 rules in 21 ms. Remains 401 /415 variables (removed 14) and now considering 355/369 (removed 14) transitions.
// Phase 1: matrix 355 rows 401 cols
[2022-05-15 15:34:10] [INFO ] Computed 84 place invariants in 3 ms
[2022-05-15 15:34:10] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 355 rows 401 cols
[2022-05-15 15:34:10] [INFO ] Computed 84 place invariants in 2 ms
[2022-05-15 15:34:11] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
// Phase 1: matrix 355 rows 401 cols
[2022-05-15 15:34:11] [INFO ] Computed 84 place invariants in 5 ms
[2022-05-15 15:34:11] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 401/415 places, 355/369 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/415 places, 355/369 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(NEQ s373 1), p0:(EQ s239 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3485 steps with 27 reset in 9 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-14 finished in 980 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G(p1)))'
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 405 transition count 359
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 405 transition count 359
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 401 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 401 transition count 355
Applied a total of 28 rules in 13 ms. Remains 401 /415 variables (removed 14) and now considering 355/369 (removed 14) transitions.
// Phase 1: matrix 355 rows 401 cols
[2022-05-15 15:34:11] [INFO ] Computed 84 place invariants in 4 ms
[2022-05-15 15:34:11] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 355 rows 401 cols
[2022-05-15 15:34:11] [INFO ] Computed 84 place invariants in 16 ms
[2022-05-15 15:34:12] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
// Phase 1: matrix 355 rows 401 cols
[2022-05-15 15:34:12] [INFO ] Computed 84 place invariants in 2 ms
[2022-05-15 15:34:12] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 401/415 places, 355/369 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/415 places, 355/369 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 3}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(EQ s42 0), p1:(EQ s219 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 214 ms.
Product exploration explored 100000 steps with 33333 reset in 245 ms.
Computed a total of 196 stabilizing places and 201 stable transitions
Graph (complete) has 928 edges and 401 vertex of which 400 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 196 stabilizing places and 201 stable transitions
Detected a total of 196/401 stabilizing places and 201/355 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 6 factoid took 101 ms. Reduced automaton from 7 states, 11 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-10-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-10-LTLFireability-15 finished in 1538 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U !(G(!G(p1))&&(X(F(p0)) U p2))))'
Found a SL insensitive property : BusinessProcesses-PT-10-LTLFireability-12
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p0) (NOT p1)), (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p2 p0), (NOT p1)]
Support contains 3 out of 415 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Graph (trivial) has 189 edges and 415 vertex of which 7 / 415 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 940 edges and 409 vertex of which 408 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 407 transition count 317
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 364 transition count 317
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 88 place count 364 transition count 232
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 183 rules applied. Total rules applied 271 place count 266 transition count 232
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 278 place count 259 transition count 225
Iterating global reduction 2 with 7 rules applied. Total rules applied 285 place count 259 transition count 225
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 496 place count 151 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 498 place count 150 transition count 125
Applied a total of 498 rules in 28 ms. Remains 150 /415 variables (removed 265) and now considering 125/369 (removed 244) transitions.
// Phase 1: matrix 125 rows 150 cols
[2022-05-15 15:34:13] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-15 15:34:13] [INFO ] Implicit Places using invariants in 173 ms returned [1, 2, 3, 4, 5, 6, 7, 20, 21, 22, 23, 24, 25, 50, 51]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 185 ms to find 15 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 135/415 places, 125/369 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 135/415 places, 125/369 transitions.
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={1, 2} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p2 p0), acceptance={1, 2} source=1 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=1 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(AND p1 p2 p0), acceptance={1, 2} source=5 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={2} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 2} source=5 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND p2 p0), acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=5 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=5 dest: 5}], [{ cond=p1, acceptance={1, 2} source=6 dest: 6}, { cond=(NOT p1), acceptance={0, 1, 2} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s14 1), p2:(EQ s98 1), p0:(EQ s36 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 29415 reset in 342 ms.
Product exploration explored 100000 steps with 29268 reset in 284 ms.
Computed a total of 64 stabilizing places and 79 stable transitions
Computed a total of 64 stabilizing places and 79 stable transitions
Detected a total of 64/135 stabilizing places and 79/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2 p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 39 factoid took 2850 ms. Reduced automaton from 7 states, 33 edges and 3 AP to 7 states, 35 edges and 3 AP.
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p1) p2), (AND (NOT p1) p0 p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0 p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 2322 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10001 steps, including 700 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 713 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 661 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 687 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 657 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 125 rows 135 cols
[2022-05-15 15:34:17] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-15 15:34:17] [INFO ] [Real]Absence check using 31 positive place invariants in 59 ms returned sat
[2022-05-15 15:34:17] [INFO ] [Real]Absence check using 31 positive and 20 generalized place invariants in 3 ms returned sat
[2022-05-15 15:34:17] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2022-05-15 15:34:17] [INFO ] [Nat]Absence check using 31 positive place invariants in 4 ms returned sat
[2022-05-15 15:34:17] [INFO ] [Nat]Absence check using 31 positive and 20 generalized place invariants in 4 ms returned sat
[2022-05-15 15:34:18] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2022-05-15 15:34:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 15:34:18] [INFO ] After 26ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2022-05-15 15:34:18] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 11 ms to minimize.
[2022-05-15 15:34:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2022-05-15 15:34:18] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-15 15:34:18] [INFO ] After 266ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 135/135 places, 125/125 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 124
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 135 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 133 transition count 122
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 133 transition count 122
Applied a total of 6 rules in 10 ms. Remains 133 /135 variables (removed 2) and now considering 122/125 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/135 places, 122/125 transitions.
Incomplete random walk after 10000 steps, including 445 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 230 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :2
Finished Best-First random walk after 843 steps, including 23 resets, run visited all 1 properties in 2 ms. (steps per millisecond=421 )
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2 p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 p0 (NOT p2)))), (G (NOT (AND p1 p0 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND p1 (NOT p0) (NOT p2))), (F p1), (F (AND p0 p2)), (F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p0 p2)), (F (AND p1 (NOT p0) p2)), (F (AND (NOT p1) p0 (NOT p2)))]
Knowledge based reduction with 41 factoid took 2715 ms. Reduced automaton from 7 states, 35 edges and 3 AP to 7 states, 30 edges and 3 AP.
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p1) p2) (AND p0 p2)), (AND p0 p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2), (NOT p1)]
Stuttering acceptance computed with spot in 314 ms :[(OR (AND (NOT p1) p2) (AND p0 p2)), (AND p0 p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2), (NOT p1)]
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 135 /135 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 135 cols
[2022-05-15 15:34:21] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-15 15:34:21] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 125 rows 135 cols
[2022-05-15 15:34:21] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-15 15:34:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 15:34:21] [INFO ] Implicit Places using invariants and state equation in 154 ms returned [13, 72, 78, 84, 86]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 277 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 130/135 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 130 /130 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 130/135 places, 125/125 transitions.
Computed a total of 59 stabilizing places and 79 stable transitions
Graph (complete) has 485 edges and 130 vertex of which 119 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Computed a total of 59 stabilizing places and 79 stable transitions
Detected a total of 59/130 stabilizing places and 79/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 29 factoid took 1902 ms. Reduced automaton from 7 states, 30 edges and 3 AP to 7 states, 30 edges and 3 AP.
Stuttering acceptance computed with spot in 238 ms :[(OR (AND (NOT p1) p2) (AND p0 p2)), (AND p0 p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10001 steps, including 721 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 682 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 125 rows 130 cols
[2022-05-15 15:34:24] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-15 15:34:24] [INFO ] [Real]Absence check using 26 positive place invariants in 3 ms returned sat
[2022-05-15 15:34:24] [INFO ] [Real]Absence check using 26 positive and 20 generalized place invariants in 4 ms returned sat
[2022-05-15 15:34:24] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 15:34:24] [INFO ] [Nat]Absence check using 26 positive place invariants in 3 ms returned sat
[2022-05-15 15:34:24] [INFO ] [Nat]Absence check using 26 positive and 20 generalized place invariants in 7 ms returned sat
[2022-05-15 15:34:24] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 15:34:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 15:34:24] [INFO ] After 16ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 15:34:24] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2022-05-15 15:34:24] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2022-05-15 15:34:24] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 0 ms to minimize.
[2022-05-15 15:34:24] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 0 ms to minimize.
[2022-05-15 15:34:24] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2022-05-15 15:34:24] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2022-05-15 15:34:24] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2022-05-15 15:34:24] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 0 ms to minimize.
[2022-05-15 15:34:24] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2022-05-15 15:34:24] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2022-05-15 15:34:25] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2022-05-15 15:34:25] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2022-05-15 15:34:25] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 727 ms
[2022-05-15 15:34:25] [INFO ] After 761ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-15 15:34:25] [INFO ] After 888ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 31 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p2 p1)), (F (AND (NOT p2) p0)), (F (AND p2 (NOT p1) (NOT p0))), (F (AND p2 (NOT p0))), (F (NOT (AND (NOT p2) (NOT p0)))), (F p1), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0))), (F (AND (NOT p2) p1 (NOT p0))), (F (AND p2 p0)), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1)), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 29 factoid took 2304 ms. Reduced automaton from 7 states, 30 edges and 3 AP to 7 states, 30 edges and 3 AP.
Stuttering acceptance computed with spot in 270 ms :[(OR (AND (NOT p1) p2) (AND p0 p2)), (AND p0 p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2), (NOT p1)]
Stuttering acceptance computed with spot in 260 ms :[(OR (AND (NOT p1) p2) (AND p0 p2)), (AND p0 p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2), (NOT p1)]
Stuttering acceptance computed with spot in 249 ms :[(OR (AND (NOT p1) p2) (AND p0 p2)), (AND p0 p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2), (NOT p1)]
Product exploration explored 100000 steps with 37116 reset in 205 ms.
Product exploration explored 100000 steps with 37016 reset in 227 ms.
Applying partial POR strategy [false, false, true, false, true, false, true]
Stuttering acceptance computed with spot in 236 ms :[(OR (AND (NOT p1) p2) (AND p0 p2)), (AND p0 p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2), (NOT p1)]
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 125/125 transitions.
Graph (complete) has 485 edges and 130 vertex of which 123 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 123 transition count 122
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 116 transition count 94
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 116 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 116 transition count 94
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 18 rules in 9 ms. Remains 116 /130 variables (removed 14) and now considering 94/125 (removed 31) transitions.
[2022-05-15 15:34:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 94 rows 116 cols
[2022-05-15 15:34:29] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-15 15:34:29] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/130 places, 94/125 transitions.
Finished structural reductions, in 1 iterations. Remains : 116/130 places, 94/125 transitions.
Product exploration explored 100000 steps with 37169 reset in 209 ms.
Product exploration explored 100000 steps with 37044 reset in 252 ms.
Built C files in :
/tmp/ltsmin35623091134601075
[2022-05-15 15:34:29] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin35623091134601075
Running compilation step : cd /tmp/ltsmin35623091134601075;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 226 ms.
Running link step : cd /tmp/ltsmin35623091134601075;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin35623091134601075;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1458371007291252069.hoa' '--buchi-type=spotba'
LTSmin run took 4229 ms.
Treatment of property BusinessProcesses-PT-10-LTLFireability-12 finished in 21219 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-12 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-15 15:34:34] [INFO ] Flatten gal took : 18 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 162393 ms.

BK_STOP 1652628874616

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-10"
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-10, 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 r024-tall-165251918500396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-10.tgz
mv BusinessProcesses-PT-10 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;