Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 11 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 16:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 131K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716650908921

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 15:28:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:28:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:28:32] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2024-05-25 15:28:32] [INFO ] Transformed 518 places.
[2024-05-25 15:28:33] [INFO ] Transformed 471 transitions.
[2024-05-25 15:28:33] [INFO ] Found NUPN structural information;
[2024-05-25 15:28:33] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 351 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA BusinessProcesses-PT-10-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 471/471 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 471
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 72 place count 446 transition count 400
Iterating global reduction 1 with 71 rules applied. Total rules applied 143 place count 446 transition count 400
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 178 place count 411 transition count 365
Iterating global reduction 1 with 35 rules applied. Total rules applied 213 place count 411 transition count 365
Applied a total of 213 rules in 142 ms. Remains 411 /518 variables (removed 107) and now considering 365/471 (removed 106) transitions.
// Phase 1: matrix 365 rows 411 cols
[2024-05-25 15:28:33] [INFO ] Computed 84 invariants in 42 ms
[2024-05-25 15:28:33] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-25 15:28:33] [INFO ] Invariant cache hit.
[2024-05-25 15:28:34] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
[2024-05-25 15:28:34] [INFO ] Invariant cache hit.
[2024-05-25 15:28:34] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 411/518 places, 365/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1325 ms. Remains : 411/518 places, 365/471 transitions.
Support contains 28 out of 411 places after structural reductions.
[2024-05-25 15:28:34] [INFO ] Flatten gal took : 74 ms
[2024-05-25 15:28:34] [INFO ] Flatten gal took : 27 ms
[2024-05-25 15:28:34] [INFO ] Input system was already deterministic with 365 transitions.
Support contains 27 out of 411 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 81 resets, run finished after 660 ms. (steps per millisecond=15 ) properties (out of 25) seen :14
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-25 15:28:36] [INFO ] Invariant cache hit.
[2024-05-25 15:28:36] [INFO ] [Real]Absence check using 45 positive place invariants in 42 ms returned sat
[2024-05-25 15:28:36] [INFO ] [Real]Absence check using 45 positive and 39 generalized place invariants in 12 ms returned sat
[2024-05-25 15:28:36] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:9
[2024-05-25 15:28:36] [INFO ] [Nat]Absence check using 45 positive place invariants in 12 ms returned sat
[2024-05-25 15:28:36] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 50 ms returned sat
[2024-05-25 15:28:37] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :6
[2024-05-25 15:28:37] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 7 ms to minimize.
[2024-05-25 15:28:37] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-25 15:28:37] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2024-05-25 15:28:37] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 3 ms to minimize.
[2024-05-25 15:28:37] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 0 ms to minimize.
[2024-05-25 15:28:38] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-25 15:28:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 811 ms
[2024-05-25 15:28:40] [INFO ] Deduced a trap composed of 77 places in 2530 ms of which 1 ms to minimize.
[2024-05-25 15:28:40] [INFO ] Deduced a trap composed of 93 places in 167 ms of which 1 ms to minimize.
[2024-05-25 15:28:41] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 1 ms to minimize.
[2024-05-25 15:28:41] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 0 ms to minimize.
[2024-05-25 15:28:41] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 5 ms to minimize.
[2024-05-25 15:28:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3203 ms
[2024-05-25 15:28:41] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 1 ms to minimize.
[2024-05-25 15:28:41] [INFO ] Deduced a trap composed of 74 places in 159 ms of which 1 ms to minimize.
[2024-05-25 15:28:41] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 0 ms to minimize.
[2024-05-25 15:28:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 461 ms
[2024-05-25 15:28:41] [INFO ] Deduced a trap composed of 73 places in 145 ms of which 1 ms to minimize.
[2024-05-25 15:28:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2024-05-25 15:28:42] [INFO ] After 5066ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :6
Attempting to minimize the solution found.
Minimization took 131 ms.
[2024-05-25 15:28:42] [INFO ] After 5594ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :6
Fused 11 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 74 ms.
Support contains 5 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 365/365 transitions.
Graph (trivial) has 181 edges and 411 vertex of which 6 / 411 are part of one of the 1 SCC in 31 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 933 edges and 406 vertex of which 405 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 405 transition count 318
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 366 transition count 317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 365 transition count 317
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 82 place count 365 transition count 232
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 264 place count 268 transition count 232
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 270 place count 262 transition count 226
Iterating global reduction 3 with 6 rules applied. Total rules applied 276 place count 262 transition count 226
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 481 place count 157 transition count 126
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 3 with 2 rules applied. Total rules applied 483 place count 156 transition count 129
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 485 place count 156 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 487 place count 154 transition count 127
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 488 place count 154 transition count 127
Applied a total of 488 rules in 178 ms. Remains 154 /411 variables (removed 257) and now considering 127/365 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 154/411 places, 127/365 transitions.
Finished random walk after 275 steps, including 10 resets, run visited all 5 properties in 4 ms. (steps per millisecond=68 )
Parikh walk visited 0 properties in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 10 simplifications.
FORMULA BusinessProcesses-PT-10-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 201 stabilizing places and 206 stable transitions
Graph (complete) has 940 edges and 411 vertex of which 410 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
FORMULA BusinessProcesses-PT-10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F((p1&&X(p2))))))'
Support contains 4 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 365/365 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 403 transition count 357
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 403 transition count 357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 402 transition count 356
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 402 transition count 356
Applied a total of 18 rules in 73 ms. Remains 402 /411 variables (removed 9) and now considering 356/365 (removed 9) transitions.
// Phase 1: matrix 356 rows 402 cols
[2024-05-25 15:28:43] [INFO ] Computed 84 invariants in 14 ms
[2024-05-25 15:28:43] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-25 15:28:43] [INFO ] Invariant cache hit.
[2024-05-25 15:28:44] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2024-05-25 15:28:44] [INFO ] Invariant cache hit.
[2024-05-25 15:28:44] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 402/411 places, 356/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1171 ms. Remains : 402/411 places, 356/365 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 366 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s48 1), p2:(EQ s149 1), p0:(OR (EQ s227 0) (EQ s344 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 111 steps with 0 reset in 9 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-02 finished in 1648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 365/365 transitions.
Graph (trivial) has 188 edges and 411 vertex of which 6 / 411 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 934 edges and 406 vertex of which 405 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 404 transition count 315
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 362 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 361 transition count 314
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 88 place count 361 transition count 229
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 183 rules applied. Total rules applied 271 place count 263 transition count 229
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 278 place count 256 transition count 222
Iterating global reduction 3 with 7 rules applied. Total rules applied 285 place count 256 transition count 222
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 494 place count 149 transition count 120
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 496 place count 148 transition count 123
Applied a total of 496 rules in 79 ms. Remains 148 /411 variables (removed 263) and now considering 123/365 (removed 242) transitions.
// Phase 1: matrix 123 rows 148 cols
[2024-05-25 15:28:45] [INFO ] Computed 66 invariants in 2 ms
[2024-05-25 15:28:45] [INFO ] Implicit Places using invariants in 146 ms returned [1, 2, 3, 4, 5, 6, 7, 20, 21, 22, 23, 24, 25, 48, 49]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 150 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/411 places, 123/365 transitions.
Applied a total of 0 rules in 6 ms. Remains 133 /133 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 236 ms. Remains : 133/411 places, 123/365 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s47 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 55 steps with 8 reset in 5 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-04 finished in 348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 365/365 transitions.
Graph (trivial) has 188 edges and 411 vertex of which 6 / 411 are part of one of the 1 SCC in 10 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 934 edges and 406 vertex of which 405 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 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 404 transition count 315
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 362 transition count 315
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 86 place count 362 transition count 229
Deduced a syphon composed of 86 places in 3 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 271 place count 263 transition count 229
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 279 place count 255 transition count 221
Iterating global reduction 2 with 8 rules applied. Total rules applied 287 place count 255 transition count 221
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 496 place count 148 transition count 119
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 498 place count 147 transition count 122
Applied a total of 498 rules in 69 ms. Remains 147 /411 variables (removed 264) and now considering 122/365 (removed 243) transitions.
// Phase 1: matrix 122 rows 147 cols
[2024-05-25 15:28:45] [INFO ] Computed 66 invariants in 4 ms
[2024-05-25 15:28:53] [INFO ] Implicit Places using invariants in 8327 ms returned [1, 2, 3, 4, 5, 6, 7, 20, 21, 22, 23, 24, 25, 49, 50]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 8338 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/411 places, 122/365 transitions.
Applied a total of 0 rules in 6 ms. Remains 132 /132 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8426 ms. Remains : 132/411 places, 122/365 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-05 finished in 8585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||(p1&&F(p2))))))'
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 365/365 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 403 transition count 357
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 403 transition count 357
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 401 transition count 355
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 401 transition count 355
Applied a total of 20 rules in 27 ms. Remains 401 /411 variables (removed 10) and now considering 355/365 (removed 10) transitions.
// Phase 1: matrix 355 rows 401 cols
[2024-05-25 15:28:53] [INFO ] Computed 84 invariants in 30 ms
[2024-05-25 15:28:55] [INFO ] Implicit Places using invariants in 1542 ms returned []
[2024-05-25 15:28:55] [INFO ] Invariant cache hit.
[2024-05-25 15:28:55] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 2031 ms to find 0 implicit places.
[2024-05-25 15:28:55] [INFO ] Invariant cache hit.
[2024-05-25 15:28:56] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 401/411 places, 355/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2294 ms. Remains : 401/411 places, 355/365 transitions.
Stuttering acceptance computed with spot in 454 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s271 0), p1:(EQ s22 0), p2:(EQ s22 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1351 reset in 326 ms.
Product exploration explored 100000 steps with 1348 reset in 280 ms.
Computed a total of 196 stabilizing places and 201 stable transitions
Graph (complete) has 928 edges and 401 vertex of which 400 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 ms
Computed a total of 196 stabilizing places and 201 stable transitions
Detected a total of 196/401 stabilizing places and 201/355 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 186 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 80 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:28:57] [INFO ] Invariant cache hit.
[2024-05-25 15:28:57] [INFO ] [Real]Absence check using 45 positive place invariants in 35 ms returned sat
[2024-05-25 15:28:57] [INFO ] [Real]Absence check using 45 positive and 39 generalized place invariants in 29 ms returned sat
[2024-05-25 15:28:58] [INFO ] After 193ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 15:28:58] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2024-05-25 15:28:58] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2024-05-25 15:28:58] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2024-05-25 15:28:58] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-05-25 15:28:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 392 ms
[2024-05-25 15:28:58] [INFO ] After 600ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:28:58] [INFO ] After 778ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:28:58] [INFO ] [Nat]Absence check using 45 positive place invariants in 298 ms returned sat
[2024-05-25 15:28:59] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 114 ms returned sat
[2024-05-25 15:28:59] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:29:00] [INFO ] Deduced a trap composed of 8 places in 851 ms of which 1 ms to minimize.
[2024-05-25 15:29:00] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-05-25 15:29:00] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-25 15:29:00] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-05-25 15:29:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1140 ms
[2024-05-25 15:29:00] [INFO ] After 1309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-25 15:29:00] [INFO ] After 1878ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 355/355 transitions.
Graph (trivial) has 177 edges and 401 vertex of which 6 / 401 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 921 edges and 396 vertex of which 395 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 395 transition count 311
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 359 transition count 311
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 74 place count 359 transition count 225
Deduced a syphon composed of 86 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 259 place count 260 transition count 225
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 260 place count 259 transition count 224
Iterating global reduction 2 with 1 rules applied. Total rules applied 261 place count 259 transition count 224
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 215 rules applied. Total rules applied 476 place count 149 transition count 119
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 478 place count 148 transition count 122
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 480 place count 148 transition count 120
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 482 place count 146 transition count 120
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 483 place count 146 transition count 120
Applied a total of 483 rules in 47 ms. Remains 146 /401 variables (removed 255) and now considering 120/355 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 146/401 places, 120/355 transitions.
Finished random walk after 241 steps, including 11 resets, run visited all 1 properties in 2 ms. (steps per millisecond=120 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 6 factoid took 246 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 2 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 355/355 transitions.
Applied a total of 0 rules in 15 ms. Remains 401 /401 variables (removed 0) and now considering 355/355 (removed 0) transitions.
[2024-05-25 15:29:01] [INFO ] Invariant cache hit.
[2024-05-25 15:29:01] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-25 15:29:01] [INFO ] Invariant cache hit.
[2024-05-25 15:29:01] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
[2024-05-25 15:29:01] [INFO ] Invariant cache hit.
[2024-05-25 15:29:02] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 924 ms. Remains : 401/401 places, 355/355 transitions.
Computed a total of 196 stabilizing places and 201 stable transitions
Graph (complete) has 928 edges and 401 vertex of which 400 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 196 stabilizing places and 201 stable transitions
Detected a total of 196/401 stabilizing places and 201/355 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 83 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:29:02] [INFO ] Invariant cache hit.
[2024-05-25 15:29:02] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-25 15:29:02] [INFO ] [Real]Absence check using 45 positive and 39 generalized place invariants in 11 ms returned sat
[2024-05-25 15:29:02] [INFO ] After 133ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 15:29:02] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2024-05-25 15:29:02] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-05-25 15:29:03] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 0 ms to minimize.
[2024-05-25 15:29:03] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-25 15:29:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 411 ms
[2024-05-25 15:29:03] [INFO ] After 557ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:29:03] [INFO ] After 681ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:29:03] [INFO ] [Nat]Absence check using 45 positive place invariants in 21 ms returned sat
[2024-05-25 15:29:03] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 11 ms returned sat
[2024-05-25 15:29:03] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:29:03] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 1 ms to minimize.
[2024-05-25 15:29:03] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 0 ms to minimize.
[2024-05-25 15:29:03] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 0 ms to minimize.
[2024-05-25 15:29:03] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-25 15:29:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 546 ms
[2024-05-25 15:29:04] [INFO ] After 754ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-25 15:29:04] [INFO ] After 958ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 355/355 transitions.
Graph (trivial) has 177 edges and 401 vertex of which 6 / 401 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 921 edges and 396 vertex of which 395 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 395 transition count 311
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 359 transition count 311
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 74 place count 359 transition count 225
Deduced a syphon composed of 86 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 259 place count 260 transition count 225
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 260 place count 259 transition count 224
Iterating global reduction 2 with 1 rules applied. Total rules applied 261 place count 259 transition count 224
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 215 rules applied. Total rules applied 476 place count 149 transition count 119
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 478 place count 148 transition count 122
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 480 place count 148 transition count 120
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 482 place count 146 transition count 120
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 483 place count 146 transition count 120
Applied a total of 483 rules in 71 ms. Remains 146 /401 variables (removed 255) and now considering 120/355 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 146/401 places, 120/355 transitions.
Finished random walk after 188 steps, including 8 resets, run visited all 1 properties in 2 ms. (steps per millisecond=94 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 345 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 412 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 1346 reset in 354 ms.
Product exploration explored 100000 steps with 1320 reset in 455 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 2 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 355/355 transitions.
Graph (trivial) has 175 edges and 401 vertex of which 6 / 401 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 922 edges and 396 vertex of which 395 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 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 395 transition count 348
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 59 Pre rules applied. Total rules applied 37 place count 395 transition count 389
Deduced a syphon composed of 94 places in 1 ms
Iterating global reduction 1 with 59 rules applied. Total rules applied 96 place count 395 transition count 389
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 108 place count 383 transition count 366
Deduced a syphon composed of 82 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 120 place count 383 transition count 366
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 1 with 131 rules applied. Total rules applied 251 place count 383 transition count 366
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 279 place count 355 transition count 338
Deduced a syphon composed of 185 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 307 place count 355 transition count 338
Deduced a syphon composed of 185 places in 1 ms
Applied a total of 307 rules in 73 ms. Remains 355 /401 variables (removed 46) and now considering 338/355 (removed 17) transitions.
[2024-05-25 15:29:07] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 338 rows 355 cols
[2024-05-25 15:29:07] [INFO ] Computed 84 invariants in 5 ms
[2024-05-25 15:29:07] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 355/401 places, 338/355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 465 ms. Remains : 355/401 places, 338/355 transitions.
Built C files in :
/tmp/ltsmin5033557881908197011
[2024-05-25 15:29:07] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5033557881908197011
Running compilation step : cd /tmp/ltsmin5033557881908197011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 793 ms.
Running link step : cd /tmp/ltsmin5033557881908197011;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin5033557881908197011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18355797260672282339.hoa' '--buchi-type=spotba'
LTSmin run took 5652 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-10-LTLFireability-06 finished in 20252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 365/365 transitions.
Graph (trivial) has 187 edges and 411 vertex of which 6 / 411 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 934 edges and 406 vertex of which 405 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 404 transition count 315
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 362 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 361 transition count 314
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 88 place count 361 transition count 229
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 270 place count 264 transition count 229
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 278 place count 256 transition count 221
Iterating global reduction 3 with 8 rules applied. Total rules applied 286 place count 256 transition count 221
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 491 place count 151 transition count 121
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 3 with 2 rules applied. Total rules applied 493 place count 150 transition count 124
Applied a total of 493 rules in 69 ms. Remains 150 /411 variables (removed 261) and now considering 124/365 (removed 241) transitions.
// Phase 1: matrix 124 rows 150 cols
[2024-05-25 15:29:14] [INFO ] Computed 67 invariants in 1 ms
[2024-05-25 15:29:14] [INFO ] Implicit Places using invariants in 515 ms returned [1, 2, 3, 4, 5, 6, 9, 22, 23, 24, 25, 26, 27, 50, 51, 113]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 520 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/411 places, 124/365 transitions.
Applied a total of 0 rules in 6 ms. Remains 134 /134 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 595 ms. Remains : 134/411 places, 124/365 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2 1), p1:(OR (EQ s43 1) (AND (EQ s2 1) (EQ s43 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-10 finished in 704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 365/365 transitions.
Graph (trivial) has 185 edges and 411 vertex of which 6 / 411 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 934 edges and 406 vertex of which 405 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 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 404 transition count 317
Reduce places removed 40 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 364 transition count 315
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 362 transition count 315
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 86 place count 362 transition count 230
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 268 place count 265 transition count 230
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 276 place count 257 transition count 222
Iterating global reduction 3 with 8 rules applied. Total rules applied 284 place count 257 transition count 222
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 493 place count 150 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 494 place count 149 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 495 place count 148 transition count 119
Applied a total of 495 rules in 56 ms. Remains 148 /411 variables (removed 263) and now considering 119/365 (removed 246) transitions.
// Phase 1: matrix 119 rows 148 cols
[2024-05-25 15:29:14] [INFO ] Computed 66 invariants in 1 ms
[2024-05-25 15:29:15] [INFO ] Implicit Places using invariants in 160 ms returned [0, 1, 2, 3, 4, 5, 6, 21, 22, 23, 24, 25, 26, 51, 118]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 165 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/411 places, 119/365 transitions.
Applied a total of 0 rules in 17 ms. Remains 133 /133 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 238 ms. Remains : 133/411 places, 119/365 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s13 1) (EQ s15 1)), p1:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-12 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 365/365 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 404 transition count 358
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 404 transition count 358
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 402 transition count 356
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 402 transition count 356
Applied a total of 18 rules in 45 ms. Remains 402 /411 variables (removed 9) and now considering 356/365 (removed 9) transitions.
// Phase 1: matrix 356 rows 402 cols
[2024-05-25 15:29:15] [INFO ] Computed 84 invariants in 3 ms
[2024-05-25 15:29:15] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-25 15:29:15] [INFO ] Invariant cache hit.
[2024-05-25 15:29:16] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
[2024-05-25 15:29:16] [INFO ] Invariant cache hit.
[2024-05-25 15:29:16] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 402/411 places, 356/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1292 ms. Remains : 402/411 places, 356/365 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s284 0), p1:(EQ s343 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 155 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-13 finished in 1504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(X(G((p1&&X(p2))))))))'
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 365/365 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 404 transition count 358
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 404 transition count 358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 403 transition count 357
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 403 transition count 357
Applied a total of 16 rules in 17 ms. Remains 403 /411 variables (removed 8) and now considering 357/365 (removed 8) transitions.
// Phase 1: matrix 357 rows 403 cols
[2024-05-25 15:29:16] [INFO ] Computed 84 invariants in 6 ms
[2024-05-25 15:29:16] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-25 15:29:16] [INFO ] Invariant cache hit.
[2024-05-25 15:29:17] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
[2024-05-25 15:29:17] [INFO ] Invariant cache hit.
[2024-05-25 15:29:17] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 403/411 places, 357/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 950 ms. Remains : 403/411 places, 357/365 transitions.
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s321 1), p2:(NEQ s344 1), p0:(NEQ s279 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24974 reset in 205 ms.
Product exploration explored 100000 steps with 25060 reset in 340 ms.
Computed a total of 196 stabilizing places and 201 stable transitions
Graph (complete) has 930 edges and 403 vertex of which 402 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 196 stabilizing places and 201 stable transitions
Detected a total of 196/403 stabilizing places and 201/357 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (AND p0 p1)), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), true, (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 232 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 83 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 15:29:19] [INFO ] Invariant cache hit.
[2024-05-25 15:29:20] [INFO ] [Real]Absence check using 45 positive place invariants in 12 ms returned sat
[2024-05-25 15:29:20] [INFO ] [Real]Absence check using 45 positive and 39 generalized place invariants in 14 ms returned sat
[2024-05-25 15:29:20] [INFO ] After 149ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:2
[2024-05-25 15:29:20] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 12 ms to minimize.
[2024-05-25 15:29:27] [INFO ] Deduced a trap composed of 66 places in 7560 ms of which 21 ms to minimize.
[2024-05-25 15:29:28] [INFO ] Deduced a trap composed of 70 places in 143 ms of which 14 ms to minimize.
[2024-05-25 15:29:28] [INFO ] Deduced a trap composed of 72 places in 125 ms of which 1 ms to minimize.
[2024-05-25 15:29:28] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 0 ms to minimize.
[2024-05-25 15:29:28] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2024-05-25 15:29:28] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 0 ms to minimize.
[2024-05-25 15:29:28] [INFO ] Deduced a trap composed of 78 places in 148 ms of which 0 ms to minimize.
[2024-05-25 15:29:29] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 1 ms to minimize.
[2024-05-25 15:29:29] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2024-05-25 15:29:29] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 0 ms to minimize.
[2024-05-25 15:29:29] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 0 ms to minimize.
[2024-05-25 15:29:29] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-25 15:29:29] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2024-05-25 15:29:29] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-05-25 15:29:29] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 9452 ms
[2024-05-25 15:29:29] [INFO ] After 9618ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-25 15:29:29] [INFO ] After 9772ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-25 15:29:29] [INFO ] [Nat]Absence check using 45 positive place invariants in 13 ms returned sat
[2024-05-25 15:29:29] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 15 ms returned sat
[2024-05-25 15:29:30] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-25 15:29:30] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2024-05-25 15:29:30] [INFO ] Deduced a trap composed of 66 places in 153 ms of which 0 ms to minimize.
[2024-05-25 15:29:30] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 1 ms to minimize.
[2024-05-25 15:29:30] [INFO ] Deduced a trap composed of 72 places in 159 ms of which 1 ms to minimize.
[2024-05-25 15:29:31] [INFO ] Deduced a trap composed of 76 places in 150 ms of which 1 ms to minimize.
[2024-05-25 15:29:31] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 1 ms to minimize.
[2024-05-25 15:29:31] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 1 ms to minimize.
[2024-05-25 15:29:31] [INFO ] Deduced a trap composed of 78 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:29:31] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 0 ms to minimize.
[2024-05-25 15:29:31] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:29:32] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 1 ms to minimize.
[2024-05-25 15:29:32] [INFO ] Deduced a trap composed of 85 places in 151 ms of which 1 ms to minimize.
[2024-05-25 15:29:32] [INFO ] Deduced a trap composed of 81 places in 153 ms of which 1 ms to minimize.
[2024-05-25 15:29:32] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 1 ms to minimize.
[2024-05-25 15:29:32] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 1 ms to minimize.
[2024-05-25 15:29:32] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 1 ms to minimize.
[2024-05-25 15:29:33] [INFO ] Deduced a trap composed of 78 places in 154 ms of which 0 ms to minimize.
[2024-05-25 15:29:33] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-25 15:29:33] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2024-05-25 15:29:33] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3127 ms
[2024-05-25 15:29:33] [INFO ] After 3513ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-25 15:29:33] [INFO ] After 3735ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 19 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 357/357 transitions.
Graph (trivial) has 177 edges and 403 vertex of which 6 / 403 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 923 edges and 398 vertex of which 397 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 397 transition count 313
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 361 transition count 313
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 74 place count 361 transition count 228
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 183 rules applied. Total rules applied 257 place count 263 transition count 228
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 476 place count 151 transition count 121
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 478 place count 150 transition count 124
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 480 place count 150 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 482 place count 148 transition count 122
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 483 place count 148 transition count 122
Applied a total of 483 rules in 51 ms. Remains 148 /403 variables (removed 255) and now considering 122/357 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 148/403 places, 122/357 transitions.
Finished random walk after 385 steps, including 16 resets, run visited all 2 properties in 11 ms. (steps per millisecond=35 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X (AND p0 p1)), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), true, (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p1)), (F (NOT p0)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 13 factoid took 734 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 392 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Support contains 3 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 357/357 transitions.
Applied a total of 0 rules in 11 ms. Remains 403 /403 variables (removed 0) and now considering 357/357 (removed 0) transitions.
[2024-05-25 15:29:35] [INFO ] Invariant cache hit.
[2024-05-25 15:29:35] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-25 15:29:35] [INFO ] Invariant cache hit.
[2024-05-25 15:29:35] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2024-05-25 15:29:35] [INFO ] Invariant cache hit.
[2024-05-25 15:29:35] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 882 ms. Remains : 403/403 places, 357/357 transitions.
Computed a total of 196 stabilizing places and 201 stable transitions
Graph (complete) has 930 edges and 403 vertex of which 402 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 196 stabilizing places and 201 stable transitions
Detected a total of 196/403 stabilizing places and 201/357 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (AND p0 p1)), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 141 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 380 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 81 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-25 15:29:36] [INFO ] Invariant cache hit.
[2024-05-25 15:29:36] [INFO ] [Real]Absence check using 45 positive place invariants in 14 ms returned sat
[2024-05-25 15:29:36] [INFO ] [Real]Absence check using 45 positive and 39 generalized place invariants in 15 ms returned sat
[2024-05-25 15:29:37] [INFO ] After 180ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-25 15:29:37] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2024-05-25 15:29:37] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 1 ms to minimize.
[2024-05-25 15:29:37] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 0 ms to minimize.
[2024-05-25 15:29:37] [INFO ] Deduced a trap composed of 72 places in 162 ms of which 0 ms to minimize.
[2024-05-25 15:29:37] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 1 ms to minimize.
[2024-05-25 15:29:38] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2024-05-25 15:29:38] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 1 ms to minimize.
[2024-05-25 15:29:38] [INFO ] Deduced a trap composed of 78 places in 177 ms of which 1 ms to minimize.
[2024-05-25 15:29:38] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 0 ms to minimize.
[2024-05-25 15:29:38] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-25 15:29:38] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-25 15:29:38] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 3 ms to minimize.
[2024-05-25 15:29:38] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-25 15:29:39] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:29:39] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:29:39] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1923 ms
[2024-05-25 15:29:39] [INFO ] After 2132ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:29:39] [INFO ] After 2294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:29:39] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-25 15:29:39] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 10 ms returned sat
[2024-05-25 15:29:39] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:29:39] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 1 ms to minimize.
[2024-05-25 15:29:39] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 1 ms to minimize.
[2024-05-25 15:29:39] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 1 ms to minimize.
[2024-05-25 15:29:39] [INFO ] Deduced a trap composed of 72 places in 208 ms of which 1 ms to minimize.
[2024-05-25 15:29:40] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 0 ms to minimize.
[2024-05-25 15:29:40] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2024-05-25 15:29:40] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 1 ms to minimize.
[2024-05-25 15:29:40] [INFO ] Deduced a trap composed of 78 places in 172 ms of which 1 ms to minimize.
[2024-05-25 15:29:40] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 1 ms to minimize.
[2024-05-25 15:29:40] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 0 ms to minimize.
[2024-05-25 15:29:41] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 0 ms to minimize.
[2024-05-25 15:29:41] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 1 ms to minimize.
[2024-05-25 15:29:41] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 0 ms to minimize.
[2024-05-25 15:29:41] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 1 ms to minimize.
[2024-05-25 15:29:41] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 1 ms to minimize.
[2024-05-25 15:29:41] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 0 ms to minimize.
[2024-05-25 15:29:41] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 0 ms to minimize.
[2024-05-25 15:29:41] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:29:41] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2024-05-25 15:29:41] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2593 ms
[2024-05-25 15:29:42] [INFO ] After 2816ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-25 15:29:42] [INFO ] After 2975ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 1 properties in 24 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 357/357 transitions.
Graph (trivial) has 177 edges and 403 vertex of which 6 / 403 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 923 edges and 398 vertex of which 397 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 397 transition count 313
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 361 transition count 313
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 74 place count 361 transition count 228
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 183 rules applied. Total rules applied 257 place count 263 transition count 228
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 476 place count 151 transition count 121
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 478 place count 150 transition count 124
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 480 place count 150 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 482 place count 148 transition count 122
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 483 place count 148 transition count 122
Applied a total of 483 rules in 38 ms. Remains 148 /403 variables (removed 255) and now considering 122/357 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 148/403 places, 122/357 transitions.
Finished random walk after 243 steps, including 13 resets, run visited all 2 properties in 4 ms. (steps per millisecond=60 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 p0), (X (AND p0 p1)), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p1)), (F (NOT p0)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 11 factoid took 546 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 24961 reset in 233 ms.
Product exploration explored 100000 steps with 25084 reset in 301 ms.
Applying partial POR strategy [false, false, false, true, true, false, false]
Stuttering acceptance computed with spot in 400 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Support contains 3 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 357/357 transitions.
Graph (trivial) has 176 edges and 403 vertex of which 6 / 403 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 924 edges and 398 vertex of which 397 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 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 397 transition count 350
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 60 Pre rules applied. Total rules applied 38 place count 397 transition count 391
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 98 place count 397 transition count 391
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 110 place count 385 transition count 368
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 122 place count 385 transition count 368
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 1 with 130 rules applied. Total rules applied 252 place count 385 transition count 368
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 281 place count 356 transition count 339
Deduced a syphon composed of 185 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 310 place count 356 transition count 339
Deduced a syphon composed of 185 places in 0 ms
Applied a total of 310 rules in 43 ms. Remains 356 /403 variables (removed 47) and now considering 339/357 (removed 18) transitions.
[2024-05-25 15:29:44] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 339 rows 356 cols
[2024-05-25 15:29:44] [INFO ] Computed 84 invariants in 8 ms
[2024-05-25 15:29:45] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 356/403 places, 339/357 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 326 ms. Remains : 356/403 places, 339/357 transitions.
Built C files in :
/tmp/ltsmin3662258602399669548
[2024-05-25 15:29:45] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3662258602399669548
Running compilation step : cd /tmp/ltsmin3662258602399669548;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 776 ms.
Running link step : cd /tmp/ltsmin3662258602399669548;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3662258602399669548;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10288615839319891469.hoa' '--buchi-type=spotba'
LTSmin run took 746 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-10-LTLFireability-14 finished in 30036 ms.
All properties solved by simple procedures.
Total runtime 74094 ms.

BK_STOP 1716650986906

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is BusinessProcesses-PT-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r065-tajo-171620414900328"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-10.tgz
mv BusinessProcesses-PT-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;