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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K 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.3K Feb 25 16:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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 79K 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-04-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678501478478

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-04
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:24:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 02:24:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:24:40] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-11 02:24:40] [INFO ] Transformed 288 places.
[2023-03-11 02:24:40] [INFO ] Transformed 283 transitions.
[2023-03-11 02:24:40] [INFO ] Found NUPN structural information;
[2023-03-11 02:24:40] [INFO ] Parsed PT model containing 288 places and 283 transitions and 916 arcs in 108 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
FORMULA BusinessProcesses-PT-04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 281/281 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 283 transition count 281
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 40 place count 246 transition count 244
Iterating global reduction 1 with 37 rules applied. Total rules applied 77 place count 246 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 246 transition count 243
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 96 place count 228 transition count 225
Iterating global reduction 2 with 18 rules applied. Total rules applied 114 place count 228 transition count 225
Applied a total of 114 rules in 51 ms. Remains 228 /286 variables (removed 58) and now considering 225/281 (removed 56) transitions.
// Phase 1: matrix 225 rows 228 cols
[2023-03-11 02:24:40] [INFO ] Computed 41 place invariants in 16 ms
[2023-03-11 02:24:40] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-11 02:24:40] [INFO ] Invariant cache hit.
[2023-03-11 02:24:40] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2023-03-11 02:24:40] [INFO ] Invariant cache hit.
[2023-03-11 02:24:41] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/286 places, 225/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 614 ms. Remains : 228/286 places, 225/281 transitions.
Support contains 35 out of 228 places after structural reductions.
[2023-03-11 02:24:41] [INFO ] Flatten gal took : 60 ms
[2023-03-11 02:24:41] [INFO ] Flatten gal took : 28 ms
[2023-03-11 02:24:41] [INFO ] Input system was already deterministic with 225 transitions.
Incomplete random walk after 10000 steps, including 113 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 25) seen :21
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 02:24:41] [INFO ] Invariant cache hit.
[2023-03-11 02:24:41] [INFO ] [Real]Absence check using 18 positive place invariants in 4 ms returned sat
[2023-03-11 02:24:41] [INFO ] [Real]Absence check using 18 positive and 23 generalized place invariants in 5 ms returned sat
[2023-03-11 02:24:42] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA BusinessProcesses-PT-04-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 203 stabilizing places and 201 stable transitions
Graph (complete) has 567 edges and 228 vertex of which 227 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' '!(F(G(p0)))'
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 225/225 transitions.
Graph (trivial) has 99 edges and 228 vertex of which 6 / 228 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 560 edges and 223 vertex of which 222 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 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 221 transition count 197
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 201 transition count 197
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 42 place count 201 transition count 151
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 140 place count 149 transition count 151
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 146 place count 143 transition count 145
Iterating global reduction 2 with 6 rules applied. Total rules applied 152 place count 143 transition count 145
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 152 place count 143 transition count 141
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 160 place count 139 transition count 141
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 250 place count 94 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 252 place count 93 transition count 99
Applied a total of 252 rules in 40 ms. Remains 93 /228 variables (removed 135) and now considering 99/225 (removed 126) transitions.
// Phase 1: matrix 99 rows 93 cols
[2023-03-11 02:24:42] [INFO ] Computed 35 place invariants in 2 ms
[2023-03-11 02:24:42] [INFO ] Implicit Places using invariants in 69 ms returned [1, 11, 34, 35, 36]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 71 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/228 places, 99/225 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 115 ms. Remains : 88/228 places, 99/225 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s56 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-00 finished in 275 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(G(p0))&&F(p1))))'
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 225/225 transitions.
Graph (trivial) has 97 edges and 228 vertex of which 6 / 228 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 560 edges and 223 vertex of which 222 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 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 221 transition count 197
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 201 transition count 197
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 42 place count 201 transition count 154
Deduced a syphon composed of 43 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 134 place count 152 transition count 154
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 140 place count 146 transition count 148
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 146 transition count 148
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 146 place count 146 transition count 145
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 152 place count 143 transition count 145
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 246 place count 96 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 248 place count 95 transition count 101
Applied a total of 248 rules in 25 ms. Remains 95 /228 variables (removed 133) and now considering 101/225 (removed 124) transitions.
// Phase 1: matrix 101 rows 95 cols
[2023-03-11 02:24:42] [INFO ] Computed 35 place invariants in 6 ms
[2023-03-11 02:24:42] [INFO ] Implicit Places using invariants in 70 ms returned [1, 12, 37, 38, 39]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 74 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/228 places, 101/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 105 ms. Remains : 90/228 places, 101/225 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-01 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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s9 0), p1:(AND (EQ s22 1) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-01 finished in 232 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 5 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 225/225 transitions.
Graph (trivial) has 97 edges and 228 vertex of which 6 / 228 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 560 edges and 223 vertex of which 222 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 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 221 transition count 199
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 203 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 202 transition count 198
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 40 place count 202 transition count 151
Deduced a syphon composed of 47 places in 2 ms
Ensure Unique test removed 6 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 140 place count 149 transition count 151
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 147 place count 142 transition count 144
Iterating global reduction 3 with 7 rules applied. Total rules applied 154 place count 142 transition count 144
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 154 place count 142 transition count 141
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 160 place count 139 transition count 141
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 240 place count 99 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 242 place count 98 transition count 104
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 248 place count 98 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 249 place count 97 transition count 103
Applied a total of 249 rules in 57 ms. Remains 97 /228 variables (removed 131) and now considering 103/225 (removed 122) transitions.
// Phase 1: matrix 103 rows 97 cols
[2023-03-11 02:24:42] [INFO ] Computed 35 place invariants in 2 ms
[2023-03-11 02:24:44] [INFO ] Implicit Places using invariants in 1671 ms returned []
[2023-03-11 02:24:44] [INFO ] Invariant cache hit.
[2023-03-11 02:24:44] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:24:44] [INFO ] Implicit Places using invariants and state equation in 201 ms returned [40, 41, 50, 52, 59]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 1888 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/228 places, 103/225 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 101
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 88 transition count 98
Applied a total of 8 rules in 8 ms. Remains 88 /92 variables (removed 4) and now considering 98/103 (removed 5) transitions.
// Phase 1: matrix 98 rows 88 cols
[2023-03-11 02:24:44] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-11 02:24:46] [INFO ] Implicit Places using invariants in 1460 ms returned []
[2023-03-11 02:24:46] [INFO ] Invariant cache hit.
[2023-03-11 02:24:46] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-11 02:24:46] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 1612 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/228 places, 98/225 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3565 ms. Remains : 88/228 places, 98/225 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-02 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:(OR (AND (NEQ s1 1) (NEQ s37 1)) (AND (EQ s16 1) (EQ s53 1) (EQ s74 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 4 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-02 finished in 3667 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)||X(G((p0 U p1)))))'
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 225/225 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 219 transition count 216
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 219 transition count 216
Applied a total of 18 rules in 5 ms. Remains 219 /228 variables (removed 9) and now considering 216/225 (removed 9) transitions.
// Phase 1: matrix 216 rows 219 cols
[2023-03-11 02:24:46] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-11 02:24:46] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-11 02:24:46] [INFO ] Invariant cache hit.
[2023-03-11 02:24:46] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2023-03-11 02:24:46] [INFO ] Invariant cache hit.
[2023-03-11 02:24:47] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 219/228 places, 216/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 608 ms. Remains : 219/228 places, 216/225 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s187 1), p1:(AND (EQ s54 1) (EQ s178 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 57 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-03 finished in 801 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(p1)&&F(p0))))'
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 225/225 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 220 transition count 217
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 220 transition count 217
Applied a total of 16 rules in 17 ms. Remains 220 /228 variables (removed 8) and now considering 217/225 (removed 8) transitions.
// Phase 1: matrix 217 rows 220 cols
[2023-03-11 02:24:47] [INFO ] Computed 41 place invariants in 5 ms
[2023-03-11 02:24:47] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-11 02:24:47] [INFO ] Invariant cache hit.
[2023-03-11 02:24:47] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2023-03-11 02:24:47] [INFO ] Invariant cache hit.
[2023-03-11 02:24:47] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 220/228 places, 217/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 610 ms. Remains : 220/228 places, 217/225 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s195 0), p0:(EQ s148 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-05 finished in 840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 225/225 transitions.
Graph (trivial) has 99 edges and 228 vertex of which 6 / 228 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 560 edges and 223 vertex of which 222 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 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 221 transition count 197
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 201 transition count 197
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 42 place count 201 transition count 151
Deduced a syphon composed of 46 places in 2 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 140 place count 149 transition count 151
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 146 place count 143 transition count 145
Iterating global reduction 2 with 6 rules applied. Total rules applied 152 place count 143 transition count 145
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 152 place count 143 transition count 141
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 160 place count 139 transition count 141
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 246 place count 96 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 248 place count 95 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 249 place count 94 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 250 place count 93 transition count 100
Applied a total of 250 rules in 35 ms. Remains 93 /228 variables (removed 135) and now considering 100/225 (removed 125) transitions.
// Phase 1: matrix 100 rows 93 cols
[2023-03-11 02:24:48] [INFO ] Computed 34 place invariants in 4 ms
[2023-03-11 02:24:48] [INFO ] Implicit Places using invariants in 94 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/228 places, 100/225 transitions.
Applied a total of 0 rules in 15 ms. Remains 92 /92 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 158 ms. Remains : 92/228 places, 100/225 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1 1), p1:(EQ s60 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10581 reset in 301 ms.
Product exploration explored 100000 steps with 10470 reset in 267 ms.
Computed a total of 85 stabilizing places and 93 stable transitions
Computed a total of 85 stabilizing places and 93 stable transitions
Detected a total of 85/92 stabilizing places and 93/100 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 267 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1183 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 398 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 100 rows 92 cols
[2023-03-11 02:24:49] [INFO ] Computed 33 place invariants in 1 ms
[2023-03-11 02:24:49] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:24:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-11 02:24:49] [INFO ] [Nat]Absence check using 16 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-11 02:24:49] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:24:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:24:49] [INFO ] After 4ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:24:50] [INFO ] Deduced a trap composed of 22 places in 1440 ms of which 6 ms to minimize.
[2023-03-11 02:24:50] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
[2023-03-11 02:24:51] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2023-03-11 02:24:51] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2023-03-11 02:24:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 1640 ms
[2023-03-11 02:24:51] [INFO ] After 1646ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-11 02:24:51] [INFO ] After 1754ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 217 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 92 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 92 /92 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-11 02:24:51] [INFO ] Invariant cache hit.
[2023-03-11 02:24:51] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-11 02:24:51] [INFO ] Invariant cache hit.
[2023-03-11 02:24:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:24:51] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [37, 38, 47, 49, 55]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 216 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/92 places, 100/100 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 86 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 98
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 0 with 8 rules applied. Total rules applied 10 place count 82 transition count 94
Applied a total of 10 rules in 6 ms. Remains 82 /87 variables (removed 5) and now considering 94/100 (removed 6) transitions.
// Phase 1: matrix 94 rows 82 cols
[2023-03-11 02:24:51] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-11 02:24:51] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-11 02:24:51] [INFO ] Invariant cache hit.
[2023-03-11 02:24:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-11 02:24:51] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 82/92 places, 94/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 426 ms. Remains : 82/92 places, 94/100 transitions.
Computed a total of 75 stabilizing places and 87 stable transitions
Computed a total of 75 stabilizing places and 87 stable transitions
Detected a total of 75/82 stabilizing places and 87/94 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Finished random walk after 143 steps, including 16 resets, run visited all 1 properties in 1 ms. (steps per millisecond=143 )
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 10905 reset in 276 ms.
Product exploration explored 100000 steps with 10883 reset in 218 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 94/94 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 80 transition count 93
Applied a total of 1 rules in 5 ms. Remains 80 /82 variables (removed 2) and now considering 93/94 (removed 1) transitions.
// Phase 1: matrix 93 rows 80 cols
[2023-03-11 02:24:53] [INFO ] Computed 29 place invariants in 1 ms
[2023-03-11 02:24:53] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-11 02:24:53] [INFO ] Invariant cache hit.
[2023-03-11 02:24:53] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:24:53] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-03-11 02:24:53] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 02:24:53] [INFO ] Invariant cache hit.
[2023-03-11 02:24:53] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/82 places, 93/94 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 332 ms. Remains : 80/82 places, 93/94 transitions.
Treatment of property BusinessProcesses-PT-04-LTLFireability-07 finished in 5462 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&&F(p1))))'
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 225/225 transitions.
Graph (trivial) has 98 edges and 228 vertex of which 6 / 228 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 560 edges and 223 vertex of which 222 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 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 221 transition count 198
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 40 place count 202 transition count 198
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 40 place count 202 transition count 153
Deduced a syphon composed of 45 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 136 place count 151 transition count 153
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 142 place count 145 transition count 147
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 145 transition count 147
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 148 place count 145 transition count 143
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 156 place count 141 transition count 143
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 248 place count 95 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 250 place count 94 transition count 100
Applied a total of 250 rules in 29 ms. Remains 94 /228 variables (removed 134) and now considering 100/225 (removed 125) transitions.
// Phase 1: matrix 100 rows 94 cols
[2023-03-11 02:24:53] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-11 02:24:56] [INFO ] Implicit Places using invariants in 2899 ms returned [1, 11, 34, 35, 36]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2901 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/228 places, 100/225 transitions.
Applied a total of 0 rules in 8 ms. Remains 89 /89 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2939 ms. Remains : 89/228 places, 100/225 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s54 1), p0:(EQ s54 0)], 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, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-08 finished in 3048 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&&G((p1&&F((p2||X(p3))))))))'
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 225/225 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 221 transition count 218
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 221 transition count 218
Applied a total of 14 rules in 6 ms. Remains 221 /228 variables (removed 7) and now considering 218/225 (removed 7) transitions.
// Phase 1: matrix 218 rows 221 cols
[2023-03-11 02:24:56] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-11 02:24:56] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-11 02:24:56] [INFO ] Invariant cache hit.
[2023-03-11 02:24:56] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-11 02:24:56] [INFO ] Invariant cache hit.
[2023-03-11 02:24:56] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 221/228 places, 218/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 444 ms. Remains : 221/228 places, 218/225 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s153 0), p1:(EQ s123 1), p2:(EQ s37 1), p3:(EQ s153 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][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-04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-09 finished in 692 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 (p1 U p0)))'
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 225/225 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 221 transition count 218
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 221 transition count 218
Applied a total of 14 rules in 7 ms. Remains 221 /228 variables (removed 7) and now considering 218/225 (removed 7) transitions.
// Phase 1: matrix 218 rows 221 cols
[2023-03-11 02:24:57] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-11 02:24:57] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-11 02:24:57] [INFO ] Invariant cache hit.
[2023-03-11 02:24:57] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-11 02:24:57] [INFO ] Invariant cache hit.
[2023-03-11 02:24:57] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 221/228 places, 218/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 473 ms. Remains : 221/228 places, 218/225 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s163 1), p1:(EQ s147 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-10 finished in 618 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)||F(G(p1))))'
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 225/225 transitions.
Graph (trivial) has 98 edges and 228 vertex of which 6 / 228 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 560 edges and 223 vertex of which 222 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 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 221 transition count 198
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 40 place count 202 transition count 198
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 40 place count 202 transition count 153
Deduced a syphon composed of 45 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 136 place count 151 transition count 153
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 143 place count 144 transition count 146
Iterating global reduction 2 with 7 rules applied. Total rules applied 150 place count 144 transition count 146
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 150 place count 144 transition count 142
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 158 place count 140 transition count 142
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 244 place count 97 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 246 place count 96 transition count 102
Applied a total of 246 rules in 25 ms. Remains 96 /228 variables (removed 132) and now considering 102/225 (removed 123) transitions.
// Phase 1: matrix 102 rows 96 cols
[2023-03-11 02:24:57] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-11 02:24:57] [INFO ] Implicit Places using invariants in 75 ms returned [1, 11, 36, 37, 38]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 77 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/228 places, 102/225 transitions.
Applied a total of 0 rules in 6 ms. Remains 91 /91 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 109 ms. Remains : 91/228 places, 102/225 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s22 1) (EQ s43 1) (EQ s79 1)), p1:(EQ s12 0)], 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 524 steps with 50 reset in 8 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-13 finished in 204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 225/225 transitions.
Graph (trivial) has 98 edges and 228 vertex of which 6 / 228 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 560 edges and 223 vertex of which 222 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 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 221 transition count 198
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 40 place count 202 transition count 198
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 40 place count 202 transition count 153
Deduced a syphon composed of 45 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 95 rules applied. Total rules applied 135 place count 152 transition count 153
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 142 place count 145 transition count 146
Iterating global reduction 2 with 7 rules applied. Total rules applied 149 place count 145 transition count 146
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 149 place count 145 transition count 142
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 157 place count 141 transition count 142
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 247 place count 96 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 249 place count 95 transition count 100
Applied a total of 249 rules in 32 ms. Remains 95 /228 variables (removed 133) and now considering 100/225 (removed 125) transitions.
// Phase 1: matrix 100 rows 95 cols
[2023-03-11 02:24:58] [INFO ] Computed 36 place invariants in 1 ms
[2023-03-11 02:24:58] [INFO ] Implicit Places using invariants in 102 ms returned [1, 11, 34, 35, 39, 71]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 103 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/228 places, 100/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 143 ms. Remains : 89/228 places, 100/225 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11143 reset in 172 ms.
Product exploration explored 100000 steps with 11243 reset in 196 ms.
Computed a total of 82 stabilizing places and 93 stable transitions
Computed a total of 82 stabilizing places and 93 stable transitions
Detected a total of 82/89 stabilizing places and 93/100 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 33 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 89 cols
[2023-03-11 02:24:59] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-11 02:24:59] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-11 02:24:59] [INFO ] Invariant cache hit.
[2023-03-11 02:24:59] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:24:59] [INFO ] Implicit Places using invariants and state equation in 147 ms returned [1, 10, 36, 37, 46, 48, 54]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 223 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/89 places, 100/100 transitions.
Graph (complete) has 332 edges and 82 vertex of which 71 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 71 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 70 transition count 94
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 16 place count 57 transition count 51
Iterating global reduction 2 with 13 rules applied. Total rules applied 29 place count 57 transition count 51
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 33 place count 55 transition count 49
Applied a total of 33 rules in 6 ms. Remains 55 /82 variables (removed 27) and now considering 49/100 (removed 51) transitions.
// Phase 1: matrix 49 rows 55 cols
[2023-03-11 02:24:59] [INFO ] Computed 19 place invariants in 0 ms
[2023-03-11 02:24:59] [INFO ] Implicit Places using invariants in 71 ms returned [1, 2, 5, 6, 7]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 72 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/89 places, 49/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 307 ms. Remains : 50/89 places, 49/100 transitions.
Computed a total of 43 stabilizing places and 42 stable transitions
Computed a total of 43 stabilizing places and 42 stable transitions
Detected a total of 43/50 stabilizing places and 42/49 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 34 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 12024 reset in 134 ms.
Product exploration explored 100000 steps with 11978 reset in 125 ms.
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 49/49 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 49/49 (removed 0) transitions.
// Phase 1: matrix 49 rows 50 cols
[2023-03-11 02:25:00] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-11 02:25:00] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-11 02:25:00] [INFO ] Invariant cache hit.
[2023-03-11 02:25:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:25:00] [INFO ] Implicit Places using invariants and state equation in 82 ms returned [6, 8, 10, 15, 17]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 146 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/50 places, 49/49 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 45 transition count 44
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 40 transition count 44
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 39 transition count 43
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 39 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 39 transition count 42
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 41 place count 22 transition count 31
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 45 place count 18 transition count 27
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 18 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 17 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 17 transition count 25
Applied a total of 52 rules in 9 ms. Remains 17 /45 variables (removed 28) and now considering 25/49 (removed 24) transitions.
// Phase 1: matrix 25 rows 17 cols
[2023-03-11 02:25:00] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 02:25:00] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-11 02:25:00] [INFO ] Invariant cache hit.
[2023-03-11 02:25:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:25:00] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/50 places, 25/49 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 224 ms. Remains : 17/50 places, 25/49 transitions.
Treatment of property BusinessProcesses-PT-04-LTLFireability-15 finished in 2213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
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)))'
[2023-03-11 02:25:00] [INFO ] Flatten gal took : 19 ms
[2023-03-11 02:25:00] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-11 02:25:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 228 places, 225 transitions and 797 arcs took 7 ms.
Total runtime 20451 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-04
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA BusinessProcesses-PT-04-LTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-04-LTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678501500832

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 BusinessProcesses-PT-04-LTLFireability-07
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for BusinessProcesses-PT-04-LTLFireability-07
lola: result : true
lola: markings : 2306
lola: fired transitions : 3914
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 BusinessProcesses-PT-04-LTLFireability-15
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for BusinessProcesses-PT-04-LTLFireability-15
lola: result : true
lola: markings : 2583
lola: fired transitions : 4298
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-04-LTLFireability-07: LTL true LTL model checker
BusinessProcesses-PT-04-LTLFireability-15: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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

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