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.r037-tajo-167813690500524.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 itstools
Input is BusinessProcesses-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690500524
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 131K 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-10-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678361480267

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 11:31:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 11:31:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:31:22] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-09 11:31:22] [INFO ] Transformed 518 places.
[2023-03-09 11:31:22] [INFO ] Transformed 471 transitions.
[2023-03-09 11:31:22] [INFO ] Found NUPN structural information;
[2023-03-09 11:31:22] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA BusinessProcesses-PT-10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 471/471 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 471
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 74 place count 444 transition count 398
Iterating global reduction 1 with 73 rules applied. Total rules applied 147 place count 444 transition count 398
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 181 place count 410 transition count 364
Iterating global reduction 1 with 34 rules applied. Total rules applied 215 place count 410 transition count 364
Applied a total of 215 rules in 91 ms. Remains 410 /518 variables (removed 108) and now considering 364/471 (removed 107) transitions.
// Phase 1: matrix 364 rows 410 cols
[2023-03-09 11:31:22] [INFO ] Computed 84 place invariants in 22 ms
[2023-03-09 11:31:22] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-09 11:31:22] [INFO ] Invariant cache hit.
[2023-03-09 11:31:23] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2023-03-09 11:31:23] [INFO ] Invariant cache hit.
[2023-03-09 11:31:23] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 410/518 places, 364/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 982 ms. Remains : 410/518 places, 364/471 transitions.
Support contains 37 out of 410 places after structural reductions.
[2023-03-09 11:31:23] [INFO ] Flatten gal took : 49 ms
[2023-03-09 11:31:23] [INFO ] Flatten gal took : 22 ms
[2023-03-09 11:31:23] [INFO ] Input system was already deterministic with 364 transitions.
Support contains 36 out of 410 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 84 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 25) seen :14
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-09 11:31:24] [INFO ] Invariant cache hit.
[2023-03-09 11:31:24] [INFO ] [Real]Absence check using 47 positive place invariants in 10 ms returned sat
[2023-03-09 11:31:24] [INFO ] [Real]Absence check using 47 positive and 37 generalized place invariants in 9 ms returned sat
[2023-03-09 11:31:25] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2023-03-09 11:31:25] [INFO ] [Nat]Absence check using 47 positive place invariants in 12 ms returned sat
[2023-03-09 11:31:25] [INFO ] [Nat]Absence check using 47 positive and 37 generalized place invariants in 11 ms returned sat
[2023-03-09 11:31:25] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2023-03-09 11:31:25] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 6 ms to minimize.
[2023-03-09 11:31:25] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2023-03-09 11:31:25] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2023-03-09 11:31:25] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
[2023-03-09 11:31:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 337 ms
[2023-03-09 11:31:25] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 1 ms to minimize.
[2023-03-09 11:31:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-03-09 11:31:25] [INFO ] After 797ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-09 11:31:26] [INFO ] After 1029ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 8 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 364/364 transitions.
Graph (trivial) has 178 edges and 410 vertex of which 6 / 410 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 932 edges and 405 vertex of which 404 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 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 404 transition count 318
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 366 transition count 317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 365 transition count 317
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 80 place count 365 transition count 237
Deduced a syphon composed of 80 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 171 rules applied. Total rules applied 251 place count 274 transition count 237
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 254 place count 271 transition count 234
Iterating global reduction 3 with 3 rules applied. Total rules applied 257 place count 271 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 257 place count 271 transition count 233
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 259 place count 270 transition count 233
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 475 place count 160 transition count 127
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 3 with 2 rules applied. Total rules applied 477 place count 159 transition count 130
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 479 place count 159 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 481 place count 157 transition count 128
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 482 place count 157 transition count 128
Applied a total of 482 rules in 71 ms. Remains 157 /410 variables (removed 253) and now considering 128/364 (removed 236) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 157/410 places, 128/364 transitions.
Finished random walk after 123 steps, including 5 resets, run visited all 6 properties in 2 ms. (steps per millisecond=61 )
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA BusinessProcesses-PT-10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 200 stabilizing places and 205 stable transitions
Graph (complete) has 939 edges and 410 vertex of which 409 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 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) U !p1) U X(G(p1))))'
Support contains 3 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 364/364 transitions.
Graph (trivial) has 185 edges and 410 vertex of which 6 / 410 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 933 edges and 405 vertex of which 404 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 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 403 transition count 315
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 362 transition count 315
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 82 Pre rules applied. Total rules applied 84 place count 362 transition count 233
Deduced a syphon composed of 82 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 175 rules applied. Total rules applied 259 place count 269 transition count 233
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 265 place count 263 transition count 227
Iterating global reduction 2 with 6 rules applied. Total rules applied 271 place count 263 transition count 227
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 271 place count 263 transition count 226
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 273 place count 262 transition count 226
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 486 place count 153 transition count 122
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 488 place count 152 transition count 125
Applied a total of 488 rules in 66 ms. Remains 152 /410 variables (removed 258) and now considering 125/364 (removed 239) transitions.
// Phase 1: matrix 125 rows 152 cols
[2023-03-09 11:31:26] [INFO ] Computed 68 place invariants in 3 ms
[2023-03-09 11:31:26] [INFO ] Implicit Places using invariants in 117 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 21, 22, 23, 24, 25, 26, 51, 52]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 120 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/410 places, 125/364 transitions.
Applied a total of 0 rules in 7 ms. Remains 136 /136 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 193 ms. Remains : 136/410 places, 125/364 transitions.
Stuttering acceptance computed with spot in 318 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (EQ s17 1) (EQ s108 1)), p0:(EQ s97 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-00 finished in 582 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 3 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 364/364 transitions.
Graph (trivial) has 186 edges and 410 vertex of which 6 / 410 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 933 edges and 405 vertex of which 404 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 403 transition count 316
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 363 transition count 316
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 82 place count 363 transition count 230
Deduced a syphon composed of 86 places in 3 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 267 place count 264 transition count 230
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 273 place count 258 transition count 224
Iterating global reduction 2 with 6 rules applied. Total rules applied 279 place count 258 transition count 224
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 490 place count 150 transition count 121
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 492 place count 149 transition count 124
Applied a total of 492 rules in 53 ms. Remains 149 /410 variables (removed 261) and now considering 124/364 (removed 240) transitions.
// Phase 1: matrix 124 rows 149 cols
[2023-03-09 11:31:27] [INFO ] Computed 66 place invariants in 4 ms
[2023-03-09 11:31:27] [INFO ] Implicit Places using invariants in 118 ms returned [1, 2, 3, 4, 5, 6, 7, 20, 21, 22, 23, 24, 25, 49, 50]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 119 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/410 places, 124/364 transitions.
Applied a total of 0 rules in 6 ms. Remains 134 /134 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 179 ms. Remains : 134/410 places, 124/364 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-01 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:(AND (EQ s26 1) (EQ s81 1) (EQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-01 finished in 265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p1||(p2&&G(F(p3))))&&p0))))'
Support contains 6 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 364/364 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 406 transition count 360
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 406 transition count 360
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 403 transition count 357
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 403 transition count 357
Applied a total of 14 rules in 30 ms. Remains 403 /410 variables (removed 7) and now considering 357/364 (removed 7) transitions.
// Phase 1: matrix 357 rows 403 cols
[2023-03-09 11:31:27] [INFO ] Computed 84 place invariants in 5 ms
[2023-03-09 11:31:27] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-09 11:31:27] [INFO ] Invariant cache hit.
[2023-03-09 11:31:27] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2023-03-09 11:31:27] [INFO ] Invariant cache hit.
[2023-03-09 11:31:28] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 403/410 places, 357/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 674 ms. Remains : 403/410 places, 357/364 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p3), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s96 1) (EQ s297 1) (EQ s364 1)), p1:(EQ s326 1), p2:(EQ s296 0), p3:(AND (EQ s215 0) (EQ s296 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-02 finished in 1001 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' '!((((p0 U X(G(p1))) U !p1) U X(X(p2))))'
Support contains 3 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 364/364 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 405 transition count 359
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 405 transition count 359
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 402 transition count 356
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 402 transition count 356
Applied a total of 16 rules in 33 ms. Remains 402 /410 variables (removed 8) and now considering 356/364 (removed 8) transitions.
// Phase 1: matrix 356 rows 402 cols
[2023-03-09 11:31:28] [INFO ] Computed 84 place invariants in 8 ms
[2023-03-09 11:31:28] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-09 11:31:28] [INFO ] Invariant cache hit.
[2023-03-09 11:31:29] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2023-03-09 11:31:29] [INFO ] Invariant cache hit.
[2023-03-09 11:31:29] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 402/410 places, 356/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 940 ms. Remains : 402/410 places, 356/364 transitions.
Stuttering acceptance computed with spot in 922 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), p1, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 6}, { cond=p1, acceptance={} source=1 dest: 7}, { cond=(AND p1 p0), acceptance={} source=1 dest: 8}], [{ cond=(NOT p1), acceptance={} source=2 dest: 9}, { cond=(AND p1 p0), acceptance={} source=2 dest: 10}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 10}, { cond=p1, acceptance={} source=3 dest: 12}, { cond=(AND p1 p0), acceptance={} source=3 dest: 13}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 13}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 9}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=6 dest: 10}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=7 dest: 10}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 12}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=7 dest: 13}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 10}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=8 dest: 13}], [{ cond=(NOT p2), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=10 dest: 11}, { cond=(AND p1 (NOT p2)), acceptance={} source=10 dest: 14}], [{ cond=true, acceptance={0} source=11 dest: 11}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=12 dest: 14}, { cond=(AND p1 (NOT p2)), acceptance={} source=12 dest: 15}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=12 dest: 16}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=13 dest: 14}, { cond=(AND p0 (NOT p2)), acceptance={} source=13 dest: 16}], [{ cond=(NOT p1), acceptance={} source=14 dest: 11}, { cond=p1, acceptance={} source=14 dest: 14}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=15 dest: 14}, { cond=p1, acceptance={0} source=15 dest: 15}, { cond=(AND p1 p0), acceptance={} source=15 dest: 16}], [{ cond=(NOT p0), acceptance={} source=16 dest: 14}, { cond=(AND p1 p0), acceptance={} source=16 dest: 16}, { cond=(AND (NOT p1) p0), acceptance={0} source=16 dest: 16}]], initial=0, aps=[p1:(EQ s51 1), p0:(EQ s118 1), p2:(EQ s143 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-03 finished in 1891 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 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 364/364 transitions.
Graph (trivial) has 187 edges and 410 vertex of which 6 / 410 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 933 edges and 405 vertex of which 404 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 403 transition count 315
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 362 transition count 315
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 84 place count 362 transition count 230
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 183 rules applied. Total rules applied 267 place count 264 transition count 230
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 272 place count 259 transition count 225
Iterating global reduction 2 with 5 rules applied. Total rules applied 277 place count 259 transition count 225
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 277 place count 259 transition count 224
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 279 place count 258 transition count 224
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 215 rules applied. Total rules applied 494 place count 148 transition count 119
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 496 place count 147 transition count 122
Applied a total of 496 rules in 59 ms. Remains 147 /410 variables (removed 263) and now considering 122/364 (removed 242) transitions.
// Phase 1: matrix 122 rows 147 cols
[2023-03-09 11:31:30] [INFO ] Computed 66 place invariants in 2 ms
[2023-03-09 11:31:30] [INFO ] Implicit Places using invariants in 137 ms returned [1, 2, 3, 4, 5, 6, 7, 20, 21, 22, 23, 24, 25, 48, 49]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 138 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/410 places, 122/364 transitions.
Applied a total of 0 rules in 6 ms. Remains 132 /132 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 203 ms. Remains : 132/410 places, 122/364 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s92 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-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-04 finished in 267 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 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 364/364 transitions.
Graph (trivial) has 188 edges and 410 vertex of which 6 / 410 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 933 edges and 405 vertex of which 404 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 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 403 transition count 315
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 362 transition count 315
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 84 place count 362 transition count 230
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 183 rules applied. Total rules applied 267 place count 264 transition count 230
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 273 place count 258 transition count 224
Iterating global reduction 2 with 6 rules applied. Total rules applied 279 place count 258 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 279 place count 258 transition count 223
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 281 place count 257 transition count 223
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 492 place count 149 transition count 120
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 494 place count 148 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 495 place count 147 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 496 place count 146 transition count 122
Applied a total of 496 rules in 46 ms. Remains 146 /410 variables (removed 264) and now considering 122/364 (removed 242) transitions.
// Phase 1: matrix 122 rows 146 cols
[2023-03-09 11:31:30] [INFO ] Computed 65 place invariants in 2 ms
[2023-03-09 11:31:30] [INFO ] Implicit Places using invariants in 112 ms returned [21, 22, 23, 24, 25, 26, 49]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 113 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/410 places, 122/364 transitions.
Applied a total of 0 rules in 6 ms. Remains 139 /139 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 139/410 places, 122/364 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 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-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-05 finished in 219 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(p1)) U p2))'
Support contains 3 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 364/364 transitions.
Graph (trivial) has 186 edges and 410 vertex of which 6 / 410 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 933 edges and 405 vertex of which 404 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 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 403 transition count 316
Reduce places removed 40 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 83 place count 363 transition count 315
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 362 transition count 315
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 84 place count 362 transition count 232
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 262 place count 267 transition count 232
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 268 place count 261 transition count 226
Iterating global reduction 3 with 6 rules applied. Total rules applied 274 place count 261 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 274 place count 261 transition count 225
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 276 place count 260 transition count 225
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 211 rules applied. Total rules applied 487 place count 152 transition count 122
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 3 with 2 rules applied. Total rules applied 489 place count 151 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 490 place count 150 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 491 place count 149 transition count 124
Applied a total of 491 rules in 40 ms. Remains 149 /410 variables (removed 261) and now considering 124/364 (removed 240) transitions.
// Phase 1: matrix 124 rows 149 cols
[2023-03-09 11:31:30] [INFO ] Computed 66 place invariants in 1 ms
[2023-03-09 11:31:30] [INFO ] Implicit Places using invariants in 125 ms returned [116]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/410 places, 124/364 transitions.
Applied a total of 0 rules in 5 ms. Remains 148 /148 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 171 ms. Remains : 148/410 places, 124/364 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s19 1), p0:(EQ s1 1), p1:(EQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-07 finished in 322 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(p1)))'
Support contains 3 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 364/364 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 404 transition count 358
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 404 transition count 358
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 401 transition count 355
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 401 transition count 355
Applied a total of 18 rules in 35 ms. Remains 401 /410 variables (removed 9) and now considering 355/364 (removed 9) transitions.
// Phase 1: matrix 355 rows 401 cols
[2023-03-09 11:31:31] [INFO ] Computed 84 place invariants in 10 ms
[2023-03-09 11:31:31] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-09 11:31:31] [INFO ] Invariant cache hit.
[2023-03-09 11:31:31] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2023-03-09 11:31:31] [INFO ] Invariant cache hit.
[2023-03-09 11:31:31] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 401/410 places, 355/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 875 ms. Remains : 401/410 places, 355/364 transitions.
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s350 1) (EQ s92 1)), p0:(EQ s16 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 107 steps with 0 reset in 9 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-08 finished in 1179 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(p1)||G(p2))))'
Support contains 3 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 364/364 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 404 transition count 358
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 404 transition count 358
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 401 transition count 355
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 401 transition count 355
Applied a total of 18 rules in 37 ms. Remains 401 /410 variables (removed 9) and now considering 355/364 (removed 9) transitions.
// Phase 1: matrix 355 rows 401 cols
[2023-03-09 11:31:32] [INFO ] Computed 84 place invariants in 5 ms
[2023-03-09 11:31:32] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-09 11:31:32] [INFO ] Invariant cache hit.
[2023-03-09 11:31:32] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2023-03-09 11:31:32] [INFO ] Invariant cache hit.
[2023-03-09 11:31:33] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 401/410 places, 355/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 884 ms. Remains : 401/410 places, 355/364 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s329 1), p2:(EQ s9 1), p0:(EQ s176 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]]
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-09 finished in 1099 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 3 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 364/364 transitions.
Graph (trivial) has 185 edges and 410 vertex of which 6 / 410 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 933 edges and 405 vertex of which 404 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 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 403 transition count 315
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 362 transition count 315
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 82 Pre rules applied. Total rules applied 84 place count 362 transition count 233
Deduced a syphon composed of 82 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 260 place count 268 transition count 233
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 266 place count 262 transition count 227
Iterating global reduction 2 with 6 rules applied. Total rules applied 272 place count 262 transition count 227
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 272 place count 262 transition count 226
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 274 place count 261 transition count 226
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 215 rules applied. Total rules applied 489 place count 151 transition count 121
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 491 place count 150 transition count 124
Applied a total of 491 rules in 60 ms. Remains 150 /410 variables (removed 260) and now considering 124/364 (removed 240) transitions.
// Phase 1: matrix 124 rows 150 cols
[2023-03-09 11:31:33] [INFO ] Computed 67 place invariants in 3 ms
[2023-03-09 11:31:33] [INFO ] Implicit Places using invariants in 150 ms returned [1, 2, 3, 6, 7, 8, 9, 22, 23, 24, 25, 26, 27, 50, 51]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 152 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/410 places, 124/364 transitions.
Applied a total of 0 rules in 4 ms. Remains 135 /135 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 217 ms. Remains : 135/410 places, 124/364 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s52 0) (EQ s94 0))], 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 17088 reset in 348 ms.
Product exploration explored 100000 steps with 17064 reset in 294 ms.
Computed a total of 62 stabilizing places and 77 stable transitions
Computed a total of 62 stabilizing places and 77 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1849 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 546 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 202 steps, run visited all 1 properties in 12 ms. (steps per millisecond=16 )
Probabilistic random walk after 202 steps, saw 146 distinct states, run finished after 12 ms. (steps per millisecond=16 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 151 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 124/124 transitions.
Applied a total of 0 rules in 5 ms. Remains 135 /135 variables (removed 0) and now considering 124/124 (removed 0) transitions.
// Phase 1: matrix 124 rows 135 cols
[2023-03-09 11:31:34] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-09 11:31:34] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-09 11:31:34] [INFO ] Invariant cache hit.
[2023-03-09 11:31:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 11:31:35] [INFO ] Implicit Places using invariants and state equation in 178 ms returned [15, 73, 79, 85, 87]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 288 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/135 places, 124/124 transitions.
Graph (complete) has 488 edges and 130 vertex of which 121 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 120 transition count 119
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 12 place count 111 transition count 83
Iterating global reduction 2 with 9 rules applied. Total rules applied 21 place count 111 transition count 83
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 25 place count 109 transition count 81
Applied a total of 25 rules in 8 ms. Remains 109 /130 variables (removed 21) and now considering 81/124 (removed 43) transitions.
// Phase 1: matrix 81 rows 109 cols
[2023-03-09 11:31:35] [INFO ] Computed 42 place invariants in 1 ms
[2023-03-09 11:31:35] [INFO ] Implicit Places using invariants in 69 ms returned [15, 16, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 71 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 106/135 places, 81/124 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 375 ms. Remains : 106/135 places, 81/124 transitions.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 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 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1906 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 549 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 175 steps, run visited all 1 properties in 12 ms. (steps per millisecond=14 )
Probabilistic random walk after 175 steps, saw 124 distinct states, run finished after 12 ms. (steps per millisecond=14 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 155 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 17476 reset in 134 ms.
Product exploration explored 100000 steps with 17317 reset in 138 ms.
Built C files in :
/tmp/ltsmin16099439712888631072
[2023-03-09 11:31:35] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2023-03-09 11:31:35] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:31:35] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2023-03-09 11:31:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:31:35] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2023-03-09 11:31:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:31:35] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16099439712888631072
Running compilation step : cd /tmp/ltsmin16099439712888631072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 374 ms.
Running link step : cd /tmp/ltsmin16099439712888631072;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin16099439712888631072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12071580024367536893.hoa' '--buchi-type=spotba'
LTSmin run took 171 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-10-LTLFireability-10 finished in 3253 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 3 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 364/364 transitions.
Graph (trivial) has 187 edges and 410 vertex of which 6 / 410 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 933 edges and 405 vertex of which 404 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 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 403 transition count 315
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 362 transition count 315
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 84 place count 362 transition count 230
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 183 rules applied. Total rules applied 267 place count 264 transition count 230
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 273 place count 258 transition count 224
Iterating global reduction 2 with 6 rules applied. Total rules applied 279 place count 258 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 279 place count 258 transition count 223
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 281 place count 257 transition count 223
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 203 rules applied. Total rules applied 484 place count 153 transition count 124
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 486 place count 152 transition count 127
Applied a total of 486 rules in 46 ms. Remains 152 /410 variables (removed 258) and now considering 127/364 (removed 237) transitions.
// Phase 1: matrix 127 rows 152 cols
[2023-03-09 11:31:36] [INFO ] Computed 66 place invariants in 2 ms
[2023-03-09 11:31:36] [INFO ] Implicit Places using invariants in 134 ms returned [1, 2, 3, 4, 5, 6, 7, 22, 23, 24, 25, 26, 27, 50, 51]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 135 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/410 places, 127/364 transitions.
Applied a total of 0 rules in 3 ms. Remains 137 /137 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 186 ms. Remains : 137/410 places, 127/364 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-15 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 s89 0), p1:(AND (EQ s2 1) (EQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-15 finished in 286 ms.
All properties solved by simple procedures.
Total runtime 14818 ms.

BK_STOP 1678361497159

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-10, 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 r037-tajo-167813690500524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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