Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.7K 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.4K 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 9.7K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 91K 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-08-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678502160955

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-08
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:36:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 02:36:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:36:02] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-11 02:36:02] [INFO ] Transformed 393 places.
[2023-03-11 02:36:02] [INFO ] Transformed 344 transitions.
[2023-03-11 02:36:02] [INFO ] Found NUPN structural information;
[2023-03-11 02:36:02] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 145 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 4 formulas.
Deduced a syphon composed of 13 places in 6 ms
Reduce places removed 13 places and 13 transitions.
FORMULA BusinessProcesses-PT-08-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 331/331 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 372 transition count 331
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 66 place count 314 transition count 273
Iterating global reduction 1 with 58 rules applied. Total rules applied 124 place count 314 transition count 273
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 157 place count 281 transition count 240
Iterating global reduction 1 with 33 rules applied. Total rules applied 190 place count 281 transition count 240
Applied a total of 190 rules in 74 ms. Remains 281 /380 variables (removed 99) and now considering 240/331 (removed 91) transitions.
// Phase 1: matrix 240 rows 281 cols
[2023-03-11 02:36:02] [INFO ] Computed 50 place invariants in 18 ms
[2023-03-11 02:36:03] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-11 02:36:03] [INFO ] Invariant cache hit.
[2023-03-11 02:36:03] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2023-03-11 02:36:03] [INFO ] Invariant cache hit.
[2023-03-11 02:36:03] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 281/380 places, 240/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 829 ms. Remains : 281/380 places, 240/331 transitions.
Support contains 39 out of 281 places after structural reductions.
[2023-03-11 02:36:03] [INFO ] Flatten gal took : 60 ms
[2023-03-11 02:36:03] [INFO ] Flatten gal took : 25 ms
[2023-03-11 02:36:04] [INFO ] Input system was already deterministic with 240 transitions.
Support contains 36 out of 281 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 28) seen :24
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 02:36:04] [INFO ] Invariant cache hit.
[2023-03-11 02:36:04] [INFO ] [Real]Absence check using 50 positive place invariants in 15 ms returned sat
[2023-03-11 02:36:05] [INFO ] After 115ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-11 02:36:05] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 5 ms to minimize.
[2023-03-11 02:36:05] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2023-03-11 02:36:05] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2023-03-11 02:36:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 216 ms
[2023-03-11 02:36:05] [INFO ] After 393ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 02:36:05] [INFO ] After 524ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 02:36:05] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2023-03-11 02:36:05] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 02:36:05] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2023-03-11 02:36:05] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2023-03-11 02:36:05] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2023-03-11 02:36:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 192 ms
[2023-03-11 02:36:05] [INFO ] After 361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-11 02:36:05] [INFO ] After 504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 2 properties in 39 ms.
Support contains 2 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 240/240 transitions.
Graph (trivial) has 150 edges and 281 vertex of which 7 / 281 are part of one of the 1 SCC in 9 ms
Free SCC test removed 6 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 579 edges and 275 vertex of which 274 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 274 transition count 190
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 80 place count 235 transition count 190
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 80 place count 235 transition count 138
Deduced a syphon composed of 52 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 115 rules applied. Total rules applied 195 place count 172 transition count 138
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 207 place count 160 transition count 126
Iterating global reduction 2 with 12 rules applied. Total rules applied 219 place count 160 transition count 126
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 219 place count 160 transition count 125
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 221 place count 159 transition count 125
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 375 place count 81 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 376 place count 80 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 377 place count 79 transition count 48
Applied a total of 377 rules in 46 ms. Remains 79 /281 variables (removed 202) and now considering 48/240 (removed 192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 79/281 places, 48/240 transitions.
Finished random walk after 188 steps, including 9 resets, run visited all 2 properties in 3 ms. (steps per millisecond=62 )
Computed a total of 99 stabilizing places and 95 stable transitions
Graph (complete) has 588 edges and 281 vertex of which 280 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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&&F((G(p2)||p1))))))'
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 267 transition count 226
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 267 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 267 transition count 225
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 261 transition count 219
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 261 transition count 219
Applied a total of 41 rules in 18 ms. Remains 261 /281 variables (removed 20) and now considering 219/240 (removed 21) transitions.
// Phase 1: matrix 219 rows 261 cols
[2023-03-11 02:36:06] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-11 02:36:06] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-11 02:36:06] [INFO ] Invariant cache hit.
[2023-03-11 02:36:06] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2023-03-11 02:36:06] [INFO ] Invariant cache hit.
[2023-03-11 02:36:06] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 261/281 places, 219/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 445 ms. Remains : 261/281 places, 219/240 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s63 1), p1:(OR (EQ s63 1) (AND (EQ s67 1) (EQ s202 1) (EQ s260 1))), p2:(EQ s8 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-01 finished in 822 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||G(F(p1))))))'
Support contains 3 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 267 transition count 226
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 267 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 267 transition count 225
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 260 transition count 218
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 260 transition count 218
Applied a total of 43 rules in 69 ms. Remains 260 /281 variables (removed 21) and now considering 218/240 (removed 22) transitions.
// Phase 1: matrix 218 rows 260 cols
[2023-03-11 02:36:07] [INFO ] Computed 50 place invariants in 4 ms
[2023-03-11 02:36:07] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-11 02:36:07] [INFO ] Invariant cache hit.
[2023-03-11 02:36:07] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2023-03-11 02:36:07] [INFO ] Invariant cache hit.
[2023-03-11 02:36:07] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 260/281 places, 218/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 610 ms. Remains : 260/281 places, 218/240 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s124 0) (EQ s142 0)), p1:(NEQ s254 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 354 ms.
Product exploration explored 100000 steps with 50000 reset in 235 ms.
Computed a total of 90 stabilizing places and 86 stable transitions
Graph (complete) has 554 edges and 260 vertex of which 259 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 90 stabilizing places and 86 stable transitions
Detected a total of 90/260 stabilizing places and 86/218 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 162 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-08-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-08-LTLFireability-02 finished in 1525 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(p1) U (p2||X(F(p3))))))'
Support contains 8 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 266 transition count 225
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 266 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 266 transition count 224
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 259 transition count 217
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 259 transition count 217
Applied a total of 45 rules in 27 ms. Remains 259 /281 variables (removed 22) and now considering 217/240 (removed 23) transitions.
// Phase 1: matrix 217 rows 259 cols
[2023-03-11 02:36:08] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-11 02:36:08] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-11 02:36:08] [INFO ] Invariant cache hit.
[2023-03-11 02:36:09] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2023-03-11 02:36:09] [INFO ] Invariant cache hit.
[2023-03-11 02:36:09] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 259/281 places, 217/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 627 ms. Remains : 259/281 places, 217/240 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(EQ s123 1), p1:(EQ s12 1), p3:(AND (EQ s105 1) (EQ s221 1) (EQ s258 1)), p0:(AND (EQ s79 1) (EQ s193 1) (EQ s250 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 206 steps with 5 reset in 2 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-04 finished in 942 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||F(G((p1 U p2))))))'
Support contains 3 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 268 transition count 227
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 268 transition count 227
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 262 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 262 transition count 221
Applied a total of 38 rules in 37 ms. Remains 262 /281 variables (removed 19) and now considering 221/240 (removed 19) transitions.
// Phase 1: matrix 221 rows 262 cols
[2023-03-11 02:36:09] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-11 02:36:09] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-11 02:36:09] [INFO ] Invariant cache hit.
[2023-03-11 02:36:09] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2023-03-11 02:36:09] [INFO ] Invariant cache hit.
[2023-03-11 02:36:10] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 262/281 places, 221/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 674 ms. Remains : 262/281 places, 221/240 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(EQ s9 0), p2:(NEQ s175 1), p1:(EQ s224 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 239 ms.
Product exploration explored 100000 steps with 50000 reset in 226 ms.
Computed a total of 91 stabilizing places and 87 stable transitions
Graph (complete) has 555 edges and 262 vertex of which 261 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 91 stabilizing places and 87 stable transitions
Detected a total of 91/262 stabilizing places and 87/221 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 (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 238 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-08-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-08-LTLFireability-05 finished in 1646 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 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Graph (complete) has 588 edges and 281 vertex of which 280 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 279 transition count 202
Reduce places removed 36 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 243 transition count 200
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 241 transition count 200
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 77 place count 241 transition count 142
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 127 rules applied. Total rules applied 204 place count 172 transition count 142
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 219 place count 157 transition count 127
Iterating global reduction 3 with 15 rules applied. Total rules applied 234 place count 157 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 236 place count 157 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 237 place count 156 transition count 125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 237 place count 156 transition count 124
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 239 place count 155 transition count 124
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 147 rules applied. Total rules applied 386 place count 80 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 387 place count 80 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 388 place count 79 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 389 place count 78 transition count 50
Applied a total of 389 rules in 111 ms. Remains 78 /281 variables (removed 203) and now considering 50/240 (removed 190) transitions.
// Phase 1: matrix 50 rows 78 cols
[2023-03-11 02:36:11] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-11 02:36:11] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-11 02:36:11] [INFO ] Invariant cache hit.
[2023-03-11 02:36:11] [INFO ] Implicit Places using invariants and state equation in 137 ms returned [7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19, 21, 22, 23, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 259 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/281 places, 50/240 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 45 transition count 43
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 38 transition count 43
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 33 transition count 38
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 33 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 33 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 31 transition count 36
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 36 place count 27 transition count 32
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 38 place count 27 transition count 32
Applied a total of 38 rules in 19 ms. Remains 27 /45 variables (removed 18) and now considering 32/50 (removed 18) transitions.
// Phase 1: matrix 32 rows 27 cols
[2023-03-11 02:36:11] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 02:36:11] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-11 02:36:11] [INFO ] Invariant cache hit.
[2023-03-11 02:36:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:36:11] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [2, 3, 4]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 147 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/281 places, 32/240 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 538 ms. Remains : 24/281 places, 32/240 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s12 1) (EQ s23 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 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-07 finished in 610 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 1 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Graph (trivial) has 152 edges and 281 vertex of which 7 / 281 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 580 edges and 275 vertex of which 274 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 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 273 transition count 190
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 233 transition count 190
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 82 place count 233 transition count 136
Deduced a syphon composed of 54 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 201 place count 168 transition count 136
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 214 place count 155 transition count 123
Iterating global reduction 2 with 13 rules applied. Total rules applied 227 place count 155 transition count 123
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 377 place count 79 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 378 place count 78 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 379 place count 77 transition count 48
Applied a total of 379 rules in 56 ms. Remains 77 /281 variables (removed 204) and now considering 48/240 (removed 192) transitions.
// Phase 1: matrix 48 rows 77 cols
[2023-03-11 02:36:11] [INFO ] Computed 36 place invariants in 0 ms
[2023-03-11 02:36:11] [INFO ] Implicit Places using invariants in 130 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 132 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/281 places, 48/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 193 ms. Remains : 76/281 places, 48/240 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s65 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-08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-09 finished in 261 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&&G(p1))))'
Support contains 2 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Graph (trivial) has 150 edges and 281 vertex of which 7 / 281 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 580 edges and 275 vertex of which 274 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 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 273 transition count 192
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 235 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 234 transition count 191
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 80 place count 234 transition count 138
Deduced a syphon composed of 53 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 117 rules applied. Total rules applied 197 place count 170 transition count 138
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 209 place count 158 transition count 126
Iterating global reduction 3 with 12 rules applied. Total rules applied 221 place count 158 transition count 126
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 221 place count 158 transition count 125
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 223 place count 157 transition count 125
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 149 rules applied. Total rules applied 372 place count 81 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 373 place count 80 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 374 place count 79 transition count 51
Applied a total of 374 rules in 63 ms. Remains 79 /281 variables (removed 202) and now considering 51/240 (removed 189) transitions.
// Phase 1: matrix 51 rows 79 cols
[2023-03-11 02:36:12] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-11 02:36:12] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-11 02:36:12] [INFO ] Invariant cache hit.
[2023-03-11 02:36:12] [INFO ] Implicit Places using invariants and state equation in 162 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60]
Discarding 30 places :
Implicit Place search using SMT with State Equation took 273 ms to find 30 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/281 places, 51/240 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 49 transition count 45
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 43 transition count 45
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 40 transition count 42
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 40 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 38 transition count 40
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 38 transition count 39
Applied a total of 23 rules in 15 ms. Remains 38 /49 variables (removed 11) and now considering 39/51 (removed 12) transitions.
// Phase 1: matrix 39 rows 38 cols
[2023-03-11 02:36:12] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-11 02:36:12] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-11 02:36:12] [INFO ] Invariant cache hit.
[2023-03-11 02:36:12] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/281 places, 39/240 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 617 ms. Remains : 38/281 places, 39/240 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s13 1), p1:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-10 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((G(F(p0)) U (p1||G(p0)||G(p2)))))'
Support contains 3 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 268 transition count 227
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 268 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 268 transition count 226
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 263 transition count 221
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 263 transition count 221
Applied a total of 37 rules in 22 ms. Remains 263 /281 variables (removed 18) and now considering 221/240 (removed 19) transitions.
// Phase 1: matrix 221 rows 263 cols
[2023-03-11 02:36:12] [INFO ] Computed 50 place invariants in 3 ms
[2023-03-11 02:36:12] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-11 02:36:12] [INFO ] Invariant cache hit.
[2023-03-11 02:36:13] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2023-03-11 02:36:13] [INFO ] Invariant cache hit.
[2023-03-11 02:36:13] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 263/281 places, 221/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 501 ms. Remains : 263/281 places, 221/240 transitions.
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s206 1), p0:(EQ s258 1), p2:(NEQ s224 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 222 ms.
Product exploration explored 100000 steps with 50000 reset in 207 ms.
Computed a total of 93 stabilizing places and 89 stable transitions
Graph (complete) has 555 edges and 263 vertex of which 262 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Computed a total of 93 stabilizing places and 89 stable transitions
Detected a total of 93/263 stabilizing places and 89/221 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p0) p2)
Knowledge based reduction with 19 factoid took 1050 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-08-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-08-LTLFireability-11 finished in 2261 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&&G(F(p1)))))'
Support contains 2 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Graph (trivial) has 149 edges and 281 vertex of which 7 / 281 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 580 edges and 275 vertex of which 274 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 273 transition count 194
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 237 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 236 transition count 193
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 76 place count 236 transition count 139
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 119 rules applied. Total rules applied 195 place count 171 transition count 139
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 208 place count 158 transition count 126
Iterating global reduction 3 with 13 rules applied. Total rules applied 221 place count 158 transition count 126
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 221 place count 158 transition count 125
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 223 place count 157 transition count 125
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 371 place count 82 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 372 place count 81 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 373 place count 80 transition count 51
Applied a total of 373 rules in 27 ms. Remains 80 /281 variables (removed 201) and now considering 51/240 (removed 189) transitions.
// Phase 1: matrix 51 rows 80 cols
[2023-03-11 02:36:15] [INFO ] Computed 36 place invariants in 0 ms
[2023-03-11 02:36:15] [INFO ] Implicit Places using invariants in 73 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/281 places, 51/240 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 105 ms. Remains : 79/281 places, 51/240 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s64 1), p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-12 finished in 300 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) U p1)&&X(X(F(p0))))))'
Support contains 2 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 268 transition count 227
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 268 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 268 transition count 226
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 262 transition count 220
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 262 transition count 220
Applied a total of 39 rules in 10 ms. Remains 262 /281 variables (removed 19) and now considering 220/240 (removed 20) transitions.
// Phase 1: matrix 220 rows 262 cols
[2023-03-11 02:36:15] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-11 02:36:15] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-11 02:36:15] [INFO ] Invariant cache hit.
[2023-03-11 02:36:15] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2023-03-11 02:36:15] [INFO ] Invariant cache hit.
[2023-03-11 02:36:16] [INFO ] Dead Transitions using invariants and state equation in 1144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 262/281 places, 220/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1593 ms. Remains : 262/281 places, 220/240 transitions.
Stuttering acceptance computed with spot in 336 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=3, aps=[p0:(EQ s57 1), p1:(EQ s245 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-13 finished in 1944 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)||X(p1))))'
Support contains 3 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 267 transition count 226
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 267 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 267 transition count 225
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 260 transition count 218
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 260 transition count 218
Applied a total of 43 rules in 25 ms. Remains 260 /281 variables (removed 21) and now considering 218/240 (removed 22) transitions.
// Phase 1: matrix 218 rows 260 cols
[2023-03-11 02:36:17] [INFO ] Computed 50 place invariants in 3 ms
[2023-03-11 02:36:17] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-11 02:36:17] [INFO ] Invariant cache hit.
[2023-03-11 02:36:17] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2023-03-11 02:36:17] [INFO ] Invariant cache hit.
[2023-03-11 02:36:17] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 260/281 places, 218/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 644 ms. Remains : 260/281 places, 218/240 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, 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=[p0:(EQ s203 1), p1:(OR (EQ s94 1) (EQ s191 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-14 finished in 783 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((X(p0)||G(p1)))||((X(p0)||G(p1))&&F(!p2)))))'
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 240/240 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 267 transition count 226
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 267 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 267 transition count 225
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 260 transition count 218
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 260 transition count 218
Applied a total of 43 rules in 18 ms. Remains 260 /281 variables (removed 21) and now considering 218/240 (removed 22) transitions.
// Phase 1: matrix 218 rows 260 cols
[2023-03-11 02:36:18] [INFO ] Computed 50 place invariants in 5 ms
[2023-03-11 02:36:18] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-11 02:36:18] [INFO ] Invariant cache hit.
[2023-03-11 02:36:18] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-11 02:36:18] [INFO ] Invariant cache hit.
[2023-03-11 02:36:18] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 260/281 places, 218/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 482 ms. Remains : 260/281 places, 218/240 transitions.
Stuttering acceptance computed with spot in 476 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) (NOT p0)), true, (AND p2 (NOT p0)), (AND p2 (NOT p1) (NOT p0)), (NOT p1), p2, (AND p2 (NOT p1) p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 6}, { cond=(AND p1 p2), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=7 dest: 9}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=7 dest: 10}], [{ cond=(NOT p1), acceptance={} source=8 dest: 5}, { cond=p1, acceptance={} source=8 dest: 8}], [{ cond=p2, acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p1) p2 p0), acceptance={} source=10 dest: 9}, { cond=(AND p1 p2 p0), acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(NEQ s155 1), p2:(AND (EQ s43 1) (EQ s181 1) (EQ s259 1)), p0:(NEQ s227 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, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 186 ms.
Product exploration explored 100000 steps with 33333 reset in 251 ms.
Computed a total of 91 stabilizing places and 87 stable transitions
Graph (complete) has 552 edges and 260 vertex of which 259 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 91 stabilizing places and 87 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 9 factoid took 278 ms. Reduced automaton from 11 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-08-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-08-LTLFireability-15 finished in 1709 ms.
All properties solved by simple procedures.
Total runtime 17180 ms.
ITS solved all properties within timeout

BK_STOP 1678502180002

--------------------
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-08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is BusinessProcesses-PT-08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r039-tajo-167813692600508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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