Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414900357.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BusinessProcesses-PT-16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414900357
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 159K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716651395054

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-16
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 15:36:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:36:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:36:36] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-25 15:36:36] [INFO ] Transformed 638 places.
[2024-05-25 15:36:36] [INFO ] Transformed 578 transitions.
[2024-05-25 15:36:36] [INFO ] Found NUPN structural information;
[2024-05-25 15:36:36] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 8 places in 22 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 630 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 625 transition count 570
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 98 place count 532 transition count 477
Iterating global reduction 1 with 93 rules applied. Total rules applied 191 place count 532 transition count 477
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 237 place count 486 transition count 431
Iterating global reduction 1 with 46 rules applied. Total rules applied 283 place count 486 transition count 431
Applied a total of 283 rules in 230 ms. Remains 486 /630 variables (removed 144) and now considering 431/570 (removed 139) transitions.
// Phase 1: matrix 431 rows 486 cols
[2024-05-25 15:36:37] [INFO ] Computed 95 invariants in 26 ms
[2024-05-25 15:36:38] [INFO ] Implicit Places using invariants in 1049 ms returned []
[2024-05-25 15:36:38] [INFO ] Invariant cache hit.
[2024-05-25 15:36:39] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 1930 ms to find 0 implicit places.
[2024-05-25 15:36:39] [INFO ] Invariant cache hit.
[2024-05-25 15:36:39] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 486/630 places, 431/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2443 ms. Remains : 486/630 places, 431/570 transitions.
Support contains 29 out of 486 places after structural reductions.
[2024-05-25 15:36:40] [INFO ] Flatten gal took : 86 ms
[2024-05-25 15:36:40] [INFO ] Flatten gal took : 40 ms
[2024-05-25 15:36:40] [INFO ] Input system was already deterministic with 431 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 778 ms. (steps per millisecond=12 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2024-05-25 15:36:41] [INFO ] Invariant cache hit.
[2024-05-25 15:36:42] [INFO ] After 505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-25 15:36:42] [INFO ] [Nat]Absence check using 56 positive place invariants in 25 ms returned sat
[2024-05-25 15:36:42] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 12 ms returned sat
[2024-05-25 15:36:43] [INFO ] After 642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-25 15:36:46] [INFO ] Deduced a trap composed of 14 places in 2916 ms of which 40 ms to minimize.
[2024-05-25 15:36:46] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2024-05-25 15:36:46] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-05-25 15:36:46] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-25 15:36:46] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-05-25 15:36:46] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-25 15:36:46] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 0 ms to minimize.
[2024-05-25 15:36:46] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-25 15:36:47] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2024-05-25 15:36:47] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-25 15:36:47] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-25 15:36:47] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-25 15:36:47] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 0 ms to minimize.
[2024-05-25 15:36:47] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 0 ms to minimize.
[2024-05-25 15:36:47] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-05-25 15:36:47] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-25 15:36:47] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-25 15:36:47] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4723 ms
[2024-05-25 15:36:48] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 0 ms to minimize.
[2024-05-25 15:36:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2024-05-25 15:36:48] [INFO ] Deduced a trap composed of 107 places in 149 ms of which 0 ms to minimize.
[2024-05-25 15:36:48] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 1 ms to minimize.
[2024-05-25 15:36:48] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 2 ms to minimize.
[2024-05-25 15:36:48] [INFO ] Deduced a trap composed of 101 places in 153 ms of which 2 ms to minimize.
[2024-05-25 15:36:48] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 1 ms to minimize.
[2024-05-25 15:36:49] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 1 ms to minimize.
[2024-05-25 15:36:49] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 1 ms to minimize.
[2024-05-25 15:36:49] [INFO ] Deduced a trap composed of 102 places in 183 ms of which 1 ms to minimize.
[2024-05-25 15:36:49] [INFO ] Deduced a trap composed of 89 places in 185 ms of which 0 ms to minimize.
[2024-05-25 15:36:49] [INFO ] Deduced a trap composed of 88 places in 180 ms of which 0 ms to minimize.
[2024-05-25 15:36:50] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 0 ms to minimize.
[2024-05-25 15:36:50] [INFO ] Deduced a trap composed of 95 places in 155 ms of which 1 ms to minimize.
[2024-05-25 15:36:50] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 0 ms to minimize.
[2024-05-25 15:36:50] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 0 ms to minimize.
[2024-05-25 15:36:50] [INFO ] Deduced a trap composed of 99 places in 156 ms of which 1 ms to minimize.
[2024-05-25 15:36:50] [INFO ] Deduced a trap composed of 89 places in 163 ms of which 1 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 1 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 84 places in 154 ms of which 0 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 93 places in 169 ms of which 1 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 0 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3633 ms
[2024-05-25 15:36:52] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 1 ms to minimize.
[2024-05-25 15:36:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2024-05-25 15:36:52] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 1 ms to minimize.
[2024-05-25 15:36:52] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 0 ms to minimize.
[2024-05-25 15:36:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 338 ms
[2024-05-25 15:36:52] [INFO ] After 10204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 494 ms.
[2024-05-25 15:36:53] [INFO ] After 11085ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 5 properties in 229 ms.
Support contains 13 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 431/431 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.8 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 485 transition count 382
Reduce places removed 48 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 51 rules applied. Total rules applied 100 place count 437 transition count 379
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 103 place count 434 transition count 379
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 103 place count 434 transition count 284
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 309 place count 323 transition count 284
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 315 place count 317 transition count 278
Iterating global reduction 3 with 6 rules applied. Total rules applied 321 place count 317 transition count 278
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 321 place count 317 transition count 277
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 323 place count 316 transition count 277
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 3 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 259 rules applied. Total rules applied 582 place count 185 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 583 place count 185 transition count 148
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 4 with 2 rules applied. Total rules applied 585 place count 184 transition count 152
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 591 place count 184 transition count 152
Applied a total of 591 rules in 161 ms. Remains 184 /486 variables (removed 302) and now considering 152/431 (removed 279) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 184/486 places, 152/431 transitions.
Incomplete random walk after 10000 steps, including 809 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 257 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 225 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 230 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 261 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 210 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 225 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 274 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Finished probabilistic random walk after 54776 steps, run visited all 7 properties in 332 ms. (steps per millisecond=164 )
Probabilistic random walk after 54776 steps, saw 14330 distinct states, run finished after 332 ms. (steps per millisecond=164 ) properties seen :7
Parikh walk visited 0 properties in 0 ms.
Computed a total of 127 stabilizing places and 120 stable 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.21 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 431/431 transitions.
Graph (trivial) has 230 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1100 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 479 transition count 369
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 425 transition count 369
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 110 place count 425 transition count 269
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 327 place count 308 transition count 269
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 336 place count 299 transition count 260
Iterating global reduction 2 with 9 rules applied. Total rules applied 345 place count 299 transition count 260
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 345 place count 299 transition count 259
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 347 place count 298 transition count 259
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 600 place count 169 transition count 135
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 602 place count 168 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 603 place count 167 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 604 place count 166 transition count 138
Applied a total of 604 rules in 124 ms. Remains 166 /486 variables (removed 320) and now considering 138/431 (removed 293) transitions.
// Phase 1: matrix 138 rows 166 cols
[2024-05-25 15:36:55] [INFO ] Computed 72 invariants in 13 ms
[2024-05-25 15:36:55] [INFO ] Implicit Places using invariants in 222 ms returned [20, 21, 22, 23, 24, 25, 48, 49, 50, 51]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 226 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/486 places, 138/431 transitions.
Applied a total of 0 rules in 7 ms. Remains 156 /156 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 367 ms. Remains : 156/486 places, 138/431 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 251 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-00 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 s1 0) (EQ s116 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 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-00 finished in 710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
Support contains 4 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 431/431 transitions.
Graph (trivial) has 226 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1100 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 479 transition count 371
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 427 transition count 371
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 106 place count 427 transition count 272
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 320 place count 312 transition count 272
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 328 place count 304 transition count 264
Iterating global reduction 2 with 8 rules applied. Total rules applied 336 place count 304 transition count 264
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 336 place count 304 transition count 263
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 303 transition count 263
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 13 ms
Ensure Unique test removed 5 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 591 place count 174 transition count 139
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 593 place count 173 transition count 143
Applied a total of 593 rules in 118 ms. Remains 173 /486 variables (removed 313) and now considering 143/431 (removed 288) transitions.
// Phase 1: matrix 143 rows 173 cols
[2024-05-25 15:36:56] [INFO ] Computed 74 invariants in 8 ms
[2024-05-25 15:36:56] [INFO ] Implicit Places using invariants in 232 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 24, 25, 26, 27, 50, 51, 52, 53, 54, 138]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 235 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/486 places, 143/431 transitions.
Applied a total of 0 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 359 ms. Remains : 152/486 places, 143/431 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s11 0) (EQ s37 1)), p1:(OR (EQ s113 0) (EQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15205 reset in 411 ms.
Product exploration explored 100000 steps with 15210 reset in 310 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 126 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1676 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 602 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Probably explored full state space saw : 15771 states, properties seen :1
Probabilistic random walk after 56032 steps, saw 15771 distinct states, run finished after 199 ms. (steps per millisecond=281 ) properties seen :1
Explored full state space saw : 15771 states, properties seen :0
Exhaustive walk after 56032 steps, saw 15771 distinct states, run finished after 140 ms. (steps per millisecond=400 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 26 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-16-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-16-LTLCardinality-01 finished in 2167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 431/431 transitions.
Graph (trivial) has 230 edges and 486 vertex of which 6 / 486 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 1100 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 479 transition count 370
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 426 transition count 369
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 425 transition count 369
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 110 place count 425 transition count 270
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 324 place count 310 transition count 270
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 334 place count 300 transition count 260
Iterating global reduction 3 with 10 rules applied. Total rules applied 344 place count 300 transition count 260
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 344 place count 300 transition count 259
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 346 place count 299 transition count 259
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 253 rules applied. Total rules applied 599 place count 170 transition count 135
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 601 place count 169 transition count 139
Applied a total of 601 rules in 59 ms. Remains 169 /486 variables (removed 317) and now considering 139/431 (removed 292) transitions.
// Phase 1: matrix 139 rows 169 cols
[2024-05-25 15:36:58] [INFO ] Computed 74 invariants in 3 ms
[2024-05-25 15:36:58] [INFO ] Implicit Places using invariants in 125 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 49, 50, 51, 52, 53, 138]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 129 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/486 places, 139/431 transitions.
Applied a total of 0 rules in 7 ms. Remains 148 /148 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 195 ms. Remains : 148/486 places, 139/431 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s74 0) (EQ s36 0) (EQ s11 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 20 steps with 2 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-03 finished in 247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 431/431 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 475 transition count 420
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 475 transition count 420
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 471 transition count 416
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 471 transition count 416
Applied a total of 30 rules in 27 ms. Remains 471 /486 variables (removed 15) and now considering 416/431 (removed 15) transitions.
// Phase 1: matrix 416 rows 471 cols
[2024-05-25 15:36:58] [INFO ] Computed 95 invariants in 6 ms
[2024-05-25 15:36:59] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-25 15:36:59] [INFO ] Invariant cache hit.
[2024-05-25 15:36:59] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 964 ms to find 0 implicit places.
[2024-05-25 15:36:59] [INFO ] Invariant cache hit.
[2024-05-25 15:36:59] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/486 places, 416/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1210 ms. Remains : 471/486 places, 416/431 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-05 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:(NEQ s237 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 86 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-05 finished in 1363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 431/431 transitions.
Graph (trivial) has 229 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1100 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 479 transition count 370
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 426 transition count 369
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 425 transition count 369
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 110 place count 425 transition count 270
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 215 rules applied. Total rules applied 325 place count 309 transition count 270
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 334 place count 300 transition count 261
Iterating global reduction 3 with 9 rules applied. Total rules applied 343 place count 300 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 343 place count 300 transition count 260
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 345 place count 299 transition count 260
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 5 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 257 rules applied. Total rules applied 602 place count 168 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 604 place count 167 transition count 138
Applied a total of 604 rules in 44 ms. Remains 167 /486 variables (removed 319) and now considering 138/431 (removed 293) transitions.
// Phase 1: matrix 138 rows 167 cols
[2024-05-25 15:37:00] [INFO ] Computed 73 invariants in 2 ms
[2024-05-25 15:37:00] [INFO ] Implicit Places using invariants in 130 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 51, 52]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 134 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/486 places, 138/431 transitions.
Applied a total of 0 rules in 5 ms. Remains 148 /148 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 183 ms. Remains : 148/486 places, 138/431 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-06 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 s33 0) (EQ s67 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 136 steps with 31 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-06 finished in 237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 431/431 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 476 transition count 421
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 476 transition count 421
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 472 transition count 417
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 472 transition count 417
Applied a total of 28 rules in 26 ms. Remains 472 /486 variables (removed 14) and now considering 417/431 (removed 14) transitions.
// Phase 1: matrix 417 rows 472 cols
[2024-05-25 15:37:00] [INFO ] Computed 95 invariants in 4 ms
[2024-05-25 15:37:00] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-25 15:37:00] [INFO ] Invariant cache hit.
[2024-05-25 15:37:01] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2024-05-25 15:37:01] [INFO ] Invariant cache hit.
[2024-05-25 15:37:01] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/486 places, 417/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 988 ms. Remains : 472/486 places, 417/431 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s300 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-07 finished in 1105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 431/431 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 475 transition count 420
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 475 transition count 420
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 471 transition count 416
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 471 transition count 416
Applied a total of 30 rules in 29 ms. Remains 471 /486 variables (removed 15) and now considering 416/431 (removed 15) transitions.
// Phase 1: matrix 416 rows 471 cols
[2024-05-25 15:37:01] [INFO ] Computed 95 invariants in 10 ms
[2024-05-25 15:37:01] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-25 15:37:01] [INFO ] Invariant cache hit.
[2024-05-25 15:37:02] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
[2024-05-25 15:37:02] [INFO ] Invariant cache hit.
[2024-05-25 15:37:02] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/486 places, 416/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1103 ms. Remains : 471/486 places, 416/431 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-08 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:(EQ s159 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 0 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-08 finished in 1280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 431/431 transitions.
Graph (trivial) has 229 edges and 486 vertex of which 6 / 486 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 1100 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 479 transition count 370
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 426 transition count 370
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 108 place count 426 transition count 270
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 325 place count 309 transition count 270
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 334 place count 300 transition count 261
Iterating global reduction 2 with 9 rules applied. Total rules applied 343 place count 300 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 343 place count 300 transition count 260
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 345 place count 299 transition count 260
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 5 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 257 rules applied. Total rules applied 602 place count 168 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 604 place count 167 transition count 138
Applied a total of 604 rules in 50 ms. Remains 167 /486 variables (removed 319) and now considering 138/431 (removed 293) transitions.
// Phase 1: matrix 138 rows 167 cols
[2024-05-25 15:37:02] [INFO ] Computed 73 invariants in 2 ms
[2024-05-25 15:37:02] [INFO ] Implicit Places using invariants in 154 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 156 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/486 places, 138/431 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 211 ms. Remains : 147/486 places, 138/431 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s118 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-09 finished in 276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 431/431 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 477 transition count 422
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 477 transition count 422
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 475 transition count 420
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 475 transition count 420
Applied a total of 22 rules in 32 ms. Remains 475 /486 variables (removed 11) and now considering 420/431 (removed 11) transitions.
// Phase 1: matrix 420 rows 475 cols
[2024-05-25 15:37:02] [INFO ] Computed 95 invariants in 4 ms
[2024-05-25 15:37:03] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-25 15:37:03] [INFO ] Invariant cache hit.
[2024-05-25 15:37:03] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
[2024-05-25 15:37:03] [INFO ] Invariant cache hit.
[2024-05-25 15:37:03] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 475/486 places, 420/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1056 ms. Remains : 475/486 places, 420/431 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s388 0) (EQ s31 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 592 ms.
Product exploration explored 100000 steps with 50000 reset in 393 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1089 edges and 475 vertex of which 474 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-16-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-16-LTLCardinality-10 finished in 2158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p1)&&p0))||X(p2))))'
Support contains 7 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 431/431 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 477 transition count 422
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 477 transition count 422
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 473 transition count 418
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 473 transition count 418
Applied a total of 26 rules in 24 ms. Remains 473 /486 variables (removed 13) and now considering 418/431 (removed 13) transitions.
// Phase 1: matrix 418 rows 473 cols
[2024-05-25 15:37:05] [INFO ] Computed 95 invariants in 6 ms
[2024-05-25 15:37:05] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-25 15:37:05] [INFO ] Invariant cache hit.
[2024-05-25 15:37:05] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
[2024-05-25 15:37:05] [INFO ] Invariant cache hit.
[2024-05-25 15:37:06] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/486 places, 418/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1042 ms. Remains : 473/486 places, 418/431 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s117 0) (EQ s393 1)), p1:(AND (EQ s438 0) (EQ s167 1)), p2:(AND (EQ s339 0) (EQ s143 1) (EQ s267 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 145 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-12 finished in 1327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 431/431 transitions.
Graph (trivial) has 230 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1100 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 479 transition count 369
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 425 transition count 369
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 110 place count 425 transition count 270
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 215 rules applied. Total rules applied 325 place count 309 transition count 270
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 334 place count 300 transition count 261
Iterating global reduction 2 with 9 rules applied. Total rules applied 343 place count 300 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 343 place count 300 transition count 260
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 345 place count 299 transition count 260
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 604 place count 167 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 606 place count 166 transition count 137
Applied a total of 606 rules in 34 ms. Remains 166 /486 variables (removed 320) and now considering 137/431 (removed 294) transitions.
// Phase 1: matrix 137 rows 166 cols
[2024-05-25 15:37:06] [INFO ] Computed 73 invariants in 2 ms
[2024-05-25 15:37:06] [INFO ] Implicit Places using invariants in 111 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 48, 49, 50, 51, 52]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 112 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/486 places, 137/431 transitions.
Applied a total of 0 rules in 4 ms. Remains 146 /146 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 151 ms. Remains : 146/486 places, 137/431 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s12 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 21706 reset in 179 ms.
Stuttering criterion allowed to conclude after 47464 steps with 10356 reset in 99 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-14 finished in 483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))||p0)))'
Support contains 4 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 431/431 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 475 transition count 420
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 475 transition count 420
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 471 transition count 416
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 471 transition count 416
Applied a total of 30 rules in 22 ms. Remains 471 /486 variables (removed 15) and now considering 416/431 (removed 15) transitions.
// Phase 1: matrix 416 rows 471 cols
[2024-05-25 15:37:06] [INFO ] Computed 95 invariants in 9 ms
[2024-05-25 15:37:07] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-25 15:37:07] [INFO ] Invariant cache hit.
[2024-05-25 15:37:07] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2024-05-25 15:37:07] [INFO ] Invariant cache hit.
[2024-05-25 15:37:07] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/486 places, 416/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 941 ms. Remains : 471/486 places, 416/431 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s100 0) (EQ s311 1)), p1:(AND (NEQ s183 0) (NEQ s462 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 457 ms.
Product exploration explored 100000 steps with 50000 reset in 347 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1081 edges and 471 vertex of which 470 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 25 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-16-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-16-LTLCardinality-15 finished in 1967 ms.
All properties solved by simple procedures.
Total runtime 32129 ms.

BK_STOP 1716651429062

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-16"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is BusinessProcesses-PT-16, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r065-tajo-171620414900357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;