About the Execution of ITS-Tools for BusinessProcesses-PT-16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 374.691 | 23087.00 | 48573.00 | 131.00 | TFTFFFFFFFFTTFTF | normal |
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-165251918500443.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-16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500443
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 5.9K Apr 29 23:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 29 23:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 23:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 29 23:51 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:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 159K 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-16-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652635169786
Running Version 202205111006
[2022-05-15 17:19:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 17:19:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 17:19:31] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2022-05-15 17:19:31] [INFO ] Transformed 638 places.
[2022-05-15 17:19:31] [INFO ] Transformed 578 transitions.
[2022-05-15 17:19:31] [INFO ] Found NUPN structural information;
[2022-05-15 17:19:31] [INFO ] Parsed PT model containing 638 places and 578 transitions in 234 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 8 places in 13 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 630 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 625 transition count 570
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 100 place count 530 transition count 475
Iterating global reduction 1 with 95 rules applied. Total rules applied 195 place count 530 transition count 475
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 243 place count 482 transition count 427
Iterating global reduction 1 with 48 rules applied. Total rules applied 291 place count 482 transition count 427
Applied a total of 291 rules in 120 ms. Remains 482 /630 variables (removed 148) and now considering 427/570 (removed 143) transitions.
// Phase 1: matrix 427 rows 482 cols
[2022-05-15 17:19:31] [INFO ] Computed 95 place invariants in 30 ms
[2022-05-15 17:19:31] [INFO ] Implicit Places using invariants in 349 ms returned []
// Phase 1: matrix 427 rows 482 cols
[2022-05-15 17:19:31] [INFO ] Computed 95 place invariants in 22 ms
[2022-05-15 17:19:32] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 895 ms to find 0 implicit places.
// Phase 1: matrix 427 rows 482 cols
[2022-05-15 17:19:32] [INFO ] Computed 95 place invariants in 11 ms
[2022-05-15 17:19:32] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 482/630 places, 427/570 transitions.
Finished structural reductions, in 1 iterations. Remains : 482/630 places, 427/570 transitions.
Support contains 25 out of 482 places after structural reductions.
[2022-05-15 17:19:32] [INFO ] Flatten gal took : 97 ms
[2022-05-15 17:19:32] [INFO ] Flatten gal took : 43 ms
[2022-05-15 17:19:32] [INFO ] Input system was already deterministic with 427 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 590 ms. (steps per millisecond=16 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 414836 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{7=1, 9=1}
Probabilistic random walk after 414836 steps, saw 67632 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :2
Running SMT prover for 10 properties.
// Phase 1: matrix 427 rows 482 cols
[2022-05-15 17:19:37] [INFO ] Computed 95 place invariants in 3 ms
[2022-05-15 17:19:37] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-15 17:19:37] [INFO ] [Nat]Absence check using 56 positive place invariants in 27 ms returned sat
[2022-05-15 17:19:38] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 19 ms returned sat
[2022-05-15 17:19:38] [INFO ] After 403ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2022-05-15 17:19:38] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 4 ms to minimize.
[2022-05-15 17:19:38] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2022-05-15 17:19:38] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
[2022-05-15 17:19:39] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2022-05-15 17:19:39] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 1 ms to minimize.
[2022-05-15 17:19:39] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 0 ms to minimize.
[2022-05-15 17:19:39] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2022-05-15 17:19:39] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 1 ms to minimize.
[2022-05-15 17:19:39] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2022-05-15 17:19:39] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2022-05-15 17:19:39] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2022-05-15 17:19:39] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 0 ms to minimize.
[2022-05-15 17:19:40] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
[2022-05-15 17:19:40] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 0 ms to minimize.
[2022-05-15 17:19:40] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
[2022-05-15 17:19:40] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1622 ms
[2022-05-15 17:19:40] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 0 ms to minimize.
[2022-05-15 17:19:40] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 0 ms to minimize.
[2022-05-15 17:19:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2022-05-15 17:19:40] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 1 ms to minimize.
[2022-05-15 17:19:40] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 1 ms to minimize.
[2022-05-15 17:19:40] [INFO ] Deduced a trap composed of 80 places in 158 ms of which 1 ms to minimize.
[2022-05-15 17:19:41] [INFO ] Deduced a trap composed of 105 places in 114 ms of which 0 ms to minimize.
[2022-05-15 17:19:41] [INFO ] Deduced a trap composed of 86 places in 158 ms of which 0 ms to minimize.
[2022-05-15 17:19:41] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 1 ms to minimize.
[2022-05-15 17:19:41] [INFO ] Deduced a trap composed of 66 places in 155 ms of which 0 ms to minimize.
[2022-05-15 17:19:41] [INFO ] Deduced a trap composed of 81 places in 146 ms of which 1 ms to minimize.
[2022-05-15 17:19:41] [INFO ] Deduced a trap composed of 90 places in 169 ms of which 0 ms to minimize.
[2022-05-15 17:19:42] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 1 ms to minimize.
[2022-05-15 17:19:42] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 0 ms to minimize.
[2022-05-15 17:19:42] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 0 ms to minimize.
[2022-05-15 17:19:42] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2004 ms
[2022-05-15 17:19:42] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 0 ms to minimize.
[2022-05-15 17:19:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2022-05-15 17:19:42] [INFO ] After 4643ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 241 ms.
[2022-05-15 17:19:42] [INFO ] After 5455ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 3 properties in 112 ms.
Support contains 12 out of 482 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 482/482 places, 427/427 transitions.
Graph (trivial) has 213 edges and 482 vertex of which 6 / 482 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1095 edges and 477 vertex of which 476 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 476 transition count 375
Reduce places removed 44 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 432 transition count 373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 94 place count 430 transition count 373
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 94 place count 430 transition count 277
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 302 place count 318 transition count 277
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 305 place count 315 transition count 274
Iterating global reduction 3 with 3 rules applied. Total rules applied 308 place count 315 transition count 274
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 563 place count 186 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 565 place count 185 transition count 152
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 567 place count 185 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 569 place count 183 transition count 150
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 570 place count 183 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 571 place count 182 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 572 place count 181 transition count 149
Applied a total of 572 rules in 119 ms. Remains 181 /482 variables (removed 301) and now considering 149/427 (removed 278) transitions.
Finished structural reductions, in 1 iterations. Remains : 181/482 places, 149/427 transitions.
Finished random walk after 234 steps, including 7 resets, run visited all 6 properties in 8 ms. (steps per millisecond=29 )
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA BusinessProcesses-PT-16-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 129 stabilizing places and 122 stable transitions
Graph (complete) has 1102 edges and 482 vertex of which 481 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U G(p1)) U X(X(p2))))'
Support contains 6 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 477 transition count 422
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 477 transition count 422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 476 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 476 transition count 421
Applied a total of 12 rules in 53 ms. Remains 476 /482 variables (removed 6) and now considering 421/427 (removed 6) transitions.
// Phase 1: matrix 421 rows 476 cols
[2022-05-15 17:19:43] [INFO ] Computed 95 place invariants in 8 ms
[2022-05-15 17:19:43] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 421 rows 476 cols
[2022-05-15 17:19:43] [INFO ] Computed 95 place invariants in 7 ms
[2022-05-15 17:19:44] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
// Phase 1: matrix 421 rows 476 cols
[2022-05-15 17:19:44] [INFO ] Computed 95 place invariants in 3 ms
[2022-05-15 17:19:44] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 476/482 places, 421/427 transitions.
Finished structural reductions, in 1 iterations. Remains : 476/482 places, 421/427 transitions.
Stuttering acceptance computed with spot in 933 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), true, (AND p1 (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND p1 (NOT p0)), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND p1 p0), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 8}, { cond=p0, acceptance={} source=3 dest: 9}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 11}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 12}, { cond=p0, acceptance={} source=4 dest: 13}, { cond=(OR p1 p0), acceptance={} source=4 dest: 14}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 15}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}, { cond=p1, acceptance={} source=5 dest: 10}], [{ cond=(NOT p2), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=8 dest: 16}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=9 dest: 16}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=9 dest: 17}, { cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 18}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=10 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={} source=10 dest: 17}], [{ cond=(NOT p2), acceptance={} source=11 dest: 6}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=12 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=12 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=13 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=13 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=13 dest: 9}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=13 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=14 dest: 11}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=14 dest: 12}, { cond=(AND p0 (NOT p2)), acceptance={} source=14 dest: 13}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=14 dest: 14}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=14 dest: 15}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=15 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=15 dest: 10}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=16 dest: 7}, { cond=(AND p1 p0), acceptance={} source=16 dest: 16}], [{ cond=(NOT p1), acceptance={} source=17 dest: 7}, { cond=p1, acceptance={} source=17 dest: 17}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=18 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={} source=18 dest: 16}, { cond=(AND p1 (NOT p0)), acceptance={} source=18 dest: 17}, { cond=(AND p1 p0), acceptance={} source=18 dest: 18}, { cond=(AND (NOT p1) p0), acceptance={0} source=18 dest: 18}]], initial=0, aps=[p1:(OR (EQ s248 0) (EQ s82 1)), p0:(OR (EQ s177 0) (EQ s112 1)), p2:(OR (EQ s439 0) (EQ s397 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 466 ms.
Product exploration explored 100000 steps with 33333 reset in 295 ms.
Computed a total of 128 stabilizing places and 121 stable transitions
Graph (complete) has 1090 edges and 476 vertex of which 475 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Computed a total of 128 stabilizing places and 121 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 17 factoid took 632 ms. Reduced automaton from 19 states, 52 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-16-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-16-LTLCardinality-00 finished in 3451 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X(F(F(p0))))))'
Support contains 2 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 475 transition count 420
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 475 transition count 420
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 473 transition count 418
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 473 transition count 418
Applied a total of 18 rules in 52 ms. Remains 473 /482 variables (removed 9) and now considering 418/427 (removed 9) transitions.
// Phase 1: matrix 418 rows 473 cols
[2022-05-15 17:19:46] [INFO ] Computed 95 place invariants in 8 ms
[2022-05-15 17:19:47] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 418 rows 473 cols
[2022-05-15 17:19:47] [INFO ] Computed 95 place invariants in 2 ms
[2022-05-15 17:19:47] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
// Phase 1: matrix 418 rows 473 cols
[2022-05-15 17:19:47] [INFO ] Computed 95 place invariants in 6 ms
[2022-05-15 17:19:47] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/482 places, 418/427 transitions.
Finished structural reductions, in 1 iterations. Remains : 473/482 places, 418/427 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s399 0) (NEQ s407 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 142 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-01 finished in 1046 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(X(G(F(p0)))))))'
Support contains 2 out of 482 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Graph (trivial) has 225 edges and 482 vertex of which 6 / 482 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 1096 edges and 477 vertex of which 476 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 475 transition count 370
Reduce places removed 49 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 426 transition count 369
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 425 transition count 369
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 102 place count 425 transition count 267
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 221 rules applied. Total rules applied 323 place count 306 transition count 267
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 330 place count 299 transition count 260
Iterating global reduction 3 with 7 rules applied. Total rules applied 337 place count 299 transition count 260
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 337 place count 299 transition count 259
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 339 place count 298 transition count 259
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 594 place count 168 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 596 place count 167 transition count 138
Applied a total of 596 rules in 52 ms. Remains 167 /482 variables (removed 315) and now considering 138/427 (removed 289) transitions.
// Phase 1: matrix 138 rows 167 cols
[2022-05-15 17:19:47] [INFO ] Computed 73 place invariants in 1 ms
[2022-05-15 17:19:48] [INFO ] Implicit Places using invariants in 105 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 49, 50, 51, 52]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 108 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/482 places, 138/427 transitions.
Applied a total of 0 rules in 14 ms. Remains 148 /148 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 148/482 places, 138/427 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s116 0) (NEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-05 finished in 257 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X(p0)))))'
Support contains 2 out of 482 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Graph (trivial) has 225 edges and 482 vertex of which 6 / 482 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 1096 edges and 477 vertex of which 476 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 475 transition count 370
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 426 transition count 370
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 100 place count 426 transition count 269
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 318 place count 309 transition count 269
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 325 place count 302 transition count 262
Iterating global reduction 2 with 7 rules applied. Total rules applied 332 place count 302 transition count 262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 332 place count 302 transition count 261
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 334 place count 301 transition count 261
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 593 place count 169 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 595 place count 168 transition count 138
Applied a total of 595 rules in 49 ms. Remains 168 /482 variables (removed 314) and now considering 138/427 (removed 289) transitions.
// Phase 1: matrix 138 rows 168 cols
[2022-05-15 17:19:48] [INFO ] Computed 74 place invariants in 1 ms
[2022-05-15 17:19:48] [INFO ] Implicit Places using invariants in 110 ms returned [1, 2, 3, 4, 5, 6, 7, 15, 16, 20, 21, 22, 23, 24, 25, 48, 49, 50, 51, 54, 144]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 111 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/482 places, 138/427 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 147/482 places, 138/427 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s33 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-08 finished in 249 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(p0 U p1))||X(G(p2))))'
Support contains 6 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 475 transition count 420
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 475 transition count 420
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 472 transition count 417
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 472 transition count 417
Applied a total of 20 rules in 32 ms. Remains 472 /482 variables (removed 10) and now considering 417/427 (removed 10) transitions.
// Phase 1: matrix 417 rows 472 cols
[2022-05-15 17:19:48] [INFO ] Computed 95 place invariants in 6 ms
[2022-05-15 17:19:48] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 417 rows 472 cols
[2022-05-15 17:19:48] [INFO ] Computed 95 place invariants in 3 ms
[2022-05-15 17:19:49] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
// Phase 1: matrix 417 rows 472 cols
[2022-05-15 17:19:49] [INFO ] Computed 95 place invariants in 9 ms
[2022-05-15 17:19:49] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/482 places, 417/427 transitions.
Finished structural reductions, in 1 iterations. Remains : 472/482 places, 417/427 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), p1]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (EQ s419 0) (EQ s438 1)), p1:(OR (EQ s36 0) (EQ s69 1)), p0:(OR (EQ s44 0) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-10 finished in 1096 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(G(F(X(G(p0))))))))'
Support contains 2 out of 482 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Graph (trivial) has 225 edges and 482 vertex of which 6 / 482 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 1096 edges and 477 vertex of which 476 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 475 transition count 369
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 425 transition count 369
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 102 place count 425 transition count 269
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 319 place count 308 transition count 269
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 326 place count 301 transition count 262
Iterating global reduction 2 with 7 rules applied. Total rules applied 333 place count 301 transition count 262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 333 place count 301 transition count 261
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 335 place count 300 transition count 261
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 594 place count 168 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 596 place count 167 transition count 138
Applied a total of 596 rules in 73 ms. Remains 167 /482 variables (removed 315) and now considering 138/427 (removed 289) transitions.
// Phase 1: matrix 138 rows 167 cols
[2022-05-15 17:19:49] [INFO ] Computed 73 place invariants in 1 ms
[2022-05-15 17:19:49] [INFO ] Implicit Places using invariants in 230 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 232 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/482 places, 138/427 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 147/482 places, 138/427 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s135 0) (EQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 21686 reset in 320 ms.
Product exploration explored 100000 steps with 21781 reset in 233 ms.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 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 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2464 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 773 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20627 steps, run visited all 1 properties in 87 ms. (steps per millisecond=237 )
Probabilistic random walk after 20627 steps, saw 5283 distinct states, run finished after 88 ms. (steps per millisecond=234 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 138/138 transitions.
Applied a total of 0 rules in 9 ms. Remains 147 /147 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 147 cols
[2022-05-15 17:19:50] [INFO ] Computed 53 place invariants in 2 ms
[2022-05-15 17:19:50] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 138 rows 147 cols
[2022-05-15 17:19:50] [INFO ] Computed 53 place invariants in 1 ms
[2022-05-15 17:19:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 17:19:51] [INFO ] Implicit Places using invariants and state equation in 197 ms returned [1, 3, 7, 10, 33, 35, 37, 39, 40, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 66, 68, 70, 72, 74, 76, 78, 80, 88, 90, 92, 94, 96]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 283 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/147 places, 138/138 transitions.
Graph (complete) has 377 edges and 115 vertex of which 104 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 104 transition count 125
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 96 transition count 125
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 32 place count 81 transition count 81
Iterating global reduction 2 with 15 rules applied. Total rules applied 47 place count 81 transition count 81
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 50 place count 81 transition count 78
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 53 place count 78 transition count 78
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 54 place count 77 transition count 77
Iterating global reduction 4 with 1 rules applied. Total rules applied 55 place count 77 transition count 77
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 72 place count 68 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 74 place count 67 transition count 68
Applied a total of 74 rules in 12 ms. Remains 67 /115 variables (removed 48) and now considering 68/138 (removed 70) transitions.
// Phase 1: matrix 68 rows 67 cols
[2022-05-15 17:19:51] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-15 17:19:51] [INFO ] Implicit Places using invariants in 41 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/147 places, 68/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 64/147 places, 68/138 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 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 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2590 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 771 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1628 steps, run visited all 1 properties in 7 ms. (steps per millisecond=232 )
Probabilistic random walk after 1628 steps, saw 547 distinct states, run finished after 7 ms. (steps per millisecond=232 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22484 reset in 102 ms.
Product exploration explored 100000 steps with 22181 reset in 210 ms.
Built C files in :
/tmp/ltsmin8961345651354853213
[2022-05-15 17:19:52] [INFO ] Computing symmetric may disable matrix : 68 transitions.
[2022-05-15 17:19:52] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:19:52] [INFO ] Computing symmetric may enable matrix : 68 transitions.
[2022-05-15 17:19:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:19:52] [INFO ] Computing Do-Not-Accords matrix : 68 transitions.
[2022-05-15 17:19:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:19:52] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8961345651354853213
Running compilation step : cd /tmp/ltsmin8961345651354853213;'/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 252 ms.
Running link step : cd /tmp/ltsmin8961345651354853213;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin8961345651354853213;'/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/stateBased15281300627709204327.hoa' '--buchi-type=spotba'
LTSmin run took 123 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-16-LTLCardinality-11 finished in 2960 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G(X(X(G(F(X(p1))))))))'
Support contains 3 out of 482 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Graph (trivial) has 223 edges and 482 vertex of which 6 / 482 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 1096 edges and 477 vertex of which 476 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 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 475 transition count 372
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 428 transition count 371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 427 transition count 371
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 98 place count 427 transition count 270
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 317 place count 309 transition count 270
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 324 place count 302 transition count 263
Iterating global reduction 3 with 7 rules applied. Total rules applied 331 place count 302 transition count 263
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 331 place count 302 transition count 262
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 333 place count 301 transition count 262
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 587 place count 172 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 589 place count 171 transition count 141
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 595 place count 171 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 596 place count 170 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 597 place count 169 transition count 140
Applied a total of 597 rules in 57 ms. Remains 169 /482 variables (removed 313) and now considering 140/427 (removed 287) transitions.
// Phase 1: matrix 140 rows 169 cols
[2022-05-15 17:19:52] [INFO ] Computed 73 place invariants in 1 ms
[2022-05-15 17:19:52] [INFO ] Implicit Places using invariants in 96 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/482 places, 140/427 transitions.
Applied a total of 0 rules in 6 ms. Remains 168 /168 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 168/482 places, 140/427 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-13 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 s1 0) (EQ s137 1)), p1:(EQ s124 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-13 finished in 246 ms.
All properties solved by simple procedures.
Total runtime 21756 ms.
BK_STOP 1652635192873
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -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-16"
export BK_EXAMINATION="LTLCardinality"
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-16, examination is LTLCardinality"
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-165251918500443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-16.tgz
mv BusinessProcesses-PT-16 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;