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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 5.7K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 30 00:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.8K 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 104K 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-09-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652627306638

Running Version 202205111006
[2022-05-15 15:08:27] [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 15:08:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:08:28] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2022-05-15 15:08:28] [INFO ] Transformed 403 places.
[2022-05-15 15:08:28] [INFO ] Transformed 374 transitions.
[2022-05-15 15:08:28] [INFO ] Found NUPN structural information;
[2022-05-15 15:08:28] [INFO ] Parsed PT model containing 403 places and 374 transitions in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA BusinessProcesses-PT-09-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 374/374 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 374
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 55 place count 348 transition count 320
Iterating global reduction 1 with 54 rules applied. Total rules applied 109 place count 348 transition count 320
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 134 place count 323 transition count 295
Iterating global reduction 1 with 25 rules applied. Total rules applied 159 place count 323 transition count 295
Applied a total of 159 rules in 82 ms. Remains 323 /403 variables (removed 80) and now considering 295/374 (removed 79) transitions.
// Phase 1: matrix 295 rows 323 cols
[2022-05-15 15:08:28] [INFO ] Computed 64 place invariants in 26 ms
[2022-05-15 15:08:28] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 295 rows 323 cols
[2022-05-15 15:08:28] [INFO ] Computed 64 place invariants in 16 ms
[2022-05-15 15:08:28] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
// Phase 1: matrix 295 rows 323 cols
[2022-05-15 15:08:28] [INFO ] Computed 64 place invariants in 9 ms
[2022-05-15 15:08:29] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 323/403 places, 295/374 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/403 places, 295/374 transitions.
Support contains 23 out of 323 places after structural reductions.
[2022-05-15 15:08:29] [INFO ] Flatten gal took : 56 ms
[2022-05-15 15:08:29] [INFO ] Flatten gal took : 23 ms
[2022-05-15 15:08:29] [INFO ] Input system was already deterministic with 295 transitions.
Support contains 22 out of 323 places (down from 23) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 105 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
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 19 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 295 rows 323 cols
[2022-05-15 15:08:29] [INFO ] Computed 64 place invariants in 3 ms
[2022-05-15 15:08:30] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 15:08:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2022-05-15 15:08:30] [INFO ] [Nat]Absence check using 34 positive and 30 generalized place invariants in 23 ms returned sat
[2022-05-15 15:08:31] [INFO ] After 526ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2022-05-15 15:08:31] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 5 ms to minimize.
[2022-05-15 15:08:31] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 2 ms to minimize.
[2022-05-15 15:08:31] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 1 ms to minimize.
[2022-05-15 15:08:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 625 ms
[2022-05-15 15:08:31] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2022-05-15 15:08:31] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 1 ms to minimize.
[2022-05-15 15:08:32] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2022-05-15 15:08:32] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2022-05-15 15:08:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 430 ms
[2022-05-15 15:08:32] [INFO ] After 1622ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-05-15 15:08:32] [INFO ] After 1852ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 323/323 places, 295/295 transitions.
Graph (trivial) has 144 edges and 323 vertex of which 6 / 323 are part of one of the 1 SCC in 17 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 749 edges and 318 vertex of which 317 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 317 transition count 255
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 285 transition count 255
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 66 place count 285 transition count 189
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 208 place count 209 transition count 189
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 211 place count 206 transition count 186
Iterating global reduction 2 with 3 rules applied. Total rules applied 214 place count 206 transition count 186
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 159 rules applied. Total rules applied 373 place count 125 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 375 place count 124 transition count 111
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 377 place count 124 transition count 109
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 379 place count 122 transition count 109
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 380 place count 122 transition count 109
Applied a total of 380 rules in 164 ms. Remains 122 /323 variables (removed 201) and now considering 109/295 (removed 186) transitions.
Finished structural reductions, in 1 iterations. Remains : 122/323 places, 109/295 transitions.
Finished random walk after 2653 steps, including 179 resets, run visited all 2 properties in 21 ms. (steps per millisecond=126 )
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 194 stabilizing places and 196 stable transitions
Graph (complete) has 756 edges and 323 vertex of which 322 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.31 ms
FORMULA BusinessProcesses-PT-09-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 295/295 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 318 transition count 290
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 318 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 317 transition count 289
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 317 transition count 289
Applied a total of 12 rules in 67 ms. Remains 317 /323 variables (removed 6) and now considering 289/295 (removed 6) transitions.
// Phase 1: matrix 289 rows 317 cols
[2022-05-15 15:08:32] [INFO ] Computed 64 place invariants in 3 ms
[2022-05-15 15:08:33] [INFO ] Implicit Places using invariants in 513 ms returned []
// Phase 1: matrix 289 rows 317 cols
[2022-05-15 15:08:33] [INFO ] Computed 64 place invariants in 21 ms
[2022-05-15 15:08:33] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
// Phase 1: matrix 289 rows 317 cols
[2022-05-15 15:08:33] [INFO ] Computed 64 place invariants in 2 ms
[2022-05-15 15:08:34] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 317/323 places, 289/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 317/323 places, 289/295 transitions.
Stuttering acceptance computed with spot in 315 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-03 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: 2}]], initial=3, aps=[p0:(EQ s263 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-03 finished in 1779 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(X(p0)) U p1)) U F((X(p1)&&p0))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 295/295 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 318 transition count 290
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 318 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 317 transition count 289
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 317 transition count 289
Applied a total of 12 rules in 33 ms. Remains 317 /323 variables (removed 6) and now considering 289/295 (removed 6) transitions.
// Phase 1: matrix 289 rows 317 cols
[2022-05-15 15:08:34] [INFO ] Computed 64 place invariants in 2 ms
[2022-05-15 15:08:34] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 289 rows 317 cols
[2022-05-15 15:08:34] [INFO ] Computed 64 place invariants in 2 ms
[2022-05-15 15:08:35] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
// Phase 1: matrix 289 rows 317 cols
[2022-05-15 15:08:35] [INFO ] Computed 64 place invariants in 2 ms
[2022-05-15 15:08:35] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 317/323 places, 289/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 317/323 places, 289/295 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s35 1), p1:(EQ s150 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 82 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-04 finished in 1153 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(F(p0))&&p0))))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 295/295 transitions.
Graph (trivial) has 145 edges and 323 vertex of which 6 / 323 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 750 edges and 318 vertex of which 317 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 316 transition count 255
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 284 transition count 255
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 66 place count 284 transition count 188
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 210 place count 207 transition count 188
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 213 place count 204 transition count 185
Iterating global reduction 2 with 3 rules applied. Total rules applied 216 place count 204 transition count 185
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 377 place count 122 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 379 place count 121 transition count 109
Applied a total of 379 rules in 52 ms. Remains 121 /323 variables (removed 202) and now considering 109/295 (removed 186) transitions.
// Phase 1: matrix 109 rows 121 cols
[2022-05-15 15:08:35] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-15 15:08:35] [INFO ] Implicit Places using invariants in 77 ms returned [1, 2, 3, 11, 38, 39, 40, 41, 42, 43, 44]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 79 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/323 places, 109/295 transitions.
Applied a total of 0 rules in 6 ms. Remains 110 /110 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 110/323 places, 109/295 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s9 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 350 steps with 70 reset in 8 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-05 finished in 239 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(G(p0)))&&G(F(X((G(p1)&&p1))))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 295/295 transitions.
Graph (trivial) has 146 edges and 323 vertex of which 6 / 323 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 750 edges and 318 vertex of which 317 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 316 transition count 254
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 68 place count 283 transition count 254
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 68 place count 283 transition count 188
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 141 rules applied. Total rules applied 209 place count 208 transition count 188
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 213 place count 204 transition count 184
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 204 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 217 place count 204 transition count 183
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 219 place count 203 transition count 183
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 153 rules applied. Total rules applied 372 place count 125 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 374 place count 124 transition count 111
Applied a total of 374 rules in 50 ms. Remains 124 /323 variables (removed 199) and now considering 111/295 (removed 184) transitions.
// Phase 1: matrix 111 rows 124 cols
[2022-05-15 15:08:35] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-15 15:08:36] [INFO ] Implicit Places using invariants in 209 ms returned [1, 2, 3, 11, 38, 39, 40, 41, 42, 43, 44, 94]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 210 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/323 places, 111/295 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 110
Applied a total of 2 rules in 9 ms. Remains 111 /112 variables (removed 1) and now considering 110/111 (removed 1) transitions.
// Phase 1: matrix 110 rows 111 cols
[2022-05-15 15:08:36] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-15 15:08:36] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 110 rows 111 cols
[2022-05-15 15:08:36] [INFO ] Computed 40 place invariants in 5 ms
[2022-05-15 15:08:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 15:08:36] [INFO ] Implicit Places using invariants and state equation in 219 ms returned [10, 60, 62, 68, 70]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 303 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 106/323 places, 110/295 transitions.
Graph (complete) has 378 edges and 106 vertex of which 97 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 96 transition count 105
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 13 place count 86 transition count 67
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 86 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 85 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 85 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 84 transition count 65
Applied a total of 27 rules in 26 ms. Remains 84 /106 variables (removed 22) and now considering 65/110 (removed 45) transitions.
// Phase 1: matrix 65 rows 84 cols
[2022-05-15 15:08:36] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-15 15:08:36] [INFO ] Implicit Places using invariants in 76 ms returned [10, 11, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 92 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 81/323 places, 65/295 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions, in 4 iterations. Remains : 81/323 places, 65/295 transitions.
Stuttering acceptance computed with spot in 45 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s13 1), p1:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-06 finished in 753 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 295/295 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 319 transition count 291
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 319 transition count 291
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 318 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 318 transition count 290
Applied a total of 10 rules in 29 ms. Remains 318 /323 variables (removed 5) and now considering 290/295 (removed 5) transitions.
// Phase 1: matrix 290 rows 318 cols
[2022-05-15 15:08:36] [INFO ] Computed 64 place invariants in 2 ms
[2022-05-15 15:08:36] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 290 rows 318 cols
[2022-05-15 15:08:36] [INFO ] Computed 64 place invariants in 2 ms
[2022-05-15 15:08:37] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
// Phase 1: matrix 290 rows 318 cols
[2022-05-15 15:08:37] [INFO ] Computed 64 place invariants in 4 ms
[2022-05-15 15:08:37] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 318/323 places, 290/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 318/323 places, 290/295 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s197 1), p0:(EQ s113 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1589 reset in 380 ms.
Stack based approach found an accepted trace after 556 steps with 9 reset with depth 6 and stack size 6 in 1 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-08 finished in 1252 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 295/295 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 319 transition count 291
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 319 transition count 291
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 318 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 318 transition count 290
Applied a total of 10 rules in 13 ms. Remains 318 /323 variables (removed 5) and now considering 290/295 (removed 5) transitions.
// Phase 1: matrix 290 rows 318 cols
[2022-05-15 15:08:37] [INFO ] Computed 64 place invariants in 3 ms
[2022-05-15 15:08:37] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 290 rows 318 cols
[2022-05-15 15:08:37] [INFO ] Computed 64 place invariants in 3 ms
[2022-05-15 15:08:38] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
// Phase 1: matrix 290 rows 318 cols
[2022-05-15 15:08:38] [INFO ] Computed 64 place invariants in 2 ms
[2022-05-15 15:08:38] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 318/323 places, 290/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 318/323 places, 290/295 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-10 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 s257 0)], 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 960 steps with 10 reset in 14 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-10 finished in 705 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 295/295 transitions.
Graph (trivial) has 146 edges and 323 vertex of which 6 / 323 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 750 edges and 318 vertex of which 317 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 316 transition count 254
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 68 place count 283 transition count 254
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 68 place count 283 transition count 187
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 212 place count 206 transition count 187
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 215 place count 203 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 218 place count 203 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 218 place count 203 transition count 183
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 220 place count 202 transition count 183
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 159 rules applied. Total rules applied 379 place count 121 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 381 place count 120 transition count 108
Applied a total of 381 rules in 32 ms. Remains 120 /323 variables (removed 203) and now considering 108/295 (removed 187) transitions.
// Phase 1: matrix 108 rows 120 cols
[2022-05-15 15:08:38] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-15 15:08:38] [INFO ] Implicit Places using invariants in 84 ms returned [1, 2, 3, 11, 36, 37, 38, 39, 40, 41, 42]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 85 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/323 places, 108/295 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 109/323 places, 108/295 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s78 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-12 finished in 185 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(p0))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 295/295 transitions.
Graph (trivial) has 145 edges and 323 vertex of which 6 / 323 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 750 edges and 318 vertex of which 317 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 316 transition count 255
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 284 transition count 255
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 66 place count 284 transition count 189
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 208 place count 208 transition count 189
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 211 place count 205 transition count 186
Iterating global reduction 2 with 3 rules applied. Total rules applied 214 place count 205 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 214 place count 205 transition count 185
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 216 place count 204 transition count 185
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 157 rules applied. Total rules applied 373 place count 124 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 375 place count 123 transition count 111
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 381 place count 123 transition count 111
Applied a total of 381 rules in 27 ms. Remains 123 /323 variables (removed 200) and now considering 111/295 (removed 184) transitions.
// Phase 1: matrix 111 rows 123 cols
[2022-05-15 15:08:38] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-15 15:08:38] [INFO ] Implicit Places using invariants in 86 ms returned [1, 2, 3, 11, 36, 37, 38, 39, 40, 41, 42]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 89 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/323 places, 111/295 transitions.
Applied a total of 0 rules in 3 ms. Remains 112 /112 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 112/323 places, 111/295 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s78 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-13 finished in 209 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(F(p0)))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 295/295 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 318 transition count 290
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 318 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 317 transition count 289
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 317 transition count 289
Applied a total of 12 rules in 16 ms. Remains 317 /323 variables (removed 6) and now considering 289/295 (removed 6) transitions.
// Phase 1: matrix 289 rows 317 cols
[2022-05-15 15:08:38] [INFO ] Computed 64 place invariants in 3 ms
[2022-05-15 15:08:39] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 289 rows 317 cols
[2022-05-15 15:08:39] [INFO ] Computed 64 place invariants in 8 ms
[2022-05-15 15:08:39] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
// Phase 1: matrix 289 rows 317 cols
[2022-05-15 15:08:39] [INFO ] Computed 64 place invariants in 4 ms
[2022-05-15 15:08:39] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 317/323 places, 289/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 317/323 places, 289/295 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-14 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:(OR (EQ s130 0) (EQ s220 0) (EQ s276 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 189 ms.
Product exploration explored 100000 steps with 33333 reset in 217 ms.
Computed a total of 189 stabilizing places and 191 stable transitions
Graph (complete) has 748 edges and 317 vertex of which 316 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 189 stabilizing places and 191 stable transitions
Detected a total of 189/317 stabilizing places and 191/289 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-09-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-09-LTLFireability-14 finished in 1194 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 295/295 transitions.
Graph (trivial) has 147 edges and 323 vertex of which 6 / 323 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 750 edges and 318 vertex of which 317 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 316 transition count 254
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 68 place count 283 transition count 254
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 68 place count 283 transition count 187
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 212 place count 206 transition count 187
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 216 place count 202 transition count 183
Iterating global reduction 2 with 4 rules applied. Total rules applied 220 place count 202 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 220 place count 202 transition count 182
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 222 place count 201 transition count 182
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 155 rules applied. Total rules applied 377 place count 122 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 379 place count 121 transition count 109
Applied a total of 379 rules in 23 ms. Remains 121 /323 variables (removed 202) and now considering 109/295 (removed 186) transitions.
// Phase 1: matrix 109 rows 121 cols
[2022-05-15 15:08:40] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-15 15:08:40] [INFO ] Implicit Places using invariants in 74 ms returned [13, 38, 39, 40, 41, 42, 43, 44]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 75 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/323 places, 109/295 transitions.
Applied a total of 0 rules in 4 ms. Remains 113 /113 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 113/323 places, 109/295 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 24 steps with 4 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-15 finished in 145 ms.
All properties solved by simple procedures.
Total runtime 12474 ms.

BK_STOP 1652627320325

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-09"
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-09, 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-165251918500388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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