About the Execution of ITS-Tools for BusinessProcesses-PT-11
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 325.163 | 14118.00 | 29625.00 | 63.40 | TTFFFFTFFFTTTFFF | 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-165251918500403.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-11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500403
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 6.5K Apr 29 23:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 29 23:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 23:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 23:58 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.7K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 141K 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-11-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652629703360
Running Version 202205111006
[2022-05-15 15:48:24] [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 15:48:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:48:24] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2022-05-15 15:48:24] [INFO ] Transformed 567 places.
[2022-05-15 15:48:24] [INFO ] Transformed 508 transitions.
[2022-05-15 15:48:24] [INFO ] Found NUPN structural information;
[2022-05-15 15:48:24] [INFO ] Parsed PT model containing 567 places and 508 transitions in 224 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 4 formulas.
Deduced a syphon composed of 7 places in 11 ms
Reduce places removed 7 places and 7 transitions.
FORMULA BusinessProcesses-PT-11-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 76 place count 484 transition count 429
Iterating global reduction 1 with 72 rules applied. Total rules applied 148 place count 484 transition count 429
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 185 place count 447 transition count 392
Iterating global reduction 1 with 37 rules applied. Total rules applied 222 place count 447 transition count 392
Applied a total of 222 rules in 98 ms. Remains 447 /560 variables (removed 113) and now considering 392/501 (removed 109) transitions.
// Phase 1: matrix 392 rows 447 cols
[2022-05-15 15:48:25] [INFO ] Computed 91 place invariants in 29 ms
[2022-05-15 15:48:25] [INFO ] Implicit Places using invariants in 343 ms returned []
// Phase 1: matrix 392 rows 447 cols
[2022-05-15 15:48:25] [INFO ] Computed 91 place invariants in 13 ms
[2022-05-15 15:48:25] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
// Phase 1: matrix 392 rows 447 cols
[2022-05-15 15:48:25] [INFO ] Computed 91 place invariants in 7 ms
[2022-05-15 15:48:26] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/560 places, 392/501 transitions.
Finished structural reductions, in 1 iterations. Remains : 447/560 places, 392/501 transitions.
Support contains 21 out of 447 places after structural reductions.
[2022-05-15 15:48:26] [INFO ] Flatten gal took : 98 ms
[2022-05-15 15:48:26] [INFO ] Flatten gal took : 32 ms
[2022-05-15 15:48:26] [INFO ] Input system was already deterministic with 392 transitions.
Incomplete random walk after 10000 steps, including 75 resets, run finished after 613 ms. (steps per millisecond=16 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 392 rows 447 cols
[2022-05-15 15:48:27] [INFO ] Computed 91 place invariants in 4 ms
[2022-05-15 15:48:27] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-15 15:48:28] [INFO ] [Nat]Absence check using 49 positive place invariants in 29 ms returned sat
[2022-05-15 15:48:28] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 10 ms returned sat
[2022-05-15 15:48:28] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2022-05-15 15:48:28] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 5 ms to minimize.
[2022-05-15 15:48:28] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2022-05-15 15:48:28] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2022-05-15 15:48:28] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2022-05-15 15:48:28] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2022-05-15 15:48:28] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2022-05-15 15:48:29] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2022-05-15 15:48:29] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2022-05-15 15:48:29] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 4 ms to minimize.
[2022-05-15 15:48:29] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2022-05-15 15:48:29] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 750 ms
[2022-05-15 15:48:29] [INFO ] After 1240ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 119 ms.
[2022-05-15 15:48:29] [INFO ] After 1800ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 78 ms.
Support contains 8 out of 447 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 447/447 places, 392/392 transitions.
Graph (trivial) has 197 edges and 447 vertex of which 6 / 447 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 997 edges and 442 vertex of which 441 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 441 transition count 339
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 396 transition count 338
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 395 transition count 338
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 94 place count 395 transition count 246
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 201 rules applied. Total rules applied 295 place count 286 transition count 246
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 297 place count 284 transition count 244
Iterating global reduction 3 with 2 rules applied. Total rules applied 299 place count 284 transition count 244
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 231 rules applied. Total rules applied 530 place count 167 transition count 130
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 532 place count 166 transition count 134
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 534 place count 166 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 536 place count 164 transition count 132
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 537 place count 164 transition count 132
Applied a total of 537 rules in 90 ms. Remains 164 /447 variables (removed 283) and now considering 132/392 (removed 260) transitions.
Finished structural reductions, in 1 iterations. Remains : 164/447 places, 132/392 transitions.
Incomplete random walk after 10000 steps, including 534 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 132 rows 164 cols
[2022-05-15 15:48:29] [INFO ] Computed 71 place invariants in 4 ms
[2022-05-15 15:48:29] [INFO ] [Real]Absence check using 48 positive place invariants in 6 ms returned sat
[2022-05-15 15:48:29] [INFO ] [Real]Absence check using 48 positive and 23 generalized place invariants in 4 ms returned sat
[2022-05-15 15:48:29] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 15:48:29] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-15 15:48:29] [INFO ] After 9ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 15:48:29] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 15:48:29] [INFO ] [Nat]Absence check using 48 positive place invariants in 6 ms returned sat
[2022-05-15 15:48:29] [INFO ] [Nat]Absence check using 48 positive and 23 generalized place invariants in 5 ms returned sat
[2022-05-15 15:48:30] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 15:48:30] [INFO ] After 9ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 15:48:30] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2022-05-15 15:48:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2022-05-15 15:48:30] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-15 15:48:30] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA BusinessProcesses-PT-11-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 432 stabilizing places and 377 stable transitions
Graph (complete) has 1004 edges and 447 vertex of which 446 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' '!(X(F((F(p1)||p0))))'
Support contains 2 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 392/392 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 441 transition count 386
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 441 transition count 386
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 438 transition count 383
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 438 transition count 383
Applied a total of 18 rules in 45 ms. Remains 438 /447 variables (removed 9) and now considering 383/392 (removed 9) transitions.
// Phase 1: matrix 383 rows 438 cols
[2022-05-15 15:48:30] [INFO ] Computed 91 place invariants in 8 ms
[2022-05-15 15:48:30] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 383 rows 438 cols
[2022-05-15 15:48:30] [INFO ] Computed 91 place invariants in 3 ms
[2022-05-15 15:48:30] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 438 cols
[2022-05-15 15:48:30] [INFO ] Computed 91 place invariants in 8 ms
[2022-05-15 15:48:31] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 438/447 places, 383/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 438/447 places, 383/392 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s194 0) (EQ s337 1)), p1:(OR (EQ s194 0) (EQ s337 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 424 ms.
Product exploration explored 100000 steps with 50000 reset in 366 ms.
Computed a total of 423 stabilizing places and 368 stable transitions
Graph (complete) has 992 edges and 438 vertex of which 437 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 423 stabilizing places and 368 stable transitions
Detected a total of 423/438 stabilizing places and 368/383 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-11-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-11-LTLCardinality-00 finished in 2017 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F(p0)))))'
Support contains 2 out of 447 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 447/447 places, 392/392 transitions.
Graph (trivial) has 203 edges and 447 vertex of which 6 / 447 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 998 edges and 442 vertex of which 441 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 440 transition count 335
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 391 transition count 335
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 100 place count 391 transition count 242
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 304 place count 280 transition count 242
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 307 place count 277 transition count 239
Iterating global reduction 2 with 3 rules applied. Total rules applied 310 place count 277 transition count 239
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 310 place count 277 transition count 238
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 312 place count 276 transition count 238
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 229 rules applied. Total rules applied 541 place count 160 transition count 125
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 543 place count 159 transition count 129
Applied a total of 543 rules in 70 ms. Remains 159 /447 variables (removed 288) and now considering 129/392 (removed 263) transitions.
// Phase 1: matrix 129 rows 159 cols
[2022-05-15 15:48:32] [INFO ] Computed 70 place invariants in 1 ms
[2022-05-15 15:48:32] [INFO ] Implicit Places using invariants in 103 ms returned [1, 4, 5, 28, 29, 30, 31, 38, 39, 40, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 105 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/447 places, 129/392 transitions.
Applied a total of 0 rules in 8 ms. Remains 141 /141 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 141/447 places, 129/392 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLCardinality-02 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 s51 0) (NEQ s94 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 1 ms.
FORMULA BusinessProcesses-PT-11-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLCardinality-02 finished in 261 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1&&(!F(X(p1))||p2))))'
Support contains 5 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 392/392 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 441 transition count 386
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 441 transition count 386
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 438 transition count 383
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 438 transition count 383
Applied a total of 18 rules in 49 ms. Remains 438 /447 variables (removed 9) and now considering 383/392 (removed 9) transitions.
// Phase 1: matrix 383 rows 438 cols
[2022-05-15 15:48:32] [INFO ] Computed 91 place invariants in 8 ms
[2022-05-15 15:48:32] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 383 rows 438 cols
[2022-05-15 15:48:32] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-15 15:48:33] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 438 cols
[2022-05-15 15:48:33] [INFO ] Computed 91 place invariants in 4 ms
[2022-05-15 15:48:33] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 438/447 places, 383/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 438/447 places, 383/392 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s292 0) (EQ s284 1)), p0:(OR (EQ s203 0) (EQ s389 1)), p2:(EQ s216 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2619 reset in 216 ms.
Stack based approach found an accepted trace after 78 steps with 2 reset with depth 5 and stack size 5 in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-11-LTLCardinality-03 finished in 1334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 392/392 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 442 transition count 387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 442 transition count 387
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 440 transition count 385
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 440 transition count 385
Applied a total of 14 rules in 29 ms. Remains 440 /447 variables (removed 7) and now considering 385/392 (removed 7) transitions.
// Phase 1: matrix 385 rows 440 cols
[2022-05-15 15:48:33] [INFO ] Computed 91 place invariants in 9 ms
[2022-05-15 15:48:34] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 385 rows 440 cols
[2022-05-15 15:48:34] [INFO ] Computed 91 place invariants in 4 ms
[2022-05-15 15:48:34] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
// Phase 1: matrix 385 rows 440 cols
[2022-05-15 15:48:34] [INFO ] Computed 91 place invariants in 3 ms
[2022-05-15 15:48:34] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 440/447 places, 385/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 440/447 places, 385/392 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s172 0) (NEQ s389 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-11-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLCardinality-04 finished in 1017 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||X(p1))))'
Support contains 3 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 392/392 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 443 transition count 388
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 443 transition count 388
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 441 transition count 386
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 441 transition count 386
Applied a total of 12 rules in 25 ms. Remains 441 /447 variables (removed 6) and now considering 386/392 (removed 6) transitions.
// Phase 1: matrix 386 rows 441 cols
[2022-05-15 15:48:34] [INFO ] Computed 91 place invariants in 5 ms
[2022-05-15 15:48:35] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 386 rows 441 cols
[2022-05-15 15:48:35] [INFO ] Computed 91 place invariants in 8 ms
[2022-05-15 15:48:35] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
// Phase 1: matrix 386 rows 441 cols
[2022-05-15 15:48:35] [INFO ] Computed 91 place invariants in 7 ms
[2022-05-15 15:48:35] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 441/447 places, 386/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 441/447 places, 386/392 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(EQ s117 1), p0:(AND (EQ s56 0) (EQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-11-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLCardinality-05 finished in 1035 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(F(G((X(X(p0))||F(p0)||p1))))))'
Support contains 3 out of 447 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 447/447 places, 392/392 transitions.
Graph (trivial) has 204 edges and 447 vertex of which 6 / 447 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 998 edges and 442 vertex of which 441 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 440 transition count 335
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 391 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 390 transition count 334
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 102 place count 390 transition count 241
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 306 place count 279 transition count 241
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 311 place count 274 transition count 236
Iterating global reduction 3 with 5 rules applied. Total rules applied 316 place count 274 transition count 236
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 316 place count 274 transition count 235
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 318 place count 273 transition count 235
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 225 rules applied. Total rules applied 543 place count 159 transition count 124
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 545 place count 158 transition count 128
Applied a total of 545 rules in 48 ms. Remains 158 /447 variables (removed 289) and now considering 128/392 (removed 264) transitions.
// Phase 1: matrix 128 rows 158 cols
[2022-05-15 15:48:35] [INFO ] Computed 70 place invariants in 1 ms
[2022-05-15 15:48:36] [INFO ] Implicit Places using invariants in 107 ms returned [1, 4, 5, 28, 29, 30, 31, 38, 39, 40, 47, 48, 49, 50, 51, 52, 53]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 108 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/447 places, 128/392 transitions.
Applied a total of 0 rules in 6 ms. Remains 141 /141 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 141/447 places, 128/392 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s64 0) (EQ s36 1)), p0:(EQ s92 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLCardinality-07 finished in 258 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 3 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 392/392 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 441 transition count 386
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 441 transition count 386
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 438 transition count 383
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 438 transition count 383
Applied a total of 18 rules in 24 ms. Remains 438 /447 variables (removed 9) and now considering 383/392 (removed 9) transitions.
// Phase 1: matrix 383 rows 438 cols
[2022-05-15 15:48:36] [INFO ] Computed 91 place invariants in 7 ms
[2022-05-15 15:48:36] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 383 rows 438 cols
[2022-05-15 15:48:36] [INFO ] Computed 91 place invariants in 7 ms
[2022-05-15 15:48:36] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 438 cols
[2022-05-15 15:48:36] [INFO ] Computed 91 place invariants in 5 ms
[2022-05-15 15:48:37] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 438/447 places, 383/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 438/447 places, 383/392 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-11-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s209 1), p0:(OR (EQ s173 0) (EQ s82 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 21056 reset in 208 ms.
Stack based approach found an accepted trace after 349 steps with 80 reset with depth 5 and stack size 5 in 2 ms.
FORMULA BusinessProcesses-PT-11-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-11-LTLCardinality-13 finished in 1205 ms.
All properties solved by simple procedures.
Total runtime 12892 ms.
BK_STOP 1652629717478
--------------------
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-11"
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-11, 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-165251918500403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-11.tgz
mv BusinessProcesses-PT-11 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 ;