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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 5.8K Apr 30 00:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 00:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 23:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 23:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:10 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 189K 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-19-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652638561997

Running Version 202205111006
[2022-05-15 18:16:03] [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 18:16:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 18:16:03] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2022-05-15 18:16:03] [INFO ] Transformed 772 places.
[2022-05-15 18:16:03] [INFO ] Transformed 685 transitions.
[2022-05-15 18:16:03] [INFO ] Found NUPN structural information;
[2022-05-15 18:16:03] [INFO ] Parsed PT model containing 772 places and 685 transitions in 271 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 15 places in 16 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 751 transition count 670
Discarding 104 places :
Symmetric choice reduction at 1 with 104 rule applications. Total rules 110 place count 647 transition count 566
Iterating global reduction 1 with 104 rules applied. Total rules applied 214 place count 647 transition count 566
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 270 place count 591 transition count 510
Iterating global reduction 1 with 56 rules applied. Total rules applied 326 place count 591 transition count 510
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 327 place count 590 transition count 509
Iterating global reduction 1 with 1 rules applied. Total rules applied 328 place count 590 transition count 509
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 329 place count 589 transition count 508
Iterating global reduction 1 with 1 rules applied. Total rules applied 330 place count 589 transition count 508
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 331 place count 588 transition count 507
Iterating global reduction 1 with 1 rules applied. Total rules applied 332 place count 588 transition count 507
Applied a total of 332 rules in 237 ms. Remains 588 /757 variables (removed 169) and now considering 507/670 (removed 163) transitions.
// Phase 1: matrix 507 rows 588 cols
[2022-05-15 18:16:04] [INFO ] Computed 119 place invariants in 33 ms
[2022-05-15 18:16:04] [INFO ] Implicit Places using invariants in 379 ms returned []
// Phase 1: matrix 507 rows 588 cols
[2022-05-15 18:16:04] [INFO ] Computed 119 place invariants in 13 ms
[2022-05-15 18:16:05] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
// Phase 1: matrix 507 rows 588 cols
[2022-05-15 18:16:05] [INFO ] Computed 119 place invariants in 17 ms
[2022-05-15 18:16:05] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 588/757 places, 507/670 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/757 places, 507/670 transitions.
Support contains 25 out of 588 places after structural reductions.
[2022-05-15 18:16:05] [INFO ] Flatten gal took : 76 ms
[2022-05-15 18:16:05] [INFO ] Flatten gal took : 35 ms
[2022-05-15 18:16:06] [INFO ] Input system was already deterministic with 507 transitions.
Support contains 22 out of 588 places (down from 25) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 545 ms. (steps per millisecond=18 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 507 rows 588 cols
[2022-05-15 18:16:06] [INFO ] Computed 119 place invariants in 6 ms
[2022-05-15 18:16:07] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 18:16:07] [INFO ] [Nat]Absence check using 73 positive place invariants in 30 ms returned sat
[2022-05-15 18:16:07] [INFO ] [Nat]Absence check using 73 positive and 46 generalized place invariants in 18 ms returned sat
[2022-05-15 18:16:07] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 18:16:07] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 5 ms to minimize.
[2022-05-15 18:16:07] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 1 ms to minimize.
[2022-05-15 18:16:08] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2022-05-15 18:16:08] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 1 ms to minimize.
[2022-05-15 18:16:08] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2022-05-15 18:16:08] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 0 ms to minimize.
[2022-05-15 18:16:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 848 ms
[2022-05-15 18:16:08] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2022-05-15 18:16:08] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2022-05-15 18:16:08] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 0 ms to minimize.
[2022-05-15 18:16:08] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2022-05-15 18:16:08] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 0 ms to minimize.
[2022-05-15 18:16:09] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 0 ms to minimize.
[2022-05-15 18:16:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 606 ms
[2022-05-15 18:16:09] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 0 ms to minimize.
[2022-05-15 18:16:09] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2022-05-15 18:16:09] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2022-05-15 18:16:09] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 6 ms to minimize.
[2022-05-15 18:16:09] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 0 ms to minimize.
[2022-05-15 18:16:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 494 ms
[2022-05-15 18:16:09] [INFO ] After 2387ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 140 ms.
[2022-05-15 18:16:09] [INFO ] After 2770ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 76 ms.
Support contains 7 out of 588 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 588/588 places, 507/507 transitions.
Graph (trivial) has 268 edges and 588 vertex of which 6 / 588 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1296 edges and 583 vertex of which 580 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 580 transition count 433
Reduce places removed 66 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 514 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 513 transition count 432
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 121 Pre rules applied. Total rules applied 136 place count 513 transition count 311
Deduced a syphon composed of 121 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 402 place count 368 transition count 311
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 408 place count 362 transition count 305
Iterating global reduction 3 with 6 rules applied. Total rules applied 414 place count 362 transition count 305
Performed 151 Post agglomeration using F-continuation condition.Transition count delta: 151
Deduced a syphon composed of 151 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 720 place count 207 transition count 154
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 722 place count 206 transition count 157
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 724 place count 206 transition count 155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 726 place count 204 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 727 place count 203 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 728 place count 202 transition count 154
Applied a total of 728 rules in 108 ms. Remains 202 /588 variables (removed 386) and now considering 154/507 (removed 353) transitions.
Finished structural reductions, in 1 iterations. Remains : 202/588 places, 154/507 transitions.
Finished random walk after 117 steps, including 7 resets, run visited all 4 properties in 4 ms. (steps per millisecond=29 )
Computed a total of 531 stabilizing places and 460 stable transitions
Graph (complete) has 1303 edges and 588 vertex of which 585 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.24 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(G(F((p0 U p0)))))))'
Support contains 2 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 507/507 transitions.
Graph (trivial) has 274 edges and 588 vertex of which 6 / 588 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 1297 edges and 583 vertex of which 580 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 579 transition count 430
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 140 place count 510 transition count 430
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 122 Pre rules applied. Total rules applied 140 place count 510 transition count 308
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 408 place count 364 transition count 308
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 415 place count 357 transition count 301
Iterating global reduction 2 with 7 rules applied. Total rules applied 422 place count 357 transition count 301
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 311 rules applied. Total rules applied 733 place count 199 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 735 place count 198 transition count 151
Applied a total of 735 rules in 67 ms. Remains 198 /588 variables (removed 390) and now considering 151/507 (removed 356) transitions.
// Phase 1: matrix 151 rows 198 cols
[2022-05-15 18:16:10] [INFO ] Computed 88 place invariants in 3 ms
[2022-05-15 18:16:10] [INFO ] Implicit Places using invariants in 144 ms returned [1, 2, 3, 4, 5, 15, 16, 17, 18, 19, 20, 23, 24, 25, 26, 27, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 147 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 169/588 places, 151/507 transitions.
Applied a total of 0 rules in 9 ms. Remains 169 /169 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 169/588 places, 151/507 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-01 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:(OR (EQ s3 0) (EQ s127 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]]
Product exploration explored 100000 steps with 21361 reset in 453 ms.
Stuttering criterion allowed to conclude after 56592 steps with 12148 reset in 164 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-01 finished in 1073 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 507/507 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 586 transition count 507
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 579 transition count 500
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 578 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 578 transition count 499
Applied a total of 18 rules in 48 ms. Remains 578 /588 variables (removed 10) and now considering 499/507 (removed 8) transitions.
// Phase 1: matrix 499 rows 578 cols
[2022-05-15 18:16:11] [INFO ] Computed 117 place invariants in 15 ms
[2022-05-15 18:16:11] [INFO ] Implicit Places using invariants in 200 ms returned []
// Phase 1: matrix 499 rows 578 cols
[2022-05-15 18:16:11] [INFO ] Computed 117 place invariants in 6 ms
[2022-05-15 18:16:12] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
// Phase 1: matrix 499 rows 578 cols
[2022-05-15 18:16:12] [INFO ] Computed 117 place invariants in 7 ms
[2022-05-15 18:16:12] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 578/588 places, 499/507 transitions.
Finished structural reductions, in 1 iterations. Remains : 578/588 places, 499/507 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-02 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 s220 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 0 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-02 finished in 1273 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&(F(p2)||G(p3)))))'
Support contains 6 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 507/507 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 586 transition count 507
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 581 transition count 502
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 580 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 580 transition count 501
Applied a total of 14 rules in 46 ms. Remains 580 /588 variables (removed 8) and now considering 501/507 (removed 6) transitions.
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:16:12] [INFO ] Computed 117 place invariants in 11 ms
[2022-05-15 18:16:12] [INFO ] Implicit Places using invariants in 213 ms returned []
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:16:12] [INFO ] Computed 117 place invariants in 7 ms
[2022-05-15 18:16:13] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:16:13] [INFO ] Computed 117 place invariants in 4 ms
[2022-05-15 18:16:13] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 580/588 places, 501/507 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/588 places, 501/507 transitions.
Stuttering acceptance computed with spot in 692 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (NOT p2), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), acceptance={} source=1 dest: 4}, { cond=(OR (AND p1 (NOT p2) p3) (AND p0 (NOT p2) p3)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s374 0) (EQ s402 1)), p0:(OR (EQ s431 0) (EQ s114 1)), p2:(AND (EQ s402 0) (EQ s374 1)), p3:(OR (EQ s75 0) (EQ s151 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 968 reset in 308 ms.
Product exploration explored 100000 steps with 969 reset in 260 ms.
Computed a total of 523 stabilizing places and 454 stable transitions
Graph (complete) has 1295 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 523 stabilizing places and 454 stable transitions
Detected a total of 523/580 stabilizing places and 454/501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (OR (AND p1 (NOT p2) p3) (AND p0 (NOT p2) p3))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 927 ms. Reduced automaton from 6 states, 11 edges and 4 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 55 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:16:16] [INFO ] Computed 117 place invariants in 3 ms
[2022-05-15 18:16:16] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 18:16:16] [INFO ] [Nat]Absence check using 70 positive place invariants in 20 ms returned sat
[2022-05-15 18:16:16] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 16 ms returned sat
[2022-05-15 18:16:16] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 18:16:16] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2022-05-15 18:16:16] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 0 ms to minimize.
[2022-05-15 18:16:16] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2022-05-15 18:16:16] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2022-05-15 18:16:17] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2022-05-15 18:16:17] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2022-05-15 18:16:17] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2022-05-15 18:16:17] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2022-05-15 18:16:17] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 0 ms to minimize.
[2022-05-15 18:16:17] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 0 ms to minimize.
[2022-05-15 18:16:17] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 0 ms to minimize.
[2022-05-15 18:16:17] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 956 ms
[2022-05-15 18:16:17] [INFO ] After 1157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-05-15 18:16:17] [INFO ] After 1326ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 580 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 580/580 places, 501/501 transitions.
Graph (trivial) has 267 edges and 580 vertex of which 6 / 580 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1288 edges and 575 vertex of which 574 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 574 transition count 429
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 510 transition count 429
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 130 place count 510 transition count 305
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 273 rules applied. Total rules applied 403 place count 361 transition count 305
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 404 place count 360 transition count 304
Iterating global reduction 2 with 1 rules applied. Total rules applied 405 place count 360 transition count 304
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 311 rules applied. Total rules applied 716 place count 202 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 718 place count 201 transition count 154
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 720 place count 201 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 722 place count 199 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 723 place count 198 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 724 place count 197 transition count 151
Applied a total of 724 rules in 61 ms. Remains 197 /580 variables (removed 383) and now considering 151/501 (removed 350) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/580 places, 151/501 transitions.
Finished random walk after 44 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (OR (AND p1 (NOT p2) p3) (AND p0 (NOT p2) p3))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) p3))), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 15 factoid took 978 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 97 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 4 out of 580 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 501/501 transitions.
Applied a total of 0 rules in 18 ms. Remains 580 /580 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:16:18] [INFO ] Computed 117 place invariants in 5 ms
[2022-05-15 18:16:19] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:16:19] [INFO ] Computed 117 place invariants in 4 ms
[2022-05-15 18:16:19] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:16:19] [INFO ] Computed 117 place invariants in 4 ms
[2022-05-15 18:16:20] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/580 places, 501/501 transitions.
Computed a total of 523 stabilizing places and 454 stable transitions
Graph (complete) has 1295 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 523 stabilizing places and 454 stable transitions
Detected a total of 523/580 stabilizing places and 454/501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 268 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 54 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:16:20] [INFO ] Computed 117 place invariants in 12 ms
[2022-05-15 18:16:20] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 18:16:20] [INFO ] [Nat]Absence check using 70 positive place invariants in 18 ms returned sat
[2022-05-15 18:16:20] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 19 ms returned sat
[2022-05-15 18:16:20] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 18:16:20] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2022-05-15 18:16:21] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2022-05-15 18:16:21] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2022-05-15 18:16:21] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2022-05-15 18:16:21] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 4 ms to minimize.
[2022-05-15 18:16:21] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2022-05-15 18:16:21] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2022-05-15 18:16:21] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2022-05-15 18:16:21] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 0 ms to minimize.
[2022-05-15 18:16:21] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2022-05-15 18:16:21] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2022-05-15 18:16:21] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 993 ms
[2022-05-15 18:16:21] [INFO ] After 1199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-05-15 18:16:21] [INFO ] After 1350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 580 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 580/580 places, 501/501 transitions.
Graph (trivial) has 267 edges and 580 vertex of which 6 / 580 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1288 edges and 575 vertex of which 574 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 574 transition count 429
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 510 transition count 429
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 130 place count 510 transition count 305
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 273 rules applied. Total rules applied 403 place count 361 transition count 305
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 404 place count 360 transition count 304
Iterating global reduction 2 with 1 rules applied. Total rules applied 405 place count 360 transition count 304
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 311 rules applied. Total rules applied 716 place count 202 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 718 place count 201 transition count 154
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 720 place count 201 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 722 place count 199 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 723 place count 198 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 724 place count 197 transition count 151
Applied a total of 724 rules in 53 ms. Remains 197 /580 variables (removed 383) and now considering 151/501 (removed 350) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/580 places, 151/501 transitions.
Finished random walk after 40 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND (NOT p2) p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) p3))), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 8 factoid took 380 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 104 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 966 reset in 199 ms.
Product exploration explored 100000 steps with 974 reset in 208 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 4 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 501/501 transitions.
Graph (trivial) has 267 edges and 580 vertex of which 6 / 580 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 1289 edges and 575 vertex of which 574 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 574 transition count 494
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 88 Pre rules applied. Total rules applied 65 place count 574 transition count 560
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 153 place count 574 transition count 560
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 176 place count 551 transition count 518
Deduced a syphon composed of 129 places in 1 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 199 place count 551 transition count 518
Performed 189 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 318 places in 1 ms
Iterating global reduction 1 with 189 rules applied. Total rules applied 388 place count 551 transition count 518
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 435 place count 504 transition count 471
Deduced a syphon composed of 271 places in 0 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 482 place count 504 transition count 471
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 272 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 483 place count 504 transition count 483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 484 place count 503 transition count 481
Deduced a syphon composed of 271 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 485 place count 503 transition count 481
Deduced a syphon composed of 271 places in 0 ms
Applied a total of 485 rules in 107 ms. Remains 503 /580 variables (removed 77) and now considering 481/501 (removed 20) transitions.
[2022-05-15 18:16:23] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 481 rows 503 cols
[2022-05-15 18:16:23] [INFO ] Computed 117 place invariants in 6 ms
[2022-05-15 18:16:23] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/580 places, 481/501 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/580 places, 481/501 transitions.
Product exploration explored 100000 steps with 15904 reset in 924 ms.
Product exploration explored 100000 steps with 15913 reset in 798 ms.
Built C files in :
/tmp/ltsmin1808833364214767536
[2022-05-15 18:16:25] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1808833364214767536
Running compilation step : cd /tmp/ltsmin1808833364214767536;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 833 ms.
Running link step : cd /tmp/ltsmin1808833364214767536;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin1808833364214767536;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2766556559461792664.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 501/501 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 579 transition count 500
Applied a total of 2 rules in 36 ms. Remains 579 /580 variables (removed 1) and now considering 500/501 (removed 1) transitions.
// Phase 1: matrix 500 rows 579 cols
[2022-05-15 18:16:40] [INFO ] Computed 117 place invariants in 9 ms
[2022-05-15 18:16:40] [INFO ] Implicit Places using invariants in 203 ms returned []
// Phase 1: matrix 500 rows 579 cols
[2022-05-15 18:16:40] [INFO ] Computed 117 place invariants in 3 ms
[2022-05-15 18:16:41] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 962 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 579 cols
[2022-05-15 18:16:41] [INFO ] Computed 117 place invariants in 9 ms
[2022-05-15 18:16:41] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 579/580 places, 500/501 transitions.
Finished structural reductions, in 1 iterations. Remains : 579/580 places, 500/501 transitions.
Built C files in :
/tmp/ltsmin3660714030667850873
[2022-05-15 18:16:41] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3660714030667850873
Running compilation step : cd /tmp/ltsmin3660714030667850873;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 737 ms.
Running link step : cd /tmp/ltsmin3660714030667850873;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3660714030667850873;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18093966220685717075.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 18:16:57] [INFO ] Flatten gal took : 29 ms
[2022-05-15 18:16:57] [INFO ] Flatten gal took : 25 ms
[2022-05-15 18:16:57] [INFO ] Time to serialize gal into /tmp/LTL3958847715485412401.gal : 333 ms
[2022-05-15 18:16:57] [INFO ] Time to serialize properties into /tmp/LTL8878646767452888937.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3958847715485412401.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8878646767452888937.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3958847...266
Read 1 LTL properties
Checking formula 0 : !((X((("((p514==0)||(p125==1))")U("((p445==0)||(p479==1))"))&&((F("((p479==0)&&(p445==1))"))||(G("((p80==0)||(p170==1))"))))))
Formula 0 simplified : !X(("((p514==0)||(p125==1))" U "((p445==0)||(p479==1))") & (F"((p479==0)&&(p445==1))" | G"((p80==0)||(p170==1))"))
Detected timeout of ITS tools.
[2022-05-15 18:17:12] [INFO ] Flatten gal took : 26 ms
[2022-05-15 18:17:12] [INFO ] Applying decomposition
[2022-05-15 18:17:12] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10153747415827129058.txt' '-o' '/tmp/graph10153747415827129058.bin' '-w' '/tmp/graph10153747415827129058.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10153747415827129058.bin' '-l' '-1' '-v' '-w' '/tmp/graph10153747415827129058.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:17:12] [INFO ] Decomposing Gal with order
[2022-05-15 18:17:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:17:12] [INFO ] Removed a total of 287 redundant transitions.
[2022-05-15 18:17:13] [INFO ] Flatten gal took : 500 ms
[2022-05-15 18:17:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 21 ms.
[2022-05-15 18:17:13] [INFO ] Time to serialize gal into /tmp/LTL2463428225841181039.gal : 10 ms
[2022-05-15 18:17:13] [INFO ] Time to serialize properties into /tmp/LTL18285047076301714122.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2463428225841181039.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18285047076301714122.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2463428...246
Read 1 LTL properties
Checking formula 0 : !((X((("((i7.i3.u150.p514==0)||(i3.u45.p125==1))")U("((i5.i3.u135.p445==0)||(i10.i2.u141.p479==1))"))&&((F("((i10.i2.u141.p479==0)&&(i...232
Formula 0 simplified : !X(("((i7.i3.u150.p514==0)||(i3.u45.p125==1))" U "((i5.i3.u135.p445==0)||(i10.i2.u141.p479==1))") & (F"((i10.i2.u141.p479==0)&&(i5.i...222
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t207, t291, t304, t316, t349, t394, t397, t470, t475, t477, t479, t480, t482...1595
Computing Next relation with stutter on 109584 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17816889080369590128
[2022-05-15 18:17:28] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17816889080369590128
Running compilation step : cd /tmp/ltsmin17816889080369590128;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 726 ms.
Running link step : cd /tmp/ltsmin17816889080369590128;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17816889080369590128;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp0==true) U (LTLAPp1==true))&&(<>((LTLAPp2==true))||[]((LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-19-LTLCardinality-05 finished in 91064 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 507/507 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 586 transition count 507
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 580 transition count 501
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 579 transition count 500
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 579 transition count 500
Applied a total of 16 rules in 47 ms. Remains 579 /588 variables (removed 9) and now considering 500/507 (removed 7) transitions.
// Phase 1: matrix 500 rows 579 cols
[2022-05-15 18:17:43] [INFO ] Computed 117 place invariants in 11 ms
[2022-05-15 18:17:43] [INFO ] Implicit Places using invariants in 217 ms returned []
// Phase 1: matrix 500 rows 579 cols
[2022-05-15 18:17:43] [INFO ] Computed 117 place invariants in 4 ms
[2022-05-15 18:17:44] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 579 cols
[2022-05-15 18:17:44] [INFO ] Computed 117 place invariants in 4 ms
[2022-05-15 18:17:44] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 579/588 places, 500/507 transitions.
Finished structural reductions, in 1 iterations. Remains : 579/588 places, 500/507 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s386 0) (EQ s213 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-07 finished in 1375 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(p0))))'
Support contains 2 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 507/507 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 586 transition count 507
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 580 transition count 501
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 579 transition count 500
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 579 transition count 500
Applied a total of 16 rules in 33 ms. Remains 579 /588 variables (removed 9) and now considering 500/507 (removed 7) transitions.
// Phase 1: matrix 500 rows 579 cols
[2022-05-15 18:17:44] [INFO ] Computed 117 place invariants in 8 ms
[2022-05-15 18:17:45] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 500 rows 579 cols
[2022-05-15 18:17:45] [INFO ] Computed 117 place invariants in 11 ms
[2022-05-15 18:17:45] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 954 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 579 cols
[2022-05-15 18:17:45] [INFO ] Computed 117 place invariants in 3 ms
[2022-05-15 18:17:46] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 579/588 places, 500/507 transitions.
Finished structural reductions, in 1 iterations. Remains : 579/588 places, 500/507 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s121 0) (EQ s148 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, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 327 ms.
Product exploration explored 100000 steps with 33333 reset in 339 ms.
Computed a total of 522 stabilizing places and 453 stable transitions
Graph (complete) has 1294 edges and 579 vertex of which 578 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 522 stabilizing places and 453 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 56 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-19-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-19-LTLCardinality-09 finished in 2109 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 507/507 transitions.
Graph (trivial) has 273 edges and 588 vertex of which 6 / 588 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 1297 edges and 583 vertex of which 580 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 579 transition count 431
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 511 transition count 431
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 138 place count 511 transition count 307
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 273 rules applied. Total rules applied 411 place count 362 transition count 307
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 418 place count 355 transition count 300
Iterating global reduction 2 with 7 rules applied. Total rules applied 425 place count 355 transition count 300
Performed 152 Post agglomeration using F-continuation condition.Transition count delta: 152
Deduced a syphon composed of 152 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 2 with 309 rules applied. Total rules applied 734 place count 198 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 736 place count 197 transition count 151
Applied a total of 736 rules in 40 ms. Remains 197 /588 variables (removed 391) and now considering 151/507 (removed 356) transitions.
// Phase 1: matrix 151 rows 197 cols
[2022-05-15 18:17:47] [INFO ] Computed 87 place invariants in 3 ms
[2022-05-15 18:17:47] [INFO ] Implicit Places using invariants in 141 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 47, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 142 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/588 places, 151/507 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 170/588 places, 151/507 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-10 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 (NEQ s83 0) (NEQ s33 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 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-10 finished in 227 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 507/507 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 586 transition count 507
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 579 transition count 500
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 578 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 578 transition count 499
Applied a total of 18 rules in 42 ms. Remains 578 /588 variables (removed 10) and now considering 499/507 (removed 8) transitions.
// Phase 1: matrix 499 rows 578 cols
[2022-05-15 18:17:47] [INFO ] Computed 117 place invariants in 8 ms
[2022-05-15 18:17:47] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 499 rows 578 cols
[2022-05-15 18:17:47] [INFO ] Computed 117 place invariants in 4 ms
[2022-05-15 18:17:48] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
// Phase 1: matrix 499 rows 578 cols
[2022-05-15 18:17:48] [INFO ] Computed 117 place invariants in 8 ms
[2022-05-15 18:17:48] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 578/588 places, 499/507 transitions.
Finished structural reductions, in 1 iterations. Remains : 578/588 places, 499/507 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s209 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 1558 reset in 157 ms.
Stack based approach found an accepted trace after 155 steps with 2 reset with depth 5 and stack size 5 in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-13 finished in 1450 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!F(F(!(G(p1)&&p2))))))'
Support contains 7 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 507/507 transitions.
Graph (trivial) has 270 edges and 588 vertex of which 6 / 588 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 1297 edges and 583 vertex of which 582 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 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 581 transition count 434
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 516 transition count 434
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 132 place count 516 transition count 310
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 273 rules applied. Total rules applied 405 place count 367 transition count 310
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 410 place count 362 transition count 305
Iterating global reduction 2 with 5 rules applied. Total rules applied 415 place count 362 transition count 305
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 305 rules applied. Total rules applied 720 place count 207 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 722 place count 206 transition count 158
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 723 place count 205 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 724 place count 204 transition count 157
Applied a total of 724 rules in 43 ms. Remains 204 /588 variables (removed 384) and now considering 157/507 (removed 350) transitions.
// Phase 1: matrix 157 rows 204 cols
[2022-05-15 18:17:48] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-15 18:17:48] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 157 rows 204 cols
[2022-05-15 18:17:48] [INFO ] Computed 88 place invariants in 2 ms
[2022-05-15 18:17:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 18:17:49] [INFO ] Implicit Places using invariants and state equation in 231 ms returned [132, 134, 136, 138, 140, 142, 144]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 359 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 197/588 places, 157/507 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 197 transition count 155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 195 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 194 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 194 transition count 154
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 194 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8 place count 193 transition count 153
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 12 place count 191 transition count 151
Applied a total of 12 rules in 18 ms. Remains 191 /197 variables (removed 6) and now considering 151/157 (removed 6) transitions.
// Phase 1: matrix 151 rows 191 cols
[2022-05-15 18:17:49] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-15 18:17:49] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 151 rows 191 cols
[2022-05-15 18:17:49] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-15 18:17:49] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-15 18:17:49] [INFO ] Implicit Places using invariants and state equation in 262 ms returned [54, 55, 56, 57, 58]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 365 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 186/588 places, 151/507 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 150
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 149
Applied a total of 3 rules in 9 ms. Remains 185 /186 variables (removed 1) and now considering 149/151 (removed 2) transitions.
// Phase 1: matrix 149 rows 185 cols
[2022-05-15 18:17:49] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-15 18:17:49] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 149 rows 185 cols
[2022-05-15 18:17:49] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-15 18:17:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 18:17:49] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 185/588 places, 149/507 transitions.
Finished structural reductions, in 3 iterations. Remains : 185/588 places, 149/507 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2 p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s124 0) (EQ s78 1)), p2:(EQ s52 1), p0:(AND (OR (EQ s151 0) (EQ s58 1)) (OR (EQ s57 0) (EQ s119 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-15 finished in 1333 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&(F(p2)||G(p3)))))'
[2022-05-15 18:17:50] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13915533399066300031
[2022-05-15 18:17:50] [INFO ] Computing symmetric may disable matrix : 507 transitions.
[2022-05-15 18:17:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 18:17:50] [INFO ] Computing symmetric may enable matrix : 507 transitions.
[2022-05-15 18:17:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 18:17:50] [INFO ] Applying decomposition
[2022-05-15 18:17:50] [INFO ] Flatten gal took : 40 ms
[2022-05-15 18:17:50] [INFO ] Computing Do-Not-Accords matrix : 507 transitions.
[2022-05-15 18:17:50] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 18:17:50] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13915533399066300031
Running compilation step : cd /tmp/ltsmin13915533399066300031;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3970396727847547552.txt' '-o' '/tmp/graph3970396727847547552.bin' '-w' '/tmp/graph3970396727847547552.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3970396727847547552.bin' '-l' '-1' '-v' '-w' '/tmp/graph3970396727847547552.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:17:50] [INFO ] Decomposing Gal with order
[2022-05-15 18:17:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:17:50] [INFO ] Removed a total of 285 redundant transitions.
[2022-05-15 18:17:50] [INFO ] Flatten gal took : 34 ms
[2022-05-15 18:17:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 9 ms.
[2022-05-15 18:17:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality1339819566731671220.gal : 6 ms
[2022-05-15 18:17:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality15525660451906263896.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1339819566731671220.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15525660451906263896.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 1 LTL properties
Checking formula 0 : !((X((("((i19.i1.u150.p514==0)||(i6.u44.p125==1))")U("((i12.i1.u134.p445==0)||(i18.i1.u143.p479==1))"))&&((F("((i18.i1.u143.p479==0)&&...235
Formula 0 simplified : !X(("((i19.i1.u150.p514==0)||(i6.u44.p125==1))" U "((i12.i1.u134.p445==0)||(i18.i1.u143.p479==1))") & (F"((i18.i1.u143.p479==0)&&(i1...225
Compilation finished in 1065 ms.
Running link step : cd /tmp/ltsmin13915533399066300031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13915533399066300031;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp0==true) U (LTLAPp1==true))&&(<>((LTLAPp2==true))||[]((LTLAPp3==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t29, t207, t308, t312, t394, t397, t471, t475, t477, t480, t482, t484, t493,...1641
Computing Next relation with stutter on 109584 deadlock states
Detected timeout of ITS tools.
[2022-05-15 18:38:26] [INFO ] Applying decomposition
[2022-05-15 18:38:26] [INFO ] Flatten gal took : 51 ms
[2022-05-15 18:38:26] [INFO ] Decomposing Gal with order
[2022-05-15 18:38:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:38:26] [INFO ] Removed a total of 146 redundant transitions.
[2022-05-15 18:38:26] [INFO ] Flatten gal took : 105 ms
[2022-05-15 18:38:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 633 ms.
[2022-05-15 18:38:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality12527897912190761114.gal : 9 ms
[2022-05-15 18:38:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality3228295125781737348.ltl : 20 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12527897912190761114.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3228295125781737348.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 1 LTL properties
Checking formula 0 : !((X((("((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.u158.p514==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....702
Formula 0 simplified : !X(("((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.u158.p514==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u...692
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.018: LTL layer: formula: X((((LTLAPp0==true) U (LTLAPp1==true))&&(<>((LTLAPp2==true))||[]((LTLAPp3==true)))))
pins2lts-mc-linux64( 2/ 8), 0.018: "X((((LTLAPp0==true) U (LTLAPp1==true))&&(<>((LTLAPp2==true))||[]((LTLAPp3==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.018: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.047: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.117: DFS-FIFO for weak LTL, using special progress label 512
pins2lts-mc-linux64( 0/ 8), 0.117: There are 513 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.117: State length is 589, there are 524 groups
pins2lts-mc-linux64( 0/ 8), 0.117: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.117: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.117: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.117: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.167: ~1 levels ~960 states ~4552 transitions
pins2lts-mc-linux64( 4/ 8), 0.188: ~1 levels ~1920 states ~9224 transitions
pins2lts-mc-linux64( 4/ 8), 0.280: ~1 levels ~3840 states ~20400 transitions
pins2lts-mc-linux64( 4/ 8), 0.451: ~1 levels ~7680 states ~44432 transitions
pins2lts-mc-linux64( 4/ 8), 0.771: ~1 levels ~15360 states ~102144 transitions
pins2lts-mc-linux64( 5/ 8), 1.342: ~1 levels ~30720 states ~233648 transitions
pins2lts-mc-linux64( 7/ 8), 2.284: ~1 levels ~61440 states ~472928 transitions
pins2lts-mc-linux64( 7/ 8), 4.176: ~1 levels ~122880 states ~1066792 transitions
pins2lts-mc-linux64( 7/ 8), 7.637: ~1 levels ~245760 states ~2220248 transitions
pins2lts-mc-linux64( 4/ 8), 13.994: ~1 levels ~491520 states ~4715368 transitions
pins2lts-mc-linux64( 4/ 8), 26.354: ~1 levels ~983040 states ~9997480 transitions
pins2lts-mc-linux64( 7/ 8), 51.277: ~1 levels ~1966080 states ~20466672 transitions
pins2lts-mc-linux64( 4/ 8), 103.092: ~1 levels ~3932160 states ~44491624 transitions
pins2lts-mc-linux64( 4/ 8), 208.243: ~1 levels ~7864320 states ~93340768 transitions
pins2lts-mc-linux64( 4/ 8), 433.999: ~1 levels ~15728640 states ~195989808 transitions
pins2lts-mc-linux64( 2/ 8), 886.811: ~1 levels ~31457280 states ~406658280 transitions
pins2lts-mc-linux64( 7/ 8), 1826.979: ~1 levels ~62914560 states ~851564032 transitions
pins2lts-mc-linux64( 5/ 8), 2037.976: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2037.994:
pins2lts-mc-linux64( 0/ 8), 2037.994: mean standard work distribution: 3.1% (states) 3.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 2037.994:
pins2lts-mc-linux64( 0/ 8), 2037.994: Explored 67417707 states 990137168 transitions, fanout: 14.687
pins2lts-mc-linux64( 0/ 8), 2037.994: Total exploration time 2037.870 sec (2037.850 sec minimum, 2037.859 sec on average)
pins2lts-mc-linux64( 0/ 8), 2037.994: States per second: 33082, Transitions per second: 485869
pins2lts-mc-linux64( 0/ 8), 2037.994:
pins2lts-mc-linux64( 0/ 8), 2037.994: Progress states detected: 134209376
pins2lts-mc-linux64( 0/ 8), 2037.994: Redundant explorations: -49.7668
pins2lts-mc-linux64( 0/ 8), 2037.994:
pins2lts-mc-linux64( 0/ 8), 2037.994: Queue width: 8B, total height: 111233838, memory: 848.65MB
pins2lts-mc-linux64( 0/ 8), 2037.994: Tree memory: 1101.5MB, 8.6 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 2037.994: Tree fill ratio (roots/leafs): 99.0%/30.0%
pins2lts-mc-linux64( 0/ 8), 2037.994: Stored 585 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2037.994: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2037.994: Est. total memory use: 1950.2MB (~1872.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13915533399066300031;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp0==true) U (LTLAPp1==true))&&(<>((LTLAPp2==true))||[]((LTLAPp3==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13915533399066300031;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp0==true) U (LTLAPp1==true))&&(<>((LTLAPp2==true))||[]((LTLAPp3==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-15 18:59:04] [INFO ] Flatten gal took : 384 ms
[2022-05-15 18:59:12] [INFO ] Input system was already deterministic with 507 transitions.
[2022-05-15 18:59:12] [INFO ] Transformed 588 places.
[2022-05-15 18:59:12] [INFO ] Transformed 507 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 18:59:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality13288925950434802382.gal : 9 ms
[2022-05-15 18:59:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality7009088516243599512.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13288925950434802382.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7009088516243599512.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((("((p514==0)||(p125==1))")U("((p445==0)||(p479==1))"))&&((F("((p479==0)&&(p445==1))"))||(G("((p80==0)||(p170==1))"))))))
Formula 0 simplified : !X(("((p514==0)||(p125==1))" U "((p445==0)||(p479==1))") & (F"((p479==0)&&(p445==1))" | G"((p80==0)||(p170==1))"))

BK_TIME_CONFINEMENT_REACHED

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

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