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-165251918500428.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-14, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500428
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 7.5K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 30 00:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 156K 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-14-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652633575310

Running Version 202205111006
[2022-05-15 16:52:56] [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 16:52:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:52:57] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2022-05-15 16:52:57] [INFO ] Transformed 624 places.
[2022-05-15 16:52:57] [INFO ] Transformed 564 transitions.
[2022-05-15 16:52:57] [INFO ] Found NUPN structural information;
[2022-05-15 16:52:57] [INFO ] Parsed PT model containing 624 places and 564 transitions in 233 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 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 611 transition count 556
Discarding 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 92 place count 524 transition count 469
Iterating global reduction 1 with 87 rules applied. Total rules applied 179 place count 524 transition count 469
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 221 place count 482 transition count 427
Iterating global reduction 1 with 42 rules applied. Total rules applied 263 place count 482 transition count 427
Applied a total of 263 rules in 114 ms. Remains 482 /616 variables (removed 134) and now considering 427/556 (removed 129) transitions.
// Phase 1: matrix 427 rows 482 cols
[2022-05-15 16:52:57] [INFO ] Computed 94 place invariants in 25 ms
[2022-05-15 16:52:57] [INFO ] Implicit Places using invariants in 325 ms returned []
// Phase 1: matrix 427 rows 482 cols
[2022-05-15 16:52:57] [INFO ] Computed 94 place invariants in 13 ms
[2022-05-15 16:52:58] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
// Phase 1: matrix 427 rows 482 cols
[2022-05-15 16:52:58] [INFO ] Computed 94 place invariants in 6 ms
[2022-05-15 16:52:58] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 482/616 places, 427/556 transitions.
Finished structural reductions, in 1 iterations. Remains : 482/616 places, 427/556 transitions.
Support contains 51 out of 482 places after structural reductions.
[2022-05-15 16:52:58] [INFO ] Flatten gal took : 65 ms
[2022-05-15 16:52:58] [INFO ] Flatten gal took : 31 ms
[2022-05-15 16:52:58] [INFO ] Input system was already deterministic with 427 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 651 ms. (steps per millisecond=15 ) properties (out of 33) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) 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 18) seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 427 rows 482 cols
[2022-05-15 16:52:59] [INFO ] Computed 94 place invariants in 4 ms
[2022-05-15 16:52:59] [INFO ] [Real]Absence check using 56 positive place invariants in 20 ms returned sat
[2022-05-15 16:52:59] [INFO ] [Real]Absence check using 56 positive and 38 generalized place invariants in 15 ms returned sat
[2022-05-15 16:53:00] [INFO ] After 437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2022-05-15 16:53:00] [INFO ] [Nat]Absence check using 56 positive place invariants in 24 ms returned sat
[2022-05-15 16:53:00] [INFO ] [Nat]Absence check using 56 positive and 38 generalized place invariants in 11 ms returned sat
[2022-05-15 16:53:01] [INFO ] After 557ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :15
[2022-05-15 16:53:01] [INFO ] Deduced a trap composed of 18 places in 463 ms of which 4 ms to minimize.
[2022-05-15 16:53:01] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2022-05-15 16:53:01] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2022-05-15 16:53:01] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2022-05-15 16:53:01] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2022-05-15 16:53:02] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 0 ms to minimize.
[2022-05-15 16:53:02] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 0 ms to minimize.
[2022-05-15 16:53:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1071 ms
[2022-05-15 16:53:02] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2022-05-15 16:53:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2022-05-15 16:53:02] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 0 ms to minimize.
[2022-05-15 16:53:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2022-05-15 16:53:02] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 1 ms to minimize.
[2022-05-15 16:53:03] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 0 ms to minimize.
[2022-05-15 16:53:03] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2022-05-15 16:53:03] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 0 ms to minimize.
[2022-05-15 16:53:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 542 ms
[2022-05-15 16:53:03] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2022-05-15 16:53:03] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 0 ms to minimize.
[2022-05-15 16:53:03] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2022-05-15 16:53:03] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 1 ms to minimize.
[2022-05-15 16:53:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 436 ms
[2022-05-15 16:53:03] [INFO ] After 3354ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :15
Attempting to minimize the solution found.
Minimization took 414 ms.
[2022-05-15 16:53:04] [INFO ] After 4158ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :15
Fused 18 Parikh solutions to 15 different solutions.
Parikh walk visited 3 properties in 242 ms.
Support contains 20 out of 482 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 482/482 places, 427/427 transitions.
Graph (complete) has 1088 edges and 482 vertex of which 481 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 481 transition count 379
Reduce places removed 47 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 51 rules applied. Total rules applied 99 place count 434 transition count 375
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 103 place count 430 transition count 375
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 103 place count 430 transition count 284
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 195 rules applied. Total rules applied 298 place count 326 transition count 284
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 305 place count 319 transition count 277
Iterating global reduction 3 with 7 rules applied. Total rules applied 312 place count 319 transition count 277
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 312 place count 319 transition count 276
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 314 place count 318 transition count 276
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 5 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 253 rules applied. Total rules applied 567 place count 189 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 568 place count 189 transition count 151
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 569 place count 189 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 570 place count 188 transition count 150
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 575 place count 188 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 576 place count 187 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 577 place count 186 transition count 149
Applied a total of 577 rules in 120 ms. Remains 186 /482 variables (removed 296) and now considering 149/427 (removed 278) transitions.
Finished structural reductions, in 1 iterations. Remains : 186/482 places, 149/427 transitions.
Incomplete random walk after 10000 steps, including 904 resets, run finished after 632 ms. (steps per millisecond=15 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 259 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 267 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 262 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 258 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 266 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 267 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 253 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 263 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 277 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 259 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 268 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Finished probabilistic random walk after 113676 steps, run visited all 12 properties in 674 ms. (steps per millisecond=168 )
Probabilistic random walk after 113676 steps, saw 26987 distinct states, run finished after 674 ms. (steps per millisecond=168 ) properties seen :12
FORMULA BusinessProcesses-PT-14-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-14-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA BusinessProcesses-PT-14-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 127 stabilizing places and 120 stable transitions
Graph (complete) has 1088 edges and 482 vertex of which 481 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 ms
FORMULA BusinessProcesses-PT-14-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(p0 U p1))&&F(((p2 U p0)||X(p2)))))'
Support contains 3 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 472 transition count 417
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 472 transition count 417
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 468 transition count 413
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 468 transition count 413
Applied a total of 28 rules in 20 ms. Remains 468 /482 variables (removed 14) and now considering 413/427 (removed 14) transitions.
// Phase 1: matrix 413 rows 468 cols
[2022-05-15 16:53:07] [INFO ] Computed 94 place invariants in 8 ms
[2022-05-15 16:53:07] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 413 rows 468 cols
[2022-05-15 16:53:07] [INFO ] Computed 94 place invariants in 4 ms
[2022-05-15 16:53:08] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1026 ms to find 0 implicit places.
// Phase 1: matrix 413 rows 468 cols
[2022-05-15 16:53:08] [INFO ] Computed 94 place invariants in 3 ms
[2022-05-15 16:53:08] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 468/482 places, 413/427 transitions.
Finished structural reductions, in 1 iterations. Remains : 468/482 places, 413/427 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR p1 (AND (NOT p0) (NOT p2))), p1, (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s291 1), p1:(EQ s15 1), p2:(EQ s419 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]]
Stuttering criterion allowed to conclude after 144 steps with 1 reset in 4 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-00 finished in 1554 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(p0))))'
Support contains 1 out of 482 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Graph (trivial) has 229 edges and 482 vertex of which 7 / 482 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1081 edges and 476 vertex of which 475 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 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 474 transition count 364
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 420 transition count 364
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 110 place count 420 transition count 264
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 327 place count 303 transition count 264
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 337 place count 293 transition count 254
Iterating global reduction 2 with 10 rules applied. Total rules applied 347 place count 293 transition count 254
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 347 place count 293 transition count 253
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 349 place count 292 transition count 253
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 249 rules applied. Total rules applied 598 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 600 place count 164 transition count 135
Applied a total of 600 rules in 54 ms. Remains 164 /482 variables (removed 318) and now considering 135/427 (removed 292) transitions.
// Phase 1: matrix 135 rows 164 cols
[2022-05-15 16:53:08] [INFO ] Computed 72 place invariants in 1 ms
[2022-05-15 16:53:09] [INFO ] Implicit Places using invariants in 116 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 123 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/482 places, 135/427 transitions.
Applied a total of 0 rules in 7 ms. Remains 144 /144 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 144/482 places, 135/427 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-01 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 s103 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-14-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-01 finished in 262 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(p0))) U !(X(p1)||F(X(p2)))))'
Support contains 5 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 471 transition count 416
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 471 transition count 416
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 467 transition count 412
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 467 transition count 412
Applied a total of 30 rules in 30 ms. Remains 467 /482 variables (removed 15) and now considering 412/427 (removed 15) transitions.
// Phase 1: matrix 412 rows 467 cols
[2022-05-15 16:53:09] [INFO ] Computed 94 place invariants in 9 ms
[2022-05-15 16:53:09] [INFO ] Implicit Places using invariants in 192 ms returned []
// Phase 1: matrix 412 rows 467 cols
[2022-05-15 16:53:09] [INFO ] Computed 94 place invariants in 3 ms
[2022-05-15 16:53:09] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
// Phase 1: matrix 412 rows 467 cols
[2022-05-15 16:53:09] [INFO ] Computed 94 place invariants in 9 ms
[2022-05-15 16:53:10] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 467/482 places, 412/427 transitions.
Finished structural reductions, in 1 iterations. Remains : 467/482 places, 412/427 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR p2 p1), (OR p2 p1), (NOT p0), p2, true, (AND p2 p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p2), acceptance={0} source=1 dest: 1}, { cond=(OR p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 p0), acceptance={0} source=3 dest: 1}, { cond=(AND p2 p0), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s390 1), p2:(EQ s244 1), p0:(AND (EQ s82 1) (EQ s316 1) (EQ s432 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19948 reset in 331 ms.
Product exploration explored 100000 steps with 19945 reset in 239 ms.
Computed a total of 124 stabilizing places and 117 stable transitions
Graph (complete) has 1070 edges and 467 vertex of which 466 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 124 stabilizing places and 117 stable transitions
Detected a total of 124/467 stabilizing places and 117/412 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (OR p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 771 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 6 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 213 ms :[(OR p2 p1), (OR p2 p1), (NOT p0), p2, true, (AND p2 p0)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 412 rows 467 cols
[2022-05-15 16:53:12] [INFO ] Computed 94 place invariants in 3 ms
[2022-05-15 16:53:12] [INFO ] [Real]Absence check using 55 positive place invariants in 15 ms returned sat
[2022-05-15 16:53:12] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 13 ms returned sat
[2022-05-15 16:53:12] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 16:53:12] [INFO ] [Nat]Absence check using 55 positive place invariants in 21 ms returned sat
[2022-05-15 16:53:12] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2022-05-15 16:53:12] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 16:53:12] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2022-05-15 16:53:12] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2022-05-15 16:53:13] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2022-05-15 16:53:13] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2022-05-15 16:53:13] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2022-05-15 16:53:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 373 ms
[2022-05-15 16:53:13] [INFO ] After 674ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 67 ms.
[2022-05-15 16:53:13] [INFO ] After 872ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 30 ms.
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 467/467 places, 412/412 transitions.
Graph (complete) has 1070 edges and 467 vertex of which 466 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
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 466 transition count 365
Reduce places removed 46 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 48 rules applied. Total rules applied 95 place count 420 transition count 363
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 418 transition count 363
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 97 place count 418 transition count 262
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 316 place count 300 transition count 262
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 317 place count 299 transition count 261
Iterating global reduction 3 with 1 rules applied. Total rules applied 318 place count 299 transition count 261
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 259 rules applied. Total rules applied 577 place count 167 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 578 place count 167 transition count 133
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 579 place count 167 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 580 place count 166 transition count 132
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 586 place count 166 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 587 place count 165 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 588 place count 164 transition count 131
Applied a total of 588 rules in 45 ms. Remains 164 /467 variables (removed 303) and now considering 131/412 (removed 281) transitions.
Finished structural reductions, in 1 iterations. Remains : 164/467 places, 131/412 transitions.
Incomplete random walk after 10000 steps, including 932 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 284 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 306 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Probably explored full state space saw : 9860 states, properties seen :2
Probabilistic random walk after 34138 steps, saw 9860 distinct states, run finished after 106 ms. (steps per millisecond=322 ) properties seen :2
Explored full state space saw : 9860 states, properties seen :0
Exhaustive walk after 34138 steps, saw 9860 distinct states, run finished after 140 ms. (steps per millisecond=243 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (OR p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p2 p0)))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p2 (NOT p0))), (F (OR p1 p2)), (F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 12 factoid took 939 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 153 ms :[(OR p1 p2), p2, (OR p1 p2), true]
Stuttering acceptance computed with spot in 91 ms :[(OR p1 p2), p2, (OR p1 p2), true]
Support contains 2 out of 467 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 412/412 transitions.
Applied a total of 0 rules in 8 ms. Remains 467 /467 variables (removed 0) and now considering 412/412 (removed 0) transitions.
// Phase 1: matrix 412 rows 467 cols
[2022-05-15 16:53:15] [INFO ] Computed 94 place invariants in 4 ms
[2022-05-15 16:53:15] [INFO ] Implicit Places using invariants in 202 ms returned []
// Phase 1: matrix 412 rows 467 cols
[2022-05-15 16:53:15] [INFO ] Computed 94 place invariants in 3 ms
[2022-05-15 16:53:15] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
// Phase 1: matrix 412 rows 467 cols
[2022-05-15 16:53:15] [INFO ] Computed 94 place invariants in 2 ms
[2022-05-15 16:53:16] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 467/467 places, 412/412 transitions.
Computed a total of 124 stabilizing places and 117 stable transitions
Graph (complete) has 1070 edges and 467 vertex of which 466 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 124 stabilizing places and 117 stable transitions
Detected a total of 124/467 stabilizing places and 117/412 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT (OR p1 p2))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 179 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[true, p2, p2]
Finished random walk after 118 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=118 )
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT (OR p1 p2))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 6 factoid took 178 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[true, p2, p2]
Stuttering acceptance computed with spot in 61 ms :[true, p2, p2]
Stuttering acceptance computed with spot in 81 ms :[true, p2, p2]
Entered a terminal (fully accepting) state of product in 173 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-06 finished in 7682 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(F(p1)) U (X(X(G(p2)))||p1))))'
Support contains 3 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 470 transition count 415
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 470 transition count 415
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 466 transition count 411
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 466 transition count 411
Applied a total of 32 rules in 33 ms. Remains 466 /482 variables (removed 16) and now considering 411/427 (removed 16) transitions.
// Phase 1: matrix 411 rows 466 cols
[2022-05-15 16:53:16] [INFO ] Computed 94 place invariants in 6 ms
[2022-05-15 16:53:17] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 411 rows 466 cols
[2022-05-15 16:53:17] [INFO ] Computed 94 place invariants in 8 ms
[2022-05-15 16:53:17] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
// Phase 1: matrix 411 rows 466 cols
[2022-05-15 16:53:17] [INFO ] Computed 94 place invariants in 3 ms
[2022-05-15 16:53:17] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 466/482 places, 411/427 transitions.
Finished structural reductions, in 1 iterations. Remains : 466/482 places, 411/427 transitions.
Stuttering acceptance computed with spot in 1324 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s72 1), p0:(EQ s95 1), p2:(EQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 146 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-07 finished in 2202 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(G(p1) U p2)&&p0)))'
Support contains 5 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 470 transition count 415
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 470 transition count 415
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 466 transition count 411
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 466 transition count 411
Applied a total of 32 rules in 27 ms. Remains 466 /482 variables (removed 16) and now considering 411/427 (removed 16) transitions.
// Phase 1: matrix 411 rows 466 cols
[2022-05-15 16:53:19] [INFO ] Computed 94 place invariants in 5 ms
[2022-05-15 16:53:19] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 411 rows 466 cols
[2022-05-15 16:53:19] [INFO ] Computed 94 place invariants in 3 ms
[2022-05-15 16:53:19] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
// Phase 1: matrix 411 rows 466 cols
[2022-05-15 16:53:19] [INFO ] Computed 94 place invariants in 4 ms
[2022-05-15 16:53:19] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 466/482 places, 411/427 transitions.
Finished structural reductions, in 1 iterations. Remains : 466/482 places, 411/427 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, p1, (OR (NOT p0) p2), (OR (NOT p0) p2), (AND p1 p2)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) p2), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s231 1), p0:(AND (EQ s373 0) (OR (EQ s173 0) (EQ s349 0) (EQ s457 0))), p2:(EQ s373 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 259 ms.
Product exploration explored 100000 steps with 50000 reset in 322 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 1067 edges and 466 vertex of which 465 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Detected a total of 123/466 stabilizing places and 116/411 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (OR (NOT p0) p2))), (X (NOT (AND p0 p1 (NOT p2)))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1 (NOT p2))))
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-14-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-14-LTLFireability-08 finished in 1713 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(F((X(p1)||p2))))))'
Support contains 8 out of 482 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Graph (trivial) has 223 edges and 482 vertex of which 7 / 482 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1081 edges and 476 vertex of which 475 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
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 474 transition count 366
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 422 transition count 366
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 106 place count 422 transition count 270
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 314 place count 310 transition count 270
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 323 place count 301 transition count 261
Iterating global reduction 2 with 9 rules applied. Total rules applied 332 place count 301 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 332 place count 301 transition count 260
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 334 place count 300 transition count 260
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 247 rules applied. Total rules applied 581 place count 174 transition count 139
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 583 place count 173 transition count 143
Applied a total of 583 rules in 43 ms. Remains 173 /482 variables (removed 309) and now considering 143/427 (removed 284) transitions.
// Phase 1: matrix 143 rows 173 cols
[2022-05-15 16:53:20] [INFO ] Computed 73 place invariants in 2 ms
[2022-05-15 16:53:20] [INFO ] Implicit Places using invariants in 110 ms returned [1, 2, 5, 6, 7, 8, 9, 16, 17, 21, 22, 23, 24, 25, 26, 50, 51, 52, 53, 54]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 111 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/482 places, 143/427 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 153/482 places, 143/427 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s69 1) (EQ s123 1)), p2:(AND (EQ s1 1) (EQ s41 1) (EQ s105 1)), p1:(AND (EQ s21 1) (EQ s90 1) (EQ s139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-09 finished in 303 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0)) U p0)&&X((!X((p0 U p1)) U p2))))'
Support contains 6 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 471 transition count 416
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 471 transition count 416
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 468 transition count 413
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 468 transition count 413
Applied a total of 28 rules in 35 ms. Remains 468 /482 variables (removed 14) and now considering 413/427 (removed 14) transitions.
// Phase 1: matrix 413 rows 468 cols
[2022-05-15 16:53:21] [INFO ] Computed 94 place invariants in 7 ms
[2022-05-15 16:53:21] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 413 rows 468 cols
[2022-05-15 16:53:21] [INFO ] Computed 94 place invariants in 3 ms
[2022-05-15 16:53:21] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
// Phase 1: matrix 413 rows 468 cols
[2022-05-15 16:53:21] [INFO ] Computed 94 place invariants in 3 ms
[2022-05-15 16:53:21] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 468/482 places, 413/427 transitions.
Finished structural reductions, in 1 iterations. Remains : 468/482 places, 413/427 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), true, (OR (NOT p2) p1), p1]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s194 1) (EQ s364 1) (EQ s433 1)), p2:(NEQ s371 1), p1:(AND (EQ s182 1) (EQ s276 1) (EQ s433 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-10 finished in 1082 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((X(F(p0))&&X(X(p1)))))))'
Support contains 2 out of 482 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Graph (trivial) has 227 edges and 482 vertex of which 7 / 482 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1081 edges and 476 vertex of which 475 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 474 transition count 366
Reduce places removed 52 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 422 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 421 transition count 365
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 108 place count 421 transition count 267
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 320 place count 307 transition count 267
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 330 place count 297 transition count 257
Iterating global reduction 3 with 10 rules applied. Total rules applied 340 place count 297 transition count 257
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 340 place count 297 transition count 256
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 342 place count 296 transition count 256
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 251 rules applied. Total rules applied 593 place count 168 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 595 place count 167 transition count 137
Applied a total of 595 rules in 43 ms. Remains 167 /482 variables (removed 315) and now considering 137/427 (removed 290) transitions.
// Phase 1: matrix 137 rows 167 cols
[2022-05-15 16:53:22] [INFO ] Computed 73 place invariants in 3 ms
[2022-05-15 16:53:22] [INFO ] Implicit Places using invariants in 104 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 22, 23, 24, 25, 26, 49, 50, 51, 52, 53, 131]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 104 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/482 places, 137/427 transitions.
Applied a total of 0 rules in 6 ms. Remains 146 /146 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 146/482 places, 137/427 transitions.
Stuttering acceptance computed with spot in 60 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s11 0), p0:(EQ s70 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-11 finished in 235 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 482 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Graph (complete) has 1088 edges and 482 vertex of which 481 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 480 transition count 374
Reduce places removed 51 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 105 place count 429 transition count 372
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 427 transition count 372
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 107 place count 427 transition count 272
Deduced a syphon composed of 100 places in 1 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 324 place count 310 transition count 272
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 335 place count 299 transition count 261
Iterating global reduction 3 with 11 rules applied. Total rules applied 346 place count 299 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 346 place count 299 transition count 260
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 348 place count 298 transition count 260
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 253 rules applied. Total rules applied 601 place count 169 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 602 place count 169 transition count 135
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 4 with 2 rules applied. Total rules applied 604 place count 168 transition count 139
Applied a total of 604 rules in 77 ms. Remains 168 /482 variables (removed 314) and now considering 139/427 (removed 288) transitions.
// Phase 1: matrix 139 rows 168 cols
[2022-05-15 16:53:22] [INFO ] Computed 72 place invariants in 1 ms
[2022-05-15 16:53:22] [INFO ] Implicit Places using invariants in 146 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 147 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/482 places, 139/427 transitions.
Applied a total of 0 rules in 7 ms. Remains 148 /148 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 148/482 places, 139/427 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s113 1) (AND (EQ s33 1) (EQ s96 1) (EQ s125 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 19 steps with 2 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-14 finished in 267 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 471 transition count 416
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 471 transition count 416
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 467 transition count 412
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 467 transition count 412
Applied a total of 30 rules in 25 ms. Remains 467 /482 variables (removed 15) and now considering 412/427 (removed 15) transitions.
// Phase 1: matrix 412 rows 467 cols
[2022-05-15 16:53:22] [INFO ] Computed 94 place invariants in 3 ms
[2022-05-15 16:53:22] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 412 rows 467 cols
[2022-05-15 16:53:22] [INFO ] Computed 94 place invariants in 3 ms
[2022-05-15 16:53:23] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
// Phase 1: matrix 412 rows 467 cols
[2022-05-15 16:53:23] [INFO ] Computed 94 place invariants in 2 ms
[2022-05-15 16:53:23] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 467/482 places, 412/427 transitions.
Finished structural reductions, in 1 iterations. Remains : 467/482 places, 412/427 transitions.
Stuttering acceptance computed with spot in 476 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s302 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-15 finished in 1390 ms.
All properties solved by simple procedures.
Total runtime 27118 ms.

BK_STOP 1652633604088

--------------------
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-14"
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-14, 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-165251918500428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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