Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 148K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678503108630

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-13
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:51:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 02:51:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:51:50] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-11 02:51:50] [INFO ] Transformed 593 places.
[2023-03-11 02:51:50] [INFO ] Transformed 536 transitions.
[2023-03-11 02:51:50] [INFO ] Found NUPN structural information;
[2023-03-11 02:51:50] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 86 place count 499 transition count 447
Iterating global reduction 1 with 81 rules applied. Total rules applied 167 place count 499 transition count 447
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 209 place count 457 transition count 405
Iterating global reduction 1 with 42 rules applied. Total rules applied 251 place count 457 transition count 405
Applied a total of 251 rules in 97 ms. Remains 457 /585 variables (removed 128) and now considering 405/528 (removed 123) transitions.
// Phase 1: matrix 405 rows 457 cols
[2023-03-11 02:51:50] [INFO ] Computed 90 place invariants in 43 ms
[2023-03-11 02:51:51] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-11 02:51:51] [INFO ] Invariant cache hit.
[2023-03-11 02:51:51] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
[2023-03-11 02:51:51] [INFO ] Invariant cache hit.
[2023-03-11 02:51:51] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 457/585 places, 405/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1335 ms. Remains : 457/585 places, 405/528 transitions.
Support contains 49 out of 457 places after structural reductions.
[2023-03-11 02:51:52] [INFO ] Flatten gal took : 71 ms
[2023-03-11 02:51:52] [INFO ] Flatten gal took : 39 ms
[2023-03-11 02:51:52] [INFO ] Input system was already deterministic with 405 transitions.
Support contains 41 out of 457 places (down from 49) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 561 ms. (steps per millisecond=17 ) properties (out of 26) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) seen :0
Running SMT prover for 19 properties.
[2023-03-11 02:51:53] [INFO ] Invariant cache hit.
[2023-03-11 02:51:53] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-11 02:51:53] [INFO ] [Nat]Absence check using 52 positive place invariants in 15 ms returned sat
[2023-03-11 02:51:53] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 10 ms returned sat
[2023-03-11 02:51:54] [INFO ] After 453ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :17
[2023-03-11 02:51:54] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 9 ms to minimize.
[2023-03-11 02:51:54] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2023-03-11 02:51:54] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2023-03-11 02:51:54] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2023-03-11 02:51:54] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2023-03-11 02:51:54] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2023-03-11 02:51:54] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 2 ms to minimize.
[2023-03-11 02:51:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 573 ms
[2023-03-11 02:51:54] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 1 ms to minimize.
[2023-03-11 02:51:55] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 9 ms to minimize.
[2023-03-11 02:51:55] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 1 ms to minimize.
[2023-03-11 02:51:55] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 0 ms to minimize.
[2023-03-11 02:51:55] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 16 ms to minimize.
[2023-03-11 02:51:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 963 ms
[2023-03-11 02:51:55] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 0 ms to minimize.
[2023-03-11 02:51:56] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 0 ms to minimize.
[2023-03-11 02:51:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 343 ms
[2023-03-11 02:51:56] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 0 ms to minimize.
[2023-03-11 02:51:56] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 1 ms to minimize.
[2023-03-11 02:51:56] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
[2023-03-11 02:51:56] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 0 ms to minimize.
[2023-03-11 02:51:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 647 ms
[2023-03-11 02:51:57] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2023-03-11 02:51:57] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 0 ms to minimize.
[2023-03-11 02:51:57] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 1 ms to minimize.
[2023-03-11 02:51:57] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2023-03-11 02:51:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 389 ms
[2023-03-11 02:51:57] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2023-03-11 02:51:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-11 02:51:57] [INFO ] After 3972ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :16
Attempting to minimize the solution found.
Minimization took 274 ms.
[2023-03-11 02:51:57] [INFO ] After 4614ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :16
Fused 19 Parikh solutions to 16 different solutions.
Parikh walk visited 14 properties in 178 ms.
Support contains 5 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 405/405 transitions.
Graph (trivial) has 211 edges and 457 vertex of which 6 / 457 are part of one of the 1 SCC in 8 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1031 edges and 452 vertex of which 451 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output 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 451 transition count 345
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 399 transition count 345
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 91 Pre rules applied. Total rules applied 106 place count 399 transition count 254
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 199 rules applied. Total rules applied 305 place count 291 transition count 254
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 313 place count 283 transition count 246
Iterating global reduction 2 with 8 rules applied. Total rules applied 321 place count 283 transition count 246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 321 place count 283 transition count 245
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 323 place count 282 transition count 245
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 559 place count 162 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 561 place count 161 transition count 133
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 562 place count 161 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 563 place count 160 transition count 132
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 564 place count 160 transition count 132
Applied a total of 564 rules in 135 ms. Remains 160 /457 variables (removed 297) and now considering 132/405 (removed 273) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 160/457 places, 132/405 transitions.
Incomplete random walk after 10000 steps, including 1799 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 877 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 590 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Finished probabilistic random walk after 2821 steps, run visited all 2 properties in 29 ms. (steps per millisecond=97 )
Probabilistic random walk after 2821 steps, saw 890 distinct states, run finished after 30 ms. (steps per millisecond=94 ) properties seen :2
FORMULA BusinessProcesses-PT-13-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA BusinessProcesses-PT-13-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 124 stabilizing places and 117 stable transitions
Graph (complete) has 1038 edges and 457 vertex of which 456 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(G(((F(G(p1))&&p1)||p0)))))))'
Support contains 6 out of 457 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Graph (complete) has 1038 edges and 457 vertex of which 456 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 455 transition count 354
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 406 transition count 352
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 404 transition count 352
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 103 place count 404 transition count 256
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 312 place count 291 transition count 256
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 320 place count 283 transition count 248
Iterating global reduction 3 with 8 rules applied. Total rules applied 328 place count 283 transition count 248
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 328 place count 283 transition count 247
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 330 place count 282 transition count 247
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 562 place count 164 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 564 place count 163 transition count 137
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 565 place count 163 transition count 136
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 566 place count 163 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 567 place count 162 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 568 place count 161 transition count 135
Applied a total of 568 rules in 74 ms. Remains 161 /457 variables (removed 296) and now considering 135/405 (removed 270) transitions.
// Phase 1: matrix 135 rows 161 cols
[2023-03-11 02:51:58] [INFO ] Computed 68 place invariants in 5 ms
[2023-03-11 02:51:59] [INFO ] Implicit Places using invariants in 90 ms returned [25, 48, 49, 50, 51]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 92 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/457 places, 135/405 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 172 ms. Remains : 156/457 places, 135/405 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s23 0) (EQ s71 0) (EQ s133 0)), p0:(OR (EQ s7 0) (EQ s80 0) (EQ s108 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11414 reset in 367 ms.
Product exploration explored 100000 steps with 11335 reset in 302 ms.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0), (X (OR p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (X (OR p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 645 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1152 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 333 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 343 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 364 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 312 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 318 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Probably explored full state space saw : 72988 states, properties seen :3
Probabilistic random walk after 331780 steps, saw 72988 distinct states, run finished after 1851 ms. (steps per millisecond=179 ) properties seen :3
Explored full state space saw : 72988 states, properties seen :0
Exhaustive walk after 331780 steps, saw 72988 distinct states, run finished after 1355 ms. (steps per millisecond=244 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (OR p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (X (OR p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 13 factoid took 509 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 135/135 transitions.
Applied a total of 0 rules in 8 ms. Remains 156 /156 variables (removed 0) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 156 cols
[2023-03-11 02:52:05] [INFO ] Computed 63 place invariants in 2 ms
[2023-03-11 02:52:05] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-11 02:52:05] [INFO ] Invariant cache hit.
[2023-03-11 02:52:05] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:52:05] [INFO ] Implicit Places using invariants and state equation in 227 ms returned [25, 48, 49, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 74, 76, 81, 83, 85, 87, 89, 97, 99, 101, 103, 105]
Discarding 26 places :
Implicit Place search using SMT with State Equation took 386 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/156 places, 135/135 transitions.
Graph (complete) has 425 edges and 130 vertex of which 121 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 121 transition count 122
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 112 transition count 122
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 31 place count 100 transition count 82
Iterating global reduction 2 with 12 rules applied. Total rules applied 43 place count 100 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 100 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 47 place count 98 transition count 80
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 65 place count 88 transition count 72
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 4 with 4 rules applied. Total rules applied 69 place count 86 transition count 70
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 86 transition count 70
Applied a total of 70 rules in 26 ms. Remains 86 /130 variables (removed 44) and now considering 70/135 (removed 65) transitions.
// Phase 1: matrix 70 rows 86 cols
[2023-03-11 02:52:05] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-11 02:52:05] [INFO ] Implicit Places using invariants in 45 ms returned [23, 24, 25]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 83/156 places, 70/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 83 /83 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 478 ms. Remains : 83/156 places, 70/135 transitions.
Computed a total of 16 stabilizing places and 5 stable transitions
Computed a total of 16 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 503 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1128 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 378 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 324 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 316 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 351 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 348 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Probably explored full state space saw : 11848 states, properties seen :4
Probabilistic random walk after 42418 steps, saw 11848 distinct states, run finished after 119 ms. (steps per millisecond=356 ) properties seen :4
Explored full state space saw : 11848 states, properties seen :0
Exhaustive walk after 42418 steps, saw 11848 distinct states, run finished after 63 ms. (steps per millisecond=673 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 12 factoid took 588 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 11518 reset in 243 ms.
Product exploration explored 100000 steps with 11606 reset in 212 ms.
Support contains 6 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 70/70 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 70/70 (removed 0) transitions.
// Phase 1: matrix 70 rows 83 cols
[2023-03-11 02:52:08] [INFO ] Computed 29 place invariants in 2 ms
[2023-03-11 02:52:08] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-11 02:52:08] [INFO ] Invariant cache hit.
[2023-03-11 02:52:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 02:52:08] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [1, 2, 3, 5, 6, 8, 10, 14, 15, 16, 17, 18, 19, 20, 44, 46, 48]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 210 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/83 places, 70/70 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 66 transition count 67
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 63 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 62 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 62 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 62 transition count 65
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 32 place count 48 transition count 56
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 35 place count 45 transition count 53
Iterating global reduction 3 with 3 rules applied. Total rules applied 38 place count 45 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 45 transition count 52
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 41 place count 44 transition count 51
Applied a total of 41 rules in 9 ms. Remains 44 /66 variables (removed 22) and now considering 51/70 (removed 19) transitions.
// Phase 1: matrix 51 rows 44 cols
[2023-03-11 02:52:08] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-11 02:52:08] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-11 02:52:08] [INFO ] Invariant cache hit.
[2023-03-11 02:52:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:52:08] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/83 places, 51/70 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 314 ms. Remains : 44/83 places, 51/70 transitions.
Treatment of property BusinessProcesses-PT-13-LTLFireability-00 finished in 9870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 457 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Graph (trivial) has 214 edges and 457 vertex of which 6 / 457 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 1032 edges and 452 vertex of which 451 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 450 transition count 345
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 398 transition count 345
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 106 place count 398 transition count 250
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 313 place count 286 transition count 250
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 320 place count 279 transition count 243
Iterating global reduction 2 with 7 rules applied. Total rules applied 327 place count 279 transition count 243
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 327 place count 279 transition count 242
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 329 place count 278 transition count 242
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 563 place count 159 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 565 place count 158 transition count 131
Applied a total of 565 rules in 51 ms. Remains 158 /457 variables (removed 299) and now considering 131/405 (removed 274) transitions.
// Phase 1: matrix 131 rows 158 cols
[2023-03-11 02:52:08] [INFO ] Computed 69 place invariants in 2 ms
[2023-03-11 02:52:08] [INFO ] Implicit Places using invariants in 111 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 46, 47, 48, 49, 50]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 113 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/457 places, 131/405 transitions.
Applied a total of 0 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 169 ms. Remains : 139/457 places, 131/405 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s106 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 21888 reset in 268 ms.
Product exploration explored 100000 steps with 21809 reset in 239 ms.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2517 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 758 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 74 steps, run visited all 1 properties in 3 ms. (steps per millisecond=24 )
Probabilistic random walk after 74 steps, saw 46 distinct states, run finished after 3 ms. (steps per millisecond=24 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 243 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 131/131 transitions.
Applied a total of 0 rules in 12 ms. Remains 139 /139 variables (removed 0) and now considering 131/131 (removed 0) transitions.
// Phase 1: matrix 131 rows 139 cols
[2023-03-11 02:52:10] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-11 02:52:10] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-11 02:52:10] [INFO ] Invariant cache hit.
[2023-03-11 02:52:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:52:10] [INFO ] Implicit Places using invariants and state equation in 415 ms returned [1, 3, 7, 10, 33, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 59, 61, 63, 65, 67, 69, 71, 73, 81, 83, 85, 87, 89]
Discarding 30 places :
Implicit Place search using SMT with State Equation took 614 ms to find 30 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/139 places, 131/131 transitions.
Graph (complete) has 363 edges and 109 vertex of which 98 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 98 transition count 118
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 90 transition count 118
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 30 place count 77 transition count 76
Iterating global reduction 2 with 13 rules applied. Total rules applied 43 place count 77 transition count 76
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 45 place count 77 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 47 place count 75 transition count 74
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 74 transition count 73
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 74 transition count 73
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 66 place count 65 transition count 65
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 68 place count 64 transition count 64
Applied a total of 68 rules in 12 ms. Remains 64 /109 variables (removed 45) and now considering 64/131 (removed 67) transitions.
// Phase 1: matrix 64 rows 64 cols
[2023-03-11 02:52:10] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-11 02:52:10] [INFO ] Implicit Places using invariants in 50 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 52 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/139 places, 64/131 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 695 ms. Remains : 61/139 places, 64/131 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 5463 steps, including 1424 resets, run visited all 1 properties in 7 ms. (steps per millisecond=780 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22454 reset in 99 ms.
Product exploration explored 100000 steps with 22320 reset in 94 ms.
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 61 cols
[2023-03-11 02:52:11] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-11 02:52:11] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-11 02:52:11] [INFO ] Invariant cache hit.
[2023-03-11 02:52:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:52:11] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [23, 25, 27]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 213 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/61 places, 64/64 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 58 transition count 61
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 55 transition count 61
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 54 transition count 60
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 54 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 54 transition count 59
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 32 place count 40 transition count 50
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 35 place count 37 transition count 47
Iterating global reduction 3 with 3 rules applied. Total rules applied 38 place count 37 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 37 transition count 46
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 41 place count 36 transition count 45
Applied a total of 41 rules in 10 ms. Remains 36 /58 variables (removed 22) and now considering 45/64 (removed 19) transitions.
// Phase 1: matrix 45 rows 36 cols
[2023-03-11 02:52:11] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-11 02:52:11] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-11 02:52:11] [INFO ] Invariant cache hit.
[2023-03-11 02:52:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:52:11] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/61 places, 45/64 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 347 ms. Remains : 36/61 places, 45/64 transitions.
Treatment of property BusinessProcesses-PT-13-LTLFireability-01 finished in 2955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 449 transition count 397
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 449 transition count 397
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 446 transition count 394
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 446 transition count 394
Applied a total of 22 rules in 23 ms. Remains 446 /457 variables (removed 11) and now considering 394/405 (removed 11) transitions.
// Phase 1: matrix 394 rows 446 cols
[2023-03-11 02:52:11] [INFO ] Computed 90 place invariants in 10 ms
[2023-03-11 02:52:11] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-11 02:52:11] [INFO ] Invariant cache hit.
[2023-03-11 02:52:12] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
[2023-03-11 02:52:12] [INFO ] Invariant cache hit.
[2023-03-11 02:52:12] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/457 places, 394/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 960 ms. Remains : 446/457 places, 394/405 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-02 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 s257 0)], 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 50000 reset in 307 ms.
Product exploration explored 100000 steps with 50000 reset in 272 ms.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 1021 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Detected a total of 118/446 stabilizing places and 111/394 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-13-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-13-LTLFireability-02 finished in 1764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 449 transition count 397
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 449 transition count 397
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 446 transition count 394
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 446 transition count 394
Applied a total of 22 rules in 25 ms. Remains 446 /457 variables (removed 11) and now considering 394/405 (removed 11) transitions.
[2023-03-11 02:52:13] [INFO ] Invariant cache hit.
[2023-03-11 02:52:13] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-11 02:52:13] [INFO ] Invariant cache hit.
[2023-03-11 02:52:13] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2023-03-11 02:52:13] [INFO ] Invariant cache hit.
[2023-03-11 02:52:14] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/457 places, 394/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 774 ms. Remains : 446/457 places, 394/405 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-03 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 s341 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-13-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-03 finished in 859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 457 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Graph (trivial) has 213 edges and 457 vertex of which 6 / 457 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 1032 edges and 452 vertex of which 451 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 53 place count 450 transition count 346
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 399 transition count 346
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 104 place count 399 transition count 252
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 308 place count 289 transition count 252
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 316 place count 281 transition count 244
Iterating global reduction 2 with 8 rules applied. Total rules applied 324 place count 281 transition count 244
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 324 place count 281 transition count 243
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 326 place count 280 transition count 243
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 560 place count 161 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 562 place count 160 transition count 132
Applied a total of 562 rules in 37 ms. Remains 160 /457 variables (removed 297) and now considering 132/405 (removed 273) transitions.
// Phase 1: matrix 132 rows 160 cols
[2023-03-11 02:52:14] [INFO ] Computed 70 place invariants in 2 ms
[2023-03-11 02:52:14] [INFO ] Implicit Places using invariants in 118 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 26, 49, 50, 51, 52, 53, 128]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 119 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/457 places, 132/405 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 161 ms. Remains : 140/457 places, 132/405 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-04 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 s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-04 finished in 253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||F(p1))))))'
Support contains 6 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 449 transition count 397
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 449 transition count 397
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 446 transition count 394
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 446 transition count 394
Applied a total of 22 rules in 28 ms. Remains 446 /457 variables (removed 11) and now considering 394/405 (removed 11) transitions.
// Phase 1: matrix 394 rows 446 cols
[2023-03-11 02:52:14] [INFO ] Computed 90 place invariants in 4 ms
[2023-03-11 02:52:14] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-11 02:52:14] [INFO ] Invariant cache hit.
[2023-03-11 02:52:15] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
[2023-03-11 02:52:15] [INFO ] Invariant cache hit.
[2023-03-11 02:52:15] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/457 places, 394/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1064 ms. Remains : 446/457 places, 394/405 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s441 1) (EQ s444 1)), p1:(OR (EQ s285 1) (AND (EQ s190 1) (EQ s276 1) (EQ s407 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 1301 reset in 179 ms.
Stack based approach found an accepted trace after 1319 steps with 17 reset with depth 43 and stack size 43 in 3 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-05 finished in 1447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)&&F(p1)))||G(p2))))'
Support contains 3 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 451 transition count 399
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 451 transition count 399
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 449 transition count 397
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 449 transition count 397
Applied a total of 16 rules in 27 ms. Remains 449 /457 variables (removed 8) and now considering 397/405 (removed 8) transitions.
// Phase 1: matrix 397 rows 449 cols
[2023-03-11 02:52:16] [INFO ] Computed 90 place invariants in 8 ms
[2023-03-11 02:52:16] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-11 02:52:16] [INFO ] Invariant cache hit.
[2023-03-11 02:52:16] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
[2023-03-11 02:52:16] [INFO ] Invariant cache hit.
[2023-03-11 02:52:17] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 449/457 places, 397/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1091 ms. Remains : 449/457 places, 397/405 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s292 0), p0:(EQ s57 0), p1:(EQ s36 0)], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 716 reset in 232 ms.
Product exploration explored 100000 steps with 713 reset in 268 ms.
Computed a total of 119 stabilizing places and 112 stable transitions
Graph (complete) has 1026 edges and 449 vertex of which 448 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 119 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 390 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 70 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 670573 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :{3=1, 4=1}
Probabilistic random walk after 670573 steps, saw 105745 distinct states, run finished after 3003 ms. (steps per millisecond=223 ) properties seen :2
Running SMT prover for 3 properties.
[2023-03-11 02:52:21] [INFO ] Invariant cache hit.
[2023-03-11 02:52:21] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 02:52:21] [INFO ] [Nat]Absence check using 52 positive place invariants in 10 ms returned sat
[2023-03-11 02:52:21] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 9 ms returned sat
[2023-03-11 02:52:22] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 02:52:22] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2023-03-11 02:52:22] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 0 ms to minimize.
[2023-03-11 02:52:22] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2023-03-11 02:52:22] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2023-03-11 02:52:22] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
[2023-03-11 02:52:22] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 0 ms to minimize.
[2023-03-11 02:52:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 464 ms
[2023-03-11 02:52:22] [INFO ] After 656ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-11 02:52:22] [INFO ] After 788ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 397/397 transitions.
Graph (trivial) has 203 edges and 449 vertex of which 6 / 449 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1019 edges and 444 vertex of which 443 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 443 transition count 344
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 398 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 397 transition count 343
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 94 place count 397 transition count 248
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 207 rules applied. Total rules applied 301 place count 285 transition count 248
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 543 place count 162 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 545 place count 161 transition count 133
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 547 place count 161 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 549 place count 159 transition count 131
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 550 place count 159 transition count 131
Applied a total of 550 rules in 33 ms. Remains 159 /449 variables (removed 290) and now considering 131/397 (removed 266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 159/449 places, 131/397 transitions.
Incomplete random walk after 10000 steps, including 466 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 241 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 201 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Finished probabilistic random walk after 89398 steps, run visited all 3 properties in 210 ms. (steps per millisecond=425 )
Probabilistic random walk after 89398 steps, saw 21329 distinct states, run finished after 210 ms. (steps per millisecond=425 ) properties seen :3
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 10 factoid took 549 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 397/397 transitions.
Applied a total of 0 rules in 16 ms. Remains 449 /449 variables (removed 0) and now considering 397/397 (removed 0) transitions.
[2023-03-11 02:52:24] [INFO ] Invariant cache hit.
[2023-03-11 02:52:24] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-03-11 02:52:24] [INFO ] Invariant cache hit.
[2023-03-11 02:52:24] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
[2023-03-11 02:52:24] [INFO ] Invariant cache hit.
[2023-03-11 02:52:24] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 974 ms. Remains : 449/449 places, 397/397 transitions.
Computed a total of 119 stabilizing places and 112 stable transitions
Graph (complete) has 1026 edges and 449 vertex of which 448 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 119 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 279 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 69 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 765492 steps, run timeout after 3001 ms. (steps per millisecond=255 ) properties seen :{3=1, 4=1}
Probabilistic random walk after 765492 steps, saw 117403 distinct states, run finished after 3001 ms. (steps per millisecond=255 ) properties seen :2
Running SMT prover for 3 properties.
[2023-03-11 02:52:28] [INFO ] Invariant cache hit.
[2023-03-11 02:52:28] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 02:52:28] [INFO ] [Nat]Absence check using 52 positive place invariants in 10 ms returned sat
[2023-03-11 02:52:28] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 9 ms returned sat
[2023-03-11 02:52:29] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 02:52:29] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2023-03-11 02:52:29] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 0 ms to minimize.
[2023-03-11 02:52:29] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2023-03-11 02:52:29] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 9 ms to minimize.
[2023-03-11 02:52:29] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2023-03-11 02:52:29] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 0 ms to minimize.
[2023-03-11 02:52:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 468 ms
[2023-03-11 02:52:29] [INFO ] After 721ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-11 02:52:29] [INFO ] After 872ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 397/397 transitions.
Graph (trivial) has 203 edges and 449 vertex of which 6 / 449 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1019 edges and 444 vertex of which 443 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 443 transition count 344
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 398 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 397 transition count 343
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 94 place count 397 transition count 248
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 207 rules applied. Total rules applied 301 place count 285 transition count 248
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 543 place count 162 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 545 place count 161 transition count 133
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 547 place count 161 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 549 place count 159 transition count 131
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 550 place count 159 transition count 131
Applied a total of 550 rules in 40 ms. Remains 159 /449 variables (removed 290) and now considering 131/397 (removed 266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 159/449 places, 131/397 transitions.
Incomplete random walk after 10000 steps, including 400 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 215 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 206 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 189 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Finished probabilistic random walk after 89398 steps, run visited all 3 properties in 269 ms. (steps per millisecond=332 )
Probabilistic random walk after 89398 steps, saw 21329 distinct states, run finished after 269 ms. (steps per millisecond=332 ) properties seen :3
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 10 factoid took 503 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 715 reset in 267 ms.
Product exploration explored 100000 steps with 714 reset in 275 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 397/397 transitions.
Graph (trivial) has 203 edges and 449 vertex of which 6 / 449 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 1020 edges and 444 vertex of which 443 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
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 443 transition count 390
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 68 Pre rules applied. Total rules applied 47 place count 443 transition count 438
Deduced a syphon composed of 113 places in 1 ms
Iterating global reduction 1 with 68 rules applied. Total rules applied 115 place count 443 transition count 438
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 129 place count 429 transition count 412
Deduced a syphon composed of 99 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 143 place count 429 transition count 412
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 245 places in 0 ms
Iterating global reduction 1 with 146 rules applied. Total rules applied 289 place count 429 transition count 412
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 325 place count 393 transition count 376
Deduced a syphon composed of 209 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 361 place count 393 transition count 376
Deduced a syphon composed of 209 places in 0 ms
Applied a total of 361 rules in 119 ms. Remains 393 /449 variables (removed 56) and now considering 376/397 (removed 21) transitions.
[2023-03-11 02:52:32] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 376 rows 393 cols
[2023-03-11 02:52:32] [INFO ] Computed 90 place invariants in 5 ms
[2023-03-11 02:52:33] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 393/449 places, 376/397 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 448 ms. Remains : 393/449 places, 376/397 transitions.
Support contains 3 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 397/397 transitions.
Applied a total of 0 rules in 16 ms. Remains 449 /449 variables (removed 0) and now considering 397/397 (removed 0) transitions.
// Phase 1: matrix 397 rows 449 cols
[2023-03-11 02:52:33] [INFO ] Computed 90 place invariants in 16 ms
[2023-03-11 02:52:33] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-11 02:52:33] [INFO ] Invariant cache hit.
[2023-03-11 02:52:33] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
[2023-03-11 02:52:33] [INFO ] Invariant cache hit.
[2023-03-11 02:52:33] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 924 ms. Remains : 449/449 places, 397/397 transitions.
Treatment of property BusinessProcesses-PT-13-LTLFireability-07 finished in 18041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p1 U (p2||G(p1))))))'
Support contains 4 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 450 transition count 398
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 450 transition count 398
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 447 transition count 395
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 447 transition count 395
Applied a total of 20 rules in 20 ms. Remains 447 /457 variables (removed 10) and now considering 395/405 (removed 10) transitions.
// Phase 1: matrix 395 rows 447 cols
[2023-03-11 02:52:34] [INFO ] Computed 90 place invariants in 3 ms
[2023-03-11 02:52:34] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-11 02:52:34] [INFO ] Invariant cache hit.
[2023-03-11 02:52:34] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2023-03-11 02:52:34] [INFO ] Invariant cache hit.
[2023-03-11 02:52:34] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/457 places, 395/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 680 ms. Remains : 447/457 places, 395/405 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (NEQ s346 1) (NEQ s112 1)), p1:(NEQ s112 1), p0:(OR (EQ s145 0) (EQ s402 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 713 reset in 164 ms.
Product exploration explored 100000 steps with 713 reset in 179 ms.
Computed a total of 119 stabilizing places and 112 stable transitions
Graph (complete) has 1022 edges and 447 vertex of which 446 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 119 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X p2)), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 680 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 71 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 02:52:36] [INFO ] Invariant cache hit.
[2023-03-11 02:52:36] [INFO ] [Real]Absence check using 52 positive place invariants in 11 ms returned sat
[2023-03-11 02:52:36] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 8 ms returned sat
[2023-03-11 02:52:36] [INFO ] After 129ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-11 02:52:36] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2023-03-11 02:52:36] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2023-03-11 02:52:36] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2023-03-11 02:52:36] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2023-03-11 02:52:36] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2023-03-11 02:52:37] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2023-03-11 02:52:37] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2023-03-11 02:52:37] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2023-03-11 02:52:37] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2023-03-11 02:52:37] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 533 ms
[2023-03-11 02:52:37] [INFO ] After 672ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 02:52:37] [INFO ] After 768ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 02:52:37] [INFO ] [Nat]Absence check using 52 positive place invariants in 10 ms returned sat
[2023-03-11 02:52:37] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 8 ms returned sat
[2023-03-11 02:52:37] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-11 02:52:37] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2023-03-11 02:52:37] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 0 ms to minimize.
[2023-03-11 02:52:37] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 0 ms to minimize.
[2023-03-11 02:52:37] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 1 ms to minimize.
[2023-03-11 02:52:38] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 0 ms to minimize.
[2023-03-11 02:52:38] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 1 ms to minimize.
[2023-03-11 02:52:38] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 0 ms to minimize.
[2023-03-11 02:52:38] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 0 ms to minimize.
[2023-03-11 02:52:38] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 1 ms to minimize.
[2023-03-11 02:52:38] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1118 ms
[2023-03-11 02:52:38] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2023-03-11 02:52:38] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2023-03-11 02:52:38] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2023-03-11 02:52:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 357 ms
[2023-03-11 02:52:38] [INFO ] After 1689ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-11 02:52:39] [INFO ] After 1838ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 395/395 transitions.
Graph (trivial) has 200 edges and 447 vertex of which 6 / 447 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1015 edges and 442 vertex of which 441 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 441 transition count 342
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 396 transition count 342
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 92 place count 396 transition count 249
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 294 place count 287 transition count 249
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 534 place count 165 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 536 place count 164 transition count 135
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 538 place count 164 transition count 133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 540 place count 162 transition count 133
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 545 place count 162 transition count 133
Applied a total of 545 rules in 28 ms. Remains 162 /447 variables (removed 285) and now considering 133/395 (removed 262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 162/447 places, 133/395 transitions.
Incomplete random walk after 10000 steps, including 429 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :3
Finished Best-First random walk after 109 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=109 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X p2)), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (NOT p0)), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 21 factoid took 858 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 395/395 transitions.
Applied a total of 0 rules in 7 ms. Remains 447 /447 variables (removed 0) and now considering 395/395 (removed 0) transitions.
[2023-03-11 02:52:40] [INFO ] Invariant cache hit.
[2023-03-11 02:52:40] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-11 02:52:40] [INFO ] Invariant cache hit.
[2023-03-11 02:52:40] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2023-03-11 02:52:40] [INFO ] Invariant cache hit.
[2023-03-11 02:52:41] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 690 ms. Remains : 447/447 places, 395/395 transitions.
Computed a total of 119 stabilizing places and 112 stable transitions
Graph (complete) has 1022 edges and 447 vertex of which 446 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 119 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (AND p0 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND p0 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 470 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 02:52:41] [INFO ] Invariant cache hit.
[2023-03-11 02:52:42] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 02:52:42] [INFO ] [Nat]Absence check using 52 positive place invariants in 12 ms returned sat
[2023-03-11 02:52:42] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 10 ms returned sat
[2023-03-11 02:52:42] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 02:52:42] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2023-03-11 02:52:42] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 0 ms to minimize.
[2023-03-11 02:52:42] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2023-03-11 02:52:42] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2023-03-11 02:52:42] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2023-03-11 02:52:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 565 ms
[2023-03-11 02:52:42] [INFO ] After 816ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-11 02:52:43] [INFO ] After 994ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 395/395 transitions.
Graph (trivial) has 200 edges and 447 vertex of which 6 / 447 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1015 edges and 442 vertex of which 441 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 441 transition count 342
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 396 transition count 342
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 92 place count 396 transition count 249
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 294 place count 287 transition count 249
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 534 place count 165 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 536 place count 164 transition count 135
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 538 place count 164 transition count 133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 540 place count 162 transition count 133
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 545 place count 162 transition count 133
Applied a total of 545 rules in 30 ms. Remains 162 /447 variables (removed 285) and now considering 133/395 (removed 262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 162/447 places, 133/395 transitions.
Incomplete random walk after 10000 steps, including 415 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :3
Finished Best-First random walk after 64 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=64 )
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (AND p0 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND p0 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (NOT p2)), (F (AND p1 (NOT p2))), (F (NOT p0)), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 18 factoid took 647 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 714 reset in 166 ms.
Product exploration explored 100000 steps with 715 reset in 186 ms.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 395/395 transitions.
Applied a total of 0 rules in 10 ms. Remains 447 /447 variables (removed 0) and now considering 395/395 (removed 0) transitions.
[2023-03-11 02:52:44] [INFO ] Invariant cache hit.
[2023-03-11 02:52:44] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-11 02:52:44] [INFO ] Invariant cache hit.
[2023-03-11 02:52:45] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2023-03-11 02:52:45] [INFO ] Invariant cache hit.
[2023-03-11 02:52:45] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 824 ms. Remains : 447/447 places, 395/395 transitions.
Treatment of property BusinessProcesses-PT-13-LTLFireability-08 finished in 11470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 449 transition count 397
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 449 transition count 397
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 446 transition count 394
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 446 transition count 394
Applied a total of 22 rules in 17 ms. Remains 446 /457 variables (removed 11) and now considering 394/405 (removed 11) transitions.
// Phase 1: matrix 394 rows 446 cols
[2023-03-11 02:52:45] [INFO ] Computed 90 place invariants in 2 ms
[2023-03-11 02:52:45] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-11 02:52:45] [INFO ] Invariant cache hit.
[2023-03-11 02:52:46] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2023-03-11 02:52:46] [INFO ] Invariant cache hit.
[2023-03-11 02:52:46] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/457 places, 394/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 791 ms. Remains : 446/457 places, 394/405 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-09 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 s402 0)], 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 50000 reset in 305 ms.
Product exploration explored 100000 steps with 50000 reset in 247 ms.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 1021 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-13-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-13-LTLFireability-09 finished in 1491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 449 transition count 397
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 449 transition count 397
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 446 transition count 394
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 446 transition count 394
Applied a total of 22 rules in 17 ms. Remains 446 /457 variables (removed 11) and now considering 394/405 (removed 11) transitions.
[2023-03-11 02:52:46] [INFO ] Invariant cache hit.
[2023-03-11 02:52:47] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-11 02:52:47] [INFO ] Invariant cache hit.
[2023-03-11 02:52:47] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2023-03-11 02:52:47] [INFO ] Invariant cache hit.
[2023-03-11 02:52:47] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/457 places, 394/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 832 ms. Remains : 446/457 places, 394/405 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s360 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 50000 reset in 290 ms.
Product exploration explored 100000 steps with 50000 reset in 335 ms.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 1021 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-13-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-13-LTLFireability-12 finished in 1599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((((F(p0) U p1)||F(G(p2))) U p3))))'
Support contains 6 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 450 transition count 398
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 450 transition count 398
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 448 transition count 396
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 448 transition count 396
Applied a total of 18 rules in 37 ms. Remains 448 /457 variables (removed 9) and now considering 396/405 (removed 9) transitions.
// Phase 1: matrix 396 rows 448 cols
[2023-03-11 02:52:48] [INFO ] Computed 90 place invariants in 3 ms
[2023-03-11 02:52:48] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-11 02:52:48] [INFO ] Invariant cache hit.
[2023-03-11 02:52:49] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
[2023-03-11 02:52:49] [INFO ] Invariant cache hit.
[2023-03-11 02:52:49] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 448/457 places, 396/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 908 ms. Remains : 448/457 places, 396/405 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s105 1) (EQ s331 1) (EQ s413 1)), p1:(EQ s214 1), p0:(EQ s376 1), p2:(NEQ s124 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 708 reset in 166 ms.
Product exploration explored 100000 steps with 709 reset in 181 ms.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 1025 edges and 448 vertex of which 447 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Detected a total of 118/448 stabilizing places and 111/396 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) p2), (X (AND (NOT p3) (NOT p1))), (X (AND (NOT p3) (NOT p1) (NOT p0))), (X (NOT p3)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT p3))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 568 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 02:52:51] [INFO ] Invariant cache hit.
[2023-03-11 02:52:51] [INFO ] [Real]Absence check using 52 positive place invariants in 16 ms returned sat
[2023-03-11 02:52:51] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 11 ms returned sat
[2023-03-11 02:52:51] [INFO ] After 369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 02:52:51] [INFO ] [Nat]Absence check using 52 positive place invariants in 15 ms returned sat
[2023-03-11 02:52:51] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 11 ms returned sat
[2023-03-11 02:52:51] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 02:52:52] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 3 ms to minimize.
[2023-03-11 02:52:52] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
[2023-03-11 02:52:52] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 0 ms to minimize.
[2023-03-11 02:52:52] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2023-03-11 02:52:52] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2023-03-11 02:52:52] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2023-03-11 02:52:52] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
[2023-03-11 02:52:52] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 0 ms to minimize.
[2023-03-11 02:52:52] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2023-03-11 02:52:52] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 0 ms to minimize.
[2023-03-11 02:52:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1143 ms
[2023-03-11 02:52:53] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 2 ms to minimize.
[2023-03-11 02:52:53] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2023-03-11 02:52:53] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2023-03-11 02:52:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 293 ms
[2023-03-11 02:52:53] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 1 ms to minimize.
[2023-03-11 02:52:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-03-11 02:52:53] [INFO ] After 1910ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-11 02:52:53] [INFO ] After 2144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 395 steps, including 1 resets, run visited all 3 properties in 5 ms. (steps per millisecond=79 )
Parikh walk visited 4 properties in 10 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) p2), (X (AND (NOT p3) (NOT p1))), (X (AND (NOT p3) (NOT p1) (NOT p0))), (X (NOT p3)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT p3))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (F p3), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 14 factoid took 597 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter sensitive) to 5 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p2))]
[2023-03-11 02:52:54] [INFO ] Invariant cache hit.
[2023-03-11 02:52:54] [INFO ] [Real]Absence check using 52 positive place invariants in 28 ms returned sat
[2023-03-11 02:52:54] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 26 ms returned sat
[2023-03-11 02:52:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:52:55] [INFO ] [Real]Absence check using state equation in 821 ms returned sat
[2023-03-11 02:52:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:52:55] [INFO ] [Nat]Absence check using 52 positive place invariants in 18 ms returned sat
[2023-03-11 02:52:55] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 19 ms returned sat
[2023-03-11 02:52:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:52:56] [INFO ] [Nat]Absence check using state equation in 537 ms returned sat
[2023-03-11 02:52:56] [INFO ] Computed and/alt/rep : 390/767/390 causal constraints (skipped 5 transitions) in 29 ms.
[2023-03-11 02:52:58] [INFO ] Added : 296 causal constraints over 60 iterations in 1996 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 6 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 396/396 transitions.
Applied a total of 0 rules in 10 ms. Remains 448 /448 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2023-03-11 02:52:58] [INFO ] Invariant cache hit.
[2023-03-11 02:52:58] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-11 02:52:58] [INFO ] Invariant cache hit.
[2023-03-11 02:52:59] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
[2023-03-11 02:52:59] [INFO ] Invariant cache hit.
[2023-03-11 02:52:59] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1077 ms. Remains : 448/448 places, 396/396 transitions.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 1025 edges and 448 vertex of which 447 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Detected a total of 118/448 stabilizing places and 111/396 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) p2), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p3) (NOT p1))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p3) (NOT p1) (NOT p0))), (X (NOT p3)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT p3))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 882 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter sensitive) to 5 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 70 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 02:53:00] [INFO ] Invariant cache hit.
[2023-03-11 02:53:00] [INFO ] [Real]Absence check using 52 positive place invariants in 14 ms returned sat
[2023-03-11 02:53:00] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 10 ms returned sat
[2023-03-11 02:53:01] [INFO ] After 360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 02:53:01] [INFO ] [Nat]Absence check using 52 positive place invariants in 16 ms returned sat
[2023-03-11 02:53:01] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 11 ms returned sat
[2023-03-11 02:53:01] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 02:53:01] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 1 ms to minimize.
[2023-03-11 02:53:01] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 0 ms to minimize.
[2023-03-11 02:53:02] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2023-03-11 02:53:02] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 0 ms to minimize.
[2023-03-11 02:53:02] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 0 ms to minimize.
[2023-03-11 02:53:02] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 0 ms to minimize.
[2023-03-11 02:53:02] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2023-03-11 02:53:02] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2023-03-11 02:53:02] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2023-03-11 02:53:02] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 0 ms to minimize.
[2023-03-11 02:53:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1299 ms
[2023-03-11 02:53:03] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 1 ms to minimize.
[2023-03-11 02:53:03] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2023-03-11 02:53:03] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2023-03-11 02:53:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 316 ms
[2023-03-11 02:53:03] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 1 ms to minimize.
[2023-03-11 02:53:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-03-11 02:53:03] [INFO ] After 2129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-11 02:53:03] [INFO ] After 2398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 394 steps, including 1 resets, run visited all 3 properties in 15 ms. (steps per millisecond=26 )
Parikh walk visited 4 properties in 28 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) p2), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p3) (NOT p1))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p3) (NOT p1) (NOT p0))), (X (NOT p3)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT p3))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (F p3), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 19 factoid took 1150 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter sensitive) to 5 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p2))]
[2023-03-11 02:53:05] [INFO ] Invariant cache hit.
[2023-03-11 02:53:05] [INFO ] [Real]Absence check using 52 positive place invariants in 24 ms returned sat
[2023-03-11 02:53:05] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 28 ms returned sat
[2023-03-11 02:53:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:53:06] [INFO ] [Real]Absence check using state equation in 983 ms returned sat
[2023-03-11 02:53:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:53:06] [INFO ] [Nat]Absence check using 52 positive place invariants in 23 ms returned sat
[2023-03-11 02:53:06] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 26 ms returned sat
[2023-03-11 02:53:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:53:07] [INFO ] [Nat]Absence check using state equation in 662 ms returned sat
[2023-03-11 02:53:07] [INFO ] Computed and/alt/rep : 390/767/390 causal constraints (skipped 5 transitions) in 32 ms.
[2023-03-11 02:53:09] [INFO ] Added : 296 causal constraints over 60 iterations in 2252 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 715 reset in 211 ms.
Product exploration explored 100000 steps with 717 reset in 207 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 396/396 transitions.
Graph (complete) has 1025 edges and 448 vertex of which 447 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 447 transition count 395
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 69 Pre rules applied. Total rules applied 45 place count 447 transition count 443
Deduced a syphon composed of 113 places in 1 ms
Iterating global reduction 1 with 69 rules applied. Total rules applied 114 place count 447 transition count 443
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 128 place count 433 transition count 417
Deduced a syphon composed of 99 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 142 place count 433 transition count 417
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 242 places in 0 ms
Iterating global reduction 1 with 143 rules applied. Total rules applied 285 place count 433 transition count 417
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 319 place count 399 transition count 383
Deduced a syphon composed of 208 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 353 place count 399 transition count 383
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 356 place count 399 transition count 400
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 357 place count 399 transition count 399
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 360 place count 396 transition count 393
Deduced a syphon composed of 208 places in 1 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 363 place count 396 transition count 393
Deduced a syphon composed of 208 places in 1 ms
Applied a total of 363 rules in 57 ms. Remains 396 /448 variables (removed 52) and now considering 393/396 (removed 3) transitions.
[2023-03-11 02:53:11] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 393 rows 396 cols
[2023-03-11 02:53:11] [INFO ] Computed 90 place invariants in 7 ms
[2023-03-11 02:53:11] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 396/448 places, 393/396 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 496 ms. Remains : 396/448 places, 393/396 transitions.
Support contains 6 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 396/396 transitions.
Applied a total of 0 rules in 6 ms. Remains 448 /448 variables (removed 0) and now considering 396/396 (removed 0) transitions.
// Phase 1: matrix 396 rows 448 cols
[2023-03-11 02:53:11] [INFO ] Computed 90 place invariants in 3 ms
[2023-03-11 02:53:11] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-11 02:53:11] [INFO ] Invariant cache hit.
[2023-03-11 02:53:12] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2023-03-11 02:53:12] [INFO ] Invariant cache hit.
[2023-03-11 02:53:12] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 877 ms. Remains : 448/448 places, 396/396 transitions.
Treatment of property BusinessProcesses-PT-13-LTLFireability-14 finished in 23810 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U G(p1)))))'
Support contains 2 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 450 transition count 398
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 450 transition count 398
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 447 transition count 395
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 447 transition count 395
Applied a total of 20 rules in 15 ms. Remains 447 /457 variables (removed 10) and now considering 395/405 (removed 10) transitions.
// Phase 1: matrix 395 rows 447 cols
[2023-03-11 02:53:12] [INFO ] Computed 90 place invariants in 3 ms
[2023-03-11 02:53:12] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-11 02:53:12] [INFO ] Invariant cache hit.
[2023-03-11 02:53:12] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2023-03-11 02:53:12] [INFO ] Invariant cache hit.
[2023-03-11 02:53:13] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/457 places, 395/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 794 ms. Remains : 447/457 places, 395/405 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s326 1), p0:(EQ s390 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-15 finished in 918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(G(((F(G(p1))&&p1)||p0)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)&&F(p1)))||G(p2))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-13-LTLFireability-07
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 457 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Graph (trivial) has 211 edges and 457 vertex of which 6 / 457 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 1032 edges and 452 vertex of which 451 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 450 transition count 347
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 400 transition count 346
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 399 transition count 346
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 104 place count 399 transition count 252
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 309 place count 288 transition count 252
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 315 place count 282 transition count 246
Iterating global reduction 3 with 6 rules applied. Total rules applied 321 place count 282 transition count 246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 321 place count 282 transition count 245
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 323 place count 281 transition count 245
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 557 place count 162 transition count 130
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 559 place count 161 transition count 134
Applied a total of 559 rules in 51 ms. Remains 161 /457 variables (removed 296) and now considering 134/405 (removed 271) transitions.
// Phase 1: matrix 134 rows 161 cols
[2023-03-11 02:53:13] [INFO ] Computed 69 place invariants in 2 ms
[2023-03-11 02:53:13] [INFO ] Implicit Places using invariants in 179 ms returned [1, 4, 5, 6, 16, 17, 21, 22, 23, 24, 25, 26, 49, 50, 51, 52, 53]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 183 ms to find 17 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 144/457 places, 134/405 transitions.
Applied a total of 0 rules in 4 ms. Remains 144 /144 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 238 ms. Remains : 144/457 places, 134/405 transitions.
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s64 0), p0:(EQ s4 0), p1:(EQ s2 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 21824 reset in 206 ms.
Product exploration explored 100000 steps with 21727 reset in 232 ms.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 515 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2485 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 767 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 767 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 747 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 765 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 773 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Finished probabilistic random walk after 110721 steps, run visited all 5 properties in 318 ms. (steps per millisecond=348 )
Probabilistic random walk after 110721 steps, saw 24970 distinct states, run finished after 321 ms. (steps per millisecond=344 ) properties seen :5
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 10 factoid took 515 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 238 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 134/134 transitions.
Applied a total of 0 rules in 1 ms. Remains 144 /144 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 144 cols
[2023-03-11 02:53:16] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-11 02:53:16] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-11 02:53:16] [INFO ] Invariant cache hit.
[2023-03-11 02:53:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:53:16] [INFO ] Implicit Places using invariants and state equation in 202 ms returned [3, 6, 8, 12, 15, 38, 39, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 66, 67, 69, 71, 73, 75, 77, 79, 87, 89, 91, 93, 95]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 298 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/144 places, 134/134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 110 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 110 transition count 130
Applied a total of 6 rules in 2 ms. Remains 110 /113 variables (removed 3) and now considering 130/134 (removed 4) transitions.
// Phase 1: matrix 130 rows 110 cols
[2023-03-11 02:53:16] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-11 02:53:16] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-11 02:53:16] [INFO ] Invariant cache hit.
[2023-03-11 02:53:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:53:17] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 110/144 places, 130/134 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 536 ms. Remains : 110/144 places, 130/134 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 366 edges and 110 vertex of which 96 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 426 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2520 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 745 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 761 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 766 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 757 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 02:53:18] [INFO ] Invariant cache hit.
[2023-03-11 02:53:18] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 02:53:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 02:53:18] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-11 02:53:18] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 02:53:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:53:18] [INFO ] After 19ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 02:53:18] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-11 02:53:18] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 31 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 4 properties in 1 ms.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 10 factoid took 496 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 254 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 252 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 21881 reset in 162 ms.
Product exploration explored 100000 steps with 21967 reset in 153 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 200 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 130/130 transitions.
Graph (complete) has 366 edges and 110 vertex of which 99 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 99 transition count 125
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 20 place count 90 transition count 89
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 29 place count 90 transition count 89
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 38 place count 90 transition count 93
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 38 rules in 12 ms. Remains 90 /110 variables (removed 20) and now considering 93/130 (removed 37) transitions.
[2023-03-11 02:53:20] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 93 rows 90 cols
[2023-03-11 02:53:20] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-11 02:53:20] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/110 places, 93/130 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 90/110 places, 93/130 transitions.
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 130/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 110 /110 variables (removed 0) and now considering 130/130 (removed 0) transitions.
// Phase 1: matrix 130 rows 110 cols
[2023-03-11 02:53:20] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-11 02:53:20] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-11 02:53:20] [INFO ] Invariant cache hit.
[2023-03-11 02:53:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:53:20] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2023-03-11 02:53:20] [INFO ] Invariant cache hit.
[2023-03-11 02:53:20] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 349 ms. Remains : 110/110 places, 130/130 transitions.
Treatment of property BusinessProcesses-PT-13-LTLFireability-07 finished in 7426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p1 U (p2||G(p1))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-13-LTLFireability-08
Stuttering acceptance computed with spot in 227 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 457 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Graph (trivial) has 210 edges and 457 vertex of which 6 / 457 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 1032 edges and 452 vertex of which 451 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 53 place count 450 transition count 346
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 399 transition count 346
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 92 Pre rules applied. Total rules applied 104 place count 399 transition count 254
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 304 place count 291 transition count 254
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 311 place count 284 transition count 247
Iterating global reduction 2 with 7 rules applied. Total rules applied 318 place count 284 transition count 247
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 318 place count 284 transition count 246
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 320 place count 283 transition count 246
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 552 place count 165 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 554 place count 164 transition count 136
Applied a total of 554 rules in 34 ms. Remains 164 /457 variables (removed 293) and now considering 136/405 (removed 269) transitions.
// Phase 1: matrix 136 rows 164 cols
[2023-03-11 02:53:21] [INFO ] Computed 70 place invariants in 3 ms
[2023-03-11 02:53:21] [INFO ] Implicit Places using invariants in 140 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 23, 24, 25, 50, 51, 52, 53, 54]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 153 ms to find 18 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 146/457 places, 136/405 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 189 ms. Remains : 146/457 places, 136/405 transitions.
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (NEQ s92 1) (NEQ s11 1)), p1:(NEQ s11 1), p0:(OR (EQ s17 0) (EQ s117 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 21599 reset in 209 ms.
Product exploration explored 100000 steps with 21715 reset in 224 ms.
Computed a total of 13 stabilizing places and 11 stable transitions
Computed a total of 13 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X p2)), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 967 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2490 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10000 steps, including 774 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 758 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 740 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 741 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 731 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 136 rows 146 cols
[2023-03-11 02:53:23] [INFO ] Computed 52 place invariants in 4 ms
[2023-03-11 02:53:23] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-11 02:53:23] [INFO ] [Real]Absence check using 33 positive and 19 generalized place invariants in 5 ms returned sat
[2023-03-11 02:53:23] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 02:53:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-11 02:53:23] [INFO ] [Nat]Absence check using 33 positive and 19 generalized place invariants in 4 ms returned sat
[2023-03-11 02:53:23] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-11 02:53:23] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:53:23] [INFO ] After 28ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-11 02:53:23] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-11 02:53:23] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 31 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 4 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X p2)), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (NOT p0)), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 21 factoid took 1081 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 219 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 136/136 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2023-03-11 02:53:25] [INFO ] Invariant cache hit.
[2023-03-11 02:53:25] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-11 02:53:25] [INFO ] Invariant cache hit.
[2023-03-11 02:53:25] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:53:25] [INFO ] Implicit Places using invariants and state equation in 246 ms returned [1, 3, 7, 10, 13, 38, 39, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 64, 66, 68, 70, 72, 74, 76, 78, 86, 88, 90, 94, 95]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 373 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/146 places, 136/136 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 111 transition count 130
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 111 transition count 130
Applied a total of 8 rules in 2 ms. Remains 111 /115 variables (removed 4) and now considering 130/136 (removed 6) transitions.
// Phase 1: matrix 130 rows 111 cols
[2023-03-11 02:53:25] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-11 02:53:25] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 02:53:25] [INFO ] Invariant cache hit.
[2023-03-11 02:53:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:53:25] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/146 places, 130/136 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 597 ms. Remains : 111/146 places, 130/136 transitions.
Computed a total of 7 stabilizing places and 8 stable transitions
Graph (complete) has 364 edges and 111 vertex of which 97 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (AND p0 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND p0 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 721 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2447 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 796 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 747 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 766 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 732 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 02:53:26] [INFO ] Invariant cache hit.
[2023-03-11 02:53:26] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 02:53:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-11 02:53:26] [INFO ] [Nat]Absence check using 7 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-11 02:53:26] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 02:53:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:53:26] [INFO ] After 19ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 02:53:26] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-11 02:53:26] [INFO ] After 183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 31 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 4 properties in 2 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (AND p0 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND p0 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (NOT p2)), (F (AND p1 (NOT p2))), (F (NOT p0)), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 18 factoid took 652 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 21734 reset in 98 ms.
Product exploration explored 100000 steps with 21827 reset in 103 ms.
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 130/130 transitions.
Applied a total of 0 rules in 0 ms. Remains 111 /111 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2023-03-11 02:53:28] [INFO ] Invariant cache hit.
[2023-03-11 02:53:28] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 02:53:28] [INFO ] Invariant cache hit.
[2023-03-11 02:53:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:53:28] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-03-11 02:53:28] [INFO ] Invariant cache hit.
[2023-03-11 02:53:28] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 282 ms. Remains : 111/111 places, 130/130 transitions.
Treatment of property BusinessProcesses-PT-13-LTLFireability-08 finished in 7660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((((F(p0) U p1)||F(G(p2))) U p3))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-13-LTLFireability-14
Stuttering acceptance computed with spot in 202 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 457 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Graph (complete) has 1038 edges and 457 vertex of which 456 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 455 transition count 355
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 407 transition count 353
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 405 transition count 353
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 101 place count 405 transition count 256
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 211 rules applied. Total rules applied 312 place count 291 transition count 256
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 319 place count 284 transition count 249
Iterating global reduction 3 with 7 rules applied. Total rules applied 326 place count 284 transition count 249
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 326 place count 284 transition count 248
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 328 place count 283 transition count 248
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 228 rules applied. Total rules applied 556 place count 167 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 557 place count 167 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 559 place count 166 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 560 place count 165 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 561 place count 164 transition count 138
Applied a total of 561 rules in 44 ms. Remains 164 /457 variables (removed 293) and now considering 138/405 (removed 267) transitions.
// Phase 1: matrix 138 rows 164 cols
[2023-03-11 02:53:28] [INFO ] Computed 68 place invariants in 2 ms
[2023-03-11 02:53:29] [INFO ] Implicit Places using invariants in 185 ms returned [21, 22, 26, 49, 50, 51, 52]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 187 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 157/457 places, 138/405 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 235 ms. Remains : 157/457 places, 138/405 transitions.
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s19 1) (EQ s96 1) (EQ s134 1)), p1:(EQ s48 1), p0:(EQ s117 1), p2:(NEQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 70 steps with 8 reset in 0 ms.
Treatment of property BusinessProcesses-PT-13-LTLFireability-14 finished in 543 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-14 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-11 02:53:29] [INFO ] Flatten gal took : 28 ms
[2023-03-11 02:53:29] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-11 02:53:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 457 places, 405 transitions and 1315 arcs took 5 ms.
Total runtime 98760 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-13
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA BusinessProcesses-PT-13-LTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-13-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-13-LTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678503324753

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:373
lola: rewrite Frontend/Parser/formula_rewrite.k:379
lola: rewrite Frontend/Parser/formula_rewrite.k:346
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 BusinessProcesses-PT-13-LTLFireability-00
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for BusinessProcesses-PT-13-LTLFireability-00
lola: result : true
lola: markings : 23419
lola: fired transitions : 48534
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 13 (type EXCL) for 12 BusinessProcesses-PT-13-LTLFireability-14
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for BusinessProcesses-PT-13-LTLFireability-14
lola: result : false
lola: markings : 200
lola: fired transitions : 200
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 BusinessProcesses-PT-13-LTLFireability-08
lola: time limit : 1200 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/1200 4/32 BusinessProcesses-PT-13-LTLFireability-08 466976 m, 93395 m/sec, 1991698 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/1200 7/32 BusinessProcesses-PT-13-LTLFireability-08 902565 m, 87117 m/sec, 4151845 t fired, .

