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.r041-tajo-167813694800492.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 ltsminxred
Input is BusinessProcesses-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694800492
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 8.0K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:50 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:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 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 85K 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-06-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678640383319

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:59:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:59:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:59:44] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-12 16:59:44] [INFO ] Transformed 376 places.
[2023-03-12 16:59:44] [INFO ] Transformed 297 transitions.
[2023-03-12 16:59:44] [INFO ] Found NUPN structural information;
[2023-03-12 16:59:44] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-06-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 296/296 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 373 transition count 296
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 40 place count 335 transition count 258
Iterating global reduction 1 with 38 rules applied. Total rules applied 78 place count 335 transition count 258
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 94 place count 319 transition count 242
Iterating global reduction 1 with 16 rules applied. Total rules applied 110 place count 319 transition count 242
Applied a total of 110 rules in 65 ms. Remains 319 /375 variables (removed 56) and now considering 242/296 (removed 54) transitions.
// Phase 1: matrix 242 rows 319 cols
[2023-03-12 16:59:45] [INFO ] Computed 79 place invariants in 26 ms
[2023-03-12 16:59:45] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-12 16:59:45] [INFO ] Invariant cache hit.
[2023-03-12 16:59:45] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2023-03-12 16:59:45] [INFO ] Invariant cache hit.
[2023-03-12 16:59:45] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/375 places, 242/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 744 ms. Remains : 319/375 places, 242/296 transitions.
Support contains 45 out of 319 places after structural reductions.
[2023-03-12 16:59:46] [INFO ] Flatten gal took : 40 ms
[2023-03-12 16:59:46] [INFO ] Flatten gal took : 15 ms
[2023-03-12 16:59:46] [INFO ] Input system was already deterministic with 242 transitions.
Incomplete random walk after 10000 steps, including 99 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 34) seen :31
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 16:59:46] [INFO ] Invariant cache hit.
[2023-03-12 16:59:46] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-12 16:59:46] [INFO ] [Real]Absence check using 34 positive and 45 generalized place invariants in 12 ms returned sat
[2023-03-12 16:59:46] [INFO ] After 117ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1
[2023-03-12 16:59:46] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 4 ms to minimize.
[2023-03-12 16:59:46] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2023-03-12 16:59:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 133 ms
[2023-03-12 16:59:47] [INFO ] After 261ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-12 16:59:47] [INFO ] After 386ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-12 16:59:47] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-12 16:59:47] [INFO ] [Nat]Absence check using 34 positive and 45 generalized place invariants in 12 ms returned sat
[2023-03-12 16:59:47] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-12 16:59:47] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2023-03-12 16:59:47] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2023-03-12 16:59:47] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2023-03-12 16:59:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 135 ms
[2023-03-12 16:59:47] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-12 16:59:47] [INFO ] After 316ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 194 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=97 )
Parikh walk visited 1 properties in 2 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 312 stabilizing places and 233 stable transitions
Graph (complete) has 630 edges and 319 vertex of which 318 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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((p0||(X(p2)&&p1))))'
Support contains 4 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 242/242 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 310 transition count 233
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 310 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 309 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 309 transition count 232
Applied a total of 20 rules in 20 ms. Remains 309 /319 variables (removed 10) and now considering 232/242 (removed 10) transitions.
// Phase 1: matrix 232 rows 309 cols
[2023-03-12 16:59:47] [INFO ] Computed 79 place invariants in 5 ms
[2023-03-12 16:59:47] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-12 16:59:47] [INFO ] Invariant cache hit.
[2023-03-12 16:59:48] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-12 16:59:48] [INFO ] Invariant cache hit.
[2023-03-12 16:59:48] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/319 places, 232/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 477 ms. Remains : 309/319 places, 232/242 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s11 0), p1:(AND (EQ s61 1) (EQ s52 1)), p2:(OR (EQ s11 1) (EQ s98 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 48 steps with 0 reset in 5 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-00 finished in 741 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)||G((X(F(p1))||(p1&&F(p2)))))))'
Support contains 2 out of 319 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 319/319 places, 242/242 transitions.
Graph (complete) has 630 edges and 319 vertex of which 318 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 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 317 transition count 211
Reduce places removed 29 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 288 transition count 209
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 286 transition count 209
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 63 place count 286 transition count 140
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 211 place count 207 transition count 140
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 218 place count 200 transition count 133
Iterating global reduction 3 with 7 rules applied. Total rules applied 225 place count 200 transition count 133
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 393 place count 112 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 394 place count 112 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 395 place count 111 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 396 place count 110 transition count 51
Applied a total of 396 rules in 86 ms. Remains 110 /319 variables (removed 209) and now considering 51/242 (removed 191) transitions.
// Phase 1: matrix 51 rows 110 cols
[2023-03-12 16:59:48] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-12 16:59:48] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-12 16:59:48] [INFO ] Invariant cache hit.
[2023-03-12 16:59:48] [INFO ] Implicit Places using invariants and state equation in 116 ms returned [5, 6, 7, 8, 9, 10, 12, 14, 16, 18, 20, 22, 24, 26, 35, 36, 78]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 198 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/319 places, 51/242 transitions.
Graph (complete) has 258 edges and 93 vertex of which 85 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 4 ms. Remains 85 /93 variables (removed 8) and now considering 50/51 (removed 1) transitions.
// Phase 1: matrix 50 rows 85 cols
[2023-03-12 16:59:48] [INFO ] Computed 36 place invariants in 3 ms
[2023-03-12 16:59:48] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-12 16:59:48] [INFO ] Invariant cache hit.
[2023-03-12 16:59:48] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/319 places, 50/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 435 ms. Remains : 85/319 places, 50/242 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s60 1), p0:(EQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-01 finished in 520 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(p0))'
Support contains 3 out of 319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 319/319 places, 242/242 transitions.
Graph (trivial) has 140 edges and 319 vertex of which 6 / 319 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 624 edges and 314 vertex of which 313 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 312 transition count 203
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 281 transition count 202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 280 transition count 202
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 66 place count 280 transition count 137
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 206 place count 205 transition count 137
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 213 place count 198 transition count 130
Iterating global reduction 3 with 7 rules applied. Total rules applied 220 place count 198 transition count 130
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 388 place count 110 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 389 place count 109 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 390 place count 108 transition count 49
Applied a total of 390 rules in 45 ms. Remains 108 /319 variables (removed 211) and now considering 49/242 (removed 193) transitions.
// Phase 1: matrix 49 rows 108 cols
[2023-03-12 16:59:49] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-12 16:59:49] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-12 16:59:49] [INFO ] Invariant cache hit.
[2023-03-12 16:59:49] [INFO ] Implicit Places using invariants and state equation in 113 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 33, 34]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 191 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/319 places, 49/242 transitions.
Graph (complete) has 248 edges and 89 vertex of which 81 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 4 ms. Remains 81 /89 variables (removed 8) and now considering 48/49 (removed 1) transitions.
// Phase 1: matrix 48 rows 81 cols
[2023-03-12 16:59:49] [INFO ] Computed 34 place invariants in 0 ms
[2023-03-12 16:59:49] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-12 16:59:49] [INFO ] Invariant cache hit.
[2023-03-12 16:59:49] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 81/319 places, 48/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 387 ms. Remains : 81/319 places, 48/242 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s8 1) (EQ s38 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-02 finished in 444 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((X(p0)||(p1 U (p2||G(p1)))))))'
Support contains 5 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 242/242 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 312 transition count 235
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 312 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 311 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 311 transition count 234
Applied a total of 16 rules in 35 ms. Remains 311 /319 variables (removed 8) and now considering 234/242 (removed 8) transitions.
// Phase 1: matrix 234 rows 311 cols
[2023-03-12 16:59:49] [INFO ] Computed 79 place invariants in 2 ms
[2023-03-12 16:59:49] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-12 16:59:49] [INFO ] Invariant cache hit.
[2023-03-12 16:59:49] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2023-03-12 16:59:49] [INFO ] Invariant cache hit.
[2023-03-12 16:59:49] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 311/319 places, 234/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 532 ms. Remains : 311/319 places, 234/242 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (NEQ s238 1) (NEQ s273 1)), p1:(NEQ s273 1), p0:(AND (EQ s94 1) (EQ s223 1) (EQ s280 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][false, false, false, false]]
Product exploration explored 100000 steps with 1019 reset in 268 ms.
Product exploration explored 100000 steps with 1018 reset in 243 ms.
Computed a total of 304 stabilizing places and 225 stable transitions
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 304 stabilizing places and 225 stable transitions
Detected a total of 304/311 stabilizing places and 225/234 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 788 ms. Reduced automaton from 4 states, 17 edges and 3 AP (stutter sensitive) to 3 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (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 100 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-12 16:59:51] [INFO ] Invariant cache hit.
[2023-03-12 16:59:51] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-12 16:59:51] [INFO ] [Real]Absence check using 34 positive and 45 generalized place invariants in 13 ms returned sat
[2023-03-12 16:59:51] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (OR (AND p0 p1) (AND p0 p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR (AND p0 p1) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 22 factoid took 717 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 234/234 transitions.
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 309 transition count 205
Reduce places removed 27 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 282 transition count 203
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 280 transition count 203
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 59 place count 280 transition count 138
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 199 place count 205 transition count 138
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 381 place count 110 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 382 place count 110 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 383 place count 109 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 108 transition count 49
Applied a total of 384 rules in 27 ms. Remains 108 /311 variables (removed 203) and now considering 49/234 (removed 185) transitions.
// Phase 1: matrix 49 rows 108 cols
[2023-03-12 16:59:52] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-12 16:59:52] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-12 16:59:52] [INFO ] Invariant cache hit.
[2023-03-12 16:59:52] [INFO ] Implicit Places using invariants and state equation in 107 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 25, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 73, 74, 76]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 168 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/311 places, 49/234 transitions.
Graph (complete) has 174 edges and 77 vertex of which 69 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 69 transition count 39
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 60 transition count 39
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 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 42 place count 45 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 44 transition count 30
Applied a total of 44 rules in 7 ms. Remains 44 /77 variables (removed 33) and now considering 30/49 (removed 19) transitions.
// Phase 1: matrix 30 rows 44 cols
[2023-03-12 16:59:52] [INFO ] Computed 15 place invariants in 13 ms
[2023-03-12 16:59:52] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-12 16:59:52] [INFO ] Invariant cache hit.
[2023-03-12 16:59:53] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/311 places, 30/234 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 282 ms. Remains : 44/311 places, 30/234 transitions.
Computed a total of 41 stabilizing places and 26 stable transitions
Graph (complete) has 134 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 26 stable transitions
Detected a total of 41/44 stabilizing places and 26/30 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (OR p1 p2)), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (OR p1 p2))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 288 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 1791 steps, including 291 resets, run visited all 4 properties in 12 ms. (steps per millisecond=149 )
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (OR p1 p2)), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (OR p1 p2))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (F (NOT (OR p1 p2))), (F (OR (AND p1 p0) (AND p2 p0))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 11 factoid took 367 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 15967 reset in 105 ms.
Product exploration explored 100000 steps with 16009 reset in 121 ms.
Support contains 5 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-12 16:59:54] [INFO ] Invariant cache hit.
[2023-03-12 16:59:54] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-12 16:59:54] [INFO ] Invariant cache hit.
[2023-03-12 16:59:54] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-12 16:59:54] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-12 16:59:54] [INFO ] Invariant cache hit.
[2023-03-12 16:59:54] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 44/44 places, 30/30 transitions.
Treatment of property BusinessProcesses-PT-06-LTLFireability-03 finished in 4935 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(p0) U p1)&&G(X(G(p2))))))'
Support contains 3 out of 319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 319/319 places, 242/242 transitions.
Graph (trivial) has 140 edges and 319 vertex of which 6 / 319 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 624 edges and 314 vertex of which 313 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 312 transition count 203
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 281 transition count 202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 280 transition count 202
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 66 place count 280 transition count 137
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 206 place count 205 transition count 137
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 214 place count 197 transition count 129
Iterating global reduction 3 with 8 rules applied. Total rules applied 222 place count 197 transition count 129
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 388 place count 110 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 389 place count 109 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 390 place count 108 transition count 49
Applied a total of 390 rules in 25 ms. Remains 108 /319 variables (removed 211) and now considering 49/242 (removed 193) transitions.
// Phase 1: matrix 49 rows 108 cols
[2023-03-12 16:59:54] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-12 16:59:54] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-12 16:59:54] [INFO ] Invariant cache hit.
[2023-03-12 16:59:54] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [0, 1, 2, 3, 4, 5, 7, 8, 9, 11, 13, 15, 17, 19, 22, 24, 26, 35, 36, 68, 70, 72, 74, 76, 78]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 157 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/319 places, 49/242 transitions.
Graph (complete) has 214 edges and 83 vertex of which 75 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 74 transition count 47
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 14 place count 67 transition count 43
Applied a total of 14 rules in 4 ms. Remains 67 /83 variables (removed 16) and now considering 43/49 (removed 6) transitions.
// Phase 1: matrix 43 rows 67 cols
[2023-03-12 16:59:54] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-12 16:59:54] [INFO ] Implicit Places using invariants in 36 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/319 places, 43/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 226 ms. Remains : 66/319 places, 43/242 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s12 1), p2:(EQ s7 0), p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-05 finished in 347 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||X(X(p1))))&&(p2||F(p3)))))'
Support contains 5 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 242/242 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 310 transition count 233
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 310 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 309 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 309 transition count 232
Applied a total of 20 rules in 12 ms. Remains 309 /319 variables (removed 10) and now considering 232/242 (removed 10) transitions.
// Phase 1: matrix 232 rows 309 cols
[2023-03-12 16:59:54] [INFO ] Computed 79 place invariants in 2 ms
[2023-03-12 16:59:54] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-12 16:59:54] [INFO ] Invariant cache hit.
[2023-03-12 16:59:55] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2023-03-12 16:59:55] [INFO ] Invariant cache hit.
[2023-03-12 16:59:55] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/319 places, 232/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 459 ms. Remains : 309/319 places, 232/242 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p3), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s93 0), p2:(EQ s93 1), p3:(AND (EQ s85 1) (EQ s211 1) (EQ s278 1) (EQ s16 1)), p1:(OR (EQ s85 0) (EQ s211 0) (EQ s278 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, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 667 steps with 4 reset in 5 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-08 finished in 752 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(p0)&&(p1 U X(X(G(!p1))))))'
Support contains 2 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 242/242 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 310 transition count 233
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 310 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 309 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 309 transition count 232
Applied a total of 20 rules in 13 ms. Remains 309 /319 variables (removed 10) and now considering 232/242 (removed 10) transitions.
[2023-03-12 16:59:55] [INFO ] Invariant cache hit.
[2023-03-12 16:59:55] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-12 16:59:55] [INFO ] Invariant cache hit.
[2023-03-12 16:59:55] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2023-03-12 16:59:55] [INFO ] Invariant cache hit.
[2023-03-12 16:59:55] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/319 places, 232/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 309/319 places, 232/242 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) p1), (NOT p0), p1, p1, p1, true]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s59 1), p1:(EQ s99 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 616 steps with 6 reset in 2 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-09 finished in 745 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(G(p0))&&F(p1))))'
Support contains 4 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 242/242 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 310 transition count 233
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 310 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 309 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 309 transition count 232
Applied a total of 20 rules in 14 ms. Remains 309 /319 variables (removed 10) and now considering 232/242 (removed 10) transitions.
[2023-03-12 16:59:56] [INFO ] Invariant cache hit.
[2023-03-12 16:59:56] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-12 16:59:56] [INFO ] Invariant cache hit.
[2023-03-12 16:59:56] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2023-03-12 16:59:56] [INFO ] Invariant cache hit.
[2023-03-12 16:59:56] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/319 places, 232/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 523 ms. Remains : 309/319 places, 232/242 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s18 1) (EQ s172 1) (EQ s256 1)), p0:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-11 finished in 707 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(p0)&&(p1 U X(p2))))'
Support contains 3 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 242/242 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 312 transition count 235
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 312 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 311 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 311 transition count 234
Applied a total of 16 rules in 12 ms. Remains 311 /319 variables (removed 8) and now considering 234/242 (removed 8) transitions.
// Phase 1: matrix 234 rows 311 cols
[2023-03-12 16:59:56] [INFO ] Computed 79 place invariants in 6 ms
[2023-03-12 16:59:57] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-12 16:59:57] [INFO ] Invariant cache hit.
[2023-03-12 16:59:57] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2023-03-12 16:59:57] [INFO ] Invariant cache hit.
[2023-03-12 16:59:57] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 311/319 places, 234/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 547 ms. Remains : 311/319 places, 234/242 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), true]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s49 1), p0:(EQ s213 1), p2:(EQ s238 1)], nbAcceptance=0, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-12 finished in 685 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((p0||X(X(X((F(p1)||X(!p0))))))) U X(p2)))'
Support contains 3 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 242/242 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 310 transition count 233
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 310 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 309 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 309 transition count 232
Applied a total of 20 rules in 15 ms. Remains 309 /319 variables (removed 10) and now considering 232/242 (removed 10) transitions.
// Phase 1: matrix 232 rows 309 cols
[2023-03-12 16:59:57] [INFO ] Computed 79 place invariants in 2 ms
[2023-03-12 16:59:57] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-12 16:59:57] [INFO ] Invariant cache hit.
[2023-03-12 16:59:57] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2023-03-12 16:59:57] [INFO ] Invariant cache hit.
[2023-03-12 16:59:58] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/319 places, 232/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 566 ms. Remains : 309/319 places, 232/242 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p2), (AND (NOT p2) p0 (NOT p1)), (NOT p2), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p0 (NOT p1)), false, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 6}, { cond=(NOT p2), acceptance={0} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s229 1), p2:(EQ s252 1), p1:(EQ s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 18931 steps with 3017 reset in 58 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-14 finished in 937 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&&X((G(F(p0))&&(!p1 U (p2||G(!p1)))))))))'
Support contains 5 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 242/242 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 311 transition count 234
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 311 transition count 234
Applied a total of 16 rules in 10 ms. Remains 311 /319 variables (removed 8) and now considering 234/242 (removed 8) transitions.
// Phase 1: matrix 234 rows 311 cols
[2023-03-12 16:59:58] [INFO ] Computed 79 place invariants in 2 ms
[2023-03-12 16:59:58] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-12 16:59:58] [INFO ] Invariant cache hit.
[2023-03-12 16:59:58] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2023-03-12 16:59:58] [INFO ] Invariant cache hit.
[2023-03-12 16:59:59] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 311/319 places, 234/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 526 ms. Remains : 311/319 places, 234/242 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 3}, { cond=(OR p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=5 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s272 0), p2:(AND (NEQ s104 1) (NOT (AND (EQ s39 1) (EQ s227 1) (EQ s280 1)))), p1:(AND (EQ s39 1) (EQ s227 1) (EQ s280 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1041 reset in 261 ms.
Product exploration explored 100000 steps with 1028 reset in 268 ms.
Computed a total of 304 stabilizing places and 225 stable transitions
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 304 stabilizing places and 225 stable transitions
Detected a total of 304/311 stabilizing places and 225/234 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X p0)), (X (X (OR p2 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 345 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 99 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 17:00:00] [INFO ] Invariant cache hit.
[2023-03-12 17:00:00] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:00:00] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-12 17:00:00] [INFO ] [Nat]Absence check using 34 positive and 45 generalized place invariants in 13 ms returned sat
[2023-03-12 17:00:00] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X p0)), (X (X (OR p2 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (AND p1 p0 (NOT p2)))]
Knowledge based reduction with 10 factoid took 424 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Support contains 5 out of 311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 234/234 transitions.
Applied a total of 0 rules in 4 ms. Remains 311 /311 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-12 17:00:01] [INFO ] Invariant cache hit.
[2023-03-12 17:00:01] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-12 17:00:01] [INFO ] Invariant cache hit.
[2023-03-12 17:00:01] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2023-03-12 17:00:01] [INFO ] Invariant cache hit.
[2023-03-12 17:00:01] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 455 ms. Remains : 311/311 places, 234/234 transitions.
Computed a total of 304 stabilizing places and 225 stable transitions
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 304 stabilizing places and 225 stable transitions
Detected a total of 304/311 stabilizing places and 225/234 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), true, (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 300 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Finished random walk after 8986 steps, including 91 resets, run visited all 4 properties in 20 ms. (steps per millisecond=449 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), true, (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 331 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 1015 reset in 158 ms.
Product exploration explored 100000 steps with 1046 reset in 172 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Support contains 5 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 234/234 transitions.
Graph (complete) has 620 edges and 311 vertex of which 310 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 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 310 transition count 233
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 38 Pre rules applied. Total rules applied 28 place count 310 transition count 257
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 66 place count 310 transition count 257
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 77 place count 299 transition count 236
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 88 place count 299 transition count 236
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 1 ms
Iterating global reduction 1 with 112 rules applied. Total rules applied 200 place count 299 transition count 236
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 215 place count 284 transition count 221
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 230 place count 284 transition count 221
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 153 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 232 place count 284 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 233 place count 284 transition count 224
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 235 place count 282 transition count 220
Deduced a syphon composed of 151 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 237 place count 282 transition count 220
Deduced a syphon composed of 151 places in 0 ms
Applied a total of 237 rules in 47 ms. Remains 282 /311 variables (removed 29) and now considering 220/234 (removed 14) transitions.
[2023-03-12 17:00:04] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 220 rows 282 cols
[2023-03-12 17:00:04] [INFO ] Computed 79 place invariants in 4 ms
[2023-03-12 17:00:04] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/311 places, 220/234 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 215 ms. Remains : 282/311 places, 220/234 transitions.
Support contains 5 out of 311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 234/234 transitions.
Applied a total of 0 rules in 7 ms. Remains 311 /311 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 311 cols
[2023-03-12 17:00:04] [INFO ] Computed 79 place invariants in 2 ms
[2023-03-12 17:00:04] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-12 17:00:04] [INFO ] Invariant cache hit.
[2023-03-12 17:00:04] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2023-03-12 17:00:04] [INFO ] Invariant cache hit.
[2023-03-12 17:00:04] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 471 ms. Remains : 311/311 places, 234/234 transitions.
Treatment of property BusinessProcesses-PT-06-LTLFireability-15 finished in 6223 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((X(p0)||(p1 U (p2||G(p1)))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-06-LTLFireability-03
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 5 out of 319 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 319/319 places, 242/242 transitions.
Graph (complete) has 630 edges and 319 vertex of which 318 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 317 transition count 210
Reduce places removed 30 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 287 transition count 208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 285 transition count 208
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 65 place count 285 transition count 141
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 209 place count 208 transition count 141
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 215 place count 202 transition count 135
Iterating global reduction 3 with 6 rules applied. Total rules applied 221 place count 202 transition count 135
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 397 place count 110 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 398 place count 110 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 399 place count 109 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 400 place count 108 transition count 49
Applied a total of 400 rules in 26 ms. Remains 108 /319 variables (removed 211) and now considering 49/242 (removed 193) transitions.
// Phase 1: matrix 49 rows 108 cols
[2023-03-12 17:00:05] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-12 17:00:05] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-12 17:00:05] [INFO ] Invariant cache hit.
[2023-03-12 17:00:05] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 25, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 73, 74, 76]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 242 ms to find 31 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 77/319 places, 49/242 transitions.
Graph (complete) has 174 edges and 77 vertex of which 69 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 69 transition count 39
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 60 transition count 39
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 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 42 place count 45 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 44 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 44 transition count 30
Applied a total of 44 rules in 11 ms. Remains 44 /77 variables (removed 33) and now considering 30/49 (removed 19) transitions.
// Phase 1: matrix 30 rows 44 cols
[2023-03-12 17:00:05] [INFO ] Computed 15 place invariants in 7 ms
[2023-03-12 17:00:05] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-12 17:00:05] [INFO ] Invariant cache hit.
[2023-03-12 17:00:05] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 44/319 places, 30/242 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 388 ms. Remains : 44/319 places, 30/242 transitions.
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (NEQ s35 1) (NEQ s42 1)), p1:(NEQ s42 1), p0:(AND (EQ s15 1) (EQ s31 1) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 15851 reset in 115 ms.
Product exploration explored 100000 steps with 15900 reset in 120 ms.
Computed a total of 41 stabilizing places and 26 stable transitions
Graph (complete) has 134 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 26 stable transitions
Detected a total of 41/44 stabilizing places and 26/30 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 776 ms. Reduced automaton from 4 states, 17 edges and 3 AP (stutter sensitive) to 3 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (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 1620 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10000 steps, including 495 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 17:00:06] [INFO ] Invariant cache hit.
[2023-03-12 17:00:06] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 17:00:06] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-12 17:00:06] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (OR (AND p0 p1) (AND p0 p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR (AND p0 p1) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 22 factoid took 933 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-12 17:00:07] [INFO ] Invariant cache hit.
[2023-03-12 17:00:07] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-12 17:00:07] [INFO ] Invariant cache hit.
[2023-03-12 17:00:07] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-12 17:00:07] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-12 17:00:07] [INFO ] Invariant cache hit.
[2023-03-12 17:00:07] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 44/44 places, 30/30 transitions.
Computed a total of 41 stabilizing places and 26 stable transitions
Graph (complete) has 134 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 41 stabilizing places and 26 stable transitions
Detected a total of 41/44 stabilizing places and 26/30 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (OR p1 p2)), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (OR p1 p2))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 400 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 63 steps, including 5 resets, run visited all 4 properties in 4 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (OR p1 p2)), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (OR p1 p2))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (F (NOT (OR p1 p2))), (F (OR (AND p1 p0) (AND p2 p0))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 11 factoid took 586 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 15924 reset in 141 ms.
Product exploration explored 100000 steps with 16074 reset in 139 ms.
Support contains 5 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-12 17:00:09] [INFO ] Invariant cache hit.
[2023-03-12 17:00:09] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-12 17:00:09] [INFO ] Invariant cache hit.
[2023-03-12 17:00:09] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-12 17:00:09] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-12 17:00:09] [INFO ] Invariant cache hit.
[2023-03-12 17:00:09] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 44/44 places, 30/30 transitions.
Treatment of property BusinessProcesses-PT-06-LTLFireability-03 finished in 5041 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&&X((G(F(p0))&&(!p1 U (p2||G(!p1)))))))))'
Found a Shortening insensitive property : BusinessProcesses-PT-06-LTLFireability-15
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Support contains 5 out of 319 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 319/319 places, 242/242 transitions.
Graph (complete) has 630 edges and 319 vertex of which 318 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 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 317 transition count 211
Reduce places removed 29 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 288 transition count 209
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 286 transition count 209
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 63 place count 286 transition count 141
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 209 place count 208 transition count 141
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 216 place count 201 transition count 134
Iterating global reduction 3 with 7 rules applied. Total rules applied 223 place count 201 transition count 134
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 163 rules applied. Total rules applied 386 place count 118 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 387 place count 118 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 388 place count 117 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 389 place count 116 transition count 52
Applied a total of 389 rules in 28 ms. Remains 116 /319 variables (removed 203) and now considering 52/242 (removed 190) transitions.
// Phase 1: matrix 52 rows 116 cols
[2023-03-12 17:00:10] [INFO ] Computed 65 place invariants in 0 ms
[2023-03-12 17:00:10] [INFO ] Implicit Places using invariants in 78 ms returned [100, 102, 104, 106, 108]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 80 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 111/319 places, 52/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 111 ms. Remains : 111/319 places, 52/242 transitions.
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 3}, { cond=(OR p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=5 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s95 0), p2:(AND (NEQ s28 1) (NOT (AND (EQ s5 1) (EQ s74 1) (EQ s99 1)))), p1:(AND (EQ s5 1) (EQ s74 1) (EQ s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14612 reset in 228 ms.
Product exploration explored 100000 steps with 14469 reset in 239 ms.
Computed a total of 108 stabilizing places and 48 stable transitions
Computed a total of 108 stabilizing places and 48 stable transitions
Detected a total of 108/111 stabilizing places and 48/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X p0)), (X (X (OR p2 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 438 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 1478 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 441 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 52 rows 111 cols
[2023-03-12 17:00:11] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-12 17:00:11] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:00:11] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-12 17:00:11] [INFO ] [Nat]Absence check using 32 positive and 28 generalized place invariants in 4 ms returned sat
[2023-03-12 17:00:11] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X p0)), (X (X (OR p2 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (AND p1 p0 (NOT p2)))]
Knowledge based reduction with 10 factoid took 555 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 111 /111 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2023-03-12 17:00:12] [INFO ] Invariant cache hit.
[2023-03-12 17:00:12] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-12 17:00:12] [INFO ] Invariant cache hit.
[2023-03-12 17:00:12] [INFO ] Implicit Places using invariants and state equation in 97 ms returned [7, 8, 9, 10, 12, 14, 16, 18, 20, 22, 24, 26, 42, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 185 ms to find 34 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/111 places, 52/52 transitions.
Applied a total of 0 rules in 0 ms. Remains 77 /77 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 188 ms. Remains : 77/111 places, 52/52 transitions.
Computed a total of 74 stabilizing places and 48 stable transitions
Graph (complete) has 154 edges and 77 vertex of which 69 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Computed a total of 74 stabilizing places and 48 stable transitions
Detected a total of 74/77 stabilizing places and 48/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), true, (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 257 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Finished random walk after 828 steps, including 110 resets, run visited all 4 properties in 3 ms. (steps per millisecond=276 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), true, (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 298 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 14708 reset in 102 ms.
Product exploration explored 100000 steps with 14526 reset in 101 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 52/52 transitions.
Graph (complete) has 154 edges and 77 vertex of which 69 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 69 transition count 51
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 18 place count 69 transition count 51
Deduced a syphon composed of 17 places in 0 ms
Applied a total of 18 rules in 5 ms. Remains 69 /77 variables (removed 8) and now considering 51/52 (removed 1) transitions.
[2023-03-12 17:00:14] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 51 rows 69 cols
[2023-03-12 17:00:14] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-12 17:00:14] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/77 places, 51/52 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 69/77 places, 51/52 transitions.
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 52/52 transitions.
Applied a total of 0 rules in 0 ms. Remains 77 /77 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 77 cols
[2023-03-12 17:00:14] [INFO ] Computed 26 place invariants in 0 ms
[2023-03-12 17:00:14] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-12 17:00:14] [INFO ] Invariant cache hit.
[2023-03-12 17:00:14] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-12 17:00:14] [INFO ] Invariant cache hit.
[2023-03-12 17:00:14] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 77/77 places, 52/52 transitions.
Treatment of property BusinessProcesses-PT-06-LTLFireability-15 finished in 4809 ms.
[2023-03-12 17:00:14] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:00:14] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 17:00:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 319 places, 242 transitions and 718 arcs took 2 ms.
Total runtime 29798 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2302/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2302/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BusinessProcesses-PT-06-LTLFireability-03
Could not compute solution for formula : BusinessProcesses-PT-06-LTLFireability-15

BK_STOP 1678640415125

--------------------
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
mcc2023
ltl formula name BusinessProcesses-PT-06-LTLFireability-03
ltl formula formula --ltl=/tmp/2302/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 319 places, 242 transitions and 718 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2302/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2302/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2302/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2302/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
ltl formula name BusinessProcesses-PT-06-LTLFireability-15
ltl formula formula --ltl=/tmp/2302/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 319 places, 242 transitions and 718 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2302/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2302/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2302/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2302/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-06, 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 r041-tajo-167813694800492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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