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-165251918400356.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-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918400356
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 7.7K Apr 29 23:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 23:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 29 23:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 23:56 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.4K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:09 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 85K 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-05-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652623812653

Running Version 202205111006
[2022-05-15 14:10:13] [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 14:10:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 14:10:13] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2022-05-15 14:10:13] [INFO ] Transformed 368 places.
[2022-05-15 14:10:13] [INFO ] Transformed 319 transitions.
[2022-05-15 14:10:13] [INFO ] Found NUPN structural information;
[2022-05-15 14:10:13] [INFO ] Parsed PT model containing 368 places and 319 transitions in 188 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-05-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 318/318 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 365 transition count 318
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 56 place count 311 transition count 264
Iterating global reduction 1 with 54 rules applied. Total rules applied 110 place count 311 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 111 place count 311 transition count 263
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 135 place count 287 transition count 239
Iterating global reduction 2 with 24 rules applied. Total rules applied 159 place count 287 transition count 239
Applied a total of 159 rules in 72 ms. Remains 287 /367 variables (removed 80) and now considering 239/318 (removed 79) transitions.
// Phase 1: matrix 239 rows 287 cols
[2022-05-15 14:10:14] [INFO ] Computed 55 place invariants in 17 ms
[2022-05-15 14:10:14] [INFO ] Implicit Places using invariants in 230 ms returned []
// Phase 1: matrix 239 rows 287 cols
[2022-05-15 14:10:14] [INFO ] Computed 55 place invariants in 4 ms
[2022-05-15 14:10:14] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
// Phase 1: matrix 239 rows 287 cols
[2022-05-15 14:10:14] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-15 14:10:14] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 287/367 places, 239/318 transitions.
Finished structural reductions, in 1 iterations. Remains : 287/367 places, 239/318 transitions.
Support contains 43 out of 287 places after structural reductions.
[2022-05-15 14:10:14] [INFO ] Flatten gal took : 44 ms
[2022-05-15 14:10:14] [INFO ] Flatten gal took : 19 ms
[2022-05-15 14:10:15] [INFO ] Input system was already deterministic with 239 transitions.
Support contains 40 out of 287 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 97 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 28) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) 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 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 239 rows 287 cols
[2022-05-15 14:10:15] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-15 14:10:15] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2022-05-15 14:10:15] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2022-05-15 14:10:16] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :19
[2022-05-15 14:10:16] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 4 ms to minimize.
[2022-05-15 14:10:16] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2022-05-15 14:10:16] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2022-05-15 14:10:16] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2022-05-15 14:10:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 259 ms
[2022-05-15 14:10:16] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2022-05-15 14:10:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2022-05-15 14:10:16] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2022-05-15 14:10:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2022-05-15 14:10:17] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2022-05-15 14:10:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2022-05-15 14:10:17] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2022-05-15 14:10:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2022-05-15 14:10:17] [INFO ] After 1160ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :19
Attempting to minimize the solution found.
Minimization took 251 ms.
[2022-05-15 14:10:17] [INFO ] After 1706ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :19
Fused 20 Parikh solutions to 18 different solutions.
Finished Parikh walk after 172 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=172 )
Parikh walk visited 19 properties in 92 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 281 stabilizing places and 231 stable transitions
Graph (complete) has 607 edges and 287 vertex of which 286 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G(F(!(F(p0) U G(X(p0)))))))))'
Support contains 1 out of 287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Graph (trivial) has 152 edges and 287 vertex of which 6 / 287 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 600 edges and 282 vertex of which 281 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 280 transition count 193
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 242 transition count 193
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 78 place count 242 transition count 138
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 201 place count 174 transition count 138
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 211 place count 164 transition count 128
Iterating global reduction 2 with 10 rules applied. Total rules applied 221 place count 164 transition count 128
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 163 rules applied. Total rules applied 384 place count 81 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 385 place count 80 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 386 place count 79 transition count 47
Applied a total of 386 rules in 39 ms. Remains 79 /287 variables (removed 208) and now considering 47/239 (removed 192) transitions.
// Phase 1: matrix 47 rows 79 cols
[2022-05-15 14:10:17] [INFO ] Computed 38 place invariants in 0 ms
[2022-05-15 14:10:18] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 47 rows 79 cols
[2022-05-15 14:10:18] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-15 14:10:18] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 140 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/287 places, 47/239 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 41 transition count 39
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 33 transition count 39
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 28 transition count 34
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 28 transition count 34
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 28 transition count 31
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 33 place count 24 transition count 30
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 24 transition count 30
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 44 place count 19 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 19 transition count 24
Applied a total of 45 rules in 5 ms. Remains 19 /41 variables (removed 22) and now considering 24/47 (removed 23) transitions.
// Phase 1: matrix 24 rows 19 cols
[2022-05-15 14:10:18] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 14:10:18] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 24 rows 19 cols
[2022-05-15 14:10:18] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 14:10:18] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/287 places, 24/239 transitions.
Finished structural reductions, in 2 iterations. Remains : 19/287 places, 24/239 transitions.
Stuttering acceptance computed with spot in 165 ms :[p0, p0]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s17 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]]
Product exploration explored 100000 steps with 26369 reset in 150 ms.
Product exploration explored 100000 steps with 26109 reset in 91 ms.
Computed a total of 19 stabilizing places and 23 stable transitions
Computed a total of 19 stabilizing places and 23 stable transitions
Detected a total of 19/19 stabilizing places and 23/24 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Stuttering acceptance computed with spot in 69 ms :[p0, p0]
Support contains 1 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 19 cols
[2022-05-15 14:10:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 14:10:19] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 24 rows 19 cols
[2022-05-15 14:10:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 14:10:19] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-15 14:10:19] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 24 rows 19 cols
[2022-05-15 14:10:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 14:10:19] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/19 places, 24/24 transitions.
Computed a total of 19 stabilizing places and 23 stable transitions
Computed a total of 19 stabilizing places and 23 stable transitions
Detected a total of 19/19 stabilizing places and 23/24 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
Finished random walk after 3 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Stuttering acceptance computed with spot in 69 ms :[p0, p0]
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Product exploration explored 100000 steps with 26255 reset in 76 ms.
Product exploration explored 100000 steps with 26329 reset in 86 ms.
Built C files in :
/tmp/ltsmin13916999547521249492
[2022-05-15 14:10:20] [INFO ] Computing symmetric may disable matrix : 24 transitions.
[2022-05-15 14:10:20] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:10:20] [INFO ] Computing symmetric may enable matrix : 24 transitions.
[2022-05-15 14:10:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:10:20] [INFO ] Computing Do-Not-Accords matrix : 24 transitions.
[2022-05-15 14:10:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:10:20] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13916999547521249492
Running compilation step : cd /tmp/ltsmin13916999547521249492;'/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 180 ms.
Running link step : cd /tmp/ltsmin13916999547521249492;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13916999547521249492;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4649838466314616340.hoa' '--buchi-type=spotba'
LTSmin run took 58 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-05-LTLFireability-00 finished in 2417 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&G(F(X((F(p0)&&p1))))))'
Support contains 4 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 276 transition count 228
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 276 transition count 228
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 269 transition count 221
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 269 transition count 221
Applied a total of 36 rules in 23 ms. Remains 269 /287 variables (removed 18) and now considering 221/239 (removed 18) transitions.
// Phase 1: matrix 221 rows 269 cols
[2022-05-15 14:10:20] [INFO ] Computed 55 place invariants in 3 ms
[2022-05-15 14:10:20] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 221 rows 269 cols
[2022-05-15 14:10:20] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-15 14:10:20] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
// Phase 1: matrix 221 rows 269 cols
[2022-05-15 14:10:20] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:10:20] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/287 places, 221/239 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/287 places, 221/239 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s39 0), p1:(OR (EQ s75 0) (EQ s199 0) (EQ s254 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 952 reset in 247 ms.
Stack based approach found an accepted trace after 85819 steps with 802 reset with depth 151 and stack size 143 in 252 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-01 finished in 1159 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U !X(((F(X(p0)) U p1)||F(p2)||p2)))))'
Support contains 5 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 276 transition count 228
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 276 transition count 228
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 269 transition count 221
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 269 transition count 221
Applied a total of 36 rules in 31 ms. Remains 269 /287 variables (removed 18) and now considering 221/239 (removed 18) transitions.
// Phase 1: matrix 221 rows 269 cols
[2022-05-15 14:10:21] [INFO ] Computed 55 place invariants in 3 ms
[2022-05-15 14:10:21] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 221 rows 269 cols
[2022-05-15 14:10:21] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:10:21] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
// Phase 1: matrix 221 rows 269 cols
[2022-05-15 14:10:21] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-15 14:10:21] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/287 places, 221/239 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/287 places, 221/239 transitions.
Stuttering acceptance computed with spot in 416 ms :[(OR p1 p2), (OR p1 p2), (OR p2 p1), true, p2, (AND p0 p1), p0, p2, (AND p0 p1), (OR (AND p0 p1) (AND p0 p2)), (AND p2 p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(OR p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=2 dest: 1}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={1} source=2 dest: 7}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=2 dest: 8}], [{ cond=true, acceptance={0, 1} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 3}, { cond=(NOT p0), acceptance={} source=6 dest: 6}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 1}, { cond=(AND p2 p0), acceptance={0, 1} source=7 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={1} source=7 dest: 7}], [{ cond=(AND p1 p0), acceptance={0, 1} source=8 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=8 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 9}], [{ cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=9 dest: 10}], [{ cond=(AND p2 p0), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=10 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(EQ s135 1), p1:(AND (EQ s94 1) (EQ s222 1) (EQ s268 1)), p2:(EQ s66 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 958 reset in 161 ms.
Product exploration explored 100000 steps with 934 reset in 176 ms.
Computed a total of 263 stabilizing places and 213 stable transitions
Graph (complete) has 578 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 263 stabilizing places and 213 stable transitions
Detected a total of 263/269 stabilizing places and 213/221 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (NOT (OR p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (OR (AND p1 p0) (AND p2 p0))))), (X (X (NOT (OR p1 p2)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1638 ms. Reduced automaton from 11 states, 37 edges and 3 AP to 11 states, 37 edges and 3 AP.
Stuttering acceptance computed with spot in 398 ms :[(OR p2 p1), (OR p2 p1), (OR p1 p2), true, p2, (AND p0 p1), p0, p2, (AND p0 p1), (OR (AND p0 p1) (AND p0 p2)), (AND p2 p0)]
Incomplete random walk after 10000 steps, including 92 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 17) seen :7
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 221 rows 269 cols
[2022-05-15 14:10:25] [INFO ] Computed 55 place invariants in 3 ms
[2022-05-15 14:10:25] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2022-05-15 14:10:25] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 14:10:25] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-15 14:10:25] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 14:10:25] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2022-05-15 14:10:25] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2022-05-15 14:10:25] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2022-05-15 14:10:25] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2022-05-15 14:10:25] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2022-05-15 14:10:26] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2022-05-15 14:10:26] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2022-05-15 14:10:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 448 ms
[2022-05-15 14:10:26] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2022-05-15 14:10:26] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2022-05-15 14:10:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2022-05-15 14:10:26] [INFO ] After 737ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-15 14:10:26] [INFO ] After 843ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 221/221 transitions.
Graph (trivial) has 133 edges and 269 vertex of which 6 / 269 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 566 edges and 264 vertex of which 263 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 263 transition count 183
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 60 place count 234 transition count 183
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 60 place count 234 transition count 128
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 183 place count 166 transition count 128
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 161 rules applied. Total rules applied 344 place count 84 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 345 place count 83 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 346 place count 82 transition count 48
Applied a total of 346 rules in 18 ms. Remains 82 /269 variables (removed 187) and now considering 48/221 (removed 173) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/269 places, 48/221 transitions.
Finished random walk after 220 steps, including 8 resets, run visited all 2 properties in 4 ms. (steps per millisecond=55 )
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (NOT (OR p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (OR (AND p1 p0) (AND p2 p0))))), (X (X (NOT (OR p1 p2)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p0 p1))), (G (NOT (OR (AND p0 p2) (AND p0 p1)))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(F p2), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p2))), (F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p0), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p0 (NOT p1))), (F (OR p2 p1)), (F (AND (NOT p0) p2)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 29 factoid took 2005 ms. Reduced automaton from 11 states, 37 edges and 3 AP to 5 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 144 ms :[true, (OR p1 p2), (OR p2 p1), (OR p1 p2), (OR p1 p0 p2)]
Stuttering acceptance computed with spot in 147 ms :[true, (OR p1 p2), (OR p2 p1), (OR p1 p2), (OR p1 p0 p2)]
Support contains 5 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 221/221 transitions.
Applied a total of 0 rules in 9 ms. Remains 269 /269 variables (removed 0) and now considering 221/221 (removed 0) transitions.
// Phase 1: matrix 221 rows 269 cols
[2022-05-15 14:10:28] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-15 14:10:28] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 221 rows 269 cols
[2022-05-15 14:10:28] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:10:28] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
// Phase 1: matrix 221 rows 269 cols
[2022-05-15 14:10:28] [INFO ] Computed 55 place invariants in 5 ms
[2022-05-15 14:10:29] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 221/221 transitions.
Computed a total of 263 stabilizing places and 213 stable transitions
Graph (complete) has 578 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 263 stabilizing places and 213 stable transitions
Detected a total of 263/269 stabilizing places and 213/221 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR p1 p2))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR p1 p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 545 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 157 ms :[true, (OR p2 p1), (OR p1 p2), (OR p2 p1), (OR p0 p2 p1)]
Incomplete random walk after 10000 steps, including 93 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 269 cols
[2022-05-15 14:10:29] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:10:29] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-15 14:10:30] [INFO ] After 72ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 14:10:30] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2022-05-15 14:10:30] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2022-05-15 14:10:30] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2022-05-15 14:10:30] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2022-05-15 14:10:30] [INFO ] Deduced a trap composed of 58 places in 39 ms of which 0 ms to minimize.
[2022-05-15 14:10:30] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2022-05-15 14:10:30] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2022-05-15 14:10:30] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2022-05-15 14:10:30] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2022-05-15 14:10:30] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2022-05-15 14:10:30] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2022-05-15 14:10:30] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2022-05-15 14:10:30] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2022-05-15 14:10:30] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2022-05-15 14:10:30] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2022-05-15 14:10:30] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 4 ms to minimize.
[2022-05-15 14:10:30] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
[2022-05-15 14:10:30] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 838 ms
[2022-05-15 14:10:30] [INFO ] After 920ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 14:10:30] [INFO ] After 979ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 14:10:30] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-15 14:10:31] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 14:10:31] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2022-05-15 14:10:31] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2022-05-15 14:10:31] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2022-05-15 14:10:31] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2022-05-15 14:10:31] [INFO ] Deduced a trap composed of 58 places in 38 ms of which 1 ms to minimize.
[2022-05-15 14:10:31] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2022-05-15 14:10:31] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2022-05-15 14:10:31] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2022-05-15 14:10:31] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2022-05-15 14:10:31] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2022-05-15 14:10:31] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2022-05-15 14:10:31] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2022-05-15 14:10:31] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2022-05-15 14:10:31] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2022-05-15 14:10:31] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 0 ms to minimize.
[2022-05-15 14:10:31] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2022-05-15 14:10:31] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2022-05-15 14:10:31] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 906 ms
[2022-05-15 14:10:31] [INFO ] After 979ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-15 14:10:31] [INFO ] After 1038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 221/221 transitions.
Graph (trivial) has 133 edges and 269 vertex of which 6 / 269 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 566 edges and 264 vertex of which 263 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 263 transition count 183
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 60 place count 234 transition count 183
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 60 place count 234 transition count 128
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 183 place count 166 transition count 128
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 165 rules applied. Total rules applied 348 place count 82 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 349 place count 81 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 350 place count 80 transition count 46
Applied a total of 350 rules in 19 ms. Remains 80 /269 variables (removed 189) and now considering 46/221 (removed 175) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/269 places, 46/221 transitions.
Finished random walk after 580 steps, including 24 resets, run visited all 1 properties in 2 ms. (steps per millisecond=290 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR p1 p2))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR p1 p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (OR p2 p1)), (F (AND (NOT p2) p1)), (F (OR p0 p2 p1)), (F p2), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (AND p0 (NOT p2) (NOT p1)))]
Knowledge based reduction with 14 factoid took 654 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 159 ms :[true, (OR p2 p1), (OR p1 p2), (OR p2 p1), (OR p0 p2 p1)]
Stuttering acceptance computed with spot in 268 ms :[true, (OR p2 p1), (OR p1 p2), (OR p2 p1), (OR p0 p2 p1)]
Stuttering acceptance computed with spot in 154 ms :[true, (OR p2 p1), (OR p1 p2), (OR p2 p1), (OR p0 p2 p1)]
Entered a terminal (fully accepting) state of product in 3654 steps with 32 reset in 10 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-02 finished in 11794 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(F(X((G(p1)&&p2))))))'
Support contains 2 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 276 transition count 228
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 276 transition count 228
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 269 transition count 221
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 269 transition count 221
Applied a total of 36 rules in 12 ms. Remains 269 /287 variables (removed 18) and now considering 221/239 (removed 18) transitions.
// Phase 1: matrix 221 rows 269 cols
[2022-05-15 14:10:33] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:10:33] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 221 rows 269 cols
[2022-05-15 14:10:33] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:10:33] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
// Phase 1: matrix 221 rows 269 cols
[2022-05-15 14:10:33] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:10:33] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/287 places, 221/239 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/287 places, 221/239 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s237 0), p2:(EQ s237 1), p1:(EQ s8 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Computed a total of 263 stabilizing places and 213 stable transitions
Graph (complete) has 576 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 263 stabilizing places and 213 stable transitions
Detected a total of 263/269 stabilizing places and 213/221 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 9 factoid took 133 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-05-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-05-LTLFireability-03 finished in 1099 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)||F(p2)))'
Support contains 3 out of 287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Graph (trivial) has 148 edges and 287 vertex of which 6 / 287 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 600 edges and 282 vertex of which 281 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 280 transition count 195
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 244 transition count 195
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 74 place count 244 transition count 142
Deduced a syphon composed of 53 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 192 place count 179 transition count 142
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 201 place count 170 transition count 133
Iterating global reduction 2 with 9 rules applied. Total rules applied 210 place count 170 transition count 133
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 165 rules applied. Total rules applied 375 place count 86 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 376 place count 85 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 377 place count 84 transition count 51
Applied a total of 377 rules in 31 ms. Remains 84 /287 variables (removed 203) and now considering 51/239 (removed 188) transitions.
// Phase 1: matrix 51 rows 84 cols
[2022-05-15 14:10:34] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-15 14:10:34] [INFO ] Implicit Places using invariants in 49 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/287 places, 51/239 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 83/287 places, 51/239 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(EQ s73 1), p1:(EQ s24 1), p0:(EQ s17 0)], 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, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 25 steps with 6 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-04 finished in 217 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(!X(p0) U G(F(X(!((p0 U p1) U p1)))))))'
Support contains 4 out of 287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Graph (complete) has 607 edges and 287 vertex of which 286 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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 285 transition count 207
Reduce places removed 30 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 255 transition count 205
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 253 transition count 205
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 65 place count 253 transition count 144
Deduced a syphon composed of 61 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 135 rules applied. Total rules applied 200 place count 179 transition count 144
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 211 place count 168 transition count 133
Iterating global reduction 3 with 11 rules applied. Total rules applied 222 place count 168 transition count 133
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 384 place count 86 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 385 place count 86 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 386 place count 85 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 387 place count 84 transition count 51
Applied a total of 387 rules in 26 ms. Remains 84 /287 variables (removed 203) and now considering 51/239 (removed 188) transitions.
// Phase 1: matrix 51 rows 84 cols
[2022-05-15 14:10:34] [INFO ] Computed 39 place invariants in 2 ms
[2022-05-15 14:10:34] [INFO ] Implicit Places using invariants in 53 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/287 places, 51/239 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 83/287 places, 51/239 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s4 1) (EQ s32 1) (EQ s82 1)), p0:(EQ s70 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-05 finished in 154 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U p1))'
Support contains 4 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 275 transition count 227
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 275 transition count 227
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 267 transition count 219
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 267 transition count 219
Applied a total of 40 rules in 15 ms. Remains 267 /287 variables (removed 20) and now considering 219/239 (removed 20) transitions.
// Phase 1: matrix 219 rows 267 cols
[2022-05-15 14:10:34] [INFO ] Computed 55 place invariants in 4 ms
[2022-05-15 14:10:34] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 219 rows 267 cols
[2022-05-15 14:10:34] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:10:35] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
// Phase 1: matrix 219 rows 267 cols
[2022-05-15 14:10:35] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-15 14:10:35] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/287 places, 219/239 transitions.
Finished structural reductions, in 1 iterations. Remains : 267/287 places, 219/239 transitions.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s68 1) (EQ s201 1) (EQ s250 1)), p0:(EQ s96 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-07 finished in 474 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 275 transition count 227
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 275 transition count 227
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 267 transition count 219
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 267 transition count 219
Applied a total of 40 rules in 18 ms. Remains 267 /287 variables (removed 20) and now considering 219/239 (removed 20) transitions.
// Phase 1: matrix 219 rows 267 cols
[2022-05-15 14:10:35] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-15 14:10:35] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 219 rows 267 cols
[2022-05-15 14:10:35] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:10:35] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
// Phase 1: matrix 219 rows 267 cols
[2022-05-15 14:10:35] [INFO ] Computed 55 place invariants in 6 ms
[2022-05-15 14:10:35] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/287 places, 219/239 transitions.
Finished structural reductions, in 1 iterations. Remains : 267/287 places, 219/239 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(NEQ s206 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-08 finished in 533 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))||X(p1))))'
Support contains 2 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 276 transition count 228
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 276 transition count 228
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 270 transition count 222
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 270 transition count 222
Applied a total of 34 rules in 15 ms. Remains 270 /287 variables (removed 17) and now considering 222/239 (removed 17) transitions.
// Phase 1: matrix 222 rows 270 cols
[2022-05-15 14:10:35] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-15 14:10:35] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 222 rows 270 cols
[2022-05-15 14:10:35] [INFO ] Computed 55 place invariants in 0 ms
[2022-05-15 14:10:36] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
// Phase 1: matrix 222 rows 270 cols
[2022-05-15 14:10:36] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:10:36] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/287 places, 222/239 transitions.
Finished structural reductions, in 1 iterations. Remains : 270/287 places, 222/239 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(EQ s237 1), p1:(EQ s255 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-09 finished in 532 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 276 transition count 228
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 276 transition count 228
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 268 transition count 220
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 268 transition count 220
Applied a total of 38 rules in 16 ms. Remains 268 /287 variables (removed 19) and now considering 220/239 (removed 19) transitions.
// Phase 1: matrix 220 rows 268 cols
[2022-05-15 14:10:36] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:10:36] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 220 rows 268 cols
[2022-05-15 14:10:36] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:10:36] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
// Phase 1: matrix 220 rows 268 cols
[2022-05-15 14:10:36] [INFO ] Computed 55 place invariants in 0 ms
[2022-05-15 14:10:36] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/287 places, 220/239 transitions.
Finished structural reductions, in 1 iterations. Remains : 268/287 places, 220/239 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s258 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][false, false]]
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-11 finished in 449 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0) U (p1 U p0)))&&F(p2)))'
Support contains 5 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 275 transition count 227
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 275 transition count 227
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 267 transition count 219
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 267 transition count 219
Applied a total of 40 rules in 17 ms. Remains 267 /287 variables (removed 20) and now considering 219/239 (removed 20) transitions.
// Phase 1: matrix 219 rows 267 cols
[2022-05-15 14:10:36] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-15 14:10:36] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 219 rows 267 cols
[2022-05-15 14:10:36] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:10:37] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
// Phase 1: matrix 219 rows 267 cols
[2022-05-15 14:10:37] [INFO ] Computed 55 place invariants in 3 ms
[2022-05-15 14:10:37] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/287 places, 219/239 transitions.
Finished structural reductions, in 1 iterations. Remains : 267/287 places, 219/239 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s131 1), p0:(AND (EQ s80 1) (EQ s204 1) (EQ s266 1)), p1:(EQ s91 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-12 finished in 608 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 275 transition count 227
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 275 transition count 227
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 267 transition count 219
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 267 transition count 219
Applied a total of 40 rules in 16 ms. Remains 267 /287 variables (removed 20) and now considering 219/239 (removed 20) transitions.
// Phase 1: matrix 219 rows 267 cols
[2022-05-15 14:10:37] [INFO ] Computed 55 place invariants in 3 ms
[2022-05-15 14:10:37] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 219 rows 267 cols
[2022-05-15 14:10:37] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:10:37] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
// Phase 1: matrix 219 rows 267 cols
[2022-05-15 14:10:37] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-15 14:10:37] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/287 places, 219/239 transitions.
Finished structural reductions, in 1 iterations. Remains : 267/287 places, 219/239 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s96 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-13 finished in 502 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X((X(G(X(F(p0))))&&G(X(G(p1))))))))'
Support contains 2 out of 287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Graph (trivial) has 149 edges and 287 vertex of which 6 / 287 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 600 edges and 282 vertex of which 281 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 280 transition count 195
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 244 transition count 195
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 74 place count 244 transition count 141
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 194 place count 178 transition count 141
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 204 place count 168 transition count 131
Iterating global reduction 2 with 10 rules applied. Total rules applied 214 place count 168 transition count 131
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 163 rules applied. Total rules applied 377 place count 85 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 378 place count 84 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 379 place count 83 transition count 50
Applied a total of 379 rules in 23 ms. Remains 83 /287 variables (removed 204) and now considering 50/239 (removed 189) transitions.
// Phase 1: matrix 50 rows 83 cols
[2022-05-15 14:10:37] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-15 14:10:37] [INFO ] Implicit Places using invariants in 45 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/287 places, 50/239 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 82/287 places, 50/239 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s72 0), p0:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-14 finished in 189 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((false U G(p0)))))'
Support contains 1 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 276 transition count 228
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 276 transition count 228
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 268 transition count 220
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 268 transition count 220
Applied a total of 38 rules in 14 ms. Remains 268 /287 variables (removed 19) and now considering 220/239 (removed 19) transitions.
// Phase 1: matrix 220 rows 268 cols
[2022-05-15 14:10:38] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-15 14:10:38] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 220 rows 268 cols
[2022-05-15 14:10:38] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:10:38] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
// Phase 1: matrix 220 rows 268 cols
[2022-05-15 14:10:38] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-15 14:10:38] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/287 places, 220/239 transitions.
Finished structural reductions, in 1 iterations. Remains : 268/287 places, 220/239 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-15 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 s56 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 1 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-15 finished in 509 ms.
All properties solved by simple procedures.
Total runtime 24771 ms.

BK_STOP 1652623838614

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-05"
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-05, 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-165251918400356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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