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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 11 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 16:39 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 63K 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-03-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716650312519

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-03
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 15:18:34] [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:18:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:18:34] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2024-05-25 15:18:34] [INFO ] Transformed 274 places.
[2024-05-25 15:18:34] [INFO ] Transformed 237 transitions.
[2024-05-25 15:18:34] [INFO ] Found NUPN structural information;
[2024-05-25 15:18:34] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 158 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 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-03-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 236/236 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 236
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 37 place count 236 transition count 201
Iterating global reduction 1 with 35 rules applied. Total rules applied 72 place count 236 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 236 transition count 200
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 87 place count 222 transition count 186
Iterating global reduction 2 with 14 rules applied. Total rules applied 101 place count 222 transition count 186
Applied a total of 101 rules in 59 ms. Remains 222 /273 variables (removed 51) and now considering 186/236 (removed 50) transitions.
// Phase 1: matrix 186 rows 222 cols
[2024-05-25 15:18:35] [INFO ] Computed 41 invariants in 8 ms
[2024-05-25 15:18:35] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-25 15:18:35] [INFO ] Invariant cache hit.
[2024-05-25 15:18:35] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2024-05-25 15:18:35] [INFO ] Invariant cache hit.
[2024-05-25 15:18:35] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 222/273 places, 186/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 612 ms. Remains : 222/273 places, 186/236 transitions.
Support contains 39 out of 222 places after structural reductions.
[2024-05-25 15:18:35] [INFO ] Flatten gal took : 77 ms
[2024-05-25 15:18:35] [INFO ] Flatten gal took : 25 ms
[2024-05-25 15:18:36] [INFO ] Input system was already deterministic with 186 transitions.
Incomplete random walk after 10000 steps, including 119 resets, run finished after 636 ms. (steps per millisecond=15 ) properties (out of 31) seen :24
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 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 24 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 25 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 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 23 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-25 15:18:36] [INFO ] Invariant cache hit.
[2024-05-25 15:18:37] [INFO ] [Real]Absence check using 41 positive place invariants in 19 ms returned sat
[2024-05-25 15:18:37] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-25 15:18:37] [INFO ] [Nat]Absence check using 41 positive place invariants in 13 ms returned sat
[2024-05-25 15:18:37] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2024-05-25 15:18:37] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 5 ms to minimize.
[2024-05-25 15:18:37] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2024-05-25 15:18:37] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-25 15:18:37] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-25 15:18:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 337 ms
[2024-05-25 15:18:37] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-25 15:18:38] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-05-25 15:18:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2024-05-25 15:18:38] [INFO ] After 741ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-25 15:18:38] [INFO ] After 960ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 6 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 186/186 transitions.
Graph (trivial) has 112 edges and 222 vertex of which 7 / 222 are part of one of the 1 SCC in 10 ms
Free SCC test removed 6 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 450 edges and 216 vertex of which 215 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 215 transition count 151
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 190 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 189 transition count 150
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 54 place count 189 transition count 111
Deduced a syphon composed of 39 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 140 place count 142 transition count 111
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 150 place count 132 transition count 101
Iterating global reduction 3 with 10 rules applied. Total rules applied 160 place count 132 transition count 101
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 117 rules applied. Total rules applied 277 place count 73 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 278 place count 72 transition count 42
Applied a total of 278 rules in 81 ms. Remains 72 /222 variables (removed 150) and now considering 42/186 (removed 144) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 72/222 places, 42/186 transitions.
Finished random walk after 136 steps, including 5 resets, run visited all 6 properties in 8 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-03-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA BusinessProcesses-PT-03-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 215 stabilizing places and 177 stable transitions
Graph (complete) has 463 edges and 222 vertex of which 221 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Graph (trivial) has 120 edges and 222 vertex of which 7 / 222 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 455 edges and 216 vertex of which 215 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 214 transition count 148
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 60 place count 185 transition count 148
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 60 place count 185 transition count 106
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 154 place count 133 transition count 106
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 165 place count 122 transition count 95
Iterating global reduction 2 with 11 rules applied. Total rules applied 176 place count 122 transition count 95
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 293 place count 63 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 294 place count 62 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 295 place count 61 transition count 36
Applied a total of 295 rules in 32 ms. Remains 61 /222 variables (removed 161) and now considering 36/186 (removed 150) transitions.
// Phase 1: matrix 36 rows 61 cols
[2024-05-25 15:18:38] [INFO ] Computed 29 invariants in 1 ms
[2024-05-25 15:18:38] [INFO ] Implicit Places using invariants in 86 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/222 places, 36/186 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 126 ms. Remains : 60/222 places, 36/186 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 248 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s45 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22242 reset in 311 ms.
Product exploration explored 100000 steps with 22309 reset in 193 ms.
Computed a total of 60 stabilizing places and 35 stable transitions
Computed a total of 60 stabilizing places and 35 stable transitions
Detected a total of 60/60 stabilizing places and 35/36 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2919 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1308 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 96 steps, run visited all 1 properties in 7 ms. (steps per millisecond=13 )
Probabilistic random walk after 96 steps, saw 48 distinct states, run finished after 7 ms. (steps per millisecond=13 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 36/36 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 60 cols
[2024-05-25 15:18:40] [INFO ] Computed 28 invariants in 1 ms
[2024-05-25 15:18:40] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-25 15:18:40] [INFO ] Invariant cache hit.
[2024-05-25 15:18:40] [INFO ] Implicit Places using invariants and state equation in 76 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 136 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/60 places, 36/36 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 32 transition count 29
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 25 transition count 29
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 23 transition count 27
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 23 transition count 27
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 23 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 22 transition count 26
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 28 place count 18 transition count 22
Applied a total of 28 rules in 8 ms. Remains 18 /32 variables (removed 14) and now considering 22/36 (removed 14) transitions.
// Phase 1: matrix 22 rows 18 cols
[2024-05-25 15:18:40] [INFO ] Computed 0 invariants in 3 ms
[2024-05-25 15:18:40] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-25 15:18:40] [INFO ] Invariant cache hit.
[2024-05-25 15:18:40] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/60 places, 22/36 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 246 ms. Remains : 18/60 places, 22/36 transitions.
Computed a total of 18 stabilizing places and 21 stable transitions
Computed a total of 18 stabilizing places and 21 stable transitions
Detected a total of 18/18 stabilizing places and 21/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 7549 steps, including 2488 resets, run visited all 1 properties in 28 ms. (steps per millisecond=269 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 24747 reset in 138 ms.
Product exploration explored 100000 steps with 24718 reset in 190 ms.
Built C files in :
/tmp/ltsmin11511031636003330433
[2024-05-25 15:18:41] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-25 15:18:41] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:18:41] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-25 15:18:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:18:41] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-25 15:18:41] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:18:41] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11511031636003330433
Running compilation step : cd /tmp/ltsmin11511031636003330433;'/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 228 ms.
Running link step : cd /tmp/ltsmin11511031636003330433;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11511031636003330433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14136042232088658331.hoa' '--buchi-type=spotba'
LTSmin run took 166 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-03-LTLFireability-01 finished in 2998 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(X(X((G(F(p0))&&F(p1)))))))'
Support contains 2 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 208 transition count 172
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 208 transition count 172
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 202 transition count 166
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 202 transition count 166
Applied a total of 40 rules in 20 ms. Remains 202 /222 variables (removed 20) and now considering 166/186 (removed 20) transitions.
// Phase 1: matrix 166 rows 202 cols
[2024-05-25 15:18:41] [INFO ] Computed 41 invariants in 2 ms
[2024-05-25 15:18:41] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-25 15:18:41] [INFO ] Invariant cache hit.
[2024-05-25 15:18:42] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2024-05-25 15:18:42] [INFO ] Invariant cache hit.
[2024-05-25 15:18:42] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/222 places, 166/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 540 ms. Remains : 202/222 places, 166/186 transitions.
Stuttering acceptance computed with spot in 425 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=true, acceptance={} source=4 dest: 6}, { cond=(NOT p1), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s103 1), p1:(EQ s186 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1782 reset in 213 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-02 finished in 1217 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||G(p1)||(X(p3)&&p2)))))'
Support contains 4 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 211 transition count 175
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 211 transition count 175
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 206 transition count 170
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 206 transition count 170
Applied a total of 32 rules in 29 ms. Remains 206 /222 variables (removed 16) and now considering 170/186 (removed 16) transitions.
// Phase 1: matrix 170 rows 206 cols
[2024-05-25 15:18:43] [INFO ] Computed 41 invariants in 2 ms
[2024-05-25 15:18:43] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-25 15:18:43] [INFO ] Invariant cache hit.
[2024-05-25 15:18:44] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned []
Implicit Place search using SMT with State Equation took 1253 ms to find 0 implicit places.
[2024-05-25 15:18:44] [INFO ] Invariant cache hit.
[2024-05-25 15:18:44] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 206/222 places, 170/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1457 ms. Remains : 206/222 places, 170/186 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p2 (NOT p0) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s180 1), p2:(AND (EQ s29 0) (EQ s148 0)), p0:(EQ s29 1), p3:(EQ s65 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33328 reset in 221 ms.
Product exploration explored 100000 steps with 33454 reset in 201 ms.
Computed a total of 200 stabilizing places and 162 stable transitions
Graph (complete) has 435 edges and 206 vertex of which 205 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 200 stabilizing places and 162 stable transitions
Detected a total of 200/206 stabilizing places and 162/170 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0) p3), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND p1 p2 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 3613 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 389 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), false, false]
Incomplete random walk after 10000 steps, including 121 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 15:18:49] [INFO ] Invariant cache hit.
[2024-05-25 15:18:49] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 15:18:49] [INFO ] [Nat]Absence check using 41 positive place invariants in 7 ms returned sat
[2024-05-25 15:18:49] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2024-05-25 15:18:49] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-25 15:18:50] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2024-05-25 15:18:50] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2024-05-25 15:18:50] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-25 15:18:50] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:18:50] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2024-05-25 15:18:50] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 0 ms to minimize.
[2024-05-25 15:18:50] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2024-05-25 15:18:50] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2024-05-25 15:18:53] [INFO ] Deduced a trap composed of 26 places in 2844 ms of which 20 ms to minimize.
[2024-05-25 15:18:53] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-05-25 15:18:53] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-05-25 15:18:53] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2024-05-25 15:18:53] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2024-05-25 15:18:53] [INFO ] Deduced a trap composed of 52 places in 134 ms of which 1 ms to minimize.
[2024-05-25 15:18:53] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:18:54] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 0 ms to minimize.
[2024-05-25 15:18:54] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4098 ms
[2024-05-25 15:18:54] [INFO ] After 4173ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-25 15:18:54] [INFO ] After 4278ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 161 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=161 )
Parikh walk visited 1 properties in 1 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0) p3), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND p1 p2 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2 p3)), (F (AND (NOT p0) p1 p2)), (F (NOT (AND (NOT p0) (NOT p1) p2 p3))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) p2 (NOT p3)))]
Knowledge based reduction with 24 factoid took 7155 ms. Reduced automaton from 5 states, 17 edges and 4 AP (stutter insensitive) to 5 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 320 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), false, false]
Stuttering acceptance computed with spot in 272 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), false, false]
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 170/170 transitions.
Graph (trivial) has 100 edges and 206 vertex of which 6 / 206 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 428 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 199 transition count 139
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 48 place count 176 transition count 139
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 48 place count 176 transition count 100
Deduced a syphon composed of 39 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 87 rules applied. Total rules applied 135 place count 128 transition count 100
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 254 place count 68 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 255 place count 67 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 256 place count 66 transition count 40
Applied a total of 256 rules in 34 ms. Remains 66 /206 variables (removed 140) and now considering 40/170 (removed 130) transitions.
// Phase 1: matrix 40 rows 66 cols
[2024-05-25 15:19:01] [INFO ] Computed 30 invariants in 0 ms
[2024-05-25 15:19:01] [INFO ] Implicit Places using invariants in 85 ms returned [55, 61]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 88 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/206 places, 40/170 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 125 ms. Remains : 64/206 places, 40/170 transitions.
Computed a total of 64 stabilizing places and 39 stable transitions
Computed a total of 64 stabilizing places and 39 stable transitions
Detected a total of 64/64 stabilizing places and 39/40 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND (NOT p0) (NOT p1) p2 p3)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 3336 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter insensitive) to 5 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 290 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), false, false]
Incomplete random walk after 10000 steps, including 2859 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :6
Finished Best-First random walk after 8382 steps, including 1074 resets, run visited all 1 properties in 10 ms. (steps per millisecond=838 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND (NOT p0) (NOT p1) p2 p3)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) p3 p1 p2)), (F (NOT (AND (NOT p0) p3 (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 18 factoid took 4710 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter insensitive) to 5 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 267 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), false, false]
Stuttering acceptance computed with spot in 256 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), false, false]
Stuttering acceptance computed with spot in 240 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), false, false]
Stuttering criterion allowed to conclude after 23040 steps with 5083 reset in 83 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-03 finished in 28205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G((p0 U (p1||X(!p2))))))'
Support contains 7 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 209 transition count 173
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 209 transition count 173
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 204 transition count 168
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 204 transition count 168
Applied a total of 36 rules in 9 ms. Remains 204 /222 variables (removed 18) and now considering 168/186 (removed 18) transitions.
// Phase 1: matrix 168 rows 204 cols
[2024-05-25 15:19:11] [INFO ] Computed 41 invariants in 2 ms
[2024-05-25 15:19:11] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-25 15:19:11] [INFO ] Invariant cache hit.
[2024-05-25 15:19:11] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2024-05-25 15:19:11] [INFO ] Invariant cache hit.
[2024-05-25 15:19:11] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/222 places, 168/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 367 ms. Remains : 204/222 places, 168/186 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, true]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s47 1) (EQ s153 1) (EQ s187 1)), p1:(NEQ s189 1), p2:(AND (EQ s60 1) (EQ s152 1) (EQ s203 1))], nbAcceptance=1, 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 1190 reset in 161 ms.
Product exploration explored 100000 steps with 1179 reset in 163 ms.
Computed a total of 198 stabilizing places and 160 stable transitions
Graph (complete) has 433 edges and 204 vertex of which 203 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 198 stabilizing places and 160 stable transitions
Detected a total of 198/204 stabilizing places and 160/168 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 531 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, true]
Incomplete random walk after 10000 steps, including 115 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 15:19:13] [INFO ] Invariant cache hit.
[2024-05-25 15:19:13] [INFO ] [Real]Absence check using 41 positive place invariants in 9 ms returned sat
[2024-05-25 15:19:13] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2024-05-25 15:19:13] [INFO ] [Nat]Absence check using 41 positive place invariants in 11 ms returned sat
[2024-05-25 15:19:13] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p2))), (G (NOT (AND (NOT p1) p0 p2))), (G (NOT (AND (NOT p1) (NOT p0) p2))), (G (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F p0), (F (AND (NOT p1) (NOT p0))), (F p2)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 1891 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND p1 p2), true, false, false]
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND p1 p2), true, false, false]
Support contains 7 out of 204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 168/168 transitions.
Graph (complete) has 433 edges and 204 vertex of which 203 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 23 place count 202 transition count 144
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 180 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 178 transition count 142
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 49 place count 178 transition count 103
Deduced a syphon composed of 39 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 87 rules applied. Total rules applied 136 place count 130 transition count 103
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 256 place count 69 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 257 place count 69 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 258 place count 68 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 259 place count 67 transition count 42
Applied a total of 259 rules in 31 ms. Remains 67 /204 variables (removed 137) and now considering 42/168 (removed 126) transitions.
// Phase 1: matrix 42 rows 67 cols
[2024-05-25 15:19:16] [INFO ] Computed 29 invariants in 0 ms
[2024-05-25 15:19:16] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-25 15:19:16] [INFO ] Invariant cache hit.
[2024-05-25 15:19:16] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [13, 14, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 42, 44, 46, 48]
Discarding 18 places :
Implicit Place search using SMT with State Equation took 125 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/204 places, 42/168 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 49 transition count 36
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 43 transition count 36
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 40 transition count 33
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 40 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 40 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 38 transition count 31
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 28 place count 35 transition count 28
Applied a total of 28 rules in 7 ms. Remains 35 /49 variables (removed 14) and now considering 28/42 (removed 14) transitions.
// Phase 1: matrix 28 rows 35 cols
[2024-05-25 15:19:16] [INFO ] Computed 11 invariants in 3 ms
[2024-05-25 15:19:16] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-25 15:19:16] [INFO ] Invariant cache hit.
[2024-05-25 15:19:16] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-25 15:19:16] [INFO ] Implicit Places using invariants and state equation in 45 ms returned [2, 4, 5, 6, 10]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 81 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/204 places, 28/168 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 27
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 27
Applied a total of 2 rules in 2 ms. Remains 29 /30 variables (removed 1) and now considering 27/28 (removed 1) transitions.
// Phase 1: matrix 27 rows 29 cols
[2024-05-25 15:19:16] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 15:19:16] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 15:19:16] [INFO ] Invariant cache hit.
[2024-05-25 15:19:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:19:16] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 29/204 places, 27/168 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 312 ms. Remains : 29/204 places, 27/168 transitions.
Computed a total of 27 stabilizing places and 24 stable transitions
Computed a total of 27 stabilizing places and 24 stable transitions
Detected a total of 27/29 stabilizing places and 24/27 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (OR (AND p1 p0) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X (OR p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR (AND p1 (NOT p0)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND p1 p0) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p2)))), true, (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))), (X (X (OR p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 831 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter insensitive) to 7 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND p1 p2), true, false, false]
Incomplete random walk after 10000 steps, including 1090 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 344 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 393 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 361 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 349 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 360 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 384 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-25 15:19:18] [INFO ] Invariant cache hit.
[2024-05-25 15:19:18] [INFO ] [Real]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-05-25 15:19:18] [INFO ] [Real]Absence check using 5 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-25 15:19:18] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:2
[2024-05-25 15:19:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-05-25 15:19:18] [INFO ] [Nat]Absence check using 5 positive and 1 generalized place invariants in 10 ms returned sat
[2024-05-25 15:19:18] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (OR (AND p1 p0) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X (OR p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR (AND p1 (NOT p0)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND p1 p0) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p2)))), true, (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))), (X (X (OR p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2) p0))), (G (OR p1 (NOT p2))), (G (NOT (AND (NOT p1) p2 p0))), (G (NOT (AND (NOT p1) p2 (NOT p0)))), (G (NOT (AND (NOT p1) p2))), (G (NOT (AND p1 p2 p0)))]
False Knowledge obtained : [(F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p0)))), (F (NOT (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))))), (F (OR (AND p1 p0) (AND (NOT p2) p0))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2))]
Knowledge based reduction with 32 factoid took 3798 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter insensitive) to 7 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND p1 p2), true, false, false]
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND p1 p2), true, false, false]
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND p1 p2), true, false, false]
Product exploration explored 100000 steps with 10989 reset in 145 ms.
Product exploration explored 100000 steps with 11012 reset in 148 ms.
Built C files in :
/tmp/ltsmin2005930724674650348
[2024-05-25 15:19:23] [INFO ] Computing symmetric may disable matrix : 27 transitions.
[2024-05-25 15:19:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:19:23] [INFO ] Computing symmetric may enable matrix : 27 transitions.
[2024-05-25 15:19:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:19:23] [INFO ] Computing Do-Not-Accords matrix : 27 transitions.
[2024-05-25 15:19:23] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:19:23] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2005930724674650348
Running compilation step : cd /tmp/ltsmin2005930724674650348;'/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 100 ms.
Running link step : cd /tmp/ltsmin2005930724674650348;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin2005930724674650348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18324662998892151411.hoa' '--buchi-type=spotba'
LTSmin run took 103 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-03-LTLFireability-05 finished in 12130 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Graph (trivial) has 121 edges and 222 vertex of which 7 / 222 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 455 edges and 216 vertex of which 215 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 214 transition count 147
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 184 transition count 147
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 62 place count 184 transition count 105
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 156 place count 132 transition count 105
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 168 place count 120 transition count 93
Iterating global reduction 2 with 12 rules applied. Total rules applied 180 place count 120 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 180 place count 120 transition count 92
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 182 place count 119 transition count 92
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 294 place count 62 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 295 place count 61 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 296 place count 60 transition count 36
Applied a total of 296 rules in 15 ms. Remains 60 /222 variables (removed 162) and now considering 36/186 (removed 150) transitions.
// Phase 1: matrix 36 rows 60 cols
[2024-05-25 15:19:23] [INFO ] Computed 28 invariants in 0 ms
[2024-05-25 15:19:23] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-25 15:19:23] [INFO ] Invariant cache hit.
[2024-05-25 15:19:23] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 142 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/222 places, 36/186 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 159 ms. Remains : 48/222 places, 36/186 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s32 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-03-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-06 finished in 299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||F(p1)))))'
Support contains 2 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 209 transition count 173
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 209 transition count 173
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 204 transition count 168
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 204 transition count 168
Applied a total of 36 rules in 7 ms. Remains 204 /222 variables (removed 18) and now considering 168/186 (removed 18) transitions.
// Phase 1: matrix 168 rows 204 cols
[2024-05-25 15:19:23] [INFO ] Computed 41 invariants in 10 ms
[2024-05-25 15:19:23] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-25 15:19:23] [INFO ] Invariant cache hit.
[2024-05-25 15:19:23] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2024-05-25 15:19:23] [INFO ] Invariant cache hit.
[2024-05-25 15:19:24] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/222 places, 168/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 381 ms. Remains : 204/222 places, 168/186 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(EQ s185 1), p0:(EQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 215 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-07 finished in 544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 209 transition count 173
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 209 transition count 173
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 203 transition count 167
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 203 transition count 167
Applied a total of 38 rules in 12 ms. Remains 203 /222 variables (removed 19) and now considering 167/186 (removed 19) transitions.
// Phase 1: matrix 167 rows 203 cols
[2024-05-25 15:19:24] [INFO ] Computed 41 invariants in 2 ms
[2024-05-25 15:19:24] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-25 15:19:24] [INFO ] Invariant cache hit.
[2024-05-25 15:19:24] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-05-25 15:19:24] [INFO ] Invariant cache hit.
[2024-05-25 15:19:24] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/222 places, 167/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 364 ms. Remains : 203/222 places, 167/186 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s181 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1219 steps with 13 reset in 2 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-08 finished in 502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G((p1&&X(G((p1||G(p2))))))))))'
Support contains 1 out of 222 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 209 transition count 173
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 209 transition count 173
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 204 transition count 168
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 204 transition count 168
Applied a total of 36 rules in 8 ms. Remains 204 /222 variables (removed 18) and now considering 168/186 (removed 18) transitions.
// Phase 1: matrix 168 rows 204 cols
[2024-05-25 15:19:24] [INFO ] Computed 41 invariants in 1 ms
[2024-05-25 15:19:24] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-25 15:19:24] [INFO ] Invariant cache hit.
[2024-05-25 15:19:25] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2024-05-25 15:19:25] [INFO ] Invariant cache hit.
[2024-05-25 15:19:25] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/222 places, 168/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 507 ms. Remains : 204/222 places, 168/186 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(NEQ s179 1), p0:(EQ s179 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7520 steps with 90 reset in 12 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-09 finished in 701 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 (p1||X((G(p2) U (p1&&G(p2)))))))'
Support contains 4 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 211 transition count 175
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 211 transition count 175
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 205 transition count 169
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 205 transition count 169
Applied a total of 34 rules in 9 ms. Remains 205 /222 variables (removed 17) and now considering 169/186 (removed 17) transitions.
// Phase 1: matrix 169 rows 205 cols
[2024-05-25 15:19:25] [INFO ] Computed 41 invariants in 1 ms
[2024-05-25 15:19:25] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-25 15:19:25] [INFO ] Invariant cache hit.
[2024-05-25 15:19:25] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-05-25 15:19:25] [INFO ] Invariant cache hit.
[2024-05-25 15:19:25] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/222 places, 169/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 205/222 places, 169/186 transitions.
Stuttering acceptance computed with spot in 355 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p2)), true, (NOT p2), p0, (AND (NOT p2) p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p0 p2), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s46 1), p0:(OR (EQ s96 1) (NEQ s197 1)), p2:(EQ s174 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-10 finished in 845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 2 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 209 transition count 173
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 209 transition count 173
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 204 transition count 168
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 204 transition count 168
Applied a total of 36 rules in 6 ms. Remains 204 /222 variables (removed 18) and now considering 168/186 (removed 18) transitions.
// Phase 1: matrix 168 rows 204 cols
[2024-05-25 15:19:26] [INFO ] Computed 41 invariants in 1 ms
[2024-05-25 15:19:26] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-25 15:19:26] [INFO ] Invariant cache hit.
[2024-05-25 15:19:26] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-05-25 15:19:26] [INFO ] Invariant cache hit.
[2024-05-25 15:19:26] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/222 places, 168/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 426 ms. Remains : 204/222 places, 168/186 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s182 1), p1:(EQ s126 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 175 ms.
Product exploration explored 100000 steps with 33333 reset in 186 ms.
Computed a total of 198 stabilizing places and 160 stable transitions
Graph (complete) has 431 edges and 204 vertex of which 203 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 198 stabilizing places and 160 stable transitions
Detected a total of 198/204 stabilizing places and 160/168 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-03-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-03-LTLFireability-12 finished in 972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((p1||X(p2))))))'
Support contains 6 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 186/186 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 208 transition count 172
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 208 transition count 172
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 202 transition count 166
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 202 transition count 166
Applied a total of 40 rules in 5 ms. Remains 202 /222 variables (removed 20) and now considering 166/186 (removed 20) transitions.
// Phase 1: matrix 166 rows 202 cols
[2024-05-25 15:19:27] [INFO ] Computed 41 invariants in 19 ms
[2024-05-25 15:19:27] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-25 15:19:27] [INFO ] Invariant cache hit.
[2024-05-25 15:19:27] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-05-25 15:19:27] [INFO ] Invariant cache hit.
[2024-05-25 15:19:27] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/222 places, 166/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 406 ms. Remains : 202/222 places, 166/186 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s27 1) (EQ s136 1) (EQ s201 1)), p2:(OR (EQ s44 0) (EQ s156 0) (EQ s201 0)), p0:(EQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 151 ms.
Product exploration explored 100000 steps with 33333 reset in 150 ms.
Computed a total of 196 stabilizing places and 158 stable transitions
Graph (complete) has 429 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 196 stabilizing places and 158 stable transitions
Detected a total of 196/202 stabilizing places and 158/166 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 14 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-03-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-03-LTLFireability-14 finished in 933 ms.
All properties solved by simple procedures.
Total runtime 53422 ms.

BK_STOP 1716650368422

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-03"
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-03, 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-171620414800293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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