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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 7.5K Apr 29 23:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 23:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 29 23:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 29 23:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:08 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 47K 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-01-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652622810589

Running Version 202205111006
[2022-05-15 13:53:31] [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 13:53:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 13:53:31] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2022-05-15 13:53:31] [INFO ] Transformed 200 places.
[2022-05-15 13:53:31] [INFO ] Transformed 178 transitions.
[2022-05-15 13:53:31] [INFO ] Found NUPN structural information;
[2022-05-15 13:53:31] [INFO ] Parsed PT model containing 200 places and 178 transitions in 178 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 2 formulas.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-01-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 177/177 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 197 transition count 177
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 31 place count 168 transition count 148
Iterating global reduction 1 with 29 rules applied. Total rules applied 60 place count 168 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 168 transition count 147
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 75 place count 154 transition count 133
Iterating global reduction 2 with 14 rules applied. Total rules applied 89 place count 154 transition count 133
Applied a total of 89 rules in 43 ms. Remains 154 /199 variables (removed 45) and now considering 133/177 (removed 44) transitions.
// Phase 1: matrix 133 rows 154 cols
[2022-05-15 13:53:32] [INFO ] Computed 28 place invariants in 13 ms
[2022-05-15 13:53:32] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 133 rows 154 cols
[2022-05-15 13:53:32] [INFO ] Computed 28 place invariants in 4 ms
[2022-05-15 13:53:32] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
// Phase 1: matrix 133 rows 154 cols
[2022-05-15 13:53:32] [INFO ] Computed 28 place invariants in 4 ms
[2022-05-15 13:53:32] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/199 places, 133/177 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/199 places, 133/177 transitions.
Support contains 38 out of 154 places after structural reductions.
[2022-05-15 13:53:32] [INFO ] Flatten gal took : 40 ms
[2022-05-15 13:53:32] [INFO ] Flatten gal took : 19 ms
[2022-05-15 13:53:32] [INFO ] Input system was already deterministic with 133 transitions.
Incomplete random walk after 10000 steps, including 113 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 28) seen :22
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 133 rows 154 cols
[2022-05-15 13:53:33] [INFO ] Computed 28 place invariants in 7 ms
[2022-05-15 13:53:33] [INFO ] [Real]Absence check using 18 positive place invariants in 4 ms returned sat
[2022-05-15 13:53:33] [INFO ] [Real]Absence check using 18 positive and 10 generalized place invariants in 3 ms returned sat
[2022-05-15 13:53:33] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:3
[2022-05-15 13:53:33] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 4 ms to minimize.
[2022-05-15 13:53:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 69 ms
[2022-05-15 13:53:33] [INFO ] After 121ms SMT Verify possible using trap constraints in real domain returned unsat :3 sat :0 real:3
[2022-05-15 13:53:33] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:3
[2022-05-15 13:53:33] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2022-05-15 13:53:33] [INFO ] [Nat]Absence check using 18 positive and 10 generalized place invariants in 2 ms returned sat
[2022-05-15 13:53:33] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :1
[2022-05-15 13:53:33] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2022-05-15 13:53:33] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2022-05-15 13:53:33] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2022-05-15 13:53:34] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2022-05-15 13:53:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 157 ms
[2022-05-15 13:53:34] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-15 13:53:34] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 154/154 places, 133/133 transitions.
Graph (trivial) has 78 edges and 154 vertex of which 6 / 154 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 312 edges and 149 vertex of which 148 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 19 place count 148 transition count 108
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 131 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 130 transition count 107
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 38 place count 130 transition count 78
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 101 place count 96 transition count 78
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 105 place count 92 transition count 74
Iterating global reduction 3 with 4 rules applied. Total rules applied 109 place count 92 transition count 74
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 183 place count 55 transition count 37
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 185 place count 54 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 186 place count 54 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 187 place count 53 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 188 place count 52 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 189 place count 51 transition count 38
Applied a total of 189 rules in 35 ms. Remains 51 /154 variables (removed 103) and now considering 38/133 (removed 95) transitions.
Finished structural reductions, in 1 iterations. Remains : 51/154 places, 38/133 transitions.
Finished random walk after 3928 steps, including 303 resets, run visited all 1 properties in 17 ms. (steps per millisecond=231 )
FORMULA BusinessProcesses-PT-01-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-01-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 129 stabilizing places and 109 stable transitions
Graph (complete) has 327 edges and 154 vertex of which 153 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(F(p0)))||F(p1)))))'
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 133/133 transitions.
Graph (complete) has 327 edges and 154 vertex of which 153 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 152 transition count 117
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 138 transition count 115
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 136 transition count 115
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 33 place count 136 transition count 82
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 105 place count 97 transition count 82
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 111 place count 91 transition count 76
Iterating global reduction 3 with 6 rules applied. Total rules applied 117 place count 91 transition count 76
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 187 place count 56 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 188 place count 56 transition count 40
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 4 with 2 rules applied. Total rules applied 190 place count 55 transition count 43
Applied a total of 190 rules in 19 ms. Remains 55 /154 variables (removed 99) and now considering 43/133 (removed 90) transitions.
// Phase 1: matrix 43 rows 55 cols
[2022-05-15 13:53:34] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-15 13:53:34] [INFO ] Implicit Places using invariants in 48 ms returned [7, 8, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 50 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/154 places, 43/133 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 52/154 places, 43/133 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s20 1) (EQ s47 1)), p1:(EQ s8 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 5 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-01 finished in 275 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((false U (X(p0)||p1))))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 133/133 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 149 transition count 128
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 149 transition count 128
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 146 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 146 transition count 125
Applied a total of 16 rules in 8 ms. Remains 146 /154 variables (removed 8) and now considering 125/133 (removed 8) transitions.
// Phase 1: matrix 125 rows 146 cols
[2022-05-15 13:53:34] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:53:34] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 125 rows 146 cols
[2022-05-15 13:53:34] [INFO ] Computed 28 place invariants in 7 ms
[2022-05-15 13:53:35] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 146 cols
[2022-05-15 13:53:35] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-15 13:53:35] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 146/154 places, 125/133 transitions.
Finished structural reductions, in 1 iterations. Remains : 146/154 places, 125/133 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(EQ s13 1), p0:(EQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-04 finished in 589 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F((G(p0)&&p1))&&G(p2)))))'
Support contains 7 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 133/133 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 148 transition count 127
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 148 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 145 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 145 transition count 124
Applied a total of 18 rules in 6 ms. Remains 145 /154 variables (removed 9) and now considering 124/133 (removed 9) transitions.
// Phase 1: matrix 124 rows 145 cols
[2022-05-15 13:53:35] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:53:35] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 124 rows 145 cols
[2022-05-15 13:53:35] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-15 13:53:35] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
// Phase 1: matrix 124 rows 145 cols
[2022-05-15 13:53:35] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:53:35] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/154 places, 124/133 transitions.
Finished structural reductions, in 1 iterations. Remains : 145/154 places, 124/133 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(OR (AND p2 (NOT p1)) (AND p2 (NOT p0))), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s23 1) (EQ s87 1) (EQ s119 1)), p1:(EQ s130 1), p0:(AND (EQ s51 1) (EQ s103 1) (EQ s134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-05 finished in 475 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F(G((X(!X(X(p0))) U p0)))))))'
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 133/133 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 148 transition count 127
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 148 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 145 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 145 transition count 124
Applied a total of 18 rules in 7 ms. Remains 145 /154 variables (removed 9) and now considering 124/133 (removed 9) transitions.
// Phase 1: matrix 124 rows 145 cols
[2022-05-15 13:53:35] [INFO ] Computed 28 place invariants in 0 ms
[2022-05-15 13:53:35] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 124 rows 145 cols
[2022-05-15 13:53:35] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-15 13:53:36] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
// Phase 1: matrix 124 rows 145 cols
[2022-05-15 13:53:36] [INFO ] Computed 28 place invariants in 4 ms
[2022-05-15 13:53:36] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/154 places, 124/133 transitions.
Finished structural reductions, in 1 iterations. Remains : 145/154 places, 124/133 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), false, false, false]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={} source=4 dest: 0}]], initial=0, aps=[p0:(EQ s77 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 16647 reset in 298 ms.
Stack based approach found an accepted trace after 2179 steps with 368 reset with depth 5 and stack size 5 in 4 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-06 finished in 711 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(X(p0)) U p1))'
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 133/133 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 148 transition count 127
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 148 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 146 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 146 transition count 125
Applied a total of 16 rules in 7 ms. Remains 146 /154 variables (removed 8) and now considering 125/133 (removed 8) transitions.
// Phase 1: matrix 125 rows 146 cols
[2022-05-15 13:53:36] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:53:36] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 125 rows 146 cols
[2022-05-15 13:53:36] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:53:36] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 146 cols
[2022-05-15 13:53:36] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:53:36] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 146/154 places, 125/133 transitions.
Finished structural reductions, in 1 iterations. Remains : 146/154 places, 125/133 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, p0, p1, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(NEQ s63 1), p1:(AND (EQ s125 1) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1262 reset in 251 ms.
Product exploration explored 100000 steps with 1257 reset in 168 ms.
Computed a total of 123 stabilizing places and 103 stable transitions
Graph (complete) has 315 edges and 146 vertex of which 145 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 123 stabilizing places and 103 stable transitions
Detected a total of 123/146 stabilizing places and 103/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 258 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 134 ms :[true, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 112 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :2
Finished Best-First random walk after 6526 steps, including 13 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1631 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 7 factoid took 344 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 152 ms :[true, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 246 ms :[true, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 146 cols
[2022-05-15 13:53:38] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-15 13:53:38] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 125 rows 146 cols
[2022-05-15 13:53:38] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:53:38] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 146 cols
[2022-05-15 13:53:38] [INFO ] Computed 28 place invariants in 6 ms
[2022-05-15 13:53:38] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 146/146 places, 125/125 transitions.
Computed a total of 123 stabilizing places and 103 stable transitions
Graph (complete) has 315 edges and 146 vertex of which 145 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 123 stabilizing places and 103 stable transitions
Detected a total of 123/146 stabilizing places and 103/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 373 ms :[true, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 113 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :2
Finished Best-First random walk after 2726 steps, including 7 resets, run visited all 1 properties in 3 ms. (steps per millisecond=908 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 4 factoid took 226 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 137 ms :[true, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 145 ms :[true, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 131 ms :[true, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 1244 reset in 130 ms.
Product exploration explored 100000 steps with 1265 reset in 251 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 130 ms :[true, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 125/125 transitions.
Graph (trivial) has 68 edges and 146 vertex of which 6 / 146 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 308 edges and 141 vertex of which 140 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
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 140 transition count 118
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 14 place count 140 transition count 134
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 35 place count 140 transition count 134
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 136 transition count 126
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 136 transition count 126
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 87 place count 136 transition count 126
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 99 place count 124 transition count 114
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 111 place count 124 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 124 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 123 transition count 119
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 123 transition count 119
Deduced a syphon composed of 61 places in 0 ms
Applied a total of 114 rules in 42 ms. Remains 123 /146 variables (removed 23) and now considering 119/125 (removed 6) transitions.
[2022-05-15 13:53:40] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 119 rows 123 cols
[2022-05-15 13:53:40] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:53:40] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/146 places, 119/125 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/146 places, 119/125 transitions.
Product exploration explored 100000 steps with 1289 reset in 146 ms.
Product exploration explored 100000 steps with 1247 reset in 163 ms.
Built C files in :
/tmp/ltsmin2250428825913209002
[2022-05-15 13:53:41] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2250428825913209002
Running compilation step : cd /tmp/ltsmin2250428825913209002;'/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 289 ms.
Running link step : cd /tmp/ltsmin2250428825913209002;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2250428825913209002;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15398808471729110889.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 146 cols
[2022-05-15 13:53:56] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-15 13:53:56] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 125 rows 146 cols
[2022-05-15 13:53:56] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:53:56] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 146 cols
[2022-05-15 13:53:56] [INFO ] Computed 28 place invariants in 8 ms
[2022-05-15 13:53:56] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 146/146 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin9893086106450256012
[2022-05-15 13:53:56] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9893086106450256012
Running compilation step : cd /tmp/ltsmin9893086106450256012;'/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 198 ms.
Running link step : cd /tmp/ltsmin9893086106450256012;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin9893086106450256012;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8152567213980303560.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 13:54:11] [INFO ] Flatten gal took : 11 ms
[2022-05-15 13:54:11] [INFO ] Flatten gal took : 8 ms
[2022-05-15 13:54:11] [INFO ] Time to serialize gal into /tmp/LTL1979138208591376038.gal : 2 ms
[2022-05-15 13:54:11] [INFO ] Time to serialize properties into /tmp/LTL15787929607788709374.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1979138208591376038.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15787929607788709374.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1979138...267
Read 1 LTL properties
Checking formula 0 : !((!((X(X("(p75!=1)")))U("((p160==1)&&(p23==1))"))))
Formula 0 simplified : XX"(p75!=1)" U "((p160==1)&&(p23==1))"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t26, t30, t33, t36, t39, t42, t45, t48, t51, t56, t59, t63, t67, t68, t71, t72, t75, ...306
Computing Next relation with stutter on 105 deadlock states
Detected timeout of ITS tools.
[2022-05-15 13:54:26] [INFO ] Flatten gal took : 9 ms
[2022-05-15 13:54:26] [INFO ] Applying decomposition
[2022-05-15 13:54:26] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8438564449365810635.txt' '-o' '/tmp/graph8438564449365810635.bin' '-w' '/tmp/graph8438564449365810635.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8438564449365810635.bin' '-l' '-1' '-v' '-w' '/tmp/graph8438564449365810635.weights' '-q' '0' '-e' '0.001'
[2022-05-15 13:54:26] [INFO ] Decomposing Gal with order
[2022-05-15 13:54:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 13:54:26] [INFO ] Removed a total of 49 redundant transitions.
[2022-05-15 13:54:26] [INFO ] Flatten gal took : 41 ms
[2022-05-15 13:54:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-15 13:54:26] [INFO ] Time to serialize gal into /tmp/LTL16146723133074717507.gal : 3 ms
[2022-05-15 13:54:26] [INFO ] Time to serialize properties into /tmp/LTL5999130007073033492.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16146723133074717507.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5999130007073033492.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1614672...246
Read 1 LTL properties
Checking formula 0 : !((!((X(X("(i6.u23.p75!=1)")))U("((i2.u41.p160==1)&&(i3.u8.p23==1))"))))
Formula 0 simplified : XX"(i6.u23.p75!=1)" U "((i2.u41.p160==1)&&(i3.u8.p23==1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t68, t76, t90, t123, t124, i0.u16.t71, i1.t72, i1.u12.t79, i1.u14.t75, i2.u4.t97, i2.u34....469
Computing Next relation with stutter on 105 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
145 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.46409,72744,1,0,124925,299,2292,171604,177,887,259659
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-01-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-01-LTLFireability-07 finished in 52143 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X((X(p0)&&p1)))||G(p2))))'
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 133/133 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 148 transition count 127
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 148 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 145 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 145 transition count 124
Applied a total of 18 rules in 11 ms. Remains 145 /154 variables (removed 9) and now considering 124/133 (removed 9) transitions.
// Phase 1: matrix 124 rows 145 cols
[2022-05-15 13:54:28] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:54:28] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 124 rows 145 cols
[2022-05-15 13:54:28] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:54:28] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
// Phase 1: matrix 124 rows 145 cols
[2022-05-15 13:54:28] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:54:28] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/154 places, 124/133 transitions.
Finished structural reductions, in 1 iterations. Remains : 145/154 places, 124/133 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s126 0), p1:(EQ s112 1), p0:(EQ s24 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2007 steps with 25 reset in 7 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-08 finished in 401 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(!(p0 U F(p0))))))'
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 133/133 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 148 transition count 127
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 148 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 145 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 145 transition count 124
Applied a total of 18 rules in 10 ms. Remains 145 /154 variables (removed 9) and now considering 124/133 (removed 9) transitions.
// Phase 1: matrix 124 rows 145 cols
[2022-05-15 13:54:29] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-15 13:54:29] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 124 rows 145 cols
[2022-05-15 13:54:29] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:54:29] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
// Phase 1: matrix 124 rows 145 cols
[2022-05-15 13:54:29] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:54:29] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/154 places, 124/133 transitions.
Finished structural reductions, in 1 iterations. Remains : 145/154 places, 124/133 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, p0, p0, p0, p0]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 47 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-11 finished in 483 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(F(p1))))'
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 133/133 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 149 transition count 128
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 149 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 147 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 147 transition count 126
Applied a total of 14 rules in 7 ms. Remains 147 /154 variables (removed 7) and now considering 126/133 (removed 7) transitions.
// Phase 1: matrix 126 rows 147 cols
[2022-05-15 13:54:29] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:54:29] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 126 rows 147 cols
[2022-05-15 13:54:29] [INFO ] Computed 28 place invariants in 0 ms
[2022-05-15 13:54:29] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 147 cols
[2022-05-15 13:54:29] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:54:29] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 147/154 places, 126/133 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/154 places, 126/133 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s28 1) (EQ s122 1)), p1:(NEQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Computed a total of 124 stabilizing places and 104 stable transitions
Graph (complete) has 316 edges and 147 vertex of which 146 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 124 stabilizing places and 104 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-01-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-01-LTLFireability-13 finished in 697 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(p0))))'
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 133/133 transitions.
Graph (trivial) has 78 edges and 154 vertex of which 6 / 154 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 320 edges and 149 vertex of which 148 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 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 19 place count 147 transition count 108
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 36 place count 130 transition count 108
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 36 place count 130 transition count 79
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 100 place count 95 transition count 79
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 104 place count 91 transition count 75
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 91 transition count 75
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 184 place count 53 transition count 37
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 186 place count 52 transition count 40
Applied a total of 186 rules in 16 ms. Remains 52 /154 variables (removed 102) and now considering 40/133 (removed 93) transitions.
// Phase 1: matrix 40 rows 52 cols
[2022-05-15 13:54:30] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-15 13:54:30] [INFO ] Implicit Places using invariants in 37 ms returned [1, 2, 5, 6, 7, 15]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 37 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/154 places, 40/133 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 46/154 places, 40/133 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s31 0)], 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 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-14 finished in 98 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 133/133 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 148 transition count 127
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 148 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 145 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 145 transition count 124
Applied a total of 18 rules in 8 ms. Remains 145 /154 variables (removed 9) and now considering 124/133 (removed 9) transitions.
// Phase 1: matrix 124 rows 145 cols
[2022-05-15 13:54:30] [INFO ] Computed 28 place invariants in 0 ms
[2022-05-15 13:54:30] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 124 rows 145 cols
[2022-05-15 13:54:30] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:54:30] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
// Phase 1: matrix 124 rows 145 cols
[2022-05-15 13:54:30] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:54:30] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/154 places, 124/133 transitions.
Finished structural reductions, in 1 iterations. Remains : 145/154 places, 124/133 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s104 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 6202 reset in 97 ms.
Stack based approach found an accepted trace after 71 steps with 3 reset with depth 9 and stack size 9 in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-15 finished in 427 ms.
All properties solved by simple procedures.
Total runtime 59082 ms.

BK_STOP 1652622870913

--------------------
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-01"
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-01, 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-165251918400324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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