Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918500420.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-13, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 6.3K Apr 29 23:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 23:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 23:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 23:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 148K May 10 09:33 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-13-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652631063013

Running Version 202205111006
[2022-05-15 16:11:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 16:11:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:11:04] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2022-05-15 16:11:04] [INFO ] Transformed 593 places.
[2022-05-15 16:11:04] [INFO ] Transformed 536 transitions.
[2022-05-15 16:11:04] [INFO ] Found NUPN structural information;
[2022-05-15 16:11:04] [INFO ] Parsed PT model containing 593 places and 536 transitions in 222 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 87 place count 498 transition count 446
Iterating global reduction 1 with 82 rules applied. Total rules applied 169 place count 498 transition count 446
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 208 place count 459 transition count 407
Iterating global reduction 1 with 39 rules applied. Total rules applied 247 place count 459 transition count 407
Applied a total of 247 rules in 106 ms. Remains 459 /585 variables (removed 126) and now considering 407/528 (removed 121) transitions.
// Phase 1: matrix 407 rows 459 cols
[2022-05-15 16:11:04] [INFO ] Computed 90 place invariants in 36 ms
[2022-05-15 16:11:05] [INFO ] Implicit Places using invariants in 343 ms returned []
// Phase 1: matrix 407 rows 459 cols
[2022-05-15 16:11:05] [INFO ] Computed 90 place invariants in 10 ms
[2022-05-15 16:11:05] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
// Phase 1: matrix 407 rows 459 cols
[2022-05-15 16:11:05] [INFO ] Computed 90 place invariants in 7 ms
[2022-05-15 16:11:05] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 459/585 places, 407/528 transitions.
Finished structural reductions, in 1 iterations. Remains : 459/585 places, 407/528 transitions.
Support contains 43 out of 459 places after structural reductions.
[2022-05-15 16:11:05] [INFO ] Flatten gal took : 65 ms
[2022-05-15 16:11:06] [INFO ] Flatten gal took : 30 ms
[2022-05-15 16:11:06] [INFO ] Input system was already deterministic with 407 transitions.
Support contains 41 out of 459 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 70 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 28) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 407 rows 459 cols
[2022-05-15 16:11:06] [INFO ] Computed 90 place invariants in 4 ms
[2022-05-15 16:11:07] [INFO ] [Real]Absence check using 52 positive place invariants in 17 ms returned sat
[2022-05-15 16:11:07] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 17 ms returned sat
[2022-05-15 16:11:07] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2022-05-15 16:11:08] [INFO ] [Nat]Absence check using 52 positive place invariants in 28 ms returned sat
[2022-05-15 16:11:08] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 15 ms returned sat
[2022-05-15 16:11:09] [INFO ] After 537ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :18
[2022-05-15 16:11:09] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 3 ms to minimize.
[2022-05-15 16:11:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-05-15 16:11:09] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 0 ms to minimize.
[2022-05-15 16:11:09] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2022-05-15 16:11:09] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2022-05-15 16:11:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 258 ms
[2022-05-15 16:11:09] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2022-05-15 16:11:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-15 16:11:09] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2022-05-15 16:11:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-15 16:11:10] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 0 ms to minimize.
[2022-05-15 16:11:10] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2022-05-15 16:11:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 197 ms
[2022-05-15 16:11:10] [INFO ] After 1839ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :18
Attempting to minimize the solution found.
Minimization took 375 ms.
[2022-05-15 16:11:10] [INFO ] After 3545ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :18
Fused 21 Parikh solutions to 17 different solutions.
Parikh walk visited 16 properties in 174 ms.
Support contains 2 out of 459 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 407/407 transitions.
Graph (trivial) has 214 edges and 459 vertex of which 6 / 459 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1036 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 453 transition count 350
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 404 transition count 350
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 100 place count 404 transition count 254
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 309 place count 291 transition count 254
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 317 place count 283 transition count 246
Iterating global reduction 2 with 8 rules applied. Total rules applied 325 place count 283 transition count 246
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 565 place count 161 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 567 place count 160 transition count 132
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 569 place count 160 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 571 place count 158 transition count 130
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 572 place count 158 transition count 130
Applied a total of 572 rules in 93 ms. Remains 158 /459 variables (removed 301) and now considering 130/407 (removed 277) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/459 places, 130/407 transitions.
Incomplete random walk after 10000 steps, including 439 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 243 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 283 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Finished probabilistic random walk after 4167 steps, run visited all 2 properties in 36 ms. (steps per millisecond=115 )
Probabilistic random walk after 4167 steps, saw 1476 distinct states, run finished after 36 ms. (steps per millisecond=115 ) properties seen :2
FORMULA BusinessProcesses-PT-13-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-13-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 122 stabilizing places and 115 stable transitions
Graph (complete) has 1043 edges and 459 vertex of which 458 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Graph (trivial) has 216 edges and 459 vertex of which 6 / 459 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 1037 edges and 454 vertex of which 453 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 452 transition count 349
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 402 transition count 349
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 102 place count 402 transition count 254
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 308 place count 291 transition count 254
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 318 place count 281 transition count 244
Iterating global reduction 2 with 10 rules applied. Total rules applied 328 place count 281 transition count 244
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 328 place count 281 transition count 243
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 330 place count 280 transition count 243
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 566 place count 160 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 568 place count 159 transition count 131
Applied a total of 568 rules in 61 ms. Remains 159 /459 variables (removed 300) and now considering 131/407 (removed 276) transitions.
// Phase 1: matrix 131 rows 159 cols
[2022-05-15 16:11:11] [INFO ] Computed 70 place invariants in 1 ms
[2022-05-15 16:11:11] [INFO ] Implicit Places using invariants in 114 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 117 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/459 places, 131/407 transitions.
Applied a total of 0 rules in 7 ms. Remains 139 /139 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 139/459 places, 131/407 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s97 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 1 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-00 finished in 412 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(G(p1)))&&p0)))'
Support contains 3 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 449 transition count 397
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 449 transition count 397
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 446 transition count 394
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 446 transition count 394
Applied a total of 26 rules in 46 ms. Remains 446 /459 variables (removed 13) and now considering 394/407 (removed 13) transitions.
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:11:12] [INFO ] Computed 90 place invariants in 6 ms
[2022-05-15 16:11:12] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:11:12] [INFO ] Computed 90 place invariants in 3 ms
[2022-05-15 16:11:12] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:11:12] [INFO ] Computed 90 place invariants in 9 ms
[2022-05-15 16:11:12] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/459 places, 394/407 transitions.
Finished structural reductions, in 1 iterations. Remains : 446/459 places, 394/407 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s114 1) (EQ s292 1) (EQ s386 1)), p1:(AND (EQ s114 1) (EQ s292 1) (EQ s386 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-01 finished in 1210 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)&&F(p1))) U p2))'
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 450 transition count 398
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 450 transition count 398
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 447 transition count 395
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 447 transition count 395
Applied a total of 24 rules in 23 ms. Remains 447 /459 variables (removed 12) and now considering 395/407 (removed 12) transitions.
// Phase 1: matrix 395 rows 447 cols
[2022-05-15 16:11:13] [INFO ] Computed 90 place invariants in 6 ms
[2022-05-15 16:11:13] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 395 rows 447 cols
[2022-05-15 16:11:13] [INFO ] Computed 90 place invariants in 2 ms
[2022-05-15 16:11:13] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
// Phase 1: matrix 395 rows 447 cols
[2022-05-15 16:11:13] [INFO ] Computed 90 place invariants in 7 ms
[2022-05-15 16:11:14] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/459 places, 395/407 transitions.
Finished structural reductions, in 1 iterations. Remains : 447/459 places, 395/407 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), true, (NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(AND (EQ s436 1) (EQ s439 1)), p2:(EQ s75 1), p1:(EQ s235 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-02 finished in 1112 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((X(p0) U p1)))||X(p1))))'
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 450 transition count 398
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 450 transition count 398
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 448 transition count 396
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 448 transition count 396
Applied a total of 22 rules in 36 ms. Remains 448 /459 variables (removed 11) and now considering 396/407 (removed 11) transitions.
// Phase 1: matrix 396 rows 448 cols
[2022-05-15 16:11:14] [INFO ] Computed 90 place invariants in 4 ms
[2022-05-15 16:11:14] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 396 rows 448 cols
[2022-05-15 16:11:14] [INFO ] Computed 90 place invariants in 4 ms
[2022-05-15 16:11:15] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
// Phase 1: matrix 396 rows 448 cols
[2022-05-15 16:11:15] [INFO ] Computed 90 place invariants in 4 ms
[2022-05-15 16:11:15] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 448/459 places, 396/407 transitions.
Finished structural reductions, in 1 iterations. Remains : 448/459 places, 396/407 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s384 1), p0:(AND (EQ s32 1) (EQ s263 1) (EQ s413 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 159 steps with 0 reset in 5 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-03 finished in 989 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 3 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Graph (trivial) has 214 edges and 459 vertex of which 6 / 459 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 1037 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 452 transition count 349
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 402 transition count 349
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 102 place count 402 transition count 254
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 309 place count 290 transition count 254
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 318 place count 281 transition count 245
Iterating global reduction 2 with 9 rules applied. Total rules applied 327 place count 281 transition count 245
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 327 place count 281 transition count 244
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 329 place count 280 transition count 244
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 561 place count 162 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 563 place count 161 transition count 134
Applied a total of 563 rules in 47 ms. Remains 161 /459 variables (removed 298) and now considering 134/407 (removed 273) transitions.
// Phase 1: matrix 134 rows 161 cols
[2022-05-15 16:11:15] [INFO ] Computed 69 place invariants in 1 ms
[2022-05-15 16:11:15] [INFO ] Implicit Places using invariants in 100 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 46, 47, 48, 49, 50]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 101 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/459 places, 134/407 transitions.
Applied a total of 0 rules in 6 ms. Remains 142 /142 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 142/459 places, 134/407 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(OR (EQ s80 1) (EQ s96 1)), p0:(EQ s121 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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-13-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-05 finished in 237 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U G(p1))||(X(G(p2))&&p1))))'
Support contains 3 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 450 transition count 398
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 450 transition count 398
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 447 transition count 395
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 447 transition count 395
Applied a total of 24 rules in 28 ms. Remains 447 /459 variables (removed 12) and now considering 395/407 (removed 12) transitions.
// Phase 1: matrix 395 rows 447 cols
[2022-05-15 16:11:15] [INFO ] Computed 90 place invariants in 5 ms
[2022-05-15 16:11:15] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 395 rows 447 cols
[2022-05-15 16:11:15] [INFO ] Computed 90 place invariants in 3 ms
[2022-05-15 16:11:16] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
// Phase 1: matrix 395 rows 447 cols
[2022-05-15 16:11:16] [INFO ] Computed 90 place invariants in 10 ms
[2022-05-15 16:11:16] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/459 places, 395/407 transitions.
Finished structural reductions, in 1 iterations. Remains : 447/459 places, 395/407 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p1), (NOT p1), true, (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 2}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 2}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s92 1), p0:(EQ s334 1), p2:(EQ s206 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-06 finished in 1188 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(G(X(p0)))))'
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 449 transition count 397
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 449 transition count 397
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 446 transition count 394
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 446 transition count 394
Applied a total of 26 rules in 26 ms. Remains 446 /459 variables (removed 13) and now considering 394/407 (removed 13) transitions.
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:11:16] [INFO ] Computed 90 place invariants in 7 ms
[2022-05-15 16:11:16] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:11:16] [INFO ] Computed 90 place invariants in 2 ms
[2022-05-15 16:11:17] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:11:17] [INFO ] Computed 90 place invariants in 8 ms
[2022-05-15 16:11:17] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/459 places, 394/407 transitions.
Finished structural reductions, in 1 iterations. Remains : 446/459 places, 394/407 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s238 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-08 finished in 1008 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(F((G(p0)&&(F(p1)||p1))))))))'
Support contains 2 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Graph (trivial) has 214 edges and 459 vertex of which 6 / 459 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 1037 edges and 454 vertex of which 453 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 452 transition count 350
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 403 transition count 350
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 100 place count 403 transition count 255
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 307 place count 291 transition count 255
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 315 place count 283 transition count 247
Iterating global reduction 2 with 8 rules applied. Total rules applied 323 place count 283 transition count 247
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 323 place count 283 transition count 246
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 325 place count 282 transition count 246
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 563 place count 161 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 565 place count 160 transition count 133
Applied a total of 565 rules in 38 ms. Remains 160 /459 variables (removed 299) and now considering 133/407 (removed 274) transitions.
// Phase 1: matrix 133 rows 160 cols
[2022-05-15 16:11:17] [INFO ] Computed 69 place invariants in 1 ms
[2022-05-15 16:11:17] [INFO ] Implicit Places using invariants in 108 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 46, 47, 48, 49, 50]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 109 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/459 places, 133/407 transitions.
Applied a total of 0 rules in 5 ms. Remains 141 /141 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 141/459 places, 133/407 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s102 0), p0:(EQ s64 0)], 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 9 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-10 finished in 280 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 2 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 450 transition count 398
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 450 transition count 398
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 447 transition count 395
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 447 transition count 395
Applied a total of 24 rules in 28 ms. Remains 447 /459 variables (removed 12) and now considering 395/407 (removed 12) transitions.
// Phase 1: matrix 395 rows 447 cols
[2022-05-15 16:11:18] [INFO ] Computed 90 place invariants in 7 ms
[2022-05-15 16:11:18] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 395 rows 447 cols
[2022-05-15 16:11:18] [INFO ] Computed 90 place invariants in 6 ms
[2022-05-15 16:11:18] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
// Phase 1: matrix 395 rows 447 cols
[2022-05-15 16:11:18] [INFO ] Computed 90 place invariants in 3 ms
[2022-05-15 16:11:18] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/459 places, 395/407 transitions.
Finished structural reductions, in 1 iterations. Remains : 447/459 places, 395/407 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-11 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:(EQ s301 1), p0:(EQ s369 0)], 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]]
Product exploration explored 100000 steps with 50000 reset in 450 ms.
Product exploration explored 100000 steps with 50000 reset in 422 ms.
Computed a total of 119 stabilizing places and 112 stable transitions
Graph (complete) has 1022 edges and 447 vertex of which 446 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 119 stabilizing places and 112 stable transitions
Detected a total of 119/447 stabilizing places and 112/395 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-13-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-13-LTLFireability-11 finished in 2042 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(F(!p0)) U p1))))'
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 450 transition count 398
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 450 transition count 398
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 448 transition count 396
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 448 transition count 396
Applied a total of 22 rules in 32 ms. Remains 448 /459 variables (removed 11) and now considering 396/407 (removed 11) transitions.
// Phase 1: matrix 396 rows 448 cols
[2022-05-15 16:11:20] [INFO ] Computed 90 place invariants in 5 ms
[2022-05-15 16:11:20] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 396 rows 448 cols
[2022-05-15 16:11:20] [INFO ] Computed 90 place invariants in 6 ms
[2022-05-15 16:11:20] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
// Phase 1: matrix 396 rows 448 cols
[2022-05-15 16:11:20] [INFO ] Computed 90 place invariants in 7 ms
[2022-05-15 16:11:20] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 448/459 places, 396/407 transitions.
Finished structural reductions, in 1 iterations. Remains : 448/459 places, 396/407 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), p0, p0, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s41 1), p0:(AND (EQ s88 1) (EQ s310 1) (EQ s380 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]]
Product exploration explored 100000 steps with 717 reset in 288 ms.
Product exploration explored 100000 steps with 714 reset in 256 ms.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 1025 edges and 448 vertex of which 447 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 330 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) p0), (NOT p1), p0, p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Finished probabilistic random walk after 22617 steps, run visited all 3 properties in 147 ms. (steps per millisecond=153 )
Probabilistic random walk after 22617 steps, saw 9725 distinct states, run finished after 147 ms. (steps per millisecond=153 ) properties seen :3
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 7 factoid took 437 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) p0), (NOT p1), p0, p0, (NOT p1)]
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) p0), (NOT p1), p0, p0, (NOT p1)]
// Phase 1: matrix 396 rows 448 cols
[2022-05-15 16:11:23] [INFO ] Computed 90 place invariants in 8 ms
[2022-05-15 16:11:23] [INFO ] [Real]Absence check using 52 positive place invariants in 20 ms returned sat
[2022-05-15 16:11:23] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 18 ms returned sat
[2022-05-15 16:11:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:11:24] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2022-05-15 16:11:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:11:24] [INFO ] [Nat]Absence check using 52 positive place invariants in 17 ms returned sat
[2022-05-15 16:11:24] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 18 ms returned sat
[2022-05-15 16:11:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:11:25] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2022-05-15 16:11:25] [INFO ] Computed and/alt/rep : 390/739/390 causal constraints (skipped 5 transitions) in 26 ms.
[2022-05-15 16:11:27] [INFO ] Added : 297 causal constraints over 60 iterations in 2385 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 396/396 transitions.
Graph (trivial) has 201 edges and 448 vertex of which 6 / 448 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 1019 edges and 443 vertex of which 442 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 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 441 transition count 344
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 397 transition count 344
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 90 place count 397 transition count 250
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 294 place count 287 transition count 250
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 536 place count 164 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 538 place count 163 transition count 135
Applied a total of 538 rules in 35 ms. Remains 163 /448 variables (removed 285) and now considering 135/396 (removed 261) transitions.
// Phase 1: matrix 135 rows 163 cols
[2022-05-15 16:11:27] [INFO ] Computed 70 place invariants in 1 ms
[2022-05-15 16:11:27] [INFO ] Implicit Places using invariants in 99 ms returned [1, 2, 6, 7, 8, 15, 16, 22, 23, 24, 25, 26, 27, 50, 51, 52, 53, 54]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 100 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/448 places, 135/396 transitions.
Applied a total of 0 rules in 12 ms. Remains 145 /145 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 145/448 places, 135/396 transitions.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 288 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) p0), (NOT p1), p0, p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 2009 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 636 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 599 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 608 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 135 rows 145 cols
[2022-05-15 16:11:28] [INFO ] Computed 52 place invariants in 7 ms
[2022-05-15 16:11:28] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2022-05-15 16:11:28] [INFO ] [Real]Absence check using 36 positive and 16 generalized place invariants in 5 ms returned sat
[2022-05-15 16:11:28] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 16:11:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2022-05-15 16:11:28] [INFO ] [Nat]Absence check using 36 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-15 16:11:28] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 16:11:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 16:11:28] [INFO ] After 14ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 16:11:28] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-15 16:11:28] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 38 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=19 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 8 factoid took 350 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) p0), (NOT p1), p0, p0, (NOT p1)]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) p0), (NOT p1), p0, p0, (NOT p1)]
// Phase 1: matrix 135 rows 145 cols
[2022-05-15 16:11:29] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-15 16:11:29] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2022-05-15 16:11:29] [INFO ] [Real]Absence check using 36 positive and 16 generalized place invariants in 4 ms returned sat
[2022-05-15 16:11:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 16:11:29] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2022-05-15 16:11:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 16:11:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2022-05-15 16:11:29] [INFO ] [Nat]Absence check using 36 positive and 16 generalized place invariants in 4 ms returned sat
[2022-05-15 16:11:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 16:11:29] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2022-05-15 16:11:29] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 16:11:29] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2022-05-15 16:11:29] [INFO ] Computed and/alt/rep : 115/463/115 causal constraints (skipped 15 transitions) in 8 ms.
[2022-05-15 16:11:29] [INFO ] Added : 29 causal constraints over 6 iterations in 82 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) p0), (NOT p1), p0, p0, (NOT p1)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-14 finished in 9973 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(X(F(p0)) U p1) U (p0 U G(X(!p2)))))'
Support contains 6 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 449 transition count 397
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 449 transition count 397
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 446 transition count 394
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 446 transition count 394
Applied a total of 26 rules in 28 ms. Remains 446 /459 variables (removed 13) and now considering 394/407 (removed 13) transitions.
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:11:30] [INFO ] Computed 90 place invariants in 5 ms
[2022-05-15 16:11:30] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:11:30] [INFO ] Computed 90 place invariants in 5 ms
[2022-05-15 16:11:30] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:11:30] [INFO ] Computed 90 place invariants in 5 ms
[2022-05-15 16:11:30] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/459 places, 394/407 transitions.
Finished structural reductions, in 1 iterations. Remains : 446/459 places, 394/407 transitions.
Stuttering acceptance computed with spot in 270 ms :[p2, (AND p2 p0 p1), p2, p2, true, p0, (AND p0 p1), false]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 7}]], initial=2, aps=[p2:(AND (EQ s429 1) (EQ s432 1)), p0:(EQ s410 1), p1:(AND (EQ s163 1) (EQ s324 1) (EQ s434 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33242 reset in 346 ms.
Product exploration explored 100000 steps with 33301 reset in 318 ms.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 1021 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Detected a total of 118/446 stabilizing places and 111/394 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p2)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 34 factoid took 2338 ms. Reduced automaton from 8 states, 24 edges and 3 AP to 8 states, 24 edges and 3 AP.
Stuttering acceptance computed with spot in 258 ms :[p2, (AND p2 p0 p1), p2, p2, true, p0, (AND p0 p1), false]
Incomplete random walk after 10000 steps, including 70 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 17) seen :5
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:11:35] [INFO ] Computed 90 place invariants in 2 ms
[2022-05-15 16:11:35] [INFO ] [Real]Absence check using 52 positive place invariants in 14 ms returned sat
[2022-05-15 16:11:35] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 11 ms returned sat
[2022-05-15 16:11:35] [INFO ] After 170ms SMT Verify possible using state equation in real domain returned unsat :3 sat :2 real:7
[2022-05-15 16:11:35] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 0 ms to minimize.
[2022-05-15 16:11:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-15 16:11:35] [INFO ] After 354ms SMT Verify possible using trap constraints in real domain returned unsat :3 sat :1 real:8
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-15 16:11:35] [INFO ] After 543ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :1 real:8
[2022-05-15 16:11:36] [INFO ] [Nat]Absence check using 52 positive place invariants in 14 ms returned sat
[2022-05-15 16:11:36] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 12 ms returned sat
[2022-05-15 16:11:36] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :7
[2022-05-15 16:11:36] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2022-05-15 16:11:36] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2022-05-15 16:11:36] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2022-05-15 16:11:36] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2022-05-15 16:11:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 247 ms
[2022-05-15 16:11:36] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 0 ms to minimize.
[2022-05-15 16:11:36] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 1 ms to minimize.
[2022-05-15 16:11:36] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 1 ms to minimize.
[2022-05-15 16:11:37] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 0 ms to minimize.
[2022-05-15 16:11:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 420 ms
[2022-05-15 16:11:37] [INFO ] After 1145ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :7
Attempting to minimize the solution found.
Minimization took 152 ms.
[2022-05-15 16:11:37] [INFO ] After 1489ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :7
Fused 12 Parikh solutions to 3 different solutions.
Finished Parikh walk after 202 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=50 )
Parikh walk visited 7 properties in 19 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p2)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p2 (NOT p0) p1))), (G (NOT (AND p2 p0 p1))), (G (NOT (AND p2 p0))), (G (NOT (AND (NOT p2) p0 p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p0))), (F p1), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) p0)), (F (AND p2 (NOT p1))), (F p2), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0)))), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 39 factoid took 2364 ms. Reduced automaton from 8 states, 24 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 167 ms :[p2, p2, true, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 143 ms :[p2, p2, true, p0, (AND p0 p1)]
Support contains 6 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 394/394 transitions.
Applied a total of 0 rules in 8 ms. Remains 446 /446 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:11:40] [INFO ] Computed 90 place invariants in 4 ms
[2022-05-15 16:11:40] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:11:40] [INFO ] Computed 90 place invariants in 2 ms
[2022-05-15 16:11:40] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:11:40] [INFO ] Computed 90 place invariants in 2 ms
[2022-05-15 16:11:40] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 446/446 places, 394/394 transitions.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 1021 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Detected a total of 118/446 stabilizing places and 111/394 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT p2)), (X (NOT p1)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 450 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 144 ms :[p2, p2, true, p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 70 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:11:41] [INFO ] Computed 90 place invariants in 6 ms
[2022-05-15 16:11:41] [INFO ] [Real]Absence check using 52 positive place invariants in 14 ms returned sat
[2022-05-15 16:11:41] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 14 ms returned sat
[2022-05-15 16:11:42] [INFO ] After 149ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-15 16:11:42] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2022-05-15 16:11:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2022-05-15 16:11:42] [INFO ] After 243ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 16:11:42] [INFO ] After 352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 16:11:42] [INFO ] [Nat]Absence check using 52 positive place invariants in 18 ms returned sat
[2022-05-15 16:11:42] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 12 ms returned sat
[2022-05-15 16:11:42] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 16:11:42] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 1 ms to minimize.
[2022-05-15 16:11:42] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2022-05-15 16:11:42] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2022-05-15 16:11:42] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 0 ms to minimize.
[2022-05-15 16:11:43] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 0 ms to minimize.
[2022-05-15 16:11:43] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 0 ms to minimize.
[2022-05-15 16:11:43] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 0 ms to minimize.
[2022-05-15 16:11:43] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 0 ms to minimize.
[2022-05-15 16:11:43] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 1 ms to minimize.
[2022-05-15 16:11:43] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 0 ms to minimize.
[2022-05-15 16:11:43] [INFO ] Deduced a trap composed of 76 places in 74 ms of which 0 ms to minimize.
[2022-05-15 16:11:43] [INFO ] Deduced a trap composed of 79 places in 77 ms of which 1 ms to minimize.
[2022-05-15 16:11:43] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 5 ms to minimize.
[2022-05-15 16:11:43] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1239 ms
[2022-05-15 16:11:43] [INFO ] After 1521ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 55 ms.
[2022-05-15 16:11:43] [INFO ] After 1699ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 5 out of 446 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 446/446 places, 394/394 transitions.
Graph (trivial) has 201 edges and 446 vertex of which 6 / 446 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1014 edges and 441 vertex of which 440 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 440 transition count 341
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 395 transition count 341
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 92 place count 395 transition count 248
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 203 rules applied. Total rules applied 295 place count 285 transition count 248
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 535 place count 163 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 537 place count 162 transition count 134
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 539 place count 162 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 541 place count 160 transition count 132
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 542 place count 160 transition count 132
Applied a total of 542 rules in 40 ms. Remains 160 /446 variables (removed 286) and now considering 132/394 (removed 262) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/446 places, 132/394 transitions.
Finished random walk after 223 steps, including 7 resets, run visited all 3 properties in 2 ms. (steps per millisecond=111 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT p2)), (X (NOT p1)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1)]
Knowledge based reduction with 10 factoid took 513 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 138 ms :[p2, p2, true, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 136 ms :[p2, p2, true, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 134 ms :[p2, p2, true, p0, (AND p0 p1)]
Product exploration explored 100000 steps with 709 reset in 199 ms.
Product exploration explored 100000 steps with 712 reset in 199 ms.
Applying partial POR strategy [true, false, true, true, false]
Stuttering acceptance computed with spot in 150 ms :[p2, p2, true, p0, (AND p0 p1)]
Support contains 6 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 394/394 transitions.
Graph (trivial) has 200 edges and 446 vertex of which 6 / 446 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 1015 edges and 441 vertex of which 440 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
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 440 transition count 387
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 66 Pre rules applied. Total rules applied 46 place count 440 transition count 434
Deduced a syphon composed of 110 places in 1 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 112 place count 440 transition count 434
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 126 place count 426 transition count 408
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 140 place count 426 transition count 408
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 240 places in 0 ms
Iterating global reduction 1 with 144 rules applied. Total rules applied 284 place count 426 transition count 408
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 319 place count 391 transition count 373
Deduced a syphon composed of 205 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 354 place count 391 transition count 373
Deduced a syphon composed of 205 places in 1 ms
Applied a total of 354 rules in 67 ms. Remains 391 /446 variables (removed 55) and now considering 373/394 (removed 21) transitions.
[2022-05-15 16:11:45] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 373 rows 391 cols
[2022-05-15 16:11:45] [INFO ] Computed 90 place invariants in 4 ms
[2022-05-15 16:11:45] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 391/446 places, 373/394 transitions.
Finished structural reductions, in 1 iterations. Remains : 391/446 places, 373/394 transitions.
Product exploration explored 100000 steps with 718 reset in 223 ms.
Product exploration explored 100000 steps with 716 reset in 262 ms.
Built C files in :
/tmp/ltsmin9401375806898777591
[2022-05-15 16:11:46] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9401375806898777591
Running compilation step : cd /tmp/ltsmin9401375806898777591;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 701 ms.
Running link step : cd /tmp/ltsmin9401375806898777591;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin9401375806898777591;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10625262806945298598.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 394/394 transitions.
Applied a total of 0 rules in 17 ms. Remains 446 /446 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:12:01] [INFO ] Computed 90 place invariants in 5 ms
[2022-05-15 16:12:01] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:12:01] [INFO ] Computed 90 place invariants in 2 ms
[2022-05-15 16:12:02] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:12:02] [INFO ] Computed 90 place invariants in 2 ms
[2022-05-15 16:12:02] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 446/446 places, 394/394 transitions.
Built C files in :
/tmp/ltsmin6577356733442076660
[2022-05-15 16:12:02] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6577356733442076660
Running compilation step : cd /tmp/ltsmin6577356733442076660;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 561 ms.
Running link step : cd /tmp/ltsmin6577356733442076660;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6577356733442076660;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11734305648132620114.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 16:12:17] [INFO ] Flatten gal took : 25 ms
[2022-05-15 16:12:17] [INFO ] Flatten gal took : 22 ms
[2022-05-15 16:12:17] [INFO ] Time to serialize gal into /tmp/LTL4804074236674961138.gal : 4 ms
[2022-05-15 16:12:17] [INFO ] Time to serialize properties into /tmp/LTL4087783391325984894.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4804074236674961138.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4087783391325984894.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4804074...266
Read 1 LTL properties
Checking formula 0 : !(((!((X(F("(p555==1)")))U("(((p191==1)&&(p385==1))&&(p581==1))")))U(("(p555==1)")U(G(X(!("((p576==1)&&(p579==1))")))))))
Formula 0 simplified : !(!(XF"(p555==1)" U "(((p191==1)&&(p385==1))&&(p581==1))") U ("(p555==1)" U GX!"((p576==1)&&(p579==1))"))
Detected timeout of ITS tools.
[2022-05-15 16:12:32] [INFO ] Flatten gal took : 20 ms
[2022-05-15 16:12:32] [INFO ] Applying decomposition
[2022-05-15 16:12:32] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7986555331072639628.txt' '-o' '/tmp/graph7986555331072639628.bin' '-w' '/tmp/graph7986555331072639628.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7986555331072639628.bin' '-l' '-1' '-v' '-w' '/tmp/graph7986555331072639628.weights' '-q' '0' '-e' '0.001'
[2022-05-15 16:12:32] [INFO ] Decomposing Gal with order
[2022-05-15 16:12:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 16:12:32] [INFO ] Removed a total of 269 redundant transitions.
[2022-05-15 16:12:32] [INFO ] Flatten gal took : 80 ms
[2022-05-15 16:12:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 15 ms.
[2022-05-15 16:12:32] [INFO ] Time to serialize gal into /tmp/LTL53016245046645307.gal : 9 ms
[2022-05-15 16:12:32] [INFO ] Time to serialize properties into /tmp/LTL13899715483371229397.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL53016245046645307.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13899715483371229397.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5301624...244
Read 1 LTL properties
Checking formula 0 : !(((!((X(F("(i0.i1.u142.p555==1)")))U("(((i12.i0.u53.p191==1)&&(i12.i0.u110.p385==1))&&(i12.i0.u137.p581==1))")))U(("(i0.i1.u142.p555=...223
Formula 0 simplified : !(!(XF"(i0.i1.u142.p555==1)" U "(((i12.i0.u53.p191==1)&&(i12.i0.u110.p385==1))&&(i12.i0.u137.p581==1))") U ("(i0.i1.u142.p555==1)" U...209
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t168, t240, t263, t274, t380, t389, t391, t397, t402, i0.i0.u118.t70, i0.i1....1170
Computing Next relation with stutter on 1188 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin875026384405260553
[2022-05-15 16:12:48] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin875026384405260553
Running compilation step : cd /tmp/ltsmin875026384405260553;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 604 ms.
Running link step : cd /tmp/ltsmin875026384405260553;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin875026384405260553;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!(X(<>((LTLAPp0==true))) U (LTLAPp1==true)) U ((LTLAPp0==true) U [](X(!(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-13-LTLFireability-15 finished in 93076 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(X(F(p0)) U p1) U (p0 U G(X(!p2)))))'
Found a SL insensitive property : BusinessProcesses-PT-13-LTLFireability-15
Stuttering acceptance computed with spot in 239 ms :[p2, (AND p2 p0 p1), p2, p2, true, p0, (AND p0 p1), false]
Support contains 6 out of 459 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 459/459 places, 407/407 transitions.
Graph (trivial) has 213 edges and 459 vertex of which 6 / 459 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 1037 edges and 454 vertex of which 453 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 452 transition count 349
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 402 transition count 349
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 92 Pre rules applied. Total rules applied 102 place count 402 transition count 257
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 302 place count 294 transition count 257
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 312 place count 284 transition count 247
Iterating global reduction 2 with 10 rules applied. Total rules applied 322 place count 284 transition count 247
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 322 place count 284 transition count 246
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 324 place count 283 transition count 246
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 556 place count 165 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 558 place count 164 transition count 136
Applied a total of 558 rules in 33 ms. Remains 164 /459 variables (removed 295) and now considering 136/407 (removed 271) transitions.
// Phase 1: matrix 136 rows 164 cols
[2022-05-15 16:13:03] [INFO ] Computed 70 place invariants in 1 ms
[2022-05-15 16:13:03] [INFO ] Implicit Places using invariants in 123 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 47, 48, 49, 50, 51, 52]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 124 ms to find 20 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 144/459 places, 136/407 transitions.
Applied a total of 0 rules in 3 ms. Remains 144 /144 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 144/459 places, 136/407 transitions.
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 7}]], initial=2, aps=[p2:(AND (EQ s131 1) (EQ s134 1)), p0:(EQ s118 1), p1:(AND (EQ s25 1) (EQ s78 1) (EQ s136 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 35017 reset in 327 ms.
Product exploration explored 100000 steps with 34862 reset in 285 ms.
Computed a total of 13 stabilizing places and 11 stable transitions
Computed a total of 13 stabilizing places and 11 stable transitions
Detected a total of 13/144 stabilizing places and 11/136 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p2)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 34 factoid took 1936 ms. Reduced automaton from 8 states, 24 edges and 3 AP to 8 states, 24 edges and 3 AP.
Stuttering acceptance computed with spot in 260 ms :[p2, (AND p2 p0 p1), p2, p2, true, p0, (AND p0 p1), false]
Incomplete random walk after 10000 steps, including 1964 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 17) seen :5
Incomplete Best-First random walk after 10000 steps, including 627 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 565 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 563 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 635 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 625 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 644 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 627 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 633 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 560 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 566 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 622 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 655 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 136 rows 144 cols
[2022-05-15 16:13:07] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-15 16:13:07] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2022-05-15 16:13:07] [INFO ] [Real]Absence check using 33 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-15 16:13:07] [INFO ] After 51ms SMT Verify possible using state equation in real domain returned unsat :3 sat :2 real:7
[2022-05-15 16:13:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 16:13:07] [INFO ] After 14ms SMT Verify possible using 5 Read/Feed constraints in real domain returned unsat :3 sat :0 real:9
[2022-05-15 16:13:07] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:9
[2022-05-15 16:13:07] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2022-05-15 16:13:07] [INFO ] [Nat]Absence check using 33 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-15 16:13:08] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :7
[2022-05-15 16:13:08] [INFO ] After 58ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :5 sat :7
[2022-05-15 16:13:08] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 0 ms to minimize.
[2022-05-15 16:13:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2022-05-15 16:13:08] [INFO ] After 239ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :7
Attempting to minimize the solution found.
Minimization took 55 ms.
[2022-05-15 16:13:08] [INFO ] After 464ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :7
Fused 12 Parikh solutions to 3 different solutions.
Finished Parikh walk after 25 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 7 properties in 8 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p2)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p2 (NOT p0) p1))), (G (NOT (AND p2 p0 p1))), (G (NOT (AND p2 p0))), (G (NOT (AND (NOT p2) p0 p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p0))), (F p1), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) p0)), (F (AND p2 (NOT p1))), (F p2), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0)))), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 39 factoid took 2593 ms. Reduced automaton from 8 states, 24 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 158 ms :[p2, p2, true, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 173 ms :[p2, p2, true, p0, (AND p0 p1)]
Support contains 6 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 136/136 transitions.
Applied a total of 0 rules in 1 ms. Remains 144 /144 variables (removed 0) and now considering 136/136 (removed 0) transitions.
// Phase 1: matrix 136 rows 144 cols
[2022-05-15 16:13:11] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-15 16:13:11] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 136 rows 144 cols
[2022-05-15 16:13:11] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 16:13:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 16:13:11] [INFO ] Implicit Places using invariants and state equation in 178 ms returned [1, 3, 7, 10, 34, 35, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 60, 62, 64, 66, 68, 70, 72, 74, 83, 85, 87, 89, 91]
Discarding 30 places :
Implicit Place search using SMT with State Equation took 273 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/144 places, 136/136 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 110 transition count 130
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 110 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 109 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 109 transition count 129
Applied a total of 10 rules in 4 ms. Remains 109 /114 variables (removed 5) and now considering 129/136 (removed 7) transitions.
// Phase 1: matrix 129 rows 109 cols
[2022-05-15 16:13:11] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-15 16:13:11] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 129 rows 109 cols
[2022-05-15 16:13:11] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-15 16:13:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 16:13:11] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 109/144 places, 129/136 transitions.
Finished structural reductions, in 2 iterations. Remains : 109/144 places, 129/136 transitions.
Computed a total of 7 stabilizing places and 8 stable transitions
Graph (complete) has 355 edges and 109 vertex of which 98 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 8 stable transitions
Detected a total of 7/109 stabilizing places and 8/129 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT p2)), (X (NOT p1)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 417 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 151 ms :[p2, p2, true, p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 1972 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 648 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 615 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 620 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 129 rows 109 cols
[2022-05-15 16:13:12] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-15 16:13:12] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-15 16:13:12] [INFO ] [Real]Absence check using 7 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-15 16:13:12] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-15 16:13:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 16:13:12] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 16:13:12] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 16:13:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-15 16:13:12] [INFO ] [Nat]Absence check using 7 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-15 16:13:12] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 16:13:12] [INFO ] After 21ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 16:13:12] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2022-05-15 16:13:12] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2022-05-15 16:13:12] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2022-05-15 16:13:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 162 ms
[2022-05-15 16:13:12] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-15 16:13:12] [INFO ] After 329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Parikh walk visited 3 properties in 2 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT p2)), (X (NOT p1)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1)]
Knowledge based reduction with 10 factoid took 492 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 160 ms :[p2, p2, true, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 159 ms :[p2, p2, true, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 185 ms :[p2, p2, true, p0, (AND p0 p1)]
Product exploration explored 100000 steps with 17641 reset in 118 ms.
Product exploration explored 100000 steps with 17671 reset in 117 ms.
Applying partial POR strategy [true, false, true, true, false]
Stuttering acceptance computed with spot in 154 ms :[p2, p2, true, p0, (AND p0 p1)]
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 129/129 transitions.
Graph (complete) has 355 edges and 109 vertex of which 98 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 98 transition count 124
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 20 place count 90 transition count 92
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 28 place count 90 transition count 92
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 90 transition count 96
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 36 rules in 14 ms. Remains 90 /109 variables (removed 19) and now considering 96/129 (removed 33) transitions.
[2022-05-15 16:13:14] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 96 rows 90 cols
[2022-05-15 16:13:14] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-15 16:13:14] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/109 places, 96/129 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/109 places, 96/129 transitions.
Product exploration explored 100000 steps with 17587 reset in 106 ms.
Product exploration explored 100000 steps with 17747 reset in 117 ms.
Built C files in :
/tmp/ltsmin9842248528207177533
[2022-05-15 16:13:14] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9842248528207177533
Running compilation step : cd /tmp/ltsmin9842248528207177533;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 241 ms.
Running link step : cd /tmp/ltsmin9842248528207177533;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9842248528207177533;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18319473643435152291.hoa' '--buchi-type=spotba'
LTSmin run took 320 ms.
Treatment of property BusinessProcesses-PT-13-LTLFireability-15 finished in 12444 ms.
CL/SL decision was in the wrong direction : SL + true
[2022-05-15 16:13:15] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17429287225694292545
[2022-05-15 16:13:15] [INFO ] Computing symmetric may disable matrix : 407 transitions.
[2022-05-15 16:13:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 16:13:15] [INFO ] Applying decomposition
[2022-05-15 16:13:15] [INFO ] Computing symmetric may enable matrix : 407 transitions.
[2022-05-15 16:13:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 16:13:15] [INFO ] Flatten gal took : 17 ms
[2022-05-15 16:13:15] [INFO ] Computing Do-Not-Accords matrix : 407 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15918603802239076397.txt' '-o' '/tmp/graph15918603802239076397.bin' '-w' '/tmp/graph15918603802239076397.weights'
[2022-05-15 16:13:15] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 16:13:15] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17429287225694292545
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15918603802239076397.bin' '-l' '-1' '-v' '-w' '/tmp/graph15918603802239076397.weights' '-q' '0' '-e' '0.001'
Running compilation step : cd /tmp/ltsmin17429287225694292545;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 16:13:15] [INFO ] Decomposing Gal with order
[2022-05-15 16:13:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 16:13:15] [INFO ] Removed a total of 265 redundant transitions.
[2022-05-15 16:13:15] [INFO ] Flatten gal took : 52 ms
[2022-05-15 16:13:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2022-05-15 16:13:15] [INFO ] Time to serialize gal into /tmp/LTLFireability12093844564600200079.gal : 5 ms
[2022-05-15 16:13:15] [INFO ] Time to serialize properties into /tmp/LTLFireability5792245858498127804.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12093844564600200079.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5792245858498127804.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !(((!((X(F("(i0.i1.u152.p555==1)")))U("(((i15.i2.u54.p191==1)&&(i15.i1.u117.p385==1))&&(i15.i1.u161.p581==1))")))U(("(i0.i1.u152.p555=...223
Formula 0 simplified : !(!(XF"(i0.i1.u152.p555==1)" U "(((i15.i2.u54.p191==1)&&(i15.i1.u117.p385==1))&&(i15.i1.u161.p581==1))") U ("(i0.i1.u152.p555==1)" U...209
Compilation finished in 806 ms.
Running link step : cd /tmp/ltsmin17429287225694292545;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17429287225694292545;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!(X(<>((LTLAPp0==true))) U (LTLAPp1==true)) U ((LTLAPp0==true) U [](X(!(LTLAPp2==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t168, t240, t263, t268, t382, t389, t391, t397, i0.i0.u123.t76, i0.i0.u124.t...1332
Computing Next relation with stutter on 1188 deadlock states
Detected timeout of ITS tools.
[2022-05-15 16:33:59] [INFO ] Applying decomposition
[2022-05-15 16:33:59] [INFO ] Flatten gal took : 55 ms
[2022-05-15 16:33:59] [INFO ] Decomposing Gal with order
[2022-05-15 16:33:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 16:33:59] [INFO ] Removed a total of 139 redundant transitions.
[2022-05-15 16:33:59] [INFO ] Flatten gal took : 98 ms
[2022-05-15 16:33:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 141 labels/synchronizations in 316 ms.
[2022-05-15 16:33:59] [INFO ] Time to serialize gal into /tmp/LTLFireability9017094236711506386.gal : 29 ms
[2022-05-15 16:33:59] [INFO ] Time to serialize properties into /tmp/LTLFireability10134875277980424980.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9017094236711506386.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10134875277980424980.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !(((!((X(F("(i1.u193.p555==1)")))U("(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u55.p191==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.i0.u118.p385==1))&&(i1....251
Formula 0 simplified : !(!(XF"(i1.u193.p555==1)" U "(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u55.p191==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.i0.u118.p385==1))&&(i1.u135....237
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.049: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.049: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.184: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.188: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.185: LTL layer: formula: (!(X(<>((LTLAPp0==true))) U (LTLAPp1==true)) U ((LTLAPp0==true) U [](X(!(LTLAPp2==true)))))
pins2lts-mc-linux64( 6/ 8), 0.179: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.185: "(!(X(<>((LTLAPp0==true))) U (LTLAPp1==true)) U ((LTLAPp0==true) U [](X(!(LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.185: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.187: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.192: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.193: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.198: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.200: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.232: There are 411 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.232: State length is 460, there are 439 groups
pins2lts-mc-linux64( 0/ 8), 0.232: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.232: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.232: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.232: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.309: [Blue] ~111 levels ~960 states ~7744 transitions
pins2lts-mc-linux64( 5/ 8), 0.349: [Blue] ~154 levels ~1920 states ~11488 transitions
pins2lts-mc-linux64( 5/ 8), 0.378: [Blue] ~154 levels ~3840 states ~17776 transitions
pins2lts-mc-linux64( 6/ 8), 0.433: [Blue] ~133 levels ~7680 states ~40064 transitions
pins2lts-mc-linux64( 5/ 8), 0.582: [Blue] ~154 levels ~15360 states ~68288 transitions
pins2lts-mc-linux64( 5/ 8), 0.837: [Blue] ~154 levels ~30720 states ~143600 transitions
pins2lts-mc-linux64( 5/ 8), 1.355: [Blue] ~154 levels ~61440 states ~305184 transitions
pins2lts-mc-linux64( 7/ 8), 2.283: [Blue] ~128 levels ~122880 states ~755520 transitions
pins2lts-mc-linux64( 4/ 8), 4.031: [Blue] ~128 levels ~245760 states ~1397232 transitions
pins2lts-mc-linux64( 4/ 8), 7.094: [Blue] ~585 levels ~491520 states ~2600312 transitions
pins2lts-mc-linux64( 4/ 8), 12.733: [Blue] ~585 levels ~983040 states ~5391576 transitions
pins2lts-mc-linux64( 2/ 8), 23.349: [Blue] ~1554 levels ~1966080 states ~12764992 transitions
pins2lts-mc-linux64( 2/ 8), 44.643: [Blue] ~1554 levels ~3932160 states ~27419584 transitions
pins2lts-mc-linux64( 2/ 8), 87.479: [Blue] ~1554 levels ~7864320 states ~58668720 transitions
pins2lts-mc-linux64( 2/ 8), 174.511: [Blue] ~1554 levels ~15728640 states ~124119528 transitions
pins2lts-mc-linux64( 2/ 8), 348.897: [Blue] ~1554 levels ~31457280 states ~261488432 transitions
pins2lts-mc-linux64( 2/ 8), 710.620: [Blue] ~1554 levels ~62914560 states ~554382880 transitions
pins2lts-mc-linux64( 2/ 8), 1435.614: [Blue] ~1554 levels ~125829120 states ~1152888424 transitions
pins2lts-mc-linux64( 3/ 8), 1525.330: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1525.423:
pins2lts-mc-linux64( 0/ 8), 1525.423: Explored 125293830 states 1213820480 transitions, fanout: 9.688
pins2lts-mc-linux64( 0/ 8), 1525.423: Total exploration time 1525.160 sec (1525.080 sec minimum, 1525.101 sec on average)
pins2lts-mc-linux64( 0/ 8), 1525.423: States per second: 82151, Transitions per second: 795864
pins2lts-mc-linux64( 0/ 8), 1525.423:
pins2lts-mc-linux64( 0/ 8), 1525.423: State space has 125024060 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1525.423: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1525.424: blue states: 125293830 (100.22%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1525.424: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1525.424: all-red states: 54180535 (43.34%), bogus 129251 (0.10%)
pins2lts-mc-linux64( 0/ 8), 1525.424:
pins2lts-mc-linux64( 0/ 8), 1525.424: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1525.424:
pins2lts-mc-linux64( 0/ 8), 1525.424: Queue width: 8B, total height: 2985, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 1525.424: Tree memory: 1209.9MB, 10.1 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 1525.424: Tree fill ratio (roots/leafs): 93.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1525.424: Stored 447 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1525.424: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1525.424: Est. total memory use: 1209.9MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17429287225694292545;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!(X(<>((LTLAPp0==true))) U (LTLAPp1==true)) U ((LTLAPp0==true) U [](X(!(LTLAPp2==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17429287225694292545;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!(X(<>((LTLAPp0==true))) U (LTLAPp1==true)) U ((LTLAPp0==true) U [](X(!(LTLAPp2==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-15 16:54:54] [INFO ] Flatten gal took : 210 ms
[2022-05-15 16:54:55] [INFO ] Input system was already deterministic with 407 transitions.
[2022-05-15 16:54:55] [INFO ] Transformed 459 places.
[2022-05-15 16:54:55] [INFO ] Transformed 407 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 16:55:25] [INFO ] Time to serialize gal into /tmp/LTLFireability8481559004580162839.gal : 10 ms
[2022-05-15 16:55:25] [INFO ] Time to serialize properties into /tmp/LTLFireability4145387405816988409.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8481559004580162839.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4145387405816988409.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((!((X(F("(p555==1)")))U("(((p191==1)&&(p385==1))&&(p581==1))")))U(("(p555==1)")U(G(X(!("((p576==1)&&(p579==1))")))))))
Formula 0 simplified : !(!(XF"(p555==1)" U "(((p191==1)&&(p385==1))&&(p581==1))") U ("(p555==1)" U GX!"((p576==1)&&(p579==1))"))

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-13"
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-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-13, 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 r024-tall-165251918500420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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