Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 7.6K Apr 29 23:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 23:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 29 23:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 29 23:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 157K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652634721143

Running Version 202205111006
[2022-05-15 17:12:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 17:12:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 17:12:02] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2022-05-15 17:12:02] [INFO ] Transformed 630 places.
[2022-05-15 17:12:02] [INFO ] Transformed 566 transitions.
[2022-05-15 17:12:02] [INFO ] Found NUPN structural information;
[2022-05-15 17:12:02] [INFO ] Parsed PT model containing 630 places and 566 transitions in 232 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 623 transition count 562
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 89 place count 537 transition count 476
Iterating global reduction 1 with 86 rules applied. Total rules applied 175 place count 537 transition count 476
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 218 place count 494 transition count 433
Iterating global reduction 1 with 43 rules applied. Total rules applied 261 place count 494 transition count 433
Applied a total of 261 rules in 118 ms. Remains 494 /626 variables (removed 132) and now considering 433/562 (removed 129) transitions.
// Phase 1: matrix 433 rows 494 cols
[2022-05-15 17:12:02] [INFO ] Computed 99 place invariants in 31 ms
[2022-05-15 17:12:03] [INFO ] Implicit Places using invariants in 373 ms returned []
// Phase 1: matrix 433 rows 494 cols
[2022-05-15 17:12:03] [INFO ] Computed 99 place invariants in 12 ms
[2022-05-15 17:12:03] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 972 ms to find 0 implicit places.
// Phase 1: matrix 433 rows 494 cols
[2022-05-15 17:12:03] [INFO ] Computed 99 place invariants in 11 ms
[2022-05-15 17:12:04] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 494/626 places, 433/562 transitions.
Finished structural reductions, in 1 iterations. Remains : 494/626 places, 433/562 transitions.
Support contains 39 out of 494 places after structural reductions.
[2022-05-15 17:12:04] [INFO ] Flatten gal took : 63 ms
[2022-05-15 17:12:04] [INFO ] Flatten gal took : 31 ms
[2022-05-15 17:12:04] [INFO ] Input system was already deterministic with 433 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 521 ms. (steps per millisecond=19 ) properties (out of 27) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 433 rows 494 cols
[2022-05-15 17:12:06] [INFO ] Computed 99 place invariants in 3 ms
[2022-05-15 17:12:06] [INFO ] [Real]Absence check using 58 positive place invariants in 60 ms returned sat
[2022-05-15 17:12:06] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 15 ms returned sat
[2022-05-15 17:12:06] [INFO ] After 501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-15 17:12:07] [INFO ] [Nat]Absence check using 58 positive place invariants in 31 ms returned sat
[2022-05-15 17:12:07] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 24 ms returned sat
[2022-05-15 17:12:07] [INFO ] After 614ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :13
[2022-05-15 17:12:08] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 4 ms to minimize.
[2022-05-15 17:12:08] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2022-05-15 17:12:08] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2022-05-15 17:12:08] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2022-05-15 17:12:08] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
[2022-05-15 17:12:08] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 0 ms to minimize.
[2022-05-15 17:12:08] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 0 ms to minimize.
[2022-05-15 17:12:08] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2022-05-15 17:12:08] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2022-05-15 17:12:08] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2022-05-15 17:12:09] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2022-05-15 17:12:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1164 ms
[2022-05-15 17:12:09] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 0 ms to minimize.
[2022-05-15 17:12:09] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2022-05-15 17:12:09] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2022-05-15 17:12:09] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2022-05-15 17:12:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 380 ms
[2022-05-15 17:12:09] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 0 ms to minimize.
[2022-05-15 17:12:09] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 1 ms to minimize.
[2022-05-15 17:12:09] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 1 ms to minimize.
[2022-05-15 17:12:10] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 1 ms to minimize.
[2022-05-15 17:12:10] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 1 ms to minimize.
[2022-05-15 17:12:10] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2022-05-15 17:12:10] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 1 ms to minimize.
[2022-05-15 17:12:10] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 0 ms to minimize.
[2022-05-15 17:12:10] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 1 ms to minimize.
[2022-05-15 17:12:10] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 0 ms to minimize.
[2022-05-15 17:12:10] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2022-05-15 17:12:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1538 ms
[2022-05-15 17:12:11] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 1 ms to minimize.
[2022-05-15 17:12:11] [INFO ] Deduced a trap composed of 84 places in 147 ms of which 1 ms to minimize.
[2022-05-15 17:12:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 421 ms
[2022-05-15 17:12:11] [INFO ] After 4648ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :11
Attempting to minimize the solution found.
Minimization took 307 ms.
[2022-05-15 17:12:12] [INFO ] After 5366ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :11
Fused 15 Parikh solutions to 10 different solutions.
Parikh walk visited 1 properties in 131 ms.
Support contains 16 out of 494 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 494/494 places, 433/433 transitions.
Graph (complete) has 1116 edges and 494 vertex of which 493 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 493 transition count 386
Reduce places removed 46 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 49 rules applied. Total rules applied 96 place count 447 transition count 383
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 99 place count 444 transition count 383
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 99 place count 444 transition count 277
Deduced a syphon composed of 106 places in 3 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 331 place count 318 transition count 277
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 336 place count 313 transition count 272
Iterating global reduction 3 with 5 rules applied. Total rules applied 341 place count 313 transition count 272
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 591 place count 187 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 592 place count 187 transition count 147
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 594 place count 186 transition count 151
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 599 place count 186 transition count 151
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 600 place count 185 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 601 place count 184 transition count 150
Applied a total of 601 rules in 98 ms. Remains 184 /494 variables (removed 310) and now considering 150/433 (removed 283) transitions.
Finished structural reductions, in 1 iterations. Remains : 184/494 places, 150/433 transitions.
Incomplete random walk after 10000 steps, including 871 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 166 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 163 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 203 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 204 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 203 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 211 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 187 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 216 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 176 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 213 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Finished probabilistic random walk after 9668 steps, run visited all 10 properties in 48 ms. (steps per millisecond=201 )
Probabilistic random walk after 9668 steps, saw 2456 distinct states, run finished after 48 ms. (steps per millisecond=201 ) properties seen :10
FORMULA BusinessProcesses-PT-15-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-15-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 212 stabilizing places and 184 stable transitions
Graph (complete) has 1116 edges and 494 vertex of which 493 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)&&p1))||(F(p2) U p2)))'
Support contains 4 out of 494 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 494/494 places, 433/433 transitions.
Graph (complete) has 1116 edges and 494 vertex of which 493 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 53 place count 492 transition count 379
Reduce places removed 52 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 107 place count 440 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 109 place count 438 transition count 377
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 107 Pre rules applied. Total rules applied 109 place count 438 transition count 270
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 343 place count 311 transition count 270
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 350 place count 304 transition count 263
Iterating global reduction 3 with 7 rules applied. Total rules applied 357 place count 304 transition count 263
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 615 place count 173 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 616 place count 173 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 618 place count 172 transition count 139
Applied a total of 618 rules in 52 ms. Remains 172 /494 variables (removed 322) and now considering 139/433 (removed 294) transitions.
// Phase 1: matrix 139 rows 172 cols
[2022-05-15 17:12:13] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-15 17:12:13] [INFO ] Implicit Places using invariants in 122 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 41, 42, 43, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 125 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/494 places, 139/433 transitions.
Applied a total of 0 rules in 6 ms. Remains 150 /150 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 150/494 places, 139/433 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s120 1), p1:(OR (EQ s26 0) (EQ s74 0) (EQ s127 0)), p0:(AND (EQ s26 1) (EQ s74 1) (EQ s127 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, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-00 finished in 470 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 4 out of 494 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 494/494 places, 433/433 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 486 transition count 425
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 486 transition count 425
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 484 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 484 transition count 423
Applied a total of 20 rules in 27 ms. Remains 484 /494 variables (removed 10) and now considering 423/433 (removed 10) transitions.
// Phase 1: matrix 423 rows 484 cols
[2022-05-15 17:12:14] [INFO ] Computed 99 place invariants in 3 ms
[2022-05-15 17:12:14] [INFO ] Implicit Places using invariants in 232 ms returned []
// Phase 1: matrix 423 rows 484 cols
[2022-05-15 17:12:14] [INFO ] Computed 99 place invariants in 6 ms
[2022-05-15 17:12:14] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
// Phase 1: matrix 423 rows 484 cols
[2022-05-15 17:12:14] [INFO ] Computed 99 place invariants in 8 ms
[2022-05-15 17:12:15] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 484/494 places, 423/433 transitions.
Finished structural reductions, in 1 iterations. Remains : 484/494 places, 423/433 transitions.
Stuttering acceptance computed with spot in 413 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s159 1), p1:(AND (EQ s452 1) (EQ s455 1) (EQ s458 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-01 finished in 1482 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((false U p0))))'
Support contains 1 out of 494 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 494/494 places, 433/433 transitions.
Graph (trivial) has 231 edges and 494 vertex of which 6 / 494 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1110 edges and 489 vertex of which 488 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 487 transition count 372
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 434 transition count 372
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 108 place count 434 transition count 266
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 340 place count 308 transition count 266
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 347 place count 301 transition count 259
Iterating global reduction 2 with 7 rules applied. Total rules applied 354 place count 301 transition count 259
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 610 place count 171 transition count 133
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 612 place count 170 transition count 137
Applied a total of 612 rules in 47 ms. Remains 170 /494 variables (removed 324) and now considering 137/433 (removed 296) transitions.
// Phase 1: matrix 137 rows 170 cols
[2022-05-15 17:12:15] [INFO ] Computed 75 place invariants in 4 ms
[2022-05-15 17:12:15] [INFO ] Implicit Places using invariants in 112 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 40, 41, 42, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 114 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/494 places, 137/433 transitions.
Applied a total of 0 rules in 6 ms. Remains 148 /148 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 148/494 places, 137/433 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-02 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 s114 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-15-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-02 finished in 217 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 494 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 494/494 places, 433/433 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 487 transition count 426
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 487 transition count 426
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 485 transition count 424
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 485 transition count 424
Applied a total of 18 rules in 36 ms. Remains 485 /494 variables (removed 9) and now considering 424/433 (removed 9) transitions.
// Phase 1: matrix 424 rows 485 cols
[2022-05-15 17:12:15] [INFO ] Computed 99 place invariants in 9 ms
[2022-05-15 17:12:16] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 424 rows 485 cols
[2022-05-15 17:12:16] [INFO ] Computed 99 place invariants in 11 ms
[2022-05-15 17:12:16] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
// Phase 1: matrix 424 rows 485 cols
[2022-05-15 17:12:16] [INFO ] Computed 99 place invariants in 4 ms
[2022-05-15 17:12:16] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 485/494 places, 424/433 transitions.
Finished structural reductions, in 1 iterations. Remains : 485/494 places, 424/433 transitions.
Stuttering acceptance computed with spot in 1373 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s211 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 159 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-03 finished in 2438 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(!(!(F(X(X(p0)))||p1) U p2)))))'
Support contains 2 out of 494 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 494/494 places, 433/433 transitions.
Graph (trivial) has 230 edges and 494 vertex of which 6 / 494 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 1110 edges and 489 vertex of which 488 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 487 transition count 372
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 434 transition count 372
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 108 place count 434 transition count 268
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 336 place count 310 transition count 268
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 342 place count 304 transition count 262
Iterating global reduction 2 with 6 rules applied. Total rules applied 348 place count 304 transition count 262
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 608 place count 172 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 610 place count 171 transition count 138
Applied a total of 610 rules in 39 ms. Remains 171 /494 variables (removed 323) and now considering 138/433 (removed 295) transitions.
// Phase 1: matrix 138 rows 171 cols
[2022-05-15 17:12:18] [INFO ] Computed 75 place invariants in 3 ms
[2022-05-15 17:12:18] [INFO ] Implicit Places using invariants in 121 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 40, 41, 42, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 124 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/494 places, 138/433 transitions.
Applied a total of 0 rules in 5 ms. Remains 149 /149 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 149/494 places, 138/433 transitions.
Stuttering acceptance computed with spot in 35 ms :[p2]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(AND (EQ s94 1) (EQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15130 reset in 426 ms.
Product exploration explored 100000 steps with 15112 reset in 236 ms.
Computed a total of 33 stabilizing places and 25 stable transitions
Computed a total of 33 stabilizing places and 25 stable transitions
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 316 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[p2]
Incomplete random walk after 10000 steps, including 1657 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 524 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 125 steps, run visited all 1 properties in 3 ms. (steps per millisecond=41 )
Probabilistic random walk after 125 steps, saw 87 distinct states, run finished after 3 ms. (steps per millisecond=41 ) properties seen :1
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 1231 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 52 ms :[p2]
Stuttering acceptance computed with spot in 38 ms :[p2]
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 138/138 transitions.
Applied a total of 0 rules in 7 ms. Remains 149 /149 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 149 cols
[2022-05-15 17:12:20] [INFO ] Computed 53 place invariants in 3 ms
[2022-05-15 17:12:20] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 138 rows 149 cols
[2022-05-15 17:12:20] [INFO ] Computed 53 place invariants in 2 ms
[2022-05-15 17:12:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 17:12:21] [INFO ] Implicit Places using invariants and state equation in 183 ms returned [3, 25, 27, 33, 35, 37, 39, 41, 43, 45, 52, 54, 60, 62, 64, 66, 68, 70, 72, 74, 79, 81, 83, 85, 87, 89, 95, 97]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 268 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/149 places, 138/138 transitions.
Graph (complete) has 396 edges and 121 vertex of which 112 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
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 112 transition count 123
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 101 transition count 123
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 35 place count 89 transition count 83
Iterating global reduction 2 with 12 rules applied. Total rules applied 47 place count 89 transition count 83
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 89 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 87 transition count 81
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 53 place count 85 transition count 79
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 85 transition count 79
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 67 place count 79 transition count 73
Applied a total of 67 rules in 11 ms. Remains 79 /121 variables (removed 42) and now considering 73/138 (removed 65) transitions.
// Phase 1: matrix 73 rows 79 cols
[2022-05-15 17:12:21] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-15 17:12:21] [INFO ] Implicit Places using invariants in 57 ms returned [3, 4, 5, 10, 78]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 57 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/149 places, 73/138 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 72 transition count 71
Applied a total of 4 rules in 13 ms. Remains 72 /74 variables (removed 2) and now considering 71/73 (removed 2) transitions.
// Phase 1: matrix 71 rows 72 cols
[2022-05-15 17:12:21] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-15 17:12:21] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 71 rows 72 cols
[2022-05-15 17:12:21] [INFO ] Computed 15 place invariants in 3 ms
[2022-05-15 17:12:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 17:12:21] [INFO ] Implicit Places using invariants and state equation in 82 ms returned [5, 13, 19, 21]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 129 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 68/149 places, 71/138 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 3 place count 68 transition count 68
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 65 transition count 68
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 63 transition count 65
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 63 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 63 transition count 64
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 34 place count 49 transition count 55
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 37 place count 46 transition count 52
Iterating global reduction 3 with 3 rules applied. Total rules applied 40 place count 46 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 41 place count 46 transition count 51
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 43 place count 45 transition count 50
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 45 place count 45 transition count 48
Applied a total of 45 rules in 30 ms. Remains 45 /68 variables (removed 23) and now considering 48/71 (removed 23) transitions.
// Phase 1: matrix 48 rows 45 cols
[2022-05-15 17:12:21] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 17:12:21] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 48 rows 45 cols
[2022-05-15 17:12:21] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 17:12:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 17:12:21] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 45/149 places, 48/138 transitions.
Finished structural reductions, in 4 iterations. Remains : 45/149 places, 48/138 transitions.
Computed a total of 14 stabilizing places and 15 stable transitions
Computed a total of 14 stabilizing places and 15 stable transitions
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 362 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[p2]
Incomplete random walk after 10000 steps, including 1671 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 528 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 88 steps, run visited all 1 properties in 3 ms. (steps per millisecond=29 )
Probabilistic random walk after 88 steps, saw 61 distinct states, run finished after 4 ms. (steps per millisecond=22 ) properties seen :1
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[p2]
Stuttering acceptance computed with spot in 29 ms :[p2]
Stuttering acceptance computed with spot in 31 ms :[p2]
Product exploration explored 100000 steps with 15306 reset in 80 ms.
Product exploration explored 100000 steps with 15285 reset in 87 ms.
Built C files in :
/tmp/ltsmin9116152800583214614
[2022-05-15 17:12:22] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2022-05-15 17:12:22] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:12:22] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2022-05-15 17:12:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:12:22] [INFO ] Computing Do-Not-Accords matrix : 48 transitions.
[2022-05-15 17:12:22] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:12:22] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9116152800583214614
Running compilation step : cd /tmp/ltsmin9116152800583214614;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 229 ms.
Running link step : cd /tmp/ltsmin9116152800583214614;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin9116152800583214614;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14290136699338445019.hoa' '--buchi-type=spotba'
LTSmin run took 82 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-15-LTLFireability-04 finished in 4472 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 494 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 494/494 places, 433/433 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 486 transition count 425
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 486 transition count 425
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 484 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 484 transition count 423
Applied a total of 20 rules in 58 ms. Remains 484 /494 variables (removed 10) and now considering 423/433 (removed 10) transitions.
// Phase 1: matrix 423 rows 484 cols
[2022-05-15 17:12:22] [INFO ] Computed 99 place invariants in 7 ms
[2022-05-15 17:12:22] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 423 rows 484 cols
[2022-05-15 17:12:22] [INFO ] Computed 99 place invariants in 3 ms
[2022-05-15 17:12:23] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
// Phase 1: matrix 423 rows 484 cols
[2022-05-15 17:12:23] [INFO ] Computed 99 place invariants in 2 ms
[2022-05-15 17:12:23] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 484/494 places, 423/433 transitions.
Finished structural reductions, in 1 iterations. Remains : 484/494 places, 423/433 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 837 reset in 207 ms.
Stack based approach found an accepted trace after 791 steps with 6 reset with depth 5 and stack size 5 in 3 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-06 finished in 1376 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0||G(p1))&&(G(p0)||F(p2))))))'
Support contains 6 out of 494 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 494/494 places, 433/433 transitions.
Graph (complete) has 1116 edges and 494 vertex of which 493 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 492 transition count 381
Reduce places removed 50 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 52 rules applied. Total rules applied 103 place count 442 transition count 379
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 440 transition count 379
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 105 place count 440 transition count 270
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 343 place count 311 transition count 270
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 351 place count 303 transition count 262
Iterating global reduction 3 with 8 rules applied. Total rules applied 359 place count 303 transition count 262
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 611 place count 175 transition count 138
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 612 place count 175 transition count 137
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 613 place count 175 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 614 place count 174 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 615 place count 173 transition count 136
Applied a total of 615 rules in 58 ms. Remains 173 /494 variables (removed 321) and now considering 136/433 (removed 297) transitions.
// Phase 1: matrix 136 rows 173 cols
[2022-05-15 17:12:24] [INFO ] Computed 74 place invariants in 2 ms
[2022-05-15 17:12:24] [INFO ] Implicit Places using invariants in 144 ms returned [36, 37, 42, 43, 44, 48, 49, 50, 54, 55, 56]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 146 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/494 places, 136/433 transitions.
Applied a total of 0 rules in 14 ms. Remains 162 /162 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 162/494 places, 136/433 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s44 1), p1:(AND (EQ s8 1) (EQ s113 1)), p2:(AND (EQ s34 1) (EQ s58 1) (EQ s139 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-07 finished in 371 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(X((G(F(p0))||p0))))))'
Support contains 1 out of 494 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 494/494 places, 433/433 transitions.
Graph (trivial) has 232 edges and 494 vertex of which 6 / 494 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 1110 edges and 489 vertex of which 488 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 487 transition count 371
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 433 transition count 371
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 105 Pre rules applied. Total rules applied 110 place count 433 transition count 266
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 230 rules applied. Total rules applied 340 place count 308 transition count 266
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 348 place count 300 transition count 258
Iterating global reduction 2 with 8 rules applied. Total rules applied 356 place count 300 transition count 258
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 612 place count 170 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 614 place count 169 transition count 136
Applied a total of 614 rules in 53 ms. Remains 169 /494 variables (removed 325) and now considering 136/433 (removed 297) transitions.
// Phase 1: matrix 136 rows 169 cols
[2022-05-15 17:12:24] [INFO ] Computed 75 place invariants in 6 ms
[2022-05-15 17:12:24] [INFO ] Implicit Places using invariants in 128 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 40, 41, 42, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 129 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/494 places, 136/433 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 147/494 places, 136/433 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-08 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 s130 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-15-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-08 finished in 247 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(!(p0 U !p0))||p1))))'
Support contains 2 out of 494 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 494/494 places, 433/433 transitions.
Graph (trivial) has 230 edges and 494 vertex of which 6 / 494 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 1110 edges and 489 vertex of which 488 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 487 transition count 372
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 434 transition count 372
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 108 place count 434 transition count 268
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 336 place count 310 transition count 268
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 342 place count 304 transition count 262
Iterating global reduction 2 with 6 rules applied. Total rules applied 348 place count 304 transition count 262
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 607 place count 173 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 609 place count 172 transition count 138
Applied a total of 609 rules in 31 ms. Remains 172 /494 variables (removed 322) and now considering 138/433 (removed 295) transitions.
// Phase 1: matrix 138 rows 172 cols
[2022-05-15 17:12:24] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-15 17:12:25] [INFO ] Implicit Places using invariants in 476 ms returned [1, 2, 3, 4, 5, 6, 9, 10, 33, 34, 35, 36, 41, 42, 43, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 477 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/494 places, 138/433 transitions.
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 149/494 places, 138/433 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s75 1), p1:(AND (EQ s75 1) (EQ s102 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15000 reset in 308 ms.
Product exploration explored 100000 steps with 15191 reset in 206 ms.
Computed a total of 33 stabilizing places and 25 stable transitions
Computed a total of 33 stabilizing places and 25 stable transitions
Detected a total of 33/149 stabilizing places and 25/138 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 8 factoid took 520 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 1644 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 570 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 561 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 138 rows 149 cols
[2022-05-15 17:12:26] [INFO ] Computed 53 place invariants in 1 ms
[2022-05-15 17:12:26] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-15 17:12:26] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2022-05-15 17:12:26] [INFO ] [Nat]Absence check using 37 positive and 16 generalized place invariants in 4 ms returned sat
[2022-05-15 17:12:26] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-15 17:12:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 17:12:26] [INFO ] After 6ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-05-15 17:12:26] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2022-05-15 17:12:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-15 17:12:26] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2022-05-15 17:12:26] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0)))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND (NOT p1) p0))), (F (AND p1 (NOT p0)))]
Property proved to be true thanks to knowledge :(F (OR (G p0) (G (NOT p0))))
Knowledge based reduction with 10 factoid took 472 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-15-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-15-LTLFireability-11 finished in 2453 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U p1)))'
Support contains 2 out of 494 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 494/494 places, 433/433 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 486 transition count 425
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 486 transition count 425
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 484 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 484 transition count 423
Applied a total of 20 rules in 37 ms. Remains 484 /494 variables (removed 10) and now considering 423/433 (removed 10) transitions.
// Phase 1: matrix 423 rows 484 cols
[2022-05-15 17:12:27] [INFO ] Computed 99 place invariants in 5 ms
[2022-05-15 17:12:27] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 423 rows 484 cols
[2022-05-15 17:12:27] [INFO ] Computed 99 place invariants in 3 ms
[2022-05-15 17:12:27] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
// Phase 1: matrix 423 rows 484 cols
[2022-05-15 17:12:27] [INFO ] Computed 99 place invariants in 3 ms
[2022-05-15 17:12:28] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 484/494 places, 423/433 transitions.
Finished structural reductions, in 1 iterations. Remains : 484/494 places, 423/433 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s2 1), p0:(EQ s459 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 975 reset in 170 ms.
Stack based approach found an accepted trace after 22094 steps with 223 reset with depth 5 and stack size 5 in 84 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-12 finished in 1444 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(G(G(p0))))||p1)))'
Support contains 4 out of 494 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 494/494 places, 433/433 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 486 transition count 425
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 486 transition count 425
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 484 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 484 transition count 423
Applied a total of 20 rules in 29 ms. Remains 484 /494 variables (removed 10) and now considering 423/433 (removed 10) transitions.
// Phase 1: matrix 423 rows 484 cols
[2022-05-15 17:12:28] [INFO ] Computed 99 place invariants in 2 ms
[2022-05-15 17:12:28] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 423 rows 484 cols
[2022-05-15 17:12:28] [INFO ] Computed 99 place invariants in 2 ms
[2022-05-15 17:12:29] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
// Phase 1: matrix 423 rows 484 cols
[2022-05-15 17:12:29] [INFO ] Computed 99 place invariants in 3 ms
[2022-05-15 17:12:29] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 484/494 places, 423/433 transitions.
Finished structural reductions, in 1 iterations. Remains : 484/494 places, 423/433 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s52 1) (EQ s295 1) (EQ s449 1)), p0:(EQ s216 0)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 420 steps with 2 reset in 1 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-13 finished in 1261 ms.
All properties solved by simple procedures.
Total runtime 27558 ms.

BK_STOP 1652634749939

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-15, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918500436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-15.tgz
mv BusinessProcesses-PT-15 execution
cd execution
if [ "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 ;