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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 300K
-rw-r--r-- 1 mcc users 6.9K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 30 00:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 30 00:01 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.8K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 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.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 79K 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-04-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652623373036

Running Version 202205111006
[2022-05-15 14:02:54] [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:02:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 14:02:54] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2022-05-15 14:02:54] [INFO ] Transformed 288 places.
[2022-05-15 14:02:54] [INFO ] Transformed 283 transitions.
[2022-05-15 14:02:54] [INFO ] Found NUPN structural information;
[2022-05-15 14:02:54] [INFO ] Parsed PT model containing 288 places and 283 transitions in 193 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 6 formulas.
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 2 transitions.
FORMULA BusinessProcesses-PT-04-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 281/281 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 283 transition count 281
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 37 place count 249 transition count 247
Iterating global reduction 1 with 34 rules applied. Total rules applied 71 place count 249 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 249 transition count 246
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 86 place count 235 transition count 232
Iterating global reduction 2 with 14 rules applied. Total rules applied 100 place count 235 transition count 232
Applied a total of 100 rules in 61 ms. Remains 235 /286 variables (removed 51) and now considering 232/281 (removed 49) transitions.
// Phase 1: matrix 232 rows 235 cols
[2022-05-15 14:02:54] [INFO ] Computed 41 place invariants in 24 ms
[2022-05-15 14:02:55] [INFO ] Implicit Places using invariants in 360 ms returned []
// Phase 1: matrix 232 rows 235 cols
[2022-05-15 14:02:55] [INFO ] Computed 41 place invariants in 5 ms
[2022-05-15 14:02:55] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
// Phase 1: matrix 232 rows 235 cols
[2022-05-15 14:02:55] [INFO ] Computed 41 place invariants in 27 ms
[2022-05-15 14:02:55] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/286 places, 232/281 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/286 places, 232/281 transitions.
Support contains 27 out of 235 places after structural reductions.
[2022-05-15 14:02:55] [INFO ] Flatten gal took : 46 ms
[2022-05-15 14:02:55] [INFO ] Flatten gal took : 20 ms
[2022-05-15 14:02:56] [INFO ] Input system was already deterministic with 232 transitions.
Incomplete random walk after 10000 steps, including 117 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 20) seen :17
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 232 rows 235 cols
[2022-05-15 14:02:56] [INFO ] Computed 41 place invariants in 8 ms
[2022-05-15 14:02:56] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2022-05-15 14:02:56] [INFO ] [Real]Absence check using 19 positive and 22 generalized place invariants in 6 ms returned sat
[2022-05-15 14:02:56] [INFO ] After 82ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:1
[2022-05-15 14:02:56] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 4 ms to minimize.
[2022-05-15 14:02:57] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2022-05-15 14:02:57] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 1 ms to minimize.
[2022-05-15 14:02:57] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 17 ms to minimize.
[2022-05-15 14:02:57] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 10 ms to minimize.
[2022-05-15 14:02:57] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2022-05-15 14:02:57] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
[2022-05-15 14:02:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1022 ms
[2022-05-15 14:02:57] [INFO ] After 1126ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-15 14:02:57] [INFO ] After 1221ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-15 14:02:58] [INFO ] [Nat]Absence check using 19 positive place invariants in 25 ms returned sat
[2022-05-15 14:02:58] [INFO ] [Nat]Absence check using 19 positive and 22 generalized place invariants in 5 ms returned sat
[2022-05-15 14:02:58] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-05-15 14:02:58] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 1 ms to minimize.
[2022-05-15 14:02:58] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2022-05-15 14:02:58] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 0 ms to minimize.
[2022-05-15 14:02:58] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 1 ms to minimize.
[2022-05-15 14:02:58] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 1 ms to minimize.
[2022-05-15 14:02:58] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 0 ms to minimize.
[2022-05-15 14:02:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 718 ms
[2022-05-15 14:02:59] [INFO ] After 973ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-15 14:02:59] [INFO ] After 1158ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 232/232 transitions.
Graph (trivial) has 105 edges and 235 vertex of which 6 / 235 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 560 edges and 230 vertex of which 229 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 229 transition count 200
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 50 place count 205 transition count 200
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 50 place count 205 transition count 154
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 148 place count 153 transition count 154
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 155 place count 146 transition count 147
Iterating global reduction 2 with 7 rules applied. Total rules applied 162 place count 146 transition count 147
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 162 place count 146 transition count 145
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 166 place count 144 transition count 145
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 264 place count 95 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 266 place count 94 transition count 99
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 267 place count 94 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 268 place count 93 transition count 98
Applied a total of 268 rules in 105 ms. Remains 93 /235 variables (removed 142) and now considering 98/232 (removed 134) transitions.
Finished structural reductions, in 1 iterations. Remains : 93/235 places, 98/232 transitions.
Finished random walk after 319 steps, including 23 resets, run visited all 1 properties in 3 ms. (steps per millisecond=106 )
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Computed a total of 208 stabilizing places and 206 stable transitions
Graph (complete) has 574 edges and 235 vertex of which 234 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(G((X(F((F(p0)&&p0)))&&G(p1)))))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 232/232 transitions.
Graph (trivial) has 104 edges and 235 vertex of which 6 / 235 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 567 edges and 230 vertex of which 229 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 228 transition count 200
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 50 place count 204 transition count 200
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 50 place count 204 transition count 154
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 148 place count 152 transition count 154
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 154 place count 146 transition count 148
Iterating global reduction 2 with 6 rules applied. Total rules applied 160 place count 146 transition count 148
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 160 place count 146 transition count 145
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 166 place count 143 transition count 145
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 260 place count 96 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 262 place count 95 transition count 101
Applied a total of 262 rules in 76 ms. Remains 95 /235 variables (removed 140) and now considering 101/232 (removed 131) transitions.
// Phase 1: matrix 101 rows 95 cols
[2022-05-15 14:02:59] [INFO ] Computed 35 place invariants in 21 ms
[2022-05-15 14:02:59] [INFO ] Implicit Places using invariants in 138 ms returned [1, 13, 36, 37, 38]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 153 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/235 places, 101/232 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 90/235 places, 101/232 transitions.
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-02 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 s60 0), p0:(EQ s3 0)], 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 784 steps with 94 reset in 13 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-02 finished in 636 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U X(X(!(F(X(X(p1))) U p1)))))'
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 232/232 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 225 transition count 222
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 225 transition count 222
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 221 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 221 transition count 218
Applied a total of 28 rules in 52 ms. Remains 221 /235 variables (removed 14) and now considering 218/232 (removed 14) transitions.
// Phase 1: matrix 218 rows 221 cols
[2022-05-15 14:03:00] [INFO ] Computed 41 place invariants in 5 ms
[2022-05-15 14:03:00] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 218 rows 221 cols
[2022-05-15 14:03:00] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 14:03:00] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 221 cols
[2022-05-15 14:03:00] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 14:03:00] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 221/235 places, 218/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 221/235 places, 218/232 transitions.
Stuttering acceptance computed with spot in 340 ms :[p1, p1, p1, p1, true, p1, p1, p1, p1, p1]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 7}], [{ cond=true, acceptance={0, 1} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}, { cond=p1, acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=7 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=7 dest: 9}], [{ cond=(AND p0 p1), acceptance={} source=8 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=8 dest: 9}], [{ cond=(AND p0 p1), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=9 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=9 dest: 8}]], initial=0, aps=[p0:(AND (EQ s39 1) (EQ s159 1)), p1:(AND (EQ s65 1) (EQ s152 1) (EQ s200 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1441 steps with 13 reset in 13 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-03 finished in 909 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(F(X(G(p0))))&&X(p1)))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 232/232 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 224 transition count 221
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 224 transition count 221
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 219 transition count 216
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 219 transition count 216
Applied a total of 32 rules in 42 ms. Remains 219 /235 variables (removed 16) and now considering 216/232 (removed 16) transitions.
// Phase 1: matrix 216 rows 219 cols
[2022-05-15 14:03:01] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 14:03:01] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 216 rows 219 cols
[2022-05-15 14:03:01] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:03:01] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 219 cols
[2022-05-15 14:03:01] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 14:03:01] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 219/235 places, 216/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 219/235 places, 216/232 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s5 0), p0:(EQ s212 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1097 reset in 220 ms.
Product exploration explored 100000 steps with 1101 reset in 240 ms.
Computed a total of 196 stabilizing places and 194 stable transitions
Graph (complete) has 556 edges and 219 vertex of which 218 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 196 stabilizing places and 194 stable transitions
Detected a total of 196/219 stabilizing places and 194/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 247 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 423 steps, including 5 resets, run visited all 1 properties in 3 ms. (steps per millisecond=141 )
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 6 factoid took 250 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 1 out of 219 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 216/216 transitions.
Graph (trivial) has 90 edges and 219 vertex of which 6 / 219 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 549 edges and 214 vertex of which 213 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 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 17 place count 212 transition count 193
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 32 place count 197 transition count 193
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 32 place count 197 transition count 145
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 134 place count 143 transition count 145
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 228 place count 96 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 230 place count 95 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 231 place count 94 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 232 place count 93 transition count 100
Applied a total of 232 rules in 29 ms. Remains 93 /219 variables (removed 126) and now considering 100/216 (removed 116) transitions.
// Phase 1: matrix 100 rows 93 cols
[2022-05-15 14:03:03] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-15 14:03:03] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 100 rows 93 cols
[2022-05-15 14:03:03] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-15 14:03:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 14:03:03] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [38, 39, 48, 50, 56]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 193 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/219 places, 100/216 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 98
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 83 transition count 94
Applied a total of 10 rules in 10 ms. Remains 83 /88 variables (removed 5) and now considering 94/100 (removed 6) transitions.
// Phase 1: matrix 94 rows 83 cols
[2022-05-15 14:03:03] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-15 14:03:03] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 94 rows 83 cols
[2022-05-15 14:03:03] [INFO ] Computed 31 place invariants in 0 ms
[2022-05-15 14:03:03] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 14:03:03] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 83/219 places, 94/216 transitions.
Finished structural reductions, in 2 iterations. Remains : 83/219 places, 94/216 transitions.
Computed a total of 76 stabilizing places and 87 stable transitions
Computed a total of 76 stabilizing places and 87 stable transitions
Detected a total of 76/83 stabilizing places and 87/94 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 15 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10828 reset in 147 ms.
Product exploration explored 100000 steps with 10838 reset in 217 ms.
Built C files in :
/tmp/ltsmin3136748460235083660
[2022-05-15 14:03:04] [INFO ] Computing symmetric may disable matrix : 94 transitions.
[2022-05-15 14:03:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:03:04] [INFO ] Computing symmetric may enable matrix : 94 transitions.
[2022-05-15 14:03:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:03:04] [INFO ] Computing Do-Not-Accords matrix : 94 transitions.
[2022-05-15 14:03:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:03:04] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3136748460235083660
Running compilation step : cd /tmp/ltsmin3136748460235083660;'/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 334 ms.
Running link step : cd /tmp/ltsmin3136748460235083660;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin3136748460235083660;'/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/stateBased11892186716849044867.hoa' '--buchi-type=spotba'
LTSmin run took 132 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-04-LTLFireability-04 finished in 3985 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(p0)&&F(p1)))))'
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 232/232 transitions.
Graph (trivial) has 102 edges and 235 vertex of which 6 / 235 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 567 edges and 230 vertex of which 229 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 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 228 transition count 201
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 48 place count 205 transition count 201
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 48 place count 205 transition count 155
Deduced a syphon composed of 46 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 146 place count 153 transition count 155
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 152 place count 147 transition count 149
Iterating global reduction 2 with 6 rules applied. Total rules applied 158 place count 147 transition count 149
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 158 place count 147 transition count 147
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 162 place count 145 transition count 147
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 256 place count 98 transition count 100
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 258 place count 97 transition count 103
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 264 place count 97 transition count 103
Applied a total of 264 rules in 31 ms. Remains 97 /235 variables (removed 138) and now considering 103/232 (removed 129) transitions.
// Phase 1: matrix 103 rows 97 cols
[2022-05-15 14:03:05] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-15 14:03:05] [INFO ] Implicit Places using invariants in 62 ms returned [1, 11, 35, 36, 37]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 63 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/235 places, 103/232 transitions.
Applied a total of 0 rules in 4 ms. Remains 92 /92 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 92/235 places, 103/232 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s11 0) (OR (EQ s13 0) (EQ s50 0) (EQ s64 0))), p1:(EQ s58 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 184 steps with 20 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-05 finished in 208 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(F(p0))&&F(X(X(p1)))))&&F(p0))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 232/232 transitions.
Graph (trivial) has 106 edges and 235 vertex of which 6 / 235 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 567 edges and 230 vertex of which 229 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 228 transition count 199
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 203 transition count 199
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 52 place count 203 transition count 154
Deduced a syphon composed of 45 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 148 place count 152 transition count 154
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 156 place count 144 transition count 146
Iterating global reduction 2 with 8 rules applied. Total rules applied 164 place count 144 transition count 146
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 164 place count 144 transition count 143
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 170 place count 141 transition count 143
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 260 place count 96 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 262 place count 95 transition count 101
Applied a total of 262 rules in 23 ms. Remains 95 /235 variables (removed 140) and now considering 101/232 (removed 131) transitions.
// Phase 1: matrix 101 rows 95 cols
[2022-05-15 14:03:05] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-15 14:03:05] [INFO ] Implicit Places using invariants in 118 ms returned [1, 11, 35, 36, 37]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 119 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/235 places, 101/232 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 90/235 places, 101/232 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s22 0), p1:(EQ s35 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-08 finished in 269 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(true U F(p0))))'
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 232/232 transitions.
Graph (trivial) has 106 edges and 235 vertex of which 6 / 235 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 567 edges and 230 vertex of which 229 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 228 transition count 200
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 204 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 203 transition count 199
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 52 place count 203 transition count 153
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 150 place count 151 transition count 153
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 158 place count 143 transition count 145
Iterating global reduction 3 with 8 rules applied. Total rules applied 166 place count 143 transition count 145
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 166 place count 143 transition count 142
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 172 place count 140 transition count 142
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 264 place count 94 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 266 place count 93 transition count 99
Applied a total of 266 rules in 23 ms. Remains 93 /235 variables (removed 142) and now considering 99/232 (removed 133) transitions.
// Phase 1: matrix 99 rows 93 cols
[2022-05-15 14:03:05] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-15 14:03:05] [INFO ] Implicit Places using invariants in 111 ms returned [12, 35, 36, 37]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 113 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/235 places, 99/232 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 89/235 places, 99/232 transitions.
Stuttering acceptance computed with spot in 29 ms :[p0]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ 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 137 steps with 16 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-09 finished in 183 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((X(G(p0))&&G(p1))))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 232/232 transitions.
Graph (trivial) has 105 edges and 235 vertex of which 6 / 235 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 567 edges and 230 vertex of which 229 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 228 transition count 200
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 50 place count 204 transition count 200
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 50 place count 204 transition count 154
Deduced a syphon composed of 46 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 148 place count 152 transition count 154
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 155 place count 145 transition count 147
Iterating global reduction 2 with 7 rules applied. Total rules applied 162 place count 145 transition count 147
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 162 place count 145 transition count 144
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 168 place count 142 transition count 144
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 258 place count 97 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 260 place count 96 transition count 102
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 266 place count 96 transition count 102
Applied a total of 266 rules in 26 ms. Remains 96 /235 variables (removed 139) and now considering 102/232 (removed 130) transitions.
// Phase 1: matrix 102 rows 96 cols
[2022-05-15 14:03:05] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-15 14:03:05] [INFO ] Implicit Places using invariants in 115 ms returned [1, 11, 35, 36, 37]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 116 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/235 places, 102/232 transitions.
Applied a total of 0 rules in 4 ms. Remains 91 /91 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 91/235 places, 102/232 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={0, 1} source=0 dest: 1}, { cond=p1, acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s11 0), p0:(OR (EQ s11 1) (EQ s54 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-10 finished in 325 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&p1)))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 232/232 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 226 transition count 223
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 226 transition count 223
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 222 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 222 transition count 219
Applied a total of 26 rules in 16 ms. Remains 222 /235 variables (removed 13) and now considering 219/232 (removed 13) transitions.
// Phase 1: matrix 219 rows 222 cols
[2022-05-15 14:03:06] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:03:06] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 219 rows 222 cols
[2022-05-15 14:03:06] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 14:03:06] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
// Phase 1: matrix 219 rows 222 cols
[2022-05-15 14:03:06] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-15 14:03:06] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 222/235 places, 219/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 222/235 places, 219/232 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(EQ s38 1), p1:(EQ s146 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 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-11 finished in 638 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 232/232 transitions.
Graph (trivial) has 107 edges and 235 vertex of which 6 / 235 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 229 transition count 200
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 204 transition count 200
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 51 place count 204 transition count 154
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 149 place count 152 transition count 154
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 157 place count 144 transition count 146
Iterating global reduction 2 with 8 rules applied. Total rules applied 165 place count 144 transition count 146
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 165 place count 144 transition count 143
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 171 place count 141 transition count 143
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 265 place count 94 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 267 place count 93 transition count 99
Applied a total of 267 rules in 21 ms. Remains 93 /235 variables (removed 142) and now considering 99/232 (removed 133) transitions.
// Phase 1: matrix 99 rows 93 cols
[2022-05-15 14:03:06] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-15 14:03:06] [INFO ] Implicit Places using invariants in 70 ms returned [1, 11, 34, 35, 36]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 87 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/235 places, 99/232 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 88/235 places, 99/232 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s33 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-04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-14 finished in 156 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)||(G(X(p1)) U !p1))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 232/232 transitions.
Graph (trivial) has 104 edges and 235 vertex of which 6 / 235 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 567 edges and 230 vertex of which 229 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 228 transition count 201
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 48 place count 205 transition count 201
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 48 place count 205 transition count 155
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 146 place count 153 transition count 155
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 153 place count 146 transition count 148
Iterating global reduction 2 with 7 rules applied. Total rules applied 160 place count 146 transition count 148
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 160 place count 146 transition count 146
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 164 place count 144 transition count 146
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 260 place count 96 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 262 place count 95 transition count 101
Applied a total of 262 rules in 14 ms. Remains 95 /235 variables (removed 140) and now considering 101/232 (removed 131) transitions.
// Phase 1: matrix 101 rows 95 cols
[2022-05-15 14:03:06] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-15 14:03:06] [INFO ] Implicit Places using invariants in 94 ms returned [1, 12, 35, 36, 37]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 94 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/235 places, 101/232 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 90/235 places, 101/232 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) p1)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s40 1) (EQ s2 1)), p1:(NEQ s61 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-04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-15 finished in 157 ms.
All properties solved by simple procedures.
Total runtime 12737 ms.

BK_STOP 1652623387084

--------------------
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-04"
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-04, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918400348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-04.tgz
mv BusinessProcesses-PT-04 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;