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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:42 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.8K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 156K 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-14-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678645512613

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-14
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:25:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 18:25:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:25:15] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2023-03-12 18:25:15] [INFO ] Transformed 624 places.
[2023-03-12 18:25:15] [INFO ] Transformed 564 transitions.
[2023-03-12 18:25:15] [INFO ] Found NUPN structural information;
[2023-03-12 18:25:15] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 8 places in 13 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 611 transition count 556
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 90 place count 526 transition count 471
Iterating global reduction 1 with 85 rules applied. Total rules applied 175 place count 526 transition count 471
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 217 place count 484 transition count 429
Iterating global reduction 1 with 42 rules applied. Total rules applied 259 place count 484 transition count 429
Applied a total of 259 rules in 179 ms. Remains 484 /616 variables (removed 132) and now considering 429/556 (removed 127) transitions.
// Phase 1: matrix 429 rows 484 cols
[2023-03-12 18:25:15] [INFO ] Computed 94 place invariants in 29 ms
[2023-03-12 18:25:16] [INFO ] Implicit Places using invariants in 568 ms returned []
[2023-03-12 18:25:16] [INFO ] Invariant cache hit.
[2023-03-12 18:25:16] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
[2023-03-12 18:25:16] [INFO ] Invariant cache hit.
[2023-03-12 18:25:16] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 484/616 places, 429/556 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1614 ms. Remains : 484/616 places, 429/556 transitions.
Support contains 35 out of 484 places after structural reductions.
[2023-03-12 18:25:17] [INFO ] Flatten gal took : 147 ms
[2023-03-12 18:25:17] [INFO ] Flatten gal took : 45 ms
[2023-03-12 18:25:17] [INFO ] Input system was already deterministic with 429 transitions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 29) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-12 18:25:18] [INFO ] Invariant cache hit.
[2023-03-12 18:25:18] [INFO ] [Real]Absence check using 56 positive place invariants in 15 ms returned sat
[2023-03-12 18:25:18] [INFO ] [Real]Absence check using 56 positive and 38 generalized place invariants in 14 ms returned sat
[2023-03-12 18:25:18] [INFO ] After 222ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3 real:16
[2023-03-12 18:25:19] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 8 ms to minimize.
[2023-03-12 18:25:19] [INFO ] Deduced a trap composed of 81 places in 247 ms of which 1 ms to minimize.
[2023-03-12 18:25:19] [INFO ] Deduced a trap composed of 85 places in 174 ms of which 2 ms to minimize.
[2023-03-12 18:25:19] [INFO ] Deduced a trap composed of 97 places in 224 ms of which 1 ms to minimize.
[2023-03-12 18:25:20] [INFO ] Deduced a trap composed of 83 places in 211 ms of which 2 ms to minimize.
[2023-03-12 18:25:20] [INFO ] Deduced a trap composed of 85 places in 182 ms of which 1 ms to minimize.
[2023-03-12 18:25:20] [INFO ] Deduced a trap composed of 86 places in 172 ms of which 1 ms to minimize.
[2023-03-12 18:25:20] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 1 ms to minimize.
[2023-03-12 18:25:21] [INFO ] Deduced a trap composed of 85 places in 204 ms of which 1 ms to minimize.
[2023-03-12 18:25:21] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 0 ms to minimize.
[2023-03-12 18:25:21] [INFO ] Deduced a trap composed of 88 places in 195 ms of which 1 ms to minimize.
[2023-03-12 18:25:21] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2023-03-12 18:25:21] [INFO ] Deduced a trap composed of 90 places in 167 ms of which 1 ms to minimize.
[2023-03-12 18:25:22] [INFO ] Deduced a trap composed of 86 places in 159 ms of which 1 ms to minimize.
[2023-03-12 18:25:22] [INFO ] Deduced a trap composed of 39 places in 227 ms of which 1 ms to minimize.
[2023-03-12 18:25:22] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 1 ms to minimize.
[2023-03-12 18:25:22] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 0 ms to minimize.
[2023-03-12 18:25:22] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 1 ms to minimize.
[2023-03-12 18:25:22] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 0 ms to minimize.
[2023-03-12 18:25:23] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 1 ms to minimize.
[2023-03-12 18:25:23] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 1 ms to minimize.
[2023-03-12 18:25:23] [INFO ] Deduced a trap composed of 95 places in 200 ms of which 2 ms to minimize.
[2023-03-12 18:25:23] [INFO ] Deduced a trap composed of 91 places in 148 ms of which 1 ms to minimize.
[2023-03-12 18:25:23] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4707 ms
[2023-03-12 18:25:23] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2023-03-12 18:25:24] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 0 ms to minimize.
[2023-03-12 18:25:24] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2023-03-12 18:25:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 313 ms
[2023-03-12 18:25:24] [INFO ] After 5416ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:19
[2023-03-12 18:25:24] [INFO ] After 6090ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:19
[2023-03-12 18:25:25] [INFO ] [Nat]Absence check using 56 positive place invariants in 24 ms returned sat
[2023-03-12 18:25:25] [INFO ] [Nat]Absence check using 56 positive and 38 generalized place invariants in 18 ms returned sat
[2023-03-12 18:25:25] [INFO ] After 471ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :18
[2023-03-12 18:25:25] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2023-03-12 18:25:25] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-12 18:25:25] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2023-03-12 18:25:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 211 ms
[2023-03-12 18:25:26] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 0 ms to minimize.
[2023-03-12 18:25:26] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2023-03-12 18:25:26] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2023-03-12 18:25:26] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 0 ms to minimize.
[2023-03-12 18:25:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 413 ms
[2023-03-12 18:25:26] [INFO ] Deduced a trap composed of 83 places in 164 ms of which 1 ms to minimize.
[2023-03-12 18:25:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-12 18:25:27] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 2 ms to minimize.
[2023-03-12 18:25:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-12 18:25:27] [INFO ] After 1998ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :18
Attempting to minimize the solution found.
Minimization took 499 ms.
[2023-03-12 18:25:27] [INFO ] After 3604ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :18
Fused 20 Parikh solutions to 18 different solutions.
Parikh walk visited 12 properties in 199 ms.
Support contains 5 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 429/429 transitions.
Graph (trivial) has 226 edges and 484 vertex of which 6 / 484 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1084 edges and 479 vertex of which 478 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.26 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 478 transition count 368
Reduce places removed 53 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 425 transition count 366
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 112 place count 423 transition count 366
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 112 place count 423 transition count 268
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 324 place count 309 transition count 268
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 333 place count 300 transition count 259
Ensure Unique test removed 1 places
Iterating global reduction 3 with 10 rules applied. Total rules applied 343 place count 299 transition count 259
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 595 place count 171 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 597 place count 170 transition count 139
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 599 place count 170 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 601 place count 168 transition count 137
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 602 place count 168 transition count 137
Applied a total of 602 rules in 186 ms. Remains 168 /484 variables (removed 316) and now considering 137/429 (removed 292) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 168/484 places, 137/429 transitions.
Finished random walk after 144 steps, including 6 resets, run visited all 6 properties in 16 ms. (steps per millisecond=9 )
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 132 stabilizing places and 125 stable transitions
Graph (complete) has 1091 edges and 484 vertex of which 483 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
FORMULA BusinessProcesses-PT-14-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(p1)))||F(G(p2))))'
Support contains 3 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 429/429 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 473 transition count 418
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 473 transition count 418
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 468 transition count 413
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 468 transition count 413
Applied a total of 32 rules in 89 ms. Remains 468 /484 variables (removed 16) and now considering 413/429 (removed 16) transitions.
// Phase 1: matrix 413 rows 468 cols
[2023-03-12 18:25:28] [INFO ] Computed 94 place invariants in 25 ms
[2023-03-12 18:25:29] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-12 18:25:29] [INFO ] Invariant cache hit.
[2023-03-12 18:25:30] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1429 ms to find 0 implicit places.
[2023-03-12 18:25:30] [INFO ] Invariant cache hit.
[2023-03-12 18:25:30] [INFO ] Dead Transitions using invariants and state equation in 320 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 468/484 places, 413/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1854 ms. Remains : 468/484 places, 413/429 transitions.
Stuttering acceptance computed with spot in 409 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s151 1), p2:(EQ s34 1), p1:(EQ s168 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 143 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-00 finished in 2348 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))||(F(p1)&&G(p2))))'
Support contains 3 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 429/429 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 472 transition count 417
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 472 transition count 417
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 468 transition count 413
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 468 transition count 413
Applied a total of 32 rules in 116 ms. Remains 468 /484 variables (removed 16) and now considering 413/429 (removed 16) transitions.
// Phase 1: matrix 413 rows 468 cols
[2023-03-12 18:25:31] [INFO ] Computed 94 place invariants in 7 ms
[2023-03-12 18:25:31] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-12 18:25:31] [INFO ] Invariant cache hit.
[2023-03-12 18:25:32] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
[2023-03-12 18:25:32] [INFO ] Invariant cache hit.
[2023-03-12 18:25:32] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 468/484 places, 413/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1509 ms. Remains : 468/484 places, 413/429 transitions.
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(EQ s36 1), p0:(EQ s315 1), p1:(EQ s185 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1352 reset in 366 ms.
Stack based approach found an accepted trace after 1344 steps with 18 reset with depth 5 and stack size 5 in 4 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-01 finished in 2174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 429/429 transitions.
Graph (trivial) has 231 edges and 484 vertex of which 6 / 484 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 1085 edges and 479 vertex of which 478 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 477 transition count 365
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 114 place count 421 transition count 365
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 114 place count 421 transition count 264
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 333 place count 303 transition count 264
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 345 place count 291 transition count 252
Ensure Unique test removed 1 places
Iterating global reduction 2 with 13 rules applied. Total rules applied 358 place count 290 transition count 252
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 600 place count 167 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 602 place count 166 transition count 137
Applied a total of 602 rules in 92 ms. Remains 166 /484 variables (removed 318) and now considering 137/429 (removed 292) transitions.
// Phase 1: matrix 137 rows 166 cols
[2023-03-12 18:25:33] [INFO ] Computed 72 place invariants in 2 ms
[2023-03-12 18:25:39] [INFO ] Implicit Places using invariants in 5993 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 6011 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/484 places, 137/429 transitions.
Applied a total of 0 rules in 13 ms. Remains 146 /146 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6116 ms. Remains : 146/484 places, 137/429 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s119 1), p1:(EQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-02 finished in 6286 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((G(p1)||p0))))'
Support contains 4 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 429/429 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 471 transition count 416
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 471 transition count 416
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 466 transition count 411
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 466 transition count 411
Applied a total of 36 rules in 40 ms. Remains 466 /484 variables (removed 18) and now considering 411/429 (removed 18) transitions.
// Phase 1: matrix 411 rows 466 cols
[2023-03-12 18:25:39] [INFO ] Computed 94 place invariants in 4 ms
[2023-03-12 18:25:39] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-12 18:25:39] [INFO ] Invariant cache hit.
[2023-03-12 18:25:40] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
[2023-03-12 18:25:40] [INFO ] Invariant cache hit.
[2023-03-12 18:25:40] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 466/484 places, 411/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1110 ms. Remains : 466/484 places, 411/429 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(NEQ s16 1), p0:(OR (NEQ s200 1) (NEQ s368 1) (NEQ s431 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 786 steps with 5 reset in 6 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-03 finished in 1266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 429/429 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 472 transition count 417
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 472 transition count 417
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 467 transition count 412
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 467 transition count 412
Applied a total of 34 rules in 40 ms. Remains 467 /484 variables (removed 17) and now considering 412/429 (removed 17) transitions.
// Phase 1: matrix 412 rows 467 cols
[2023-03-12 18:25:40] [INFO ] Computed 94 place invariants in 11 ms
[2023-03-12 18:25:41] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-12 18:25:41] [INFO ] Invariant cache hit.
[2023-03-12 18:25:41] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 971 ms to find 0 implicit places.
[2023-03-12 18:25:41] [INFO ] Invariant cache hit.
[2023-03-12 18:25:42] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 467/484 places, 412/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1344 ms. Remains : 467/484 places, 412/429 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s319 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-05 finished in 1477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&F(p1)))))'
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 429/429 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 472 transition count 417
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 472 transition count 417
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 467 transition count 412
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 467 transition count 412
Applied a total of 34 rules in 28 ms. Remains 467 /484 variables (removed 17) and now considering 412/429 (removed 17) transitions.
// Phase 1: matrix 412 rows 467 cols
[2023-03-12 18:25:42] [INFO ] Computed 94 place invariants in 4 ms
[2023-03-12 18:25:42] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-12 18:25:42] [INFO ] Invariant cache hit.
[2023-03-12 18:25:43] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
[2023-03-12 18:25:43] [INFO ] Invariant cache hit.
[2023-03-12 18:25:43] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 467/484 places, 412/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1597 ms. Remains : 467/484 places, 412/429 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(EQ s119 1), p0:(EQ s294 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 134 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-06 finished in 1865 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||X((p1&&(p2||(p3 U (p4||G(p3)))))))))'
Support contains 4 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 429/429 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 473 transition count 418
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 473 transition count 418
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 469 transition count 414
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 469 transition count 414
Applied a total of 30 rules in 27 ms. Remains 469 /484 variables (removed 15) and now considering 414/429 (removed 15) transitions.
// Phase 1: matrix 414 rows 469 cols
[2023-03-12 18:25:44] [INFO ] Computed 94 place invariants in 5 ms
[2023-03-12 18:25:44] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-12 18:25:44] [INFO ] Invariant cache hit.
[2023-03-12 18:25:45] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
[2023-03-12 18:25:45] [INFO ] Invariant cache hit.
[2023-03-12 18:25:45] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 469/484 places, 414/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1230 ms. Remains : 469/484 places, 414/429 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1))), (AND (NOT p4) (NOT p3)), (OR (NOT p1) (AND (NOT p2) (NOT p3) (NOT p4)))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p4) p3), acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (AND (NOT p2) (NOT p4) (NOT p3))), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p4) p3), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(EQ s210 0), p4:(AND (NEQ s113 1) (NEQ s57 1)), p3:(NEQ s57 1), p1:(OR (EQ s57 1) (EQ s280 1)), p2:(EQ s113 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 338 ms.
Product exploration explored 100000 steps with 50000 reset in 405 ms.
Computed a total of 126 stabilizing places and 119 stable transitions
Graph (complete) has 1072 edges and 469 vertex of which 468 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 126 stabilizing places and 119 stable transitions
Detected a total of 126/469 stabilizing places and 119/414 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/5 atomic propositions.
Knowledge obtained : [(AND p0 p4 p3 (NOT p1) p2), (X p0), (X (X (OR (NOT p1) (AND (NOT p2) (NOT p4) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p4) p3)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 142 ms. Reduced automaton from 5 states, 7 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-14-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-14-LTLFireability-07 finished in 2433 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) U (p0||X(F(p1)))))'
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 429/429 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 473 transition count 418
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 473 transition count 418
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 470 transition count 415
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 470 transition count 415
Applied a total of 28 rules in 27 ms. Remains 470 /484 variables (removed 14) and now considering 415/429 (removed 14) transitions.
// Phase 1: matrix 415 rows 470 cols
[2023-03-12 18:25:46] [INFO ] Computed 94 place invariants in 3 ms
[2023-03-12 18:25:47] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-12 18:25:47] [INFO ] Invariant cache hit.
[2023-03-12 18:25:48] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
[2023-03-12 18:25:48] [INFO ] Invariant cache hit.
[2023-03-12 18:25:48] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 470/484 places, 415/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1636 ms. Remains : 470/484 places, 415/429 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s389 1), p1:(EQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 135 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-09 finished in 1784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1 U p2))))))'
Support contains 6 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 429/429 transitions.
Graph (trivial) has 227 edges and 484 vertex of which 6 / 484 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 1085 edges and 479 vertex of which 478 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 477 transition count 367
Reduce places removed 54 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 423 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 422 transition count 366
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 112 place count 422 transition count 266
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 329 place count 305 transition count 266
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 341 place count 293 transition count 254
Ensure Unique test removed 1 places
Iterating global reduction 3 with 13 rules applied. Total rules applied 354 place count 292 transition count 254
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 588 place count 174 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 590 place count 173 transition count 142
Applied a total of 590 rules in 50 ms. Remains 173 /484 variables (removed 311) and now considering 142/429 (removed 287) transitions.
// Phase 1: matrix 142 rows 173 cols
[2023-03-12 18:25:48] [INFO ] Computed 74 place invariants in 1 ms
[2023-03-12 18:25:48] [INFO ] Implicit Places using invariants in 215 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 22, 23, 24, 25, 26, 27, 51, 52, 53, 54, 55, 150, 152]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 218 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/484 places, 142/429 transitions.
Applied a total of 0 rules in 6 ms. Remains 151 /151 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 275 ms. Remains : 151/484 places, 142/429 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s8 1) (AND (EQ s18 1) (EQ s87 1) (EQ s133 1))), p2:(NEQ s115 1), p1:(EQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-10 finished in 468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 429/429 transitions.
Graph (trivial) has 231 edges and 484 vertex of which 6 / 484 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 1085 edges and 479 vertex of which 478 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 477 transition count 366
Reduce places removed 55 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 422 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 421 transition count 365
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 114 place count 421 transition count 265
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 330 place count 305 transition count 265
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 343 place count 292 transition count 252
Ensure Unique test removed 1 places
Iterating global reduction 3 with 14 rules applied. Total rules applied 357 place count 291 transition count 252
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 603 place count 166 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 605 place count 165 transition count 135
Applied a total of 605 rules in 46 ms. Remains 165 /484 variables (removed 319) and now considering 135/429 (removed 294) transitions.
// Phase 1: matrix 135 rows 165 cols
[2023-03-12 18:25:48] [INFO ] Computed 73 place invariants in 1 ms
[2023-03-12 18:25:49] [INFO ] Implicit Places using invariants in 133 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 22, 23, 24, 25, 26, 49, 50, 51, 52, 53, 129]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 146 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/484 places, 135/429 transitions.
Applied a total of 0 rules in 5 ms. Remains 144 /144 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 197 ms. Remains : 144/484 places, 135/429 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-12 finished in 334 ms.
All properties solved by simple procedures.
Total runtime 34444 ms.
ITS solved all properties within timeout

BK_STOP 1678645549496

--------------------
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

Sequence of Actions to be Executed by the VM

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

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

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

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