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-171620415000368.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-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620415000368
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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 4.0K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:31 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 11K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 16:32 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 177K 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-18-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716651521921

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-18
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 15:38:44] [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:38:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:38:44] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-25 15:38:44] [INFO ] Transformed 717 places.
[2024-05-25 15:38:44] [INFO ] Transformed 642 transitions.
[2024-05-25 15:38:44] [INFO ] Found NUPN structural information;
[2024-05-25 15:38:44] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 166 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 1 formulas.
Deduced a syphon composed of 15 places in 12 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 694 transition count 627
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 102 place count 600 transition count 533
Iterating global reduction 1 with 94 rules applied. Total rules applied 196 place count 600 transition count 533
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 243 place count 553 transition count 486
Iterating global reduction 1 with 47 rules applied. Total rules applied 290 place count 553 transition count 486
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 291 place count 552 transition count 485
Iterating global reduction 1 with 1 rules applied. Total rules applied 292 place count 552 transition count 485
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 293 place count 551 transition count 484
Iterating global reduction 1 with 1 rules applied. Total rules applied 294 place count 551 transition count 484
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 295 place count 550 transition count 483
Iterating global reduction 1 with 1 rules applied. Total rules applied 296 place count 550 transition count 483
Applied a total of 296 rules in 201 ms. Remains 550 /702 variables (removed 152) and now considering 483/627 (removed 144) transitions.
// Phase 1: matrix 483 rows 550 cols
[2024-05-25 15:38:44] [INFO ] Computed 106 invariants in 36 ms
[2024-05-25 15:38:45] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-25 15:38:45] [INFO ] Invariant cache hit.
[2024-05-25 15:38:45] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 1073 ms to find 0 implicit places.
[2024-05-25 15:38:45] [INFO ] Invariant cache hit.
[2024-05-25 15:38:46] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 550/702 places, 483/627 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1628 ms. Remains : 550/702 places, 483/627 transitions.
Support contains 42 out of 550 places after structural reductions.
[2024-05-25 15:38:46] [INFO ] Flatten gal took : 72 ms
[2024-05-25 15:38:46] [INFO ] Flatten gal took : 31 ms
[2024-05-25 15:38:46] [INFO ] Input system was already deterministic with 483 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 566 ms. (steps per millisecond=17 ) properties (out of 31) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2024-05-25 15:38:47] [INFO ] Invariant cache hit.
[2024-05-25 15:38:47] [INFO ] [Real]Absence check using 65 positive place invariants in 29 ms returned sat
[2024-05-25 15:38:47] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 11 ms returned sat
[2024-05-25 15:38:47] [INFO ] After 413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-25 15:38:47] [INFO ] [Nat]Absence check using 65 positive place invariants in 20 ms returned sat
[2024-05-25 15:38:47] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 10 ms returned sat
[2024-05-25 15:38:48] [INFO ] After 638ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2024-05-25 15:38:48] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 6 ms to minimize.
[2024-05-25 15:38:48] [INFO ] Deduced a trap composed of 85 places in 168 ms of which 1 ms to minimize.
[2024-05-25 15:38:49] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 7 ms to minimize.
[2024-05-25 15:38:49] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-05-25 15:38:49] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 14 ms to minimize.
[2024-05-25 15:38:49] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2024-05-25 15:38:49] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-05-25 15:38:49] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-05-25 15:38:49] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-25 15:38:49] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2024-05-25 15:38:49] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 0 ms to minimize.
[2024-05-25 15:38:49] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 0 ms to minimize.
[2024-05-25 15:38:50] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1420 ms
[2024-05-25 15:38:50] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 2 ms to minimize.
[2024-05-25 15:38:50] [INFO ] Deduced a trap composed of 103 places in 93 ms of which 0 ms to minimize.
[2024-05-25 15:38:50] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:38:50] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 1 ms to minimize.
[2024-05-25 15:38:50] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 0 ms to minimize.
[2024-05-25 15:38:50] [INFO ] Deduced a trap composed of 103 places in 138 ms of which 1 ms to minimize.
[2024-05-25 15:38:51] [INFO ] Deduced a trap composed of 103 places in 138 ms of which 0 ms to minimize.
[2024-05-25 15:38:51] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 1 ms to minimize.
[2024-05-25 15:38:51] [INFO ] Deduced a trap composed of 103 places in 145 ms of which 1 ms to minimize.
[2024-05-25 15:38:51] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 1 ms to minimize.
[2024-05-25 15:38:51] [INFO ] Deduced a trap composed of 108 places in 106 ms of which 0 ms to minimize.
[2024-05-25 15:38:51] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 0 ms to minimize.
[2024-05-25 15:38:52] [INFO ] Deduced a trap composed of 128 places in 105 ms of which 0 ms to minimize.
[2024-05-25 15:38:52] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 0 ms to minimize.
[2024-05-25 15:38:52] [INFO ] Deduced a trap composed of 100 places in 100 ms of which 1 ms to minimize.
[2024-05-25 15:38:52] [INFO ] Deduced a trap composed of 99 places in 139 ms of which 1 ms to minimize.
[2024-05-25 15:38:52] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 1 ms to minimize.
[2024-05-25 15:38:52] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 0 ms to minimize.
[2024-05-25 15:38:52] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 1 ms to minimize.
[2024-05-25 15:38:53] [INFO ] Deduced a trap composed of 109 places in 124 ms of which 0 ms to minimize.
[2024-05-25 15:38:53] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 1 ms to minimize.
[2024-05-25 15:38:53] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 1 ms to minimize.
[2024-05-25 15:38:53] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 1 ms to minimize.
[2024-05-25 15:38:53] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 1 ms to minimize.
[2024-05-25 15:38:53] [INFO ] Deduced a trap composed of 109 places in 111 ms of which 1 ms to minimize.
[2024-05-25 15:38:53] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 1 ms to minimize.
[2024-05-25 15:38:54] [INFO ] Deduced a trap composed of 105 places in 105 ms of which 0 ms to minimize.
[2024-05-25 15:38:54] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4141 ms
[2024-05-25 15:38:54] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-25 15:38:54] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 0 ms to minimize.
[2024-05-25 15:38:54] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:38:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 269 ms
[2024-05-25 15:38:55] [INFO ] After 7164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 576 ms.
[2024-05-25 15:38:55] [INFO ] After 8146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 13 properties in 276 ms.
Support contains 6 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 483/483 transitions.
Graph (trivial) has 265 edges and 550 vertex of which 7 / 550 are part of one of the 1 SCC in 11 ms
Free SCC test removed 6 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 1217 edges and 544 vertex of which 543 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 543 transition count 406
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 476 transition count 406
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 136 place count 476 transition count 295
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 382 place count 341 transition count 295
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 391 place count 332 transition count 286
Iterating global reduction 2 with 9 rules applied. Total rules applied 400 place count 332 transition count 286
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 293 rules applied. Total rules applied 693 place count 184 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 695 place count 183 transition count 144
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 696 place count 183 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 697 place count 182 transition count 143
Applied a total of 697 rules in 130 ms. Remains 182 /550 variables (removed 368) and now considering 143/483 (removed 340) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 182/550 places, 143/483 transitions.
Incomplete random walk after 10000 steps, including 517 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 257 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 143 rows 182 cols
[2024-05-25 15:38:56] [INFO ] Computed 79 invariants in 11 ms
[2024-05-25 15:38:56] [INFO ] [Real]Absence check using 65 positive place invariants in 9 ms returned sat
[2024-05-25 15:38:56] [INFO ] [Real]Absence check using 65 positive and 14 generalized place invariants in 4 ms returned sat
[2024-05-25 15:38:56] [INFO ] After 57ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 15:38:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 15:38:56] [INFO ] After 11ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:38:56] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:38:56] [INFO ] [Nat]Absence check using 65 positive place invariants in 8 ms returned sat
[2024-05-25 15:38:56] [INFO ] [Nat]Absence check using 65 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-25 15:38:56] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:38:56] [INFO ] After 10ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:38:56] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-25 15:38:56] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 43 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
Parikh walk visited 1 properties in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 492 stabilizing places and 434 stable transitions
Graph (complete) has 1226 edges and 550 vertex of which 549 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 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 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Graph (trivial) has 270 edges and 550 vertex of which 7 / 550 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1218 edges and 544 vertex of which 543 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 542 transition count 405
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 474 transition count 405
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 115 Pre rules applied. Total rules applied 138 place count 474 transition count 290
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 393 place count 334 transition count 290
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 404 place count 323 transition count 279
Iterating global reduction 2 with 11 rules applied. Total rules applied 415 place count 323 transition count 279
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 287 rules applied. Total rules applied 702 place count 178 transition count 137
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 704 place count 177 transition count 140
Applied a total of 704 rules in 51 ms. Remains 177 /550 variables (removed 373) and now considering 140/483 (removed 343) transitions.
// Phase 1: matrix 140 rows 177 cols
[2024-05-25 15:38:57] [INFO ] Computed 78 invariants in 3 ms
[2024-05-25 15:38:57] [INFO ] Implicit Places using invariants in 234 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 239 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/550 places, 140/483 transitions.
Applied a total of 0 rules in 7 ms. Remains 149 /149 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 297 ms. Remains : 149/550 places, 140/483 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 211 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-00 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 s113 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-00 finished in 576 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((p1||(!p1 U p0)))))'
Support contains 2 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Graph (trivial) has 267 edges and 550 vertex of which 7 / 550 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1218 edges and 544 vertex of which 543 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 542 transition count 407
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 476 transition count 407
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 134 place count 476 transition count 293
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 387 place count 337 transition count 293
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 397 place count 327 transition count 283
Iterating global reduction 2 with 10 rules applied. Total rules applied 407 place count 327 transition count 283
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 289 rules applied. Total rules applied 696 place count 181 transition count 140
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 698 place count 180 transition count 143
Applied a total of 698 rules in 48 ms. Remains 180 /550 variables (removed 370) and now considering 143/483 (removed 340) transitions.
// Phase 1: matrix 143 rows 180 cols
[2024-05-25 15:38:57] [INFO ] Computed 78 invariants in 3 ms
[2024-05-25 15:38:57] [INFO ] Implicit Places using invariants in 141 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 143 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/550 places, 143/483 transitions.
Applied a total of 0 rules in 9 ms. Remains 152 /152 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 201 ms. Remains : 152/550 places, 143/483 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s44 1), p0:(EQ s128 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-01 finished in 372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(G(p1))))))'
Support contains 3 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 537 transition count 470
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 537 transition count 470
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 537 transition count 469
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 532 transition count 464
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 532 transition count 464
Applied a total of 37 rules in 85 ms. Remains 532 /550 variables (removed 18) and now considering 464/483 (removed 19) transitions.
// Phase 1: matrix 464 rows 532 cols
[2024-05-25 15:38:58] [INFO ] Computed 106 invariants in 17 ms
[2024-05-25 15:38:58] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-25 15:38:58] [INFO ] Invariant cache hit.
[2024-05-25 15:38:58] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 938 ms to find 0 implicit places.
[2024-05-25 15:38:58] [INFO ] Invariant cache hit.
[2024-05-25 15:38:59] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/550 places, 464/483 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1320 ms. Remains : 532/550 places, 464/483 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s448 1), p1:(AND (EQ s122 1) (EQ s468 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-02 finished in 1577 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((X((p1 U X(p2))) U (p3&&X((p1 U X(p2))))))||p0))))'
Support contains 5 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 540 transition count 473
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 540 transition count 473
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 537 transition count 470
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 537 transition count 470
Applied a total of 26 rules in 51 ms. Remains 537 /550 variables (removed 13) and now considering 470/483 (removed 13) transitions.
// Phase 1: matrix 470 rows 537 cols
[2024-05-25 15:38:59] [INFO ] Computed 106 invariants in 7 ms
[2024-05-25 15:38:59] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-25 15:38:59] [INFO ] Invariant cache hit.
[2024-05-25 15:39:00] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2024-05-25 15:39:00] [INFO ] Invariant cache hit.
[2024-05-25 15:39:00] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 537/550 places, 470/483 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1074 ms. Remains : 537/550 places, 470/483 transitions.
Stuttering acceptance computed with spot in 348 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s118 1) (EQ s36 0) (EQ s271 1)), p3:(EQ s271 1), p1:(EQ s434 1), p2:(EQ s124 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]]
Entered a terminal (fully accepting) state of product in 9809 steps with 52 reset in 78 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-03 finished in 1535 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((X(p1)||p0)))'
Support contains 3 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 536 transition count 469
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 536 transition count 469
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 536 transition count 468
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 531 transition count 463
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 531 transition count 463
Applied a total of 39 rules in 41 ms. Remains 531 /550 variables (removed 19) and now considering 463/483 (removed 20) transitions.
// Phase 1: matrix 463 rows 531 cols
[2024-05-25 15:39:01] [INFO ] Computed 106 invariants in 6 ms
[2024-05-25 15:39:01] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-25 15:39:01] [INFO ] Invariant cache hit.
[2024-05-25 15:39:02] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
[2024-05-25 15:39:02] [INFO ] Invariant cache hit.
[2024-05-25 15:39:02] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 531/550 places, 463/483 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1263 ms. Remains : 531/550 places, 463/483 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s365 1) (EQ s253 0)), p1:(EQ s123 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 44 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-04 finished in 1415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p0&&G(F(((p0&&X((p1||F(p2))))||G((p1||F(p2)))))))))))'
Support contains 3 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 538 transition count 471
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 538 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 538 transition count 470
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 533 transition count 465
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 533 transition count 465
Applied a total of 35 rules in 33 ms. Remains 533 /550 variables (removed 17) and now considering 465/483 (removed 18) transitions.
// Phase 1: matrix 465 rows 533 cols
[2024-05-25 15:39:02] [INFO ] Computed 106 invariants in 6 ms
[2024-05-25 15:39:02] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-25 15:39:02] [INFO ] Invariant cache hit.
[2024-05-25 15:39:03] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
[2024-05-25 15:39:03] [INFO ] Invariant cache hit.
[2024-05-25 15:39:03] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 533/550 places, 465/483 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1179 ms. Remains : 533/550 places, 465/483 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(NEQ s331 1), p2:(NEQ s185 1), p1:(NEQ s326 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 527 reset in 264 ms.
Product exploration explored 100000 steps with 534 reset in 286 ms.
Computed a total of 478 stabilizing places and 420 stable transitions
Graph (complete) has 1204 edges and 533 vertex of which 532 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 478 stabilizing places and 420 stable transitions
Detected a total of 478/533 stabilizing places and 420/465 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 321 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Incomplete random walk after 10000 steps, including 51 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 597717 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{3=1}
Probabilistic random walk after 597717 steps, saw 92735 distinct states, run finished after 3002 ms. (steps per millisecond=199 ) properties seen :1
Running SMT prover for 3 properties.
[2024-05-25 15:39:08] [INFO ] Invariant cache hit.
[2024-05-25 15:39:08] [INFO ] [Real]Absence check using 65 positive place invariants in 18 ms returned sat
[2024-05-25 15:39:08] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 11 ms returned sat
[2024-05-25 15:39:08] [INFO ] After 194ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-25 15:39:08] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 0 ms to minimize.
[2024-05-25 15:39:08] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 0 ms to minimize.
[2024-05-25 15:39:09] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2024-05-25 15:39:09] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2024-05-25 15:39:09] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2024-05-25 15:39:09] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 0 ms to minimize.
[2024-05-25 15:39:09] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:39:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 785 ms
[2024-05-25 15:39:09] [INFO ] After 1006ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:39:09] [INFO ] After 1127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:39:09] [INFO ] [Nat]Absence check using 65 positive place invariants in 18 ms returned sat
[2024-05-25 15:39:09] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 12 ms returned sat
[2024-05-25 15:39:09] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:39:09] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 1 ms to minimize.
[2024-05-25 15:39:10] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2024-05-25 15:39:10] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-25 15:39:10] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-25 15:39:10] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 3 ms to minimize.
[2024-05-25 15:39:10] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 0 ms to minimize.
[2024-05-25 15:39:10] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-25 15:39:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 762 ms
[2024-05-25 15:39:10] [INFO ] After 1087ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-05-25 15:39:10] [INFO ] After 1309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 35 ms.
Support contains 3 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 465/465 transitions.
Graph (trivial) has 250 edges and 533 vertex of which 6 / 533 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 1189 edges and 528 vertex of which 527 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 527 transition count 397
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 467 transition count 397
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 122 place count 467 transition count 284
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 373 place count 329 transition count 284
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 293 rules applied. Total rules applied 666 place count 181 transition count 139
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 668 place count 180 transition count 142
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 669 place count 180 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 670 place count 179 transition count 141
Applied a total of 670 rules in 83 ms. Remains 179 /533 variables (removed 354) and now considering 141/465 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 179/533 places, 141/465 transitions.
Incomplete random walk after 10000 steps, including 513 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 131 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 141 rows 179 cols
[2024-05-25 15:39:11] [INFO ] Computed 78 invariants in 4 ms
[2024-05-25 15:39:11] [INFO ] [Real]Absence check using 64 positive place invariants in 13 ms returned sat
[2024-05-25 15:39:11] [INFO ] [Real]Absence check using 64 positive and 14 generalized place invariants in 7 ms returned sat
[2024-05-25 15:39:11] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:39:11] [INFO ] [Nat]Absence check using 64 positive place invariants in 9 ms returned sat
[2024-05-25 15:39:11] [INFO ] [Nat]Absence check using 64 positive and 14 generalized place invariants in 4 ms returned sat
[2024-05-25 15:39:11] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:39:11] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 15:39:11] [INFO ] After 21ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:39:11] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-25 15:39:11] [INFO ] After 183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 141/141 transitions.
Applied a total of 0 rules in 6 ms. Remains 179 /179 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 179/179 places, 141/141 transitions.
Incomplete random walk after 10000 steps, including 529 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 153 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Finished probabilistic random walk after 127222 steps, run visited all 1 properties in 391 ms. (steps per millisecond=325 )
Probabilistic random walk after 127222 steps, saw 33385 distinct states, run finished after 393 ms. (steps per millisecond=323 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p0 p1)), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 795 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Support contains 3 out of 533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 533/533 places, 465/465 transitions.
Graph (trivial) has 250 edges and 533 vertex of which 6 / 533 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 1197 edges and 528 vertex of which 527 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 526 transition count 397
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 466 transition count 397
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 122 place count 466 transition count 284
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 373 place count 328 transition count 284
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 291 rules applied. Total rules applied 664 place count 181 transition count 140
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 666 place count 180 transition count 143
Applied a total of 666 rules in 53 ms. Remains 180 /533 variables (removed 353) and now considering 143/465 (removed 322) transitions.
// Phase 1: matrix 143 rows 180 cols
[2024-05-25 15:39:13] [INFO ] Computed 78 invariants in 1 ms
[2024-05-25 15:39:13] [INFO ] Implicit Places using invariants in 143 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 145 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/533 places, 143/465 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 153/533 places, 143/465 transitions.
Computed a total of 130 stabilizing places and 125 stable transitions
Computed a total of 130 stabilizing places and 125 stable transitions
Detected a total of 130/153 stabilizing places and 125/143 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 280 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), false]
Incomplete random walk after 10000 steps, including 1320 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 371 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 439 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 499 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 709 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Finished probabilistic random walk after 57077 steps, run visited all 4 properties in 187 ms. (steps per millisecond=305 )
Probabilistic random walk after 57077 steps, saw 15243 distinct states, run finished after 187 ms. (steps per millisecond=305 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p1 p0)), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) p1 (NOT p0))), (F (AND (NOT p2) (NOT p1) p0))]
Knowledge based reduction with 11 factoid took 362 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), false]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), false]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), false]
Product exploration explored 100000 steps with 11051 reset in 255 ms.
Product exploration explored 100000 steps with 10986 reset in 247 ms.
Built C files in :
/tmp/ltsmin3801130050673613768
[2024-05-25 15:39:16] [INFO ] Computing symmetric may disable matrix : 143 transitions.
[2024-05-25 15:39:16] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:39:16] [INFO ] Computing symmetric may enable matrix : 143 transitions.
[2024-05-25 15:39:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:39:16] [INFO ] Computing Do-Not-Accords matrix : 143 transitions.
[2024-05-25 15:39:16] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:39:16] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3801130050673613768
Running compilation step : cd /tmp/ltsmin3801130050673613768;'/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 585 ms.
Running link step : cd /tmp/ltsmin3801130050673613768;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin3801130050673613768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9067346315619683602.hoa' '--buchi-type=spotba'
LTSmin run took 4567 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-18-LTLFireability-06 finished in 19038 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' '!(((p0&&G(p1)&&F(p2)) U X(!p2)))'
Support contains 5 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 537 transition count 470
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 537 transition count 470
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 537 transition count 469
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 533 transition count 465
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 533 transition count 465
Applied a total of 35 rules in 61 ms. Remains 533 /550 variables (removed 17) and now considering 465/483 (removed 18) transitions.
// Phase 1: matrix 465 rows 533 cols
[2024-05-25 15:39:21] [INFO ] Computed 106 invariants in 6 ms
[2024-05-25 15:39:21] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-25 15:39:21] [INFO ] Invariant cache hit.
[2024-05-25 15:39:22] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2024-05-25 15:39:22] [INFO ] Invariant cache hit.
[2024-05-25 15:39:22] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 533/550 places, 465/483 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1024 ms. Remains : 533/550 places, 465/483 transitions.
Stuttering acceptance computed with spot in 204 ms :[p2, p2, p2, true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s118 1), p1:(AND (EQ s62 1) (EQ s329 1) (EQ s504 1)), p2:(NEQ s339 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-07 finished in 1256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 2 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 537 transition count 470
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 537 transition count 470
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 537 transition count 469
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 532 transition count 464
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 532 transition count 464
Applied a total of 37 rules in 35 ms. Remains 532 /550 variables (removed 18) and now considering 464/483 (removed 19) transitions.
// Phase 1: matrix 464 rows 532 cols
[2024-05-25 15:39:22] [INFO ] Computed 106 invariants in 4 ms
[2024-05-25 15:39:22] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-25 15:39:22] [INFO ] Invariant cache hit.
[2024-05-25 15:39:23] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
[2024-05-25 15:39:23] [INFO ] Invariant cache hit.
[2024-05-25 15:39:23] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/550 places, 464/483 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1161 ms. Remains : 532/550 places, 464/483 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s87 1), p1:(NEQ s382 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 288 ms.
Product exploration explored 100000 steps with 33333 reset in 239 ms.
Computed a total of 477 stabilizing places and 419 stable transitions
Graph (complete) has 1201 edges and 532 vertex of which 531 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 477 stabilizing places and 419 stable transitions
Detected a total of 477/532 stabilizing places and 419/464 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-18-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-18-LTLFireability-10 finished in 1850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Graph (trivial) has 270 edges and 550 vertex of which 7 / 550 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1218 edges and 544 vertex of which 543 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 542 transition count 405
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 474 transition count 405
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 138 place count 474 transition count 291
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 391 place count 335 transition count 291
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 402 place count 324 transition count 280
Iterating global reduction 2 with 11 rules applied. Total rules applied 413 place count 324 transition count 280
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 289 rules applied. Total rules applied 702 place count 178 transition count 137
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 704 place count 177 transition count 140
Applied a total of 704 rules in 35 ms. Remains 177 /550 variables (removed 373) and now considering 140/483 (removed 343) transitions.
// Phase 1: matrix 140 rows 177 cols
[2024-05-25 15:39:24] [INFO ] Computed 78 invariants in 1 ms
[2024-05-25 15:39:24] [INFO ] Implicit Places using invariants in 128 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 129 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/550 places, 140/483 transitions.
Applied a total of 0 rules in 4 ms. Remains 149 /149 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 168 ms. Remains : 149/550 places, 140/483 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s49 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-11 finished in 220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(!p0)) U (p1 U p2))))'
Support contains 5 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 537 transition count 470
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 537 transition count 470
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 537 transition count 469
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 534 transition count 466
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 534 transition count 466
Applied a total of 33 rules in 30 ms. Remains 534 /550 variables (removed 16) and now considering 466/483 (removed 17) transitions.
// Phase 1: matrix 466 rows 534 cols
[2024-05-25 15:39:24] [INFO ] Computed 106 invariants in 6 ms
[2024-05-25 15:39:25] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-25 15:39:25] [INFO ] Invariant cache hit.
[2024-05-25 15:39:25] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
[2024-05-25 15:39:25] [INFO ] Invariant cache hit.
[2024-05-25 15:39:25] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 534/550 places, 466/483 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1027 ms. Remains : 534/550 places, 466/483 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p2), (NOT p2), p0]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s430 1), p1:(EQ s470 1), p0:(AND (EQ s109 1) (EQ s340 1) (EQ s459 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 528 reset in 275 ms.
Stack based approach found an accepted trace after 10487 steps with 54 reset with depth 5 and stack size 5 in 36 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-12 finished in 1489 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((F(G(p0))&&G(p1))))'
Support contains 2 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Graph (trivial) has 270 edges and 550 vertex of which 7 / 550 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1218 edges and 544 vertex of which 543 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 542 transition count 406
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 475 transition count 405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 474 transition count 405
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 138 place count 474 transition count 290
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 393 place count 334 transition count 290
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 405 place count 322 transition count 278
Iterating global reduction 3 with 12 rules applied. Total rules applied 417 place count 322 transition count 278
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 281 rules applied. Total rules applied 698 place count 180 transition count 139
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 700 place count 179 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 701 place count 178 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 702 place count 177 transition count 141
Applied a total of 702 rules in 46 ms. Remains 177 /550 variables (removed 373) and now considering 141/483 (removed 342) transitions.
// Phase 1: matrix 141 rows 177 cols
[2024-05-25 15:39:26] [INFO ] Computed 77 invariants in 2 ms
[2024-05-25 15:39:26] [INFO ] Implicit Places using invariants in 174 ms returned [43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 175 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/550 places, 141/483 transitions.
Applied a total of 0 rules in 14 ms. Remains 166 /166 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 235 ms. Remains : 166/550 places, 141/483 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s39 0), p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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-18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-13 finished in 343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((X(p2)||p1)))))'
Support contains 5 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 536 transition count 469
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 536 transition count 469
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 536 transition count 468
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 531 transition count 463
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 531 transition count 463
Applied a total of 39 rules in 40 ms. Remains 531 /550 variables (removed 19) and now considering 463/483 (removed 20) transitions.
// Phase 1: matrix 463 rows 531 cols
[2024-05-25 15:39:26] [INFO ] Computed 106 invariants in 3 ms
[2024-05-25 15:39:26] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-25 15:39:26] [INFO ] Invariant cache hit.
[2024-05-25 15:39:27] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
[2024-05-25 15:39:27] [INFO ] Invariant cache hit.
[2024-05-25 15:39:27] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 531/550 places, 463/483 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1134 ms. Remains : 531/550 places, 463/483 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s228 0) (EQ s423 0) (EQ s502 0)), p2:(EQ s264 1), p0:(EQ s203 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 335 ms.
Product exploration explored 100000 steps with 50000 reset in 318 ms.
Computed a total of 476 stabilizing places and 418 stable transitions
Graph (complete) has 1200 edges and 531 vertex of which 530 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 476 stabilizing places and 418 stable transitions
Detected a total of 476/531 stabilizing places and 418/463 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 30 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-18-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-18-LTLFireability-14 finished in 2027 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) U G(p1)))'
Support contains 4 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 483/483 transitions.
Graph (complete) has 1226 edges and 550 vertex of which 549 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 548 transition count 417
Reduce places removed 64 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 67 rules applied. Total rules applied 132 place count 484 transition count 414
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 135 place count 481 transition count 414
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 118 Pre rules applied. Total rules applied 135 place count 481 transition count 296
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 3 with 261 rules applied. Total rules applied 396 place count 338 transition count 296
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 409 place count 325 transition count 283
Iterating global reduction 3 with 13 rules applied. Total rules applied 422 place count 325 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 424 place count 325 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 425 place count 324 transition count 281
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 5 with 283 rules applied. Total rules applied 708 place count 181 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 709 place count 181 transition count 140
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 6 with 2 rules applied. Total rules applied 711 place count 180 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 712 place count 179 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 713 place count 178 transition count 142
Applied a total of 713 rules in 49 ms. Remains 178 /550 variables (removed 372) and now considering 142/483 (removed 341) transitions.
// Phase 1: matrix 142 rows 178 cols
[2024-05-25 15:39:28] [INFO ] Computed 77 invariants in 2 ms
[2024-05-25 15:39:28] [INFO ] Implicit Places using invariants in 125 ms returned [38, 39, 40, 41, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 141 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/550 places, 142/483 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 194 ms. Remains : 164/550 places, 142/483 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s14 1) (EQ s75 1) (EQ s145 1)), p0:(NEQ s39 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 19 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-15 finished in 292 ms.
All properties solved by simple procedures.
Total runtime 44916 ms.

BK_STOP 1716651569169

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

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