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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 59K 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-02-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716650152930

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-02
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 15:15:55] [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:15:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:15:56] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-25 15:15:56] [INFO ] Transformed 262 places.
[2024-05-25 15:15:56] [INFO ] Transformed 219 transitions.
[2024-05-25 15:15:56] [INFO ] Found NUPN structural information;
[2024-05-25 15:15:56] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 204/204 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 239 transition count 204
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 34 place count 211 transition count 176
Iterating global reduction 1 with 28 rules applied. Total rules applied 62 place count 211 transition count 176
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 71 place count 202 transition count 167
Iterating global reduction 1 with 9 rules applied. Total rules applied 80 place count 202 transition count 167
Applied a total of 80 rules in 108 ms. Remains 202 /245 variables (removed 43) and now considering 167/204 (removed 37) transitions.
// Phase 1: matrix 167 rows 202 cols
[2024-05-25 15:15:56] [INFO ] Computed 37 invariants in 34 ms
[2024-05-25 15:15:57] [INFO ] Implicit Places using invariants in 1183 ms returned []
[2024-05-25 15:15:57] [INFO ] Invariant cache hit.
[2024-05-25 15:15:57] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 1536 ms to find 0 implicit places.
[2024-05-25 15:15:57] [INFO ] Invariant cache hit.
[2024-05-25 15:15:58] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/245 places, 167/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1887 ms. Remains : 202/245 places, 167/204 transitions.
Support contains 35 out of 202 places after structural reductions.
[2024-05-25 15:15:58] [INFO ] Flatten gal took : 81 ms
[2024-05-25 15:15:58] [INFO ] Flatten gal took : 33 ms
[2024-05-25 15:15:58] [INFO ] Input system was already deterministic with 167 transitions.
Support contains 31 out of 202 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 28) seen :21
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-25 15:15:59] [INFO ] Invariant cache hit.
[2024-05-25 15:15:59] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-25 15:15:59] [INFO ] [Nat]Absence check using 24 positive place invariants in 7 ms returned sat
[2024-05-25 15:15:59] [INFO ] [Nat]Absence check using 24 positive and 13 generalized place invariants in 5 ms returned sat
[2024-05-25 15:16:00] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-25 15:16:00] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 17 ms to minimize.
[2024-05-25 15:16:00] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
[2024-05-25 15:16:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 252 ms
[2024-05-25 15:16:00] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:16:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-25 15:16:00] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-25 15:16:00] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:16:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2024-05-25 15:16:00] [INFO ] After 858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-25 15:16:00] [INFO ] After 1161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 8 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 167/167 transitions.
Graph (trivial) has 92 edges and 202 vertex of which 7 / 202 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 390 edges and 196 vertex of which 193 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 193 transition count 133
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 46 place count 171 transition count 133
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 46 place count 171 transition count 96
Deduced a syphon composed of 37 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 81 rules applied. Total rules applied 127 place count 127 transition count 96
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 131 place count 123 transition count 92
Iterating global reduction 2 with 4 rules applied. Total rules applied 135 place count 123 transition count 92
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 235 place count 72 transition count 43
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 236 place count 72 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 237 place count 71 transition count 42
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 238 place count 71 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 239 place count 70 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 240 place count 69 transition count 41
Applied a total of 240 rules in 50 ms. Remains 69 /202 variables (removed 133) and now considering 41/167 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 69/202 places, 41/167 transitions.
Incomplete random walk after 10000 steps, including 399 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 268 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 41 rows 69 cols
[2024-05-25 15:16:00] [INFO ] Computed 28 invariants in 3 ms
[2024-05-25 15:16:01] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:16:01] [INFO ] [Nat]Absence check using 24 positive place invariants in 4 ms returned sat
[2024-05-25 15:16:01] [INFO ] [Nat]Absence check using 24 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 15:16:01] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:16:01] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:16:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2024-05-25 15:16:01] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2024-05-25 15:16:01] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-02-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 194 stabilizing places and 157 stable transitions
Graph (complete) has 398 edges and 202 vertex of which 199 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Graph (complete) has 398 edges and 202 vertex of which 199 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 198 transition count 139
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 174 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 172 transition count 137
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 53 place count 172 transition count 95
Deduced a syphon composed of 42 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 145 place count 122 transition count 95
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 155 place count 112 transition count 85
Iterating global reduction 3 with 10 rules applied. Total rules applied 165 place count 112 transition count 85
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 269 place count 59 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 270 place count 59 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 271 place count 58 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 272 place count 57 transition count 32
Applied a total of 272 rules in 35 ms. Remains 57 /202 variables (removed 145) and now considering 32/167 (removed 135) transitions.
// Phase 1: matrix 32 rows 57 cols
[2024-05-25 15:16:01] [INFO ] Computed 26 invariants in 1 ms
[2024-05-25 15:16:01] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-25 15:16:01] [INFO ] Invariant cache hit.
[2024-05-25 15:16:01] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 14, 16, 18, 20, 21, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 186 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/202 places, 32/167 transitions.
Graph (complete) has 63 edges and 32 vertex of which 30 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 30 transition count 25
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 24 transition count 25
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 22 transition count 23
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 22 transition count 23
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 26 place count 17 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 28 place count 16 transition count 18
Applied a total of 28 rules in 9 ms. Remains 16 /32 variables (removed 16) and now considering 18/32 (removed 14) transitions.
// Phase 1: matrix 18 rows 16 cols
[2024-05-25 15:16:01] [INFO ] Computed 1 invariants in 2 ms
[2024-05-25 15:16:01] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-25 15:16:01] [INFO ] Invariant cache hit.
[2024-05-25 15:16:01] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/202 places, 18/167 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 307 ms. Remains : 16/202 places, 18/167 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 224 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s15 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 19870 reset in 251 ms.
Stack based approach found an accepted trace after 10 steps with 3 reset with depth 2 and stack size 2 in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-00 finished in 859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)))'
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 193 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 193 transition count 158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 189 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 189 transition count 154
Applied a total of 26 rules in 22 ms. Remains 189 /202 variables (removed 13) and now considering 154/167 (removed 13) transitions.
// Phase 1: matrix 154 rows 189 cols
[2024-05-25 15:16:02] [INFO ] Computed 37 invariants in 3 ms
[2024-05-25 15:16:02] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-25 15:16:02] [INFO ] Invariant cache hit.
[2024-05-25 15:16:02] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2024-05-25 15:16:02] [INFO ] Invariant cache hit.
[2024-05-25 15:16:03] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/202 places, 154/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 607 ms. Remains : 189/202 places, 154/167 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s181 1), p1:(EQ s160 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]]
Stuttering criterion allowed to conclude after 86 steps with 1 reset in 2 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-02 finished in 793 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 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Graph (trivial) has 103 edges and 202 vertex of which 7 / 202 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 391 edges and 196 vertex of which 193 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 192 transition count 129
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 165 transition count 129
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 56 place count 165 transition count 92
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 138 place count 120 transition count 92
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 147 place count 111 transition count 83
Iterating global reduction 2 with 9 rules applied. Total rules applied 156 place count 111 transition count 83
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 256 place count 60 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 257 place count 59 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 258 place count 58 transition count 33
Applied a total of 258 rules in 27 ms. Remains 58 /202 variables (removed 144) and now considering 33/167 (removed 134) transitions.
// Phase 1: matrix 33 rows 58 cols
[2024-05-25 15:16:03] [INFO ] Computed 26 invariants in 1 ms
[2024-05-25 15:16:03] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-25 15:16:03] [INFO ] Invariant cache hit.
[2024-05-25 15:16:03] [INFO ] Implicit Places using invariants and state equation in 116 ms returned [0, 1, 2, 4, 6, 8, 11, 12, 13, 14, 15, 17, 19, 21, 22, 23, 25, 27, 32, 34, 36, 38, 40, 42]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 211 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/202 places, 33/167 transitions.
Graph (complete) has 67 edges and 34 vertex of which 32 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 32 transition count 26
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 26 transition count 26
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 24 transition count 24
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 24 transition count 24
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 26 place count 19 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 28 place count 18 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 18 transition count 17
Applied a total of 30 rules in 10 ms. Remains 18 /34 variables (removed 16) and now considering 17/33 (removed 16) transitions.
// Phase 1: matrix 17 rows 18 cols
[2024-05-25 15:16:03] [INFO ] Computed 2 invariants in 0 ms
[2024-05-25 15:16:03] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-25 15:16:03] [INFO ] Invariant cache hit.
[2024-05-25 15:16:03] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/202 places, 17/167 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 347 ms. Remains : 18/202 places, 17/167 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s9 1) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-04 finished in 467 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((p0 U X(((p1||X(p2)) U X(p0))))))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 192 transition count 157
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 192 transition count 157
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 188 transition count 153
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 188 transition count 153
Applied a total of 28 rules in 13 ms. Remains 188 /202 variables (removed 14) and now considering 153/167 (removed 14) transitions.
// Phase 1: matrix 153 rows 188 cols
[2024-05-25 15:16:03] [INFO ] Computed 37 invariants in 2 ms
[2024-05-25 15:16:03] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-25 15:16:03] [INFO ] Invariant cache hit.
[2024-05-25 15:16:04] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-05-25 15:16:04] [INFO ] Invariant cache hit.
[2024-05-25 15:16:04] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 153/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 535 ms. Remains : 188/202 places, 153/167 transitions.
Stuttering acceptance computed with spot in 426 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s6 1), p1:(AND (EQ s44 1) (EQ s47 1)), p2:(EQ s14 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-02-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-06 finished in 1006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 193 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 193 transition count 158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 189 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 189 transition count 154
Applied a total of 26 rules in 33 ms. Remains 189 /202 variables (removed 13) and now considering 154/167 (removed 13) transitions.
// Phase 1: matrix 154 rows 189 cols
[2024-05-25 15:16:04] [INFO ] Computed 37 invariants in 5 ms
[2024-05-25 15:16:04] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-25 15:16:04] [INFO ] Invariant cache hit.
[2024-05-25 15:16:05] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-05-25 15:16:05] [INFO ] Invariant cache hit.
[2024-05-25 15:16:05] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/202 places, 154/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 522 ms. Remains : 189/202 places, 154/167 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s157 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 85 steps with 1 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-07 finished in 655 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 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Graph (trivial) has 103 edges and 202 vertex of which 7 / 202 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 391 edges and 196 vertex of which 193 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 192 transition count 130
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 166 transition count 130
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 54 place count 166 transition count 92
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 83 rules applied. Total rules applied 137 place count 121 transition count 92
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 146 place count 112 transition count 83
Iterating global reduction 2 with 9 rules applied. Total rules applied 155 place count 112 transition count 83
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 255 place count 61 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 256 place count 60 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 257 place count 59 transition count 33
Applied a total of 257 rules in 27 ms. Remains 59 /202 variables (removed 143) and now considering 33/167 (removed 134) transitions.
// Phase 1: matrix 33 rows 59 cols
[2024-05-25 15:16:05] [INFO ] Computed 27 invariants in 2 ms
[2024-05-25 15:16:05] [INFO ] Implicit Places using invariants in 72 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/202 places, 33/167 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 58/202 places, 33/167 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s12 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-02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-08 finished in 205 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)&&G(F(((p1&&X(p2))||G(p2))))))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 194 transition count 159
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 194 transition count 159
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 191 transition count 156
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 191 transition count 156
Applied a total of 22 rules in 7 ms. Remains 191 /202 variables (removed 11) and now considering 156/167 (removed 11) transitions.
// Phase 1: matrix 156 rows 191 cols
[2024-05-25 15:16:05] [INFO ] Computed 37 invariants in 3 ms
[2024-05-25 15:16:05] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-25 15:16:05] [INFO ] Invariant cache hit.
[2024-05-25 15:16:05] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-05-25 15:16:05] [INFO ] Invariant cache hit.
[2024-05-25 15:16:06] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 191/202 places, 156/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 469 ms. Remains : 191/202 places, 156/167 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s50 1), p2:(NEQ s171 1), p1:(EQ s165 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 133 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-09 finished in 765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(F(p0))&&G(p1))))))'
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 193 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 193 transition count 158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 189 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 189 transition count 154
Applied a total of 26 rules in 6 ms. Remains 189 /202 variables (removed 13) and now considering 154/167 (removed 13) transitions.
// Phase 1: matrix 154 rows 189 cols
[2024-05-25 15:16:06] [INFO ] Computed 37 invariants in 2 ms
[2024-05-25 15:16:06] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-25 15:16:06] [INFO ] Invariant cache hit.
[2024-05-25 15:16:06] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-05-25 15:16:06] [INFO ] Invariant cache hit.
[2024-05-25 15:16:06] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/202 places, 154/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 446 ms. Remains : 189/202 places, 154/167 transitions.
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s169 0), p0:(EQ s128 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2575 reset in 197 ms.
Product exploration explored 100000 steps with 2529 reset in 209 ms.
Computed a total of 182 stabilizing places and 145 stable transitions
Graph (complete) has 376 edges and 189 vertex of which 186 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 182 stabilizing places and 145 stable transitions
Detected a total of 182/189 stabilizing places and 145/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 135 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:16:08] [INFO ] Invariant cache hit.
[2024-05-25 15:16:08] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:16:08] [INFO ] [Nat]Absence check using 28 positive place invariants in 7 ms returned sat
[2024-05-25 15:16:08] [INFO ] [Nat]Absence check using 28 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-25 15:16:08] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:16:08] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:16:10] [INFO ] Deduced a trap composed of 23 places in 1777 ms of which 26 ms to minimize.
[2024-05-25 15:16:10] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-25 15:16:10] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-25 15:16:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1987 ms
[2024-05-25 15:16:10] [INFO ] After 2068ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-25 15:16:10] [INFO ] After 2151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 154/154 transitions.
Graph (trivial) has 91 edges and 189 vertex of which 6 / 189 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 369 edges and 184 vertex of which 181 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 181 transition count 119
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 50 place count 157 transition count 119
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 50 place count 157 transition count 82
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 81 rules applied. Total rules applied 131 place count 113 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 112 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 112 transition count 81
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 235 place count 60 transition count 31
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 236 place count 60 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 237 place count 59 transition count 30
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 238 place count 59 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 239 place count 58 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 240 place count 57 transition count 29
Applied a total of 240 rules in 22 ms. Remains 57 /189 variables (removed 132) and now considering 29/154 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 57/189 places, 29/154 transitions.
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 262 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 154/154 transitions.
Applied a total of 0 rules in 2 ms. Remains 189 /189 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2024-05-25 15:16:11] [INFO ] Invariant cache hit.
[2024-05-25 15:16:11] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-25 15:16:11] [INFO ] Invariant cache hit.
[2024-05-25 15:16:11] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-25 15:16:11] [INFO ] Invariant cache hit.
[2024-05-25 15:16:11] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 459 ms. Remains : 189/189 places, 154/154 transitions.
Computed a total of 182 stabilizing places and 145 stable transitions
Graph (complete) has 376 edges and 189 vertex of which 186 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.8 ms
Computed a total of 182 stabilizing places and 145 stable transitions
Detected a total of 182/189 stabilizing places and 145/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 132 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:16:12] [INFO ] Invariant cache hit.
[2024-05-25 15:16:12] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:16:12] [INFO ] [Nat]Absence check using 28 positive place invariants in 8 ms returned sat
[2024-05-25 15:16:12] [INFO ] [Nat]Absence check using 28 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-25 15:16:12] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:16:12] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-25 15:16:12] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2024-05-25 15:16:12] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-25 15:16:12] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-05-25 15:16:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 329 ms
[2024-05-25 15:16:12] [INFO ] After 417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-25 15:16:12] [INFO ] After 531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 154/154 transitions.
Graph (trivial) has 91 edges and 189 vertex of which 6 / 189 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 369 edges and 184 vertex of which 181 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 181 transition count 119
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 50 place count 157 transition count 119
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 50 place count 157 transition count 82
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 81 rules applied. Total rules applied 131 place count 113 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 112 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 112 transition count 81
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 235 place count 60 transition count 31
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 236 place count 60 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 237 place count 59 transition count 30
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 238 place count 59 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 239 place count 58 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 240 place count 57 transition count 29
Applied a total of 240 rules in 48 ms. Remains 57 /189 variables (removed 132) and now considering 29/154 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 57/189 places, 29/154 transitions.
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 450 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 429 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2606 reset in 217 ms.
Product exploration explored 100000 steps with 2571 reset in 163 ms.
Applying partial POR strategy [false, false, false, true, false]
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 154/154 transitions.
Graph (trivial) has 89 edges and 189 vertex of which 6 / 189 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 370 edges and 184 vertex of which 181 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 181 transition count 145
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 28 Pre rules applied. Total rules applied 25 place count 181 transition count 166
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 53 place count 181 transition count 166
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 174 transition count 153
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 174 transition count 153
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 1 with 59 rules applied. Total rules applied 126 place count 174 transition count 153
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 143 place count 157 transition count 136
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 160 place count 157 transition count 136
Deduced a syphon composed of 86 places in 0 ms
Applied a total of 160 rules in 46 ms. Remains 157 /189 variables (removed 32) and now considering 136/154 (removed 18) transitions.
[2024-05-25 15:16:15] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 136 rows 157 cols
[2024-05-25 15:16:15] [INFO ] Computed 37 invariants in 3 ms
[2024-05-25 15:16:15] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/189 places, 136/154 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 207 ms. Remains : 157/189 places, 136/154 transitions.
Built C files in :
/tmp/ltsmin12143919636433378818
[2024-05-25 15:16:15] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12143919636433378818
Running compilation step : cd /tmp/ltsmin12143919636433378818;'/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 414 ms.
Running link step : cd /tmp/ltsmin12143919636433378818;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin12143919636433378818;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16815478076296982889.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 154/154 transitions.
Applied a total of 0 rules in 4 ms. Remains 189 /189 variables (removed 0) and now considering 154/154 (removed 0) transitions.
// Phase 1: matrix 154 rows 189 cols
[2024-05-25 15:16:30] [INFO ] Computed 37 invariants in 1 ms
[2024-05-25 15:16:30] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-25 15:16:30] [INFO ] Invariant cache hit.
[2024-05-25 15:16:30] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-25 15:16:30] [INFO ] Invariant cache hit.
[2024-05-25 15:16:30] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 300 ms. Remains : 189/189 places, 154/154 transitions.
Built C files in :
/tmp/ltsmin3090175851755886492
[2024-05-25 15:16:30] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3090175851755886492
Running compilation step : cd /tmp/ltsmin3090175851755886492;'/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 262 ms.
Running link step : cd /tmp/ltsmin3090175851755886492;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin3090175851755886492;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9065349012403675220.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 15:16:46] [INFO ] Flatten gal took : 10 ms
[2024-05-25 15:16:46] [INFO ] Flatten gal took : 9 ms
[2024-05-25 15:16:46] [INFO ] Time to serialize gal into /tmp/LTL4280940059701026798.gal : 3 ms
[2024-05-25 15:16:46] [INFO ] Time to serialize properties into /tmp/LTL18062107096601043032.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4280940059701026798.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3721923712689313761.hoa' '-atoms' '/tmp/LTL18062107096601043032.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL18062107096601043032.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3721923712689313761.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t28, t33, t38, t41, t44, t47, t50, t53, t56, t60, t61, t63, t66, t75, t78, t81, t83, t86,...343
Computing Next relation with stutter on 41 deadlock states
Detected timeout of ITS tools.
[2024-05-25 15:17:01] [INFO ] Flatten gal took : 9 ms
[2024-05-25 15:17:01] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:17:01] [INFO ] Time to serialize gal into /tmp/LTL6614109782414487717.gal : 3 ms
[2024-05-25 15:17:01] [INFO ] Time to serialize properties into /tmp/LTL1020937069838893750.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6614109782414487717.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1020937069838893750.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(F("(p160==0)")))&&(G("(p225==0)")))))))
Formula 0 simplified : XXG(XG!"(p160==0)" | F!"(p225==0)")
Reverse transition relation is NOT exact ! Due to transitions t2, t28, t33, t38, t41, t44, t47, t50, t53, t56, t60, t61, t63, t66, t75, t78, t81, t83, t86,...343
Computing Next relation with stutter on 41 deadlock states
Detected timeout of ITS tools.
[2024-05-25 15:17:16] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:17:16] [INFO ] Applying decomposition
[2024-05-25 15:17:16] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5650766249899219640.txt' '-o' '/tmp/graph5650766249899219640.bin' '-w' '/tmp/graph5650766249899219640.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5650766249899219640.bin' '-l' '-1' '-v' '-w' '/tmp/graph5650766249899219640.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:17:16] [INFO ] Decomposing Gal with order
[2024-05-25 15:17:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:17:16] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-25 15:17:16] [INFO ] Flatten gal took : 43 ms
[2024-05-25 15:17:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-25 15:17:16] [INFO ] Time to serialize gal into /tmp/LTL13503518846388763259.gal : 4 ms
[2024-05-25 15:17:16] [INFO ] Time to serialize properties into /tmp/LTL16600621402324012759.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13503518846388763259.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16600621402324012759.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(F("(i16.i1.u45.p160==0)")))&&(G("(i16.i0.u58.p225==0)")))))))
Formula 0 simplified : XXG(XG!"(i16.i1.u45.p160==0)" | F!"(i16.i0.u58.p225==0)")
Reverse transition relation is NOT exact ! Due to transitions t107, t119, t125, i0.u52.t41, i0.u53.t38, i1.i1.u30.t86, i2.t113, i2.u6.t132, i2.u12.t118, i3...572
Computing Next relation with stutter on 41 deadlock states
62 unique states visited
55 strongly connected components in search stack
63 transitions explored
58 items max in DFS search stack
119 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.2187,60180,1,0,99182,1074,2407,136386,276,4351,275698
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-02-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-02-LTLFireability-10 finished in 71558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(X((p0||G(p1))))||G(p2))))))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 195 transition count 160
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 195 transition count 160
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 192 transition count 157
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 192 transition count 157
Applied a total of 20 rules in 31 ms. Remains 192 /202 variables (removed 10) and now considering 157/167 (removed 10) transitions.
// Phase 1: matrix 157 rows 192 cols
[2024-05-25 15:17:17] [INFO ] Computed 37 invariants in 3 ms
[2024-05-25 15:17:18] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-25 15:17:18] [INFO ] Invariant cache hit.
[2024-05-25 15:17:18] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2024-05-25 15:17:18] [INFO ] Invariant cache hit.
[2024-05-25 15:17:18] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/202 places, 157/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 392 ms. Remains : 192/202 places, 157/167 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s164 0), p0:(AND (EQ s166 1) (EQ s21 1)), p2:(EQ s87 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1363 reset in 294 ms.
Product exploration explored 100000 steps with 1362 reset in 352 ms.
Computed a total of 185 stabilizing places and 148 stable transitions
Graph (complete) has 382 edges and 192 vertex of which 189 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 185 stabilizing places and 148 stable transitions
Detected a total of 185/192 stabilizing places and 148/157 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 133 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 15:17:19] [INFO ] Invariant cache hit.
[2024-05-25 15:17:19] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:17:19] [INFO ] [Nat]Absence check using 24 positive place invariants in 5 ms returned sat
[2024-05-25 15:17:19] [INFO ] [Nat]Absence check using 24 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-25 15:17:19] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:17:20] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-25 15:17:20] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-25 15:17:20] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 149 ms
[2024-05-25 15:17:20] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:17:20] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-25 15:17:20] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:17:20] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:17:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 170 ms
[2024-05-25 15:17:20] [INFO ] After 403ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-25 15:17:20] [INFO ] After 471ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 157/157 transitions.
Graph (trivial) has 91 edges and 192 vertex of which 6 / 192 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 375 edges and 187 vertex of which 184 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 184 transition count 124
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 46 place count 162 transition count 124
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 46 place count 162 transition count 86
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 130 place count 116 transition count 86
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 232 place count 64 transition count 36
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 233 place count 64 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 234 place count 63 transition count 35
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 235 place count 63 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 236 place count 62 transition count 34
Applied a total of 236 rules in 13 ms. Remains 62 /192 variables (removed 130) and now considering 34/157 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 62/192 places, 34/157 transitions.
Finished random walk after 47 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=47 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0) p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 (NOT p0) p2)), (F (NOT (AND p1 (NOT p0) (NOT p2))))]
Knowledge based reduction with 6 factoid took 254 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 192 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 157/157 transitions.
Applied a total of 0 rules in 2 ms. Remains 192 /192 variables (removed 0) and now considering 157/157 (removed 0) transitions.
[2024-05-25 15:17:20] [INFO ] Invariant cache hit.
[2024-05-25 15:17:21] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-25 15:17:21] [INFO ] Invariant cache hit.
[2024-05-25 15:17:21] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-25 15:17:21] [INFO ] Invariant cache hit.
[2024-05-25 15:17:21] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 263 ms. Remains : 192/192 places, 157/157 transitions.
Computed a total of 185 stabilizing places and 148 stable transitions
Graph (complete) has 382 edges and 192 vertex of which 189 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 185 stabilizing places and 148 stable transitions
Detected a total of 185/192 stabilizing places and 148/157 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 131 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1723 steps, run visited all 2 properties in 28 ms. (steps per millisecond=61 )
Probabilistic random walk after 1723 steps, saw 943 distinct states, run finished after 28 ms. (steps per millisecond=61 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1359 reset in 165 ms.
Product exploration explored 100000 steps with 1367 reset in 153 ms.
Applying partial POR strategy [false, false, true, false, false]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 157/157 transitions.
Graph (trivial) has 91 edges and 192 vertex of which 6 / 192 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 376 edges and 187 vertex of which 184 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 184 transition count 148
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 29 Pre rules applied. Total rules applied 24 place count 184 transition count 170
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 53 place count 184 transition count 170
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 177 transition count 157
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 177 transition count 157
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 128 place count 177 transition count 157
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 145 place count 160 transition count 140
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 162 place count 160 transition count 140
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 162 rules in 16 ms. Remains 160 /192 variables (removed 32) and now considering 140/157 (removed 17) transitions.
[2024-05-25 15:17:23] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 140 rows 160 cols
[2024-05-25 15:17:23] [INFO ] Computed 37 invariants in 1 ms
[2024-05-25 15:17:23] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/192 places, 140/157 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 160/192 places, 140/157 transitions.
Built C files in :
/tmp/ltsmin1102935665892697144
[2024-05-25 15:17:23] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1102935665892697144
Running compilation step : cd /tmp/ltsmin1102935665892697144;'/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 332 ms.
Running link step : cd /tmp/ltsmin1102935665892697144;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1102935665892697144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6052648022119371074.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 157/157 transitions.
Applied a total of 0 rules in 4 ms. Remains 192 /192 variables (removed 0) and now considering 157/157 (removed 0) transitions.
// Phase 1: matrix 157 rows 192 cols
[2024-05-25 15:17:38] [INFO ] Computed 37 invariants in 2 ms
[2024-05-25 15:17:38] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-25 15:17:38] [INFO ] Invariant cache hit.
[2024-05-25 15:17:38] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-05-25 15:17:38] [INFO ] Invariant cache hit.
[2024-05-25 15:17:38] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 192/192 places, 157/157 transitions.
Built C files in :
/tmp/ltsmin1310829352984703531
[2024-05-25 15:17:38] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1310829352984703531
Running compilation step : cd /tmp/ltsmin1310829352984703531;'/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 294 ms.
Running link step : cd /tmp/ltsmin1310829352984703531;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1310829352984703531;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased413043811239810677.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 15:17:53] [INFO ] Flatten gal took : 37 ms
[2024-05-25 15:17:53] [INFO ] Flatten gal took : 15 ms
[2024-05-25 15:17:53] [INFO ] Time to serialize gal into /tmp/LTL8379055600155581809.gal : 9 ms
[2024-05-25 15:17:53] [INFO ] Time to serialize properties into /tmp/LTL15556063873065073848.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8379055600155581809.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4299295634351478429.hoa' '-atoms' '/tmp/LTL15556063873065073848.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15556063873065073848.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4299295634351478429.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t23, t25, t28, t33, t38, t41, t44, t47, t50, t53, t56, t59, t63, t66, t75, t78, t81, t83,...360
Computing Next relation with stutter on 41 deadlock states
Detected timeout of ITS tools.
[2024-05-25 15:18:09] [INFO ] Flatten gal took : 14 ms
[2024-05-25 15:18:09] [INFO ] Flatten gal took : 12 ms
[2024-05-25 15:18:09] [INFO ] Time to serialize gal into /tmp/LTL8603856428481505980.gal : 2 ms
[2024-05-25 15:18:09] [INFO ] Time to serialize properties into /tmp/LTL10212319961563544293.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8603856428481505980.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10212319961563544293.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(X(("((p211==1)&&(p23==1))")||(G("(p208==0)")))))||(G("(p101==1)")))))))
Formula 0 simplified : XXG(XX(!"((p211==1)&&(p23==1))" & F!"(p208==0)") & F!"(p101==1)")
Reverse transition relation is NOT exact ! Due to transitions t2, t23, t25, t28, t33, t38, t41, t44, t47, t50, t53, t56, t59, t63, t66, t75, t78, t81, t83,...360
Computing Next relation with stutter on 41 deadlock states
Detected timeout of ITS tools.
[2024-05-25 15:18:24] [INFO ] Flatten gal took : 16 ms
[2024-05-25 15:18:24] [INFO ] Applying decomposition
[2024-05-25 15:18:24] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5050491832344098422.txt' '-o' '/tmp/graph5050491832344098422.bin' '-w' '/tmp/graph5050491832344098422.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5050491832344098422.bin' '-l' '-1' '-v' '-w' '/tmp/graph5050491832344098422.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:18:24] [INFO ] Decomposing Gal with order
[2024-05-25 15:18:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:18:24] [INFO ] Removed a total of 34 redundant transitions.
[2024-05-25 15:18:24] [INFO ] Flatten gal took : 20 ms
[2024-05-25 15:18:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2024-05-25 15:18:24] [INFO ] Time to serialize gal into /tmp/LTL14356864018373925279.gal : 4 ms
[2024-05-25 15:18:24] [INFO ] Time to serialize properties into /tmp/LTL8380805047474320438.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14356864018373925279.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8380805047474320438.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(X(("((i18.u54.p211==1)&&(i5.u8.p23==1))")||(G("(i18.u57.p208==0)")))))||(G("(i12.u0.p101==1)")))))))
Formula 0 simplified : XXG(XX(!"((i18.u54.p211==1)&&(i5.u8.p23==1))" & F!"(i18.u57.p208==0)") & F!"(i12.u0.p101==1)")
Reverse transition relation is NOT exact ! Due to transitions t103, t107, t113, t125, i1.u24.t98, i1.u26.t94, i2.u20.t106, i2.u22.t102, i3.t119, i3.u6.t132...599
Computing Next relation with stutter on 41 deadlock states
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
5 items max in DFS search stack
470 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.73482,136352,1,0,297171,519,2413,329959,235,3968,516311
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-02-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-02-LTLFireability-11 finished in 71942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||(X(p1)&&G(p2)))))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 192 transition count 157
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 192 transition count 157
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 188 transition count 153
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 188 transition count 153
Applied a total of 28 rules in 4 ms. Remains 188 /202 variables (removed 14) and now considering 153/167 (removed 14) transitions.
// Phase 1: matrix 153 rows 188 cols
[2024-05-25 15:18:29] [INFO ] Computed 37 invariants in 3 ms
[2024-05-25 15:18:29] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-25 15:18:29] [INFO ] Invariant cache hit.
[2024-05-25 15:18:30] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2024-05-25 15:18:30] [INFO ] Invariant cache hit.
[2024-05-25 15:18:30] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 153/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 350 ms. Remains : 188/202 places, 153/167 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s112 1), p0:(EQ s31 1), p1:(EQ s98 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, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-12 finished in 597 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)||G(p1))))'
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 192 transition count 157
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 192 transition count 157
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 188 transition count 153
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 188 transition count 153
Applied a total of 28 rules in 7 ms. Remains 188 /202 variables (removed 14) and now considering 153/167 (removed 14) transitions.
[2024-05-25 15:18:30] [INFO ] Invariant cache hit.
[2024-05-25 15:18:30] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-25 15:18:30] [INFO ] Invariant cache hit.
[2024-05-25 15:18:30] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-05-25 15:18:30] [INFO ] Invariant cache hit.
[2024-05-25 15:18:30] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 153/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 310 ms. Remains : 188/202 places, 153/167 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), 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 (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s77 1), p1:(EQ s161 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]]
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-13 finished in 448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F((!p1 U (G(!p1)||(!p1&&G((p2&&F(p3)))))))))))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 167/167 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 193 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 193 transition count 158
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 190 transition count 155
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 190 transition count 155
Applied a total of 24 rules in 10 ms. Remains 190 /202 variables (removed 12) and now considering 155/167 (removed 12) transitions.
// Phase 1: matrix 155 rows 190 cols
[2024-05-25 15:18:30] [INFO ] Computed 37 invariants in 2 ms
[2024-05-25 15:18:31] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-25 15:18:31] [INFO ] Invariant cache hit.
[2024-05-25 15:18:31] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-25 15:18:31] [INFO ] Invariant cache hit.
[2024-05-25 15:18:31] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/202 places, 155/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 190/202 places, 155/167 transitions.
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p1 (NOT p3)), (OR (AND p1 (NOT p2)) (AND p1 (NOT p3)))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(OR (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) p1), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p2 p1), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s165 0), p2:(EQ s164 1), p1:(EQ s165 1), p3:(EQ s171 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 50000 reset in 272 ms.
Product exploration explored 100000 steps with 50000 reset in 233 ms.
Computed a total of 183 stabilizing places and 146 stable transitions
Graph (complete) has 379 edges and 190 vertex of which 187 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 183 stabilizing places and 146 stable transitions
Detected a total of 183/190 stabilizing places and 146/155 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (OR (NOT p2) p1))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 40 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-02-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-02-LTLFireability-14 finished in 1220 ms.
All properties solved by simple procedures.
Total runtime 156298 ms.

BK_STOP 1716650312364

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

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