Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 148K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716651167418

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-13
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 15:32:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:32:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:32:50] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2024-05-25 15:32:50] [INFO ] Transformed 593 places.
[2024-05-25 15:32:50] [INFO ] Transformed 536 transitions.
[2024-05-25 15:32:50] [INFO ] Found NUPN structural information;
[2024-05-25 15:32:50] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 84 place count 501 transition count 449
Iterating global reduction 1 with 79 rules applied. Total rules applied 163 place count 501 transition count 449
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 205 place count 459 transition count 407
Iterating global reduction 1 with 42 rules applied. Total rules applied 247 place count 459 transition count 407
Applied a total of 247 rules in 111 ms. Remains 459 /585 variables (removed 126) and now considering 407/528 (removed 121) transitions.
// Phase 1: matrix 407 rows 459 cols
[2024-05-25 15:32:50] [INFO ] Computed 90 invariants in 27 ms
[2024-05-25 15:32:50] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-25 15:32:50] [INFO ] Invariant cache hit.
[2024-05-25 15:32:51] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2024-05-25 15:32:51] [INFO ] Invariant cache hit.
[2024-05-25 15:32:51] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 459/585 places, 407/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1188 ms. Remains : 459/585 places, 407/528 transitions.
Support contains 32 out of 459 places after structural reductions.
[2024-05-25 15:32:51] [INFO ] Flatten gal took : 81 ms
[2024-05-25 15:32:51] [INFO ] Flatten gal took : 41 ms
[2024-05-25 15:32:52] [INFO ] Input system was already deterministic with 407 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 595 ms. (steps per millisecond=16 ) properties (out of 20) seen :6
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2024-05-25 15:32:53] [INFO ] Invariant cache hit.
[2024-05-25 15:32:54] [INFO ] [Real]Absence check using 52 positive place invariants in 68 ms returned sat
[2024-05-25 15:32:54] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 42 ms returned sat
[2024-05-25 15:32:55] [INFO ] After 505ms SMT Verify possible using state equation in real domain returned unsat :4 sat :4 real:6
[2024-05-25 15:32:55] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 7 ms to minimize.
[2024-05-25 15:32:55] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2024-05-25 15:32:55] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 1 ms to minimize.
[2024-05-25 15:32:55] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 0 ms to minimize.
[2024-05-25 15:32:55] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-05-25 15:32:55] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 0 ms to minimize.
[2024-05-25 15:32:56] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-05-25 15:32:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 944 ms
[2024-05-25 15:32:56] [INFO ] After 1558ms SMT Verify possible using trap constraints in real domain returned unsat :4 sat :0 real:10
[2024-05-25 15:32:56] [INFO ] After 2152ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:10
[2024-05-25 15:32:56] [INFO ] [Nat]Absence check using 52 positive place invariants in 16 ms returned sat
[2024-05-25 15:32:56] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 29 ms returned sat
[2024-05-25 15:32:56] [INFO ] After 524ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :10
[2024-05-25 15:32:57] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 5 ms to minimize.
[2024-05-25 15:32:57] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 0 ms to minimize.
[2024-05-25 15:32:59] [INFO ] Deduced a trap composed of 16 places in 1743 ms of which 1 ms to minimize.
[2024-05-25 15:32:59] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:32:59] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2024-05-25 15:32:59] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2024-05-25 15:32:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2308 ms
[2024-05-25 15:32:59] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 0 ms to minimize.
[2024-05-25 15:32:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2024-05-25 15:32:59] [INFO ] Deduced a trap composed of 74 places in 164 ms of which 1 ms to minimize.
[2024-05-25 15:32:59] [INFO ] Deduced a trap composed of 78 places in 151 ms of which 1 ms to minimize.
[2024-05-25 15:32:59] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 1 ms to minimize.
[2024-05-25 15:33:00] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:33:00] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2024-05-25 15:33:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 684 ms
[2024-05-25 15:33:00] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 1 ms to minimize.
[2024-05-25 15:33:00] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 0 ms to minimize.
[2024-05-25 15:33:00] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 0 ms to minimize.
[2024-05-25 15:33:00] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 0 ms to minimize.
[2024-05-25 15:33:00] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-05-25 15:33:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 591 ms
[2024-05-25 15:33:00] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 0 ms to minimize.
[2024-05-25 15:33:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2024-05-25 15:33:01] [INFO ] After 4712ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :10
Attempting to minimize the solution found.
Minimization took 242 ms.
[2024-05-25 15:33:01] [INFO ] After 5223ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :10
Fused 14 Parikh solutions to 10 different solutions.
Parikh walk visited 2 properties in 196 ms.
Support contains 13 out of 459 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 459/459 places, 407/407 transitions.
Graph (complete) has 1040 edges and 459 vertex of which 458 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
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 458 transition count 358
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 410 transition count 356
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 408 transition count 356
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 101 place count 408 transition count 263
Deduced a syphon composed of 93 places in 2 ms
Ensure Unique test removed 16 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 303 place count 299 transition count 263
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 308 place count 294 transition count 258
Iterating global reduction 3 with 5 rules applied. Total rules applied 313 place count 294 transition count 258
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 545 place count 176 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 546 place count 176 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 548 place count 175 transition count 147
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 557 place count 175 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 558 place count 174 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 559 place count 173 transition count 146
Applied a total of 559 rules in 128 ms. Remains 173 /459 variables (removed 286) and now considering 146/407 (removed 261) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 173/459 places, 146/407 transitions.
Incomplete random walk after 10000 steps, including 1095 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 302 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 262 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 313 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 304 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 309 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 276 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 146 rows 173 cols
[2024-05-25 15:33:02] [INFO ] Computed 69 invariants in 4 ms
[2024-05-25 15:33:02] [INFO ] [Real]Absence check using 51 positive place invariants in 7 ms returned sat
[2024-05-25 15:33:02] [INFO ] [Real]Absence check using 51 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-25 15:33:02] [INFO ] After 69ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2024-05-25 15:33:02] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:33:02] [INFO ] After 12ms SMT Verify possible using 5 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-25 15:33:02] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-25 15:33:02] [INFO ] [Nat]Absence check using 51 positive place invariants in 8 ms returned sat
[2024-05-25 15:33:02] [INFO ] [Nat]Absence check using 51 positive and 18 generalized place invariants in 7 ms returned sat
[2024-05-25 15:33:03] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-25 15:33:03] [INFO ] After 53ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-25 15:33:03] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2024-05-25 15:33:03] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2024-05-25 15:33:03] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-05-25 15:33:03] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2024-05-25 15:33:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 348 ms
[2024-05-25 15:33:03] [INFO ] After 514ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 82 ms.
[2024-05-25 15:33:03] [INFO ] After 803ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 5 properties in 21 ms.
Support contains 3 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 146/146 transitions.
Graph (trivial) has 13 edges and 173 vertex of which 2 / 173 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 172 transition count 141
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 169 transition count 141
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 169 transition count 139
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 166 transition count 139
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 162 transition count 135
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 162 transition count 133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 160 transition count 133
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 160 transition count 133
Applied a total of 25 rules in 51 ms. Remains 160 /173 variables (removed 13) and now considering 133/146 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 160/173 places, 133/146 transitions.
Incomplete random walk after 10000 steps, including 364 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10437 steps, run visited all 1 properties in 118 ms. (steps per millisecond=88 )
Probabilistic random walk after 10437 steps, saw 3419 distinct states, run finished after 118 ms. (steps per millisecond=88 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1040 edges and 459 vertex of which 458 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Graph (trivial) has 216 edges and 459 vertex of which 6 / 459 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1034 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 452 transition count 347
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 400 transition count 347
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 106 place count 400 transition count 250
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 317 place count 286 transition count 250
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 326 place count 277 transition count 241
Iterating global reduction 2 with 9 rules applied. Total rules applied 335 place count 277 transition count 241
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 567 place count 159 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 569 place count 158 transition count 131
Applied a total of 569 rules in 90 ms. Remains 158 /459 variables (removed 301) and now considering 131/407 (removed 276) transitions.
// Phase 1: matrix 131 rows 158 cols
[2024-05-25 15:33:04] [INFO ] Computed 69 invariants in 5 ms
[2024-05-25 15:33:04] [INFO ] Implicit Places using invariants in 198 ms returned [3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 201 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/459 places, 131/407 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 301 ms. Remains : 140/459 places, 131/407 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 200 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-00 finished in 584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((X(p1)&&p0) U X(p2))&&F(G(p1))))'
Support contains 5 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 448 transition count 396
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 448 transition count 396
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 446 transition count 394
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 446 transition count 394
Applied a total of 26 rules in 35 ms. Remains 446 /459 variables (removed 13) and now considering 394/407 (removed 13) transitions.
// Phase 1: matrix 394 rows 446 cols
[2024-05-25 15:33:05] [INFO ] Computed 90 invariants in 18 ms
[2024-05-25 15:33:05] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-25 15:33:05] [INFO ] Invariant cache hit.
[2024-05-25 15:33:05] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 904 ms to find 0 implicit places.
[2024-05-25 15:33:05] [INFO ] Invariant cache hit.
[2024-05-25 15:33:06] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/459 places, 394/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1159 ms. Remains : 446/459 places, 394/407 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (NOT p2), true]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s142 1) (EQ s324 1) (EQ s419 1)), p2:(EQ s209 1), p1:(EQ s273 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 131 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-01 finished in 1378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Graph (trivial) has 216 edges and 459 vertex of which 6 / 459 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 1034 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 452 transition count 347
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 400 transition count 347
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 106 place count 400 transition count 250
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 317 place count 286 transition count 250
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 326 place count 277 transition count 241
Iterating global reduction 2 with 9 rules applied. Total rules applied 335 place count 277 transition count 241
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 231 rules applied. Total rules applied 566 place count 160 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 568 place count 159 transition count 131
Applied a total of 568 rules in 40 ms. Remains 159 /459 variables (removed 300) and now considering 131/407 (removed 276) transitions.
// Phase 1: matrix 131 rows 159 cols
[2024-05-25 15:33:06] [INFO ] Computed 70 invariants in 2 ms
[2024-05-25 15:33:06] [INFO ] Implicit Places using invariants in 110 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 112 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/459 places, 131/407 transitions.
Applied a total of 0 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 158 ms. Remains : 139/459 places, 131/407 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s96 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-03 finished in 217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Graph (trivial) has 215 edges and 459 vertex of which 6 / 459 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1034 edges and 454 vertex of which 453 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 452 transition count 348
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 401 transition count 348
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 104 place count 401 transition count 250
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 317 place count 286 transition count 250
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 326 place count 277 transition count 241
Iterating global reduction 2 with 9 rules applied. Total rules applied 335 place count 277 transition count 241
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 230 rules applied. Total rules applied 565 place count 160 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 567 place count 159 transition count 132
Applied a total of 567 rules in 38 ms. Remains 159 /459 variables (removed 300) and now considering 132/407 (removed 275) transitions.
// Phase 1: matrix 132 rows 159 cols
[2024-05-25 15:33:06] [INFO ] Computed 69 invariants in 1 ms
[2024-05-25 15:33:06] [INFO ] Implicit Places using invariants in 192 ms returned [1, 2, 6, 7, 8, 15, 16, 20, 21, 22, 23, 24, 25, 48, 49, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 202 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/459 places, 132/407 transitions.
Applied a total of 0 rules in 13 ms. Remains 141 /141 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 255 ms. Remains : 141/459 places, 132/407 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-05 finished in 381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(!p1))||p0))))'
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 448 transition count 396
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 448 transition count 396
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 446 transition count 394
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 446 transition count 394
Applied a total of 26 rules in 30 ms. Remains 446 /459 variables (removed 13) and now considering 394/407 (removed 13) transitions.
// Phase 1: matrix 394 rows 446 cols
[2024-05-25 15:33:06] [INFO ] Computed 90 invariants in 4 ms
[2024-05-25 15:33:07] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-25 15:33:07] [INFO ] Invariant cache hit.
[2024-05-25 15:33:07] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
[2024-05-25 15:33:07] [INFO ] Invariant cache hit.
[2024-05-25 15:33:07] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/459 places, 394/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 955 ms. Remains : 446/459 places, 394/407 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(OR (NEQ s144 1) (NEQ s332 1) (NEQ s443 1)), p1:(OR (AND (EQ s90 1) (EQ s144 1) (EQ s332 1) (EQ s443 1)) (EQ s90 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 424 ms.
Product exploration explored 100000 steps with 33333 reset in 293 ms.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 1021 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 39 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-13-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-13-LTLFireability-06 finished in 1886 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((!p0&&X(G((!p0||G(p1))))))||(!p0&&X(G((!p0||G(p1))))&&F((!p2||G(p0))))))))'
Support contains 6 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Graph (complete) has 1040 edges and 459 vertex of which 458 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 457 transition count 356
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 408 transition count 354
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 406 transition count 354
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 103 place count 406 transition count 254
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 320 place count 289 transition count 254
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 329 place count 280 transition count 245
Iterating global reduction 3 with 9 rules applied. Total rules applied 338 place count 280 transition count 245
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 568 place count 163 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 569 place count 163 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 571 place count 162 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 572 place count 161 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 573 place count 160 transition count 134
Applied a total of 573 rules in 41 ms. Remains 160 /459 variables (removed 299) and now considering 134/407 (removed 273) transitions.
// Phase 1: matrix 134 rows 160 cols
[2024-05-25 15:33:08] [INFO ] Computed 68 invariants in 1 ms
[2024-05-25 15:33:09] [INFO ] Implicit Places using invariants in 167 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 169 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/459 places, 134/407 transitions.
Applied a total of 0 rules in 5 ms. Remains 159 /159 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 215 ms. Remains : 159/459 places, 134/407 transitions.
Stuttering acceptance computed with spot in 270 ms :[p0, false, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={1, 2} source=1 dest: 1}], [{ cond=p0, acceptance={0, 1, 2} source=2 dest: 2}, { cond=(NOT p0), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0, 2} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={1, 2} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={1, 2} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={1} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={1, 2} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s49 1) (EQ s108 1) (EQ s136 1)), p0:(AND (EQ s16 1) (EQ s94 1) (EQ s136 1)), p1:(NEQ s54 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 12176 reset in 414 ms.
Product exploration explored 100000 steps with 12008 reset in 388 ms.
Computed a total of 15 stabilizing places and 12 stable transitions
Computed a total of 15 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 193 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter insensitive) to 6 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 263 ms :[p0, false, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 1244 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 315 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 361 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 316 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 301 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 389 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 364 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 134 rows 159 cols
[2024-05-25 15:33:11] [INFO ] Computed 67 invariants in 1 ms
[2024-05-25 15:33:11] [INFO ] [Real]Absence check using 50 positive place invariants in 19 ms returned sat
[2024-05-25 15:33:11] [INFO ] [Real]Absence check using 50 positive and 17 generalized place invariants in 6 ms returned sat
[2024-05-25 15:33:11] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2024-05-25 15:33:11] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-25 15:33:11] [INFO ] [Nat]Absence check using 50 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-25 15:33:11] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-05-25 15:33:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:33:11] [INFO ] After 191ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2024-05-25 15:33:12] [INFO ] After 320ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 130 ms.
[2024-05-25 15:33:12] [INFO ] After 689ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 114 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=57 )
Parikh walk visited 4 properties in 6 ms.
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 134/134 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 132
Applied a total of 3 rules in 18 ms. Remains 157 /159 variables (removed 2) and now considering 132/134 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 157/159 places, 132/134 transitions.
Incomplete random walk after 10000 steps, including 1400 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 413 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Finished probabilistic random walk after 195 steps, run visited all 1 properties in 8 ms. (steps per millisecond=24 )
Probabilistic random walk after 195 steps, saw 100 distinct states, run finished after 8 ms. (steps per millisecond=24 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p0 p2)), (F (AND (NOT p1) (NOT p0))), (F (AND p1 p0)), (F p2), (F (AND (NOT p0) p2)), (F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 13 factoid took 550 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter insensitive) to 6 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 273 ms :[p0, false, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 261 ms :[p0, false, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 6 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 134/134 transitions.
Applied a total of 0 rules in 4 ms. Remains 159 /159 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2024-05-25 15:33:13] [INFO ] Invariant cache hit.
[2024-05-25 15:33:13] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-25 15:33:13] [INFO ] Invariant cache hit.
[2024-05-25 15:33:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:33:13] [INFO ] Implicit Places using invariants and state equation in 226 ms returned [52, 53, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 79, 81, 83, 85, 87, 89, 91, 93, 101, 103, 105, 107, 109]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 341 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/159 places, 134/134 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 134 transition count 126
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 126 transition count 126
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 123 transition count 121
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 123 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 123 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 24 place count 122 transition count 120
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 42 place count 112 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 44 place count 111 transition count 111
Applied a total of 44 rules in 22 ms. Remains 111 /134 variables (removed 23) and now considering 111/134 (removed 23) transitions.
// Phase 1: matrix 111 rows 111 cols
[2024-05-25 15:33:13] [INFO ] Computed 42 invariants in 3 ms
[2024-05-25 15:33:13] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-25 15:33:13] [INFO ] Invariant cache hit.
[2024-05-25 15:33:13] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-25 15:33:14] [INFO ] Implicit Places using invariants and state equation in 165 ms returned [2, 3, 4, 6, 7, 8, 10, 14, 15, 18, 19, 20, 21, 22, 23, 24, 46, 47]
Discarding 18 places :
Implicit Place search using SMT with State Equation took 257 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/159 places, 111/134 transitions.
Graph (complete) has 359 edges and 93 vertex of which 84 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 75 transition count 71
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 75 transition count 71
Applied a total of 19 rules in 4 ms. Remains 75 /93 variables (removed 18) and now considering 71/111 (removed 40) transitions.
// Phase 1: matrix 71 rows 75 cols
[2024-05-25 15:33:14] [INFO ] Computed 19 invariants in 1 ms
[2024-05-25 15:33:14] [INFO ] Implicit Places using invariants in 46 ms returned [9, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 47 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 72/159 places, 71/134 transitions.
Applied a total of 0 rules in 2 ms. Remains 72 /72 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 680 ms. Remains : 72/159 places, 71/134 transitions.
Computed a total of 10 stabilizing places and 9 stable transitions
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p1 p0))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 169 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter insensitive) to 6 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 309 ms :[p0, false, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 1243 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10000 steps, including 320 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 356 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 313 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 317 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 369 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 359 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 71 rows 72 cols
[2024-05-25 15:33:14] [INFO ] Computed 16 invariants in 1 ms
[2024-05-25 15:33:14] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-25 15:33:14] [INFO ] [Real]Absence check using 12 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 15:33:14] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2024-05-25 15:33:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-25 15:33:14] [INFO ] [Nat]Absence check using 12 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 15:33:15] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-05-25 15:33:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:33:15] [INFO ] After 47ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2024-05-25 15:33:15] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-25 15:33:15] [INFO ] After 279ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 42 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=42 )
Parikh walk visited 4 properties in 1 ms.
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 71/71 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 72 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 71 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 4 place count 70 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 69 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 68 transition count 68
Applied a total of 6 rules in 6 ms. Remains 68 /72 variables (removed 4) and now considering 68/71 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 68/72 places, 68/71 transitions.
Incomplete random walk after 10000 steps, including 1387 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 157 steps, run visited all 1 properties in 5 ms. (steps per millisecond=31 )
Probabilistic random walk after 157 steps, saw 91 distinct states, run finished after 5 ms. (steps per millisecond=31 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p1 p0))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p0 p2)), (F (AND (NOT p1) (NOT p0))), (F (AND p1 p0)), (F p2), (F (AND (NOT p0) p2)), (F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 13 factoid took 578 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter insensitive) to 6 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 394 ms :[p0, false, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 372 ms :[p0, false, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 435 ms :[p0, false, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 12255 reset in 278 ms.
Product exploration explored 100000 steps with 12203 reset in 169 ms.
Built C files in :
/tmp/ltsmin8691549218709470590
[2024-05-25 15:33:17] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2024-05-25 15:33:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:33:17] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2024-05-25 15:33:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:33:17] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2024-05-25 15:33:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:33:17] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8691549218709470590
Running compilation step : cd /tmp/ltsmin8691549218709470590;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 393 ms.
Running link step : cd /tmp/ltsmin8691549218709470590;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin8691549218709470590;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12796968210150741765.hoa' '--buchi-type=spotba'
LTSmin run took 337 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-13-LTLFireability-07 finished in 9596 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p1 U (p2||G(p1))))))'
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 449 transition count 397
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 449 transition count 397
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 447 transition count 395
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 447 transition count 395
Applied a total of 24 rules in 53 ms. Remains 447 /459 variables (removed 12) and now considering 395/407 (removed 12) transitions.
// Phase 1: matrix 395 rows 447 cols
[2024-05-25 15:33:18] [INFO ] Computed 90 invariants in 8 ms
[2024-05-25 15:33:18] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-25 15:33:18] [INFO ] Invariant cache hit.
[2024-05-25 15:33:19] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
[2024-05-25 15:33:19] [INFO ] Invariant cache hit.
[2024-05-25 15:33:19] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/459 places, 395/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1279 ms. Remains : 447/459 places, 395/407 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (NEQ s346 1) (NEQ s112 1)), p1:(NEQ s112 1), p0:(OR (EQ s145 0) (EQ s402 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 712 reset in 218 ms.
Product exploration explored 100000 steps with 713 reset in 260 ms.
Computed a total of 119 stabilizing places and 112 stable transitions
Graph (complete) has 1022 edges and 447 vertex of which 446 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 119 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p0))), true, (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 186 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-25 15:33:21] [INFO ] Invariant cache hit.
[2024-05-25 15:33:21] [INFO ] [Real]Absence check using 52 positive place invariants in 15 ms returned sat
[2024-05-25 15:33:21] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 12 ms returned sat
[2024-05-25 15:33:21] [INFO ] After 155ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-25 15:33:21] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 4 ms to minimize.
[2024-05-25 15:33:21] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 13 ms to minimize.
[2024-05-25 15:33:21] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2024-05-25 15:33:21] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2024-05-25 15:33:21] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2024-05-25 15:33:21] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-05-25 15:33:22] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-25 15:33:22] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 0 ms to minimize.
[2024-05-25 15:33:22] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 0 ms to minimize.
[2024-05-25 15:33:22] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 881 ms
[2024-05-25 15:33:22] [INFO ] After 1051ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 15:33:22] [INFO ] After 1188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 15:33:22] [INFO ] [Nat]Absence check using 52 positive place invariants in 21 ms returned sat
[2024-05-25 15:33:22] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 18 ms returned sat
[2024-05-25 15:33:22] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-25 15:33:23] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-05-25 15:33:23] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2024-05-25 15:33:23] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 0 ms to minimize.
[2024-05-25 15:33:23] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 1 ms to minimize.
[2024-05-25 15:33:23] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 1 ms to minimize.
[2024-05-25 15:33:23] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 0 ms to minimize.
[2024-05-25 15:33:23] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2024-05-25 15:33:24] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 1 ms to minimize.
[2024-05-25 15:33:24] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 2 ms to minimize.
[2024-05-25 15:33:24] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1319 ms
[2024-05-25 15:33:24] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 0 ms to minimize.
[2024-05-25 15:33:24] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2024-05-25 15:33:24] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 1 ms to minimize.
[2024-05-25 15:33:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 444 ms
[2024-05-25 15:33:24] [INFO ] After 2193ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-25 15:33:24] [INFO ] After 2482ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 395/395 transitions.
Graph (trivial) has 200 edges and 447 vertex of which 6 / 447 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1015 edges and 442 vertex of which 441 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 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 441 transition count 342
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 396 transition count 342
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 92 place count 396 transition count 249
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 294 place count 287 transition count 249
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 534 place count 165 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 536 place count 164 transition count 135
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 538 place count 164 transition count 133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 540 place count 162 transition count 133
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 545 place count 162 transition count 133
Applied a total of 545 rules in 37 ms. Remains 162 /447 variables (removed 285) and now considering 133/395 (removed 262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 162/447 places, 133/395 transitions.
Incomplete random walk after 10000 steps, including 409 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :3
Finished Best-First random walk after 232 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=232 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p0))), true, (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X p0)), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (NOT p0)), (F (AND p0 (NOT p2) p1)), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT p2)), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) p1))]
Knowledge based reduction with 21 factoid took 760 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 239 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 395/395 transitions.
Applied a total of 0 rules in 7 ms. Remains 447 /447 variables (removed 0) and now considering 395/395 (removed 0) transitions.
[2024-05-25 15:33:26] [INFO ] Invariant cache hit.
[2024-05-25 15:33:26] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-25 15:33:26] [INFO ] Invariant cache hit.
[2024-05-25 15:33:26] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
[2024-05-25 15:33:26] [INFO ] Invariant cache hit.
[2024-05-25 15:33:27] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 975 ms. Remains : 447/447 places, 395/395 transitions.
Computed a total of 119 stabilizing places and 112 stable transitions
Graph (complete) has 1022 edges and 447 vertex of which 446 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 119 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 175 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 70 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 15:33:27] [INFO ] Invariant cache hit.
[2024-05-25 15:33:27] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 15:33:27] [INFO ] [Nat]Absence check using 52 positive place invariants in 14 ms returned sat
[2024-05-25 15:33:27] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 11 ms returned sat
[2024-05-25 15:33:28] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 15:33:28] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2024-05-25 15:33:28] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2024-05-25 15:33:28] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 0 ms to minimize.
[2024-05-25 15:33:28] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2024-05-25 15:33:28] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2024-05-25 15:33:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 645 ms
[2024-05-25 15:33:28] [INFO ] After 1006ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 97 ms.
[2024-05-25 15:33:29] [INFO ] After 1256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 395/395 transitions.
Graph (trivial) has 200 edges and 447 vertex of which 6 / 447 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1015 edges and 442 vertex of which 441 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 441 transition count 342
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 396 transition count 342
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 92 place count 396 transition count 249
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 294 place count 287 transition count 249
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 534 place count 165 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 536 place count 164 transition count 135
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 538 place count 164 transition count 133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 540 place count 162 transition count 133
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 545 place count 162 transition count 133
Applied a total of 545 rules in 36 ms. Remains 162 /447 variables (removed 285) and now considering 133/395 (removed 262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 162/447 places, 133/395 transitions.
Incomplete random walk after 10000 steps, including 397 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :3
Finished Best-First random walk after 128 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=128 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (AND p0 (NOT p2) p1)), (F (NOT p2)), (F (AND (NOT p2) p1)), (F (NOT p0)), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 18 factoid took 571 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 712 reset in 229 ms.
Product exploration explored 100000 steps with 715 reset in 234 ms.
Built C files in :
/tmp/ltsmin6538974099213315989
[2024-05-25 15:33:31] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6538974099213315989
Running compilation step : cd /tmp/ltsmin6538974099213315989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 841 ms.
Running link step : cd /tmp/ltsmin6538974099213315989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin6538974099213315989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10002348518762592198.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 395/395 transitions.
Applied a total of 0 rules in 9 ms. Remains 447 /447 variables (removed 0) and now considering 395/395 (removed 0) transitions.
[2024-05-25 15:33:46] [INFO ] Invariant cache hit.
[2024-05-25 15:33:46] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-25 15:33:46] [INFO ] Invariant cache hit.
[2024-05-25 15:33:47] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
[2024-05-25 15:33:47] [INFO ] Invariant cache hit.
[2024-05-25 15:33:47] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1153 ms. Remains : 447/447 places, 395/395 transitions.
Built C files in :
/tmp/ltsmin14016427314397283810
[2024-05-25 15:33:47] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14016427314397283810
Running compilation step : cd /tmp/ltsmin14016427314397283810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 703 ms.
Running link step : cd /tmp/ltsmin14016427314397283810;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin14016427314397283810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6397436528958023859.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 15:34:02] [INFO ] Flatten gal took : 34 ms
[2024-05-25 15:34:02] [INFO ] Flatten gal took : 31 ms
[2024-05-25 15:34:02] [INFO ] Time to serialize gal into /tmp/LTL12634028122574789581.gal : 11 ms
[2024-05-25 15:34:02] [INFO ] Time to serialize properties into /tmp/LTL18295627935586018681.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12634028122574789581.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5409635338252777240.hoa' '-atoms' '/tmp/LTL18295627935586018681.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18295627935586018681.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5409635338252777240.hoa
Detected timeout of ITS tools.
[2024-05-25 15:34:17] [INFO ] Flatten gal took : 19 ms
[2024-05-25 15:34:17] [INFO ] Flatten gal took : 19 ms
[2024-05-25 15:34:17] [INFO ] Time to serialize gal into /tmp/LTL5123435101523562756.gal : 4 ms
[2024-05-25 15:34:17] [INFO ] Time to serialize properties into /tmp/LTL10876526910874916070.ltl : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5123435101523562756.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10876526910874916070.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X("((p173==0)||(p538==0))"))||(("(p132!=1)")U(("((p413!=1)&&(p132!=1))")||(G("(p132!=1)")))))))
Formula 0 simplified : F(X!"((p173==0)||(p538==0))" & (!"(p132!=1)" M !"((p413!=1)&&(p132!=1))"))
Detected timeout of ITS tools.
[2024-05-25 15:34:33] [INFO ] Flatten gal took : 18 ms
[2024-05-25 15:34:33] [INFO ] Applying decomposition
[2024-05-25 15:34:33] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5564798955045207924.txt' '-o' '/tmp/graph5564798955045207924.bin' '-w' '/tmp/graph5564798955045207924.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5564798955045207924.bin' '-l' '-1' '-v' '-w' '/tmp/graph5564798955045207924.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:34:33] [INFO ] Decomposing Gal with order
[2024-05-25 15:34:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:34:33] [INFO ] Removed a total of 262 redundant transitions.
[2024-05-25 15:34:33] [INFO ] Flatten gal took : 156 ms
[2024-05-25 15:34:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 29 ms.
[2024-05-25 15:34:33] [INFO ] Time to serialize gal into /tmp/LTL4089190967375707157.gal : 8 ms
[2024-05-25 15:34:33] [INFO ] Time to serialize properties into /tmp/LTL3441867294034213493.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4089190967375707157.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3441867294034213493.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((X("((i16.i2.u51.p173==0)||(i16.i2.u138.p538==0))"))||(("(i0.i1.u40.p132!=1)")U(("((i9.i3.u115.p413!=1)&&(i0.i1.u40.p132!=1))")||...186
Formula 0 simplified : F(X!"((i16.i2.u51.p173==0)||(i16.i2.u138.p538==0))" & (!"(i0.i1.u40.p132!=1)" M !"((i9.i3.u115.p413!=1)&&(i0.i1.u40.p132!=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin398192931607433568
[2024-05-25 15:34:48] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin398192931607433568
Running compilation step : cd /tmp/ltsmin398192931607433568;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 682 ms.
Running link step : cd /tmp/ltsmin398192931607433568;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin398192931607433568;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true))||((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-13-LTLFireability-08 finished in 105250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 449 transition count 397
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 449 transition count 397
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 447 transition count 395
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 447 transition count 395
Applied a total of 24 rules in 18 ms. Remains 447 /459 variables (removed 12) and now considering 395/407 (removed 12) transitions.
// Phase 1: matrix 395 rows 447 cols
[2024-05-25 15:35:03] [INFO ] Computed 90 invariants in 3 ms
[2024-05-25 15:35:03] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-25 15:35:03] [INFO ] Invariant cache hit.
[2024-05-25 15:35:04] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2024-05-25 15:35:04] [INFO ] Invariant cache hit.
[2024-05-25 15:35:04] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/459 places, 395/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 939 ms. Remains : 447/459 places, 395/407 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-10 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:(NEQ s306 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]]
Product exploration explored 100000 steps with 717 reset in 326 ms.
Product exploration explored 100000 steps with 718 reset in 268 ms.
Computed a total of 119 stabilizing places and 112 stable transitions
Graph (complete) has 1022 edges and 447 vertex of which 446 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 119 stabilizing places and 112 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 22653 steps, run visited all 1 properties in 120 ms. (steps per millisecond=188 )
Probabilistic random walk after 22653 steps, saw 9754 distinct states, run finished after 121 ms. (steps per millisecond=187 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-13-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-13-LTLFireability-10 finished in 2187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Graph (trivial) has 214 edges and 459 vertex of which 6 / 459 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1034 edges and 454 vertex of which 453 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 452 transition count 349
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 402 transition count 349
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 102 place count 402 transition count 251
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 315 place count 287 transition count 251
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 325 place count 277 transition count 241
Iterating global reduction 2 with 10 rules applied. Total rules applied 335 place count 277 transition count 241
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 563 place count 161 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 565 place count 160 transition count 133
Applied a total of 565 rules in 29 ms. Remains 160 /459 variables (removed 299) and now considering 133/407 (removed 274) transitions.
// Phase 1: matrix 133 rows 160 cols
[2024-05-25 15:35:05] [INFO ] Computed 69 invariants in 1 ms
[2024-05-25 15:35:06] [INFO ] Implicit Places using invariants in 358 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 47, 48, 49, 53]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 372 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/459 places, 133/407 transitions.
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 407 ms. Remains : 142/459 places, 133/407 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s11 1) (EQ s34 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-13-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-11 finished in 482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 449 transition count 397
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 449 transition count 397
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 447 transition count 395
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 447 transition count 395
Applied a total of 24 rules in 53 ms. Remains 447 /459 variables (removed 12) and now considering 395/407 (removed 12) transitions.
// Phase 1: matrix 395 rows 447 cols
[2024-05-25 15:35:06] [INFO ] Computed 90 invariants in 3 ms
[2024-05-25 15:35:06] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-25 15:35:06] [INFO ] Invariant cache hit.
[2024-05-25 15:35:07] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
[2024-05-25 15:35:07] [INFO ] Invariant cache hit.
[2024-05-25 15:35:07] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/459 places, 395/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 936 ms. Remains : 447/459 places, 395/407 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s293 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-14 finished in 1056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Graph (trivial) has 214 edges and 459 vertex of which 6 / 459 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 1034 edges and 454 vertex of which 453 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 452 transition count 348
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 401 transition count 348
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 104 place count 401 transition count 251
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 315 place count 287 transition count 251
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 323 place count 279 transition count 243
Iterating global reduction 2 with 8 rules applied. Total rules applied 331 place count 279 transition count 243
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 559 place count 163 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 561 place count 162 transition count 135
Applied a total of 561 rules in 30 ms. Remains 162 /459 variables (removed 297) and now considering 135/407 (removed 272) transitions.
// Phase 1: matrix 135 rows 162 cols
[2024-05-25 15:35:07] [INFO ] Computed 69 invariants in 1 ms
[2024-05-25 15:35:07] [INFO ] Implicit Places using invariants in 194 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 46, 47, 48, 49, 50]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 236 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/459 places, 135/407 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 273 ms. Remains : 143/459 places, 135/407 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s63 1) (OR (EQ s103 1) (EQ s34 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-13-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-15 finished in 324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p1 U (p2||G(p1))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-13-LTLFireability-08
Stuttering acceptance computed with spot in 183 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Graph (trivial) has 212 edges and 459 vertex of which 6 / 459 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1034 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 452 transition count 348
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 401 transition count 348
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 104 place count 401 transition count 253
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 310 place count 290 transition count 253
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 319 place count 281 transition count 244
Iterating global reduction 2 with 9 rules applied. Total rules applied 328 place count 281 transition count 244
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 556 place count 165 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 558 place count 164 transition count 136
Applied a total of 558 rules in 37 ms. Remains 164 /459 variables (removed 295) and now considering 136/407 (removed 271) transitions.
// Phase 1: matrix 136 rows 164 cols
[2024-05-25 15:35:08] [INFO ] Computed 70 invariants in 4 ms
[2024-05-25 15:35:08] [INFO ] Implicit Places using invariants in 163 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 23, 24, 25, 50, 51, 52, 53, 54]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 165 ms to find 18 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 146/459 places, 136/407 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 205 ms. Remains : 146/459 places, 136/407 transitions.
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (NEQ s92 1) (NEQ s11 1)), p1:(NEQ s11 1), p0:(OR (EQ s17 0) (EQ s117 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 21738 reset in 254 ms.
Product exploration explored 100000 steps with 21667 reset in 241 ms.
Computed a total of 13 stabilizing places and 11 stable transitions
Computed a total of 13 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p0))), true, (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 212 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2476 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 785 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 757 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 747 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 759 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 712 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 136 rows 146 cols
[2024-05-25 15:35:09] [INFO ] Computed 52 invariants in 2 ms
[2024-05-25 15:35:09] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-25 15:35:09] [INFO ] [Real]Absence check using 33 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-25 15:35:09] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 15:35:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-25 15:35:09] [INFO ] [Nat]Absence check using 33 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-25 15:35:09] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-25 15:35:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:35:09] [INFO ] After 32ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2024-05-25 15:35:09] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-25 15:35:09] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 31 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 3 properties in 1 ms.
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 136/136 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 146 transition count 135
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 146 transition count 133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 144 transition count 133
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 144 transition count 133
Applied a total of 10 rules in 25 ms. Remains 144 /146 variables (removed 2) and now considering 133/136 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 144/146 places, 133/136 transitions.
Incomplete random walk after 10000 steps, including 411 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished Best-First random walk after 192 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=96 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p0))), true, (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (NOT p0)), (F (AND p0 (NOT p2) p1)), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT p2)), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p0) (NOT p2) (NOT p1)))]
Knowledge based reduction with 20 factoid took 697 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 188 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 136/136 transitions.
Applied a total of 0 rules in 1 ms. Remains 146 /146 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2024-05-25 15:35:10] [INFO ] Invariant cache hit.
[2024-05-25 15:35:10] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-25 15:35:10] [INFO ] Invariant cache hit.
[2024-05-25 15:35:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:35:11] [INFO ] Implicit Places using invariants and state equation in 199 ms returned [1, 3, 7, 10, 13, 38, 39, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 64, 66, 68, 70, 72, 74, 76, 78, 86, 88, 90, 94, 95]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 296 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/146 places, 136/136 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 111 transition count 130
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 111 transition count 130
Applied a total of 8 rules in 3 ms. Remains 111 /115 variables (removed 4) and now considering 130/136 (removed 6) transitions.
// Phase 1: matrix 130 rows 111 cols
[2024-05-25 15:35:11] [INFO ] Computed 23 invariants in 1 ms
[2024-05-25 15:35:11] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-25 15:35:11] [INFO ] Invariant cache hit.
[2024-05-25 15:35:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 15:35:11] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/146 places, 130/136 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 508 ms. Remains : 111/146 places, 130/136 transitions.
Computed a total of 7 stabilizing places and 8 stable transitions
Graph (complete) has 364 edges and 111 vertex of which 97 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), true, (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 173 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2466 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 762 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 769 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 770 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 770 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 726 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-25 15:35:11] [INFO ] Invariant cache hit.
[2024-05-25 15:35:11] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-25 15:35:11] [INFO ] [Real]Absence check using 7 positive and 16 generalized place invariants in 2 ms returned sat
[2024-05-25 15:35:11] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 15:35:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-25 15:35:11] [INFO ] [Nat]Absence check using 7 positive and 16 generalized place invariants in 2 ms returned sat
[2024-05-25 15:35:11] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-25 15:35:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 15:35:11] [INFO ] After 20ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2024-05-25 15:35:11] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-25 15:35:11] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 32 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 3 properties in 0 ms.
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 130/130 transitions.
Graph (complete) has 350 edges and 111 vertex of which 100 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 100 transition count 114
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 90 transition count 114
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 31 place count 81 transition count 78
Iterating global reduction 2 with 9 rules applied. Total rules applied 40 place count 81 transition count 78
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 61 place count 70 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 63 place count 69 transition count 67
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 69 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 67 transition count 65
Applied a total of 67 rules in 6 ms. Remains 67 /111 variables (removed 44) and now considering 65/130 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 67/111 places, 65/130 transitions.
Incomplete random walk after 10000 steps, including 659 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished Best-First random walk after 81 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=81 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), true, (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (NOT p0)), (F (AND p0 (NOT p2) p1)), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT p2)), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p0) (NOT p2) (NOT p1)))]
Knowledge based reduction with 20 factoid took 568 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 158 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 21791 reset in 118 ms.
Product exploration explored 100000 steps with 21634 reset in 120 ms.
Built C files in :
/tmp/ltsmin10611578300806360001
[2024-05-25 15:35:13] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10611578300806360001
Running compilation step : cd /tmp/ltsmin10611578300806360001;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 297 ms.
Running link step : cd /tmp/ltsmin10611578300806360001;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin10611578300806360001;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased94391849185317928.hoa' '--buchi-type=spotba'
LTSmin run took 1146 ms.
Treatment of property BusinessProcesses-PT-13-LTLFireability-08 finished in 7184 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-08 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-25 15:35:14] [INFO ] Flatten gal took : 29 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 145061 ms.

BK_STOP 1716651315151

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-13"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is BusinessProcesses-PT-13, 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 r065-tajo-171620414900343"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-13.tgz
mv BusinessProcesses-PT-13 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 ;