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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 7.6K Apr 29 23:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 23:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 29 23:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 29 23:49 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.5K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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.8K 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 157K 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-15-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652634685774

Running Version 202205111006
[2022-05-15 17:11:26] [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:11:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 17:11:27] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2022-05-15 17:11:27] [INFO ] Transformed 630 places.
[2022-05-15 17:11:27] [INFO ] Transformed 566 transitions.
[2022-05-15 17:11:27] [INFO ] Found NUPN structural information;
[2022-05-15 17:11:27] [INFO ] Parsed PT model containing 630 places and 566 transitions in 217 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 5 formulas.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 623 transition count 562
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 91 place count 535 transition count 474
Iterating global reduction 1 with 88 rules applied. Total rules applied 179 place count 535 transition count 474
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 223 place count 491 transition count 430
Iterating global reduction 1 with 44 rules applied. Total rules applied 267 place count 491 transition count 430
Applied a total of 267 rules in 121 ms. Remains 491 /626 variables (removed 135) and now considering 430/562 (removed 132) transitions.
// Phase 1: matrix 430 rows 491 cols
[2022-05-15 17:11:27] [INFO ] Computed 99 place invariants in 29 ms
[2022-05-15 17:11:27] [INFO ] Implicit Places using invariants in 343 ms returned []
// Phase 1: matrix 430 rows 491 cols
[2022-05-15 17:11:27] [INFO ] Computed 99 place invariants in 9 ms
[2022-05-15 17:11:28] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
// Phase 1: matrix 430 rows 491 cols
[2022-05-15 17:11:28] [INFO ] Computed 99 place invariants in 9 ms
[2022-05-15 17:11:28] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 491/626 places, 430/562 transitions.
Finished structural reductions, in 1 iterations. Remains : 491/626 places, 430/562 transitions.
Support contains 20 out of 491 places after structural reductions.
[2022-05-15 17:11:28] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-15 17:11:28] [INFO ] Flatten gal took : 63 ms
[2022-05-15 17:11:28] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA BusinessProcesses-PT-15-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 17:11:28] [INFO ] Flatten gal took : 29 ms
[2022-05-15 17:11:28] [INFO ] Input system was already deterministic with 430 transitions.
Support contains 15 out of 491 places (down from 20) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 546 ms. (steps per millisecond=18 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 430 rows 491 cols
[2022-05-15 17:11:29] [INFO ] Computed 99 place invariants in 10 ms
[2022-05-15 17:11:30] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-15 17:11:30] [INFO ] [Nat]Absence check using 58 positive place invariants in 22 ms returned sat
[2022-05-15 17:11:30] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 13 ms returned sat
[2022-05-15 17:11:30] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2022-05-15 17:11:30] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 3 ms to minimize.
[2022-05-15 17:11:30] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
[2022-05-15 17:11:30] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2022-05-15 17:11:30] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2022-05-15 17:11:31] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 2 ms to minimize.
[2022-05-15 17:11:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 514 ms
[2022-05-15 17:11:31] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 1 ms to minimize.
[2022-05-15 17:11:31] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 0 ms to minimize.
[2022-05-15 17:11:31] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 1 ms to minimize.
[2022-05-15 17:11:31] [INFO ] Deduced a trap composed of 101 places in 94 ms of which 1 ms to minimize.
[2022-05-15 17:11:31] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 1 ms to minimize.
[2022-05-15 17:11:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 622 ms
[2022-05-15 17:11:31] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2022-05-15 17:11:31] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2022-05-15 17:11:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2022-05-15 17:11:32] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 0 ms to minimize.
[2022-05-15 17:11:32] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 0 ms to minimize.
[2022-05-15 17:11:32] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 0 ms to minimize.
[2022-05-15 17:11:32] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 0 ms to minimize.
[2022-05-15 17:11:32] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 0 ms to minimize.
[2022-05-15 17:11:32] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 0 ms to minimize.
[2022-05-15 17:11:32] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 1 ms to minimize.
[2022-05-15 17:11:33] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2022-05-15 17:11:33] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 1 ms to minimize.
[2022-05-15 17:11:33] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 1 ms to minimize.
[2022-05-15 17:11:33] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 0 ms to minimize.
[2022-05-15 17:11:33] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 0 ms to minimize.
[2022-05-15 17:11:33] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2022-05-15 17:11:33] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2022-05-15 17:11:33] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2022-05-15 17:11:33] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2022-05-15 17:11:33] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1927 ms
[2022-05-15 17:11:33] [INFO ] After 3661ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 163 ms.
[2022-05-15 17:11:34] [INFO ] After 4030ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 79 ms.
Support contains 12 out of 491 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 491/491 places, 430/430 transitions.
Graph (trivial) has 217 edges and 491 vertex of which 6 / 491 are part of one of the 1 SCC in 1153 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1105 edges and 486 vertex of which 485 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output 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 485 transition count 375
Reduce places removed 47 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 438 transition count 372
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 102 place count 435 transition count 372
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 102 place count 435 transition count 272
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 318 place count 319 transition count 272
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 320 place count 317 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 322 place count 317 transition count 270
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 4 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 576 place count 188 transition count 145
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 3 with 2 rules applied. Total rules applied 578 place count 187 transition count 149
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 580 place count 187 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 582 place count 185 transition count 147
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 587 place count 185 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 588 place count 184 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 589 place count 183 transition count 146
Applied a total of 589 rules in 1264 ms. Remains 183 /491 variables (removed 308) and now considering 146/430 (removed 284) transitions.
Finished structural reductions, in 1 iterations. Remains : 183/491 places, 146/430 transitions.
Incomplete random walk after 10000 steps, including 239 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 146 rows 183 cols
[2022-05-15 17:11:35] [INFO ] Computed 78 place invariants in 5 ms
[2022-05-15 17:11:35] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 17:11:35] [INFO ] [Nat]Absence check using 58 positive place invariants in 7 ms returned sat
[2022-05-15 17:11:35] [INFO ] [Nat]Absence check using 58 positive and 20 generalized place invariants in 5 ms returned sat
[2022-05-15 17:11:35] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 17:11:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 17:11:35] [INFO ] After 9ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 17:11:35] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-15 17:11:35] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA BusinessProcesses-PT-15-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 207 stabilizing places and 179 stable transitions
Graph (complete) has 1112 edges and 491 vertex of which 490 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(p0 U !F(X(p1)))))'
Support contains 3 out of 491 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 430/430 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 485 transition count 424
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 485 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 484 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 484 transition count 423
Applied a total of 14 rules in 52 ms. Remains 484 /491 variables (removed 7) and now considering 423/430 (removed 7) transitions.
// Phase 1: matrix 423 rows 484 cols
[2022-05-15 17:11:35] [INFO ] Computed 99 place invariants in 7 ms
[2022-05-15 17:11:36] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 423 rows 484 cols
[2022-05-15 17:11:36] [INFO ] Computed 99 place invariants in 13 ms
[2022-05-15 17:11:36] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
// Phase 1: matrix 423 rows 484 cols
[2022-05-15 17:11:36] [INFO ] Computed 99 place invariants in 3 ms
[2022-05-15 17:11:36] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 484/491 places, 423/430 transitions.
Finished structural reductions, in 1 iterations. Remains : 484/491 places, 423/430 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s88 0) (EQ s130 1)), p1:(EQ s154 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-00 finished in 1283 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||F(p1)))'
Support contains 2 out of 491 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 430/430 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 485 transition count 424
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 485 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 484 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 484 transition count 423
Applied a total of 14 rules in 68 ms. Remains 484 /491 variables (removed 7) and now considering 423/430 (removed 7) transitions.
// Phase 1: matrix 423 rows 484 cols
[2022-05-15 17:11:37] [INFO ] Computed 99 place invariants in 7 ms
[2022-05-15 17:11:37] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 423 rows 484 cols
[2022-05-15 17:11:37] [INFO ] Computed 99 place invariants in 7 ms
[2022-05-15 17:11:37] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
// Phase 1: matrix 423 rows 484 cols
[2022-05-15 17:11:37] [INFO ] Computed 99 place invariants in 7 ms
[2022-05-15 17:11:38] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 484/491 places, 423/430 transitions.
Finished structural reductions, in 1 iterations. Remains : 484/491 places, 423/430 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s175 1) (EQ s196 0)), p0:(EQ s196 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 151 steps with 0 reset in 5 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-01 finished in 1101 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G(X(p0))))))'
Support contains 2 out of 491 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 430/430 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 486 transition count 425
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 486 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 485 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 485 transition count 424
Applied a total of 12 rules in 29 ms. Remains 485 /491 variables (removed 6) and now considering 424/430 (removed 6) transitions.
// Phase 1: matrix 424 rows 485 cols
[2022-05-15 17:11:38] [INFO ] Computed 99 place invariants in 8 ms
[2022-05-15 17:11:38] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 424 rows 485 cols
[2022-05-15 17:11:38] [INFO ] Computed 99 place invariants in 3 ms
[2022-05-15 17:11:38] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
// Phase 1: matrix 424 rows 485 cols
[2022-05-15 17:11:38] [INFO ] Computed 99 place invariants in 2 ms
[2022-05-15 17:11:39] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 485/491 places, 424/430 transitions.
Finished structural reductions, in 1 iterations. Remains : 485/491 places, 424/430 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s42 0) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-03 finished in 1132 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(F(X(G(p0))))))'
Support contains 2 out of 491 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 491/491 places, 430/430 transitions.
Graph (trivial) has 227 edges and 491 vertex of which 6 / 491 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 1106 edges and 486 vertex of which 485 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 484 transition count 369
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 431 transition count 369
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 108 place count 431 transition count 267
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 332 place count 309 transition count 267
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 337 place count 304 transition count 262
Iterating global reduction 2 with 5 rules applied. Total rules applied 342 place count 304 transition count 262
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 602 place count 172 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 604 place count 171 transition count 138
Applied a total of 604 rules in 68 ms. Remains 171 /491 variables (removed 320) and now considering 138/430 (removed 292) transitions.
// Phase 1: matrix 138 rows 171 cols
[2022-05-15 17:11:39] [INFO ] Computed 75 place invariants in 2 ms
[2022-05-15 17:11:39] [INFO ] Implicit Places using invariants in 106 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 40, 41, 42, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 108 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/491 places, 138/430 transitions.
Applied a total of 0 rules in 8 ms. Remains 149 /149 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 149/491 places, 138/430 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-07 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 s83 0) (EQ s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-07 finished in 240 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 491 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 491/491 places, 430/430 transitions.
Graph (trivial) has 228 edges and 491 vertex of which 6 / 491 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 1106 edges and 486 vertex of which 485 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 484 transition count 369
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 431 transition count 368
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 430 transition count 368
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 110 place count 430 transition count 264
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 228 rules applied. Total rules applied 338 place count 306 transition count 264
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 343 place count 301 transition count 259
Iterating global reduction 3 with 5 rules applied. Total rules applied 348 place count 301 transition count 259
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 4 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 604 place count 171 transition count 133
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 3 with 2 rules applied. Total rules applied 606 place count 170 transition count 137
Applied a total of 606 rules in 46 ms. Remains 170 /491 variables (removed 321) and now considering 137/430 (removed 293) transitions.
// Phase 1: matrix 137 rows 170 cols
[2022-05-15 17:11:39] [INFO ] Computed 75 place invariants in 2 ms
[2022-05-15 17:11:39] [INFO ] Implicit Places using invariants in 112 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 40, 41, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 113 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/491 places, 137/430 transitions.
Applied a total of 0 rules in 5 ms. Remains 149 /149 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 149/491 places, 137/430 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-08 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 s106 0) (EQ s30 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 21730 reset in 333 ms.
Product exploration explored 100000 steps with 21695 reset in 297 ms.
Computed a total of 31 stabilizing places and 23 stable transitions
Computed a total of 31 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 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)]
Incomplete random walk after 10000 steps, including 2459 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 755 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 14342 steps, run visited all 1 properties in 61 ms. (steps per millisecond=235 )
Probabilistic random walk after 14342 steps, saw 4367 distinct states, run finished after 62 ms. (steps per millisecond=231 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 137/137 transitions.
Applied a total of 0 rules in 9 ms. Remains 149 /149 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 149 cols
[2022-05-15 17:11:40] [INFO ] Computed 54 place invariants in 2 ms
[2022-05-15 17:11:40] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 137 rows 149 cols
[2022-05-15 17:11:41] [INFO ] Computed 54 place invariants in 3 ms
[2022-05-15 17:11:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 17:11:41] [INFO ] Implicit Places using invariants and state equation in 203 ms returned [3, 25, 27, 35, 37, 39, 41, 43, 45, 47, 54, 56, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96]
Discarding 30 places :
Implicit Place search using SMT with State Equation took 296 ms to find 30 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/149 places, 137/137 transitions.
Graph (complete) has 389 edges and 119 vertex of which 110 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 110 transition count 121
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 98 transition count 121
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 36 place count 87 transition count 83
Iterating global reduction 2 with 11 rules applied. Total rules applied 47 place count 87 transition count 83
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 87 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 85 transition count 81
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 53 place count 83 transition count 79
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 83 transition count 79
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 71 place count 74 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 75 place count 72 transition count 70
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 72 transition count 69
Applied a total of 76 rules in 27 ms. Remains 72 /119 variables (removed 47) and now considering 69/137 (removed 68) transitions.
// Phase 1: matrix 69 rows 72 cols
[2022-05-15 17:11:41] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-15 17:11:41] [INFO ] Implicit Places using invariants in 43 ms returned [3, 4, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 45 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/149 places, 69/137 transitions.
Applied a total of 0 rules in 5 ms. Remains 69 /69 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 69/149 places, 69/137 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 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 41 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2530 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 775 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4202 steps, run visited all 1 properties in 11 ms. (steps per millisecond=382 )
Probabilistic random walk after 4202 steps, saw 1570 distinct states, run finished after 12 ms. (steps per millisecond=350 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22232 reset in 123 ms.
Product exploration explored 100000 steps with 22214 reset in 114 ms.
Built C files in :
/tmp/ltsmin8411207616846899476
[2022-05-15 17:11:41] [INFO ] Computing symmetric may disable matrix : 69 transitions.
[2022-05-15 17:11:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:11:41] [INFO ] Computing symmetric may enable matrix : 69 transitions.
[2022-05-15 17:11:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:11:41] [INFO ] Computing Do-Not-Accords matrix : 69 transitions.
[2022-05-15 17:11:41] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:11:41] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8411207616846899476
Running compilation step : cd /tmp/ltsmin8411207616846899476;'/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 265 ms.
Running link step : cd /tmp/ltsmin8411207616846899476;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8411207616846899476;'/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/stateBased10693913349200957442.hoa' '--buchi-type=spotba'
LTSmin run took 110 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-15-LTLCardinality-08 finished in 2832 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 3 out of 491 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 430/430 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 487 transition count 426
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 487 transition count 426
Applied a total of 8 rules in 36 ms. Remains 487 /491 variables (removed 4) and now considering 426/430 (removed 4) transitions.
// Phase 1: matrix 426 rows 487 cols
[2022-05-15 17:11:42] [INFO ] Computed 99 place invariants in 3 ms
[2022-05-15 17:11:42] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 426 rows 487 cols
[2022-05-15 17:11:42] [INFO ] Computed 99 place invariants in 2 ms
[2022-05-15 17:11:43] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
// Phase 1: matrix 426 rows 487 cols
[2022-05-15 17:11:43] [INFO ] Computed 99 place invariants in 9 ms
[2022-05-15 17:11:43] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 487/491 places, 426/430 transitions.
Finished structural reductions, in 1 iterations. Remains : 487/491 places, 426/430 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s330 0) (EQ s428 1) (OR (EQ s121 0) (EQ s121 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-13 finished in 1128 ms.
All properties solved by simple procedures.
Total runtime 16683 ms.

BK_STOP 1652634703621

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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-15"
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-15, 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-165251918500435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-15.tgz
mv BusinessProcesses-PT-15 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;