Time elapsed: 10 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 15/1200 10/32 BusinessProcesses-PT-13-LTLFireability-08 1348233 m, 89133 m/sec, 6361542 t fired, .

Time elapsed: 15 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 20/1200 13/32 BusinessProcesses-PT-13-LTLFireability-08 1775529 m, 85459 m/sec, 8549265 t fired, .

Time elapsed: 20 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 25/1200 16/32 BusinessProcesses-PT-13-LTLFireability-08 2151190 m, 75132 m/sec, 10704941 t fired, .

Time elapsed: 25 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 30/1200 19/32 BusinessProcesses-PT-13-LTLFireability-08 2525124 m, 74786 m/sec, 12869355 t fired, .

Time elapsed: 30 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 35/1200 22/32 BusinessProcesses-PT-13-LTLFireability-08 2969499 m, 88875 m/sec, 14974391 t fired, .

Time elapsed: 35 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 40/1200 25/32 BusinessProcesses-PT-13-LTLFireability-08 3365412 m, 79182 m/sec, 17154438 t fired, .

Time elapsed: 40 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 45/1200 27/32 BusinessProcesses-PT-13-LTLFireability-08 3745398 m, 75997 m/sec, 19308429 t fired, .

Time elapsed: 45 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 50/1200 30/32 BusinessProcesses-PT-13-LTLFireability-08 4129349 m, 76790 m/sec, 21460548 t fired, .

Time elapsed: 50 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 10 (type EXCL) for BusinessProcesses-PT-13-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 7 (type EXCL) for 6 BusinessProcesses-PT-13-LTLFireability-07
lola: time limit : 1772 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1772 3/32 BusinessProcesses-PT-13-LTLFireability-07 339078 m, 67815 m/sec, 2160370 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1772 6/32 BusinessProcesses-PT-13-LTLFireability-07 696723 m, 71529 m/sec, 4612617 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1772 9/32 BusinessProcesses-PT-13-LTLFireability-07 1011871 m, 63029 m/sec, 7122176 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1772 12/32 BusinessProcesses-PT-13-LTLFireability-07 1353427 m, 68311 m/sec, 9533609 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/1772 15/32 BusinessProcesses-PT-13-LTLFireability-07 1637897 m, 56894 m/sec, 11746869 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/1772 17/32 BusinessProcesses-PT-13-LTLFireability-07 1897358 m, 51892 m/sec, 13993127 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 35/1772 19/32 BusinessProcesses-PT-13-LTLFireability-07 2200814 m, 60691 m/sec, 16390923 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 40/1772 22/32 BusinessProcesses-PT-13-LTLFireability-07 2528957 m, 65628 m/sec, 18881909 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 45/1772 25/32 BusinessProcesses-PT-13-LTLFireability-07 2838835 m, 61975 m/sec, 21364372 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 50/1772 27/32 BusinessProcesses-PT-13-LTLFireability-07 3113714 m, 54975 m/sec, 23839996 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 55/1772 30/32 BusinessProcesses-PT-13-LTLFireability-07 3456205 m, 68498 m/sec, 26325919 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 7 (type EXCL) for BusinessProcesses-PT-13-LTLFireability-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-13-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-13-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
BusinessProcesses-PT-13-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 4 (type EXCL) for 3 BusinessProcesses-PT-13-LTLFireability-01
lola: time limit : 3485 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for BusinessProcesses-PT-13-LTLFireability-01
lola: result : false
lola: markings : 614
lola: fired transitions : 1103
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 5

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLFireability-00: LTL true LTL model checker
BusinessProcesses-PT-13-LTLFireability-01: LTL false LTL model checker
BusinessProcesses-PT-13-LTLFireability-07: LTL unknown AGGR
BusinessProcesses-PT-13-LTLFireability-08: LTL unknown AGGR
BusinessProcesses-PT-13-LTLFireability-14: LTL false LTL model checker


Time elapsed: 115 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-13"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is BusinessProcesses-PT-13, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r039-tajo-167813692700548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-13.tgz
mv BusinessProcesses-PT-13 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;