Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r204-oct2-165281599100356.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SemanticWebServices-PT-S064P12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599100356
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 6.0K Apr 29 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 29 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 29 12:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 29 12:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 117K May 10 09:34 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 SemanticWebServices-PT-S064P12-LTLFireability-00
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLFireability-01
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLFireability-02
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLFireability-03
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLFireability-04
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLFireability-05
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLFireability-06
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLFireability-07
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLFireability-08
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLFireability-09
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLFireability-10
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLFireability-11
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLFireability-12
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLFireability-13
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLFireability-14
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652962098286

Running Version 202205111006
[2022-05-19 12:08:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 12:08:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 12:08:19] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2022-05-19 12:08:19] [INFO ] Transformed 104 places.
[2022-05-19 12:08:19] [INFO ] Transformed 158 transitions.
[2022-05-19 12:08:19] [INFO ] Parsed PT model containing 104 places and 158 transitions in 172 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 77 transitions
Reduce redundant transitions removed 77 transitions.
FORMULA SemanticWebServices-PT-S064P12-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 79/79 transitions.
Ensure Unique test removed 20 places
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 80 transition count 79
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 74 transition count 73
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 74 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 72 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 72 transition count 71
Applied a total of 38 rules in 13 ms. Remains 72 /102 variables (removed 30) and now considering 71/79 (removed 8) transitions.
[2022-05-19 12:08:19] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
// Phase 1: matrix 62 rows 72 cols
[2022-05-19 12:08:19] [INFO ] Computed 13 place invariants in 8 ms
[2022-05-19 12:08:19] [INFO ] Implicit Places using invariants in 113 ms returned []
[2022-05-19 12:08:19] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
// Phase 1: matrix 62 rows 72 cols
[2022-05-19 12:08:19] [INFO ] Computed 13 place invariants in 5 ms
[2022-05-19 12:08:19] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-05-19 12:08:19] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2022-05-19 12:08:19] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
// Phase 1: matrix 62 rows 72 cols
[2022-05-19 12:08:19] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-19 12:08:19] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 72/102 places, 71/79 transitions.
Finished structural reductions, in 1 iterations. Remains : 72/102 places, 71/79 transitions.
Support contains 39 out of 72 places after structural reductions.
[2022-05-19 12:08:20] [INFO ] Flatten gal took : 21 ms
[2022-05-19 12:08:20] [INFO ] Flatten gal took : 6 ms
[2022-05-19 12:08:20] [INFO ] Input system was already deterministic with 71 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 25) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Finished Best-First random walk after 4877 steps, including 1 resets, run visited all 1 properties in 7 ms. (steps per millisecond=696 )
FORMULA SemanticWebServices-PT-S064P12-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 9 stabilizing places and 11 stable transitions
Graph (complete) has 197 edges and 72 vertex of which 66 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||(G(F(p1))&&G(p2))))))'
Support contains 5 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 71/71 transitions.
Graph (complete) has 197 edges and 72 vertex of which 66 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 10 places
Reduce places removed 11 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 49 transition count 61
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 49 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 49 transition count 60
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 43 transition count 54
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 43 transition count 54
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 37 transition count 48
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 37 transition count 48
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 31 transition count 42
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 31 transition count 42
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 31 transition count 40
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 27 transition count 36
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 27 transition count 36
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 64 place count 27 transition count 32
Applied a total of 64 rules in 70 ms. Remains 27 /72 variables (removed 45) and now considering 32/71 (removed 39) transitions.
[2022-05-19 12:08:20] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 27 cols
[2022-05-19 12:08:20] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:08:21] [INFO ] Implicit Places using invariants in 48 ms returned []
[2022-05-19 12:08:21] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 27 cols
[2022-05-19 12:08:21] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:08:21] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-19 12:08:21] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2022-05-19 12:08:21] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:08:21] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 27 cols
[2022-05-19 12:08:21] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:08:21] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/72 places, 32/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/72 places, 32/71 transitions.
Stuttering acceptance computed with spot in 322 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s2 1) (GEQ s17 1)), p0:(AND (GEQ s1 1) (GEQ s19 1)), p1:(LT s9 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 313 ms.
Product exploration explored 100000 steps with 0 reset in 244 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
Knowledge based reduction with 11 factoid took 492 ms. Reduced automaton from 2 states, 7 edges and 3 AP to 2 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 70 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 12:08:22] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 27 cols
[2022-05-19 12:08:22] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:08:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-19 12:08:22] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:08:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-19 12:08:22] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:08:22] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-19 12:08:22] [INFO ] After 2ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2022-05-19 12:08:22] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p2) p0)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (F (AND p2 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (AND p2 p0)), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 12 factoid took 632 ms. Reduced automaton from 2 states, 7 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 54 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0))]
[2022-05-19 12:08:23] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 27 cols
[2022-05-19 12:08:23] [INFO ] Computed 2 place invariants in 1 ms
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p2) p0)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (F (AND p2 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (AND p2 p0)), (F (AND p2 (NOT p0))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 12 factoid took 381 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA SemanticWebServices-PT-S064P12-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P12-LTLFireability-00 finished in 3213 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(X(p0))&&F(G(p0))))))'
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 71/71 transitions.
Graph (complete) has 197 edges and 72 vertex of which 66 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 11 places
Reduce places removed 12 places and 1 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 46 transition count 59
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 46 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 46 transition count 58
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 39 transition count 51
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 39 transition count 51
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 32 transition count 44
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 32 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 32 transition count 43
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 53 place count 26 transition count 37
Iterating global reduction 2 with 6 rules applied. Total rules applied 59 place count 26 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 26 transition count 36
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 65 place count 21 transition count 31
Iterating global reduction 3 with 5 rules applied. Total rules applied 70 place count 21 transition count 31
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 75 place count 21 transition count 26
Applied a total of 75 rules in 17 ms. Remains 21 /72 variables (removed 51) and now considering 26/71 (removed 45) transitions.
[2022-05-19 12:08:24] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 21 cols
[2022-05-19 12:08:24] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:08:24] [INFO ] Implicit Places using invariants in 22 ms returned []
[2022-05-19 12:08:24] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 21 cols
[2022-05-19 12:08:24] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-19 12:08:24] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-19 12:08:24] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2022-05-19 12:08:24] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:08:24] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 21 cols
[2022-05-19 12:08:24] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:08:24] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/72 places, 26/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/72 places, 26/71 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-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:(AND (GEQ s1 1) (GEQ s17 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 0 reset in 113 ms.
Product exploration explored 100000 steps with 0 reset in 163 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Finished random walk after 3384 steps, including 1 resets, run visited all 1 properties in 15 ms. (steps per millisecond=225 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2022-05-19 12:08:24] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 21 cols
[2022-05-19 12:08:24] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:08:24] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 12:08:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:08:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-19 12:08:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:08:24] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 12:08:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:08:24] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-19 12:08:24] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-19 12:08:24] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA SemanticWebServices-PT-S064P12-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P12-LTLFireability-01 finished in 965 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (X(G((X(p1)||!p2))) U X(p0)))))'
Support contains 6 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 71/71 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 62 transition count 71
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 15 place count 57 transition count 66
Iterating global reduction 1 with 5 rules applied. Total rules applied 20 place count 57 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 57 transition count 65
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 25 place count 53 transition count 61
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 53 transition count 61
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 33 place count 49 transition count 57
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 49 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 49 transition count 56
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 40 place count 47 transition count 54
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 47 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 44 place count 47 transition count 52
Applied a total of 44 rules in 13 ms. Remains 47 /72 variables (removed 25) and now considering 52/71 (removed 19) transitions.
[2022-05-19 12:08:25] [INFO ] Flow matrix only has 46 transitions (discarded 6 similar events)
// Phase 1: matrix 46 rows 47 cols
[2022-05-19 12:08:25] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 12:08:25] [INFO ] Implicit Places using invariants in 41 ms returned []
[2022-05-19 12:08:25] [INFO ] Flow matrix only has 46 transitions (discarded 6 similar events)
// Phase 1: matrix 46 rows 47 cols
[2022-05-19 12:08:25] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 12:08:25] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-19 12:08:25] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2022-05-19 12:08:25] [INFO ] Flow matrix only has 46 transitions (discarded 6 similar events)
// Phase 1: matrix 46 rows 47 cols
[2022-05-19 12:08:25] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 12:08:25] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/72 places, 52/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/72 places, 52/71 transitions.
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND p2 (NOT p1)), true]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=p2, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s19 1), p2:(AND (GEQ s6 1) (GEQ s38 1) (GEQ s44 1)), p1:(AND (GEQ s7 1) (GEQ s31 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 100 ms.
Entered a terminal (fully accepting) state of product in 120 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLFireability-02 finished in 925 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&G(p2)&&p0)))'
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 71/71 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 61 transition count 71
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 18 place count 54 transition count 64
Iterating global reduction 1 with 7 rules applied. Total rules applied 25 place count 54 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 54 transition count 63
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 31 place count 49 transition count 58
Iterating global reduction 2 with 5 rules applied. Total rules applied 36 place count 49 transition count 58
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 46 transition count 55
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 46 transition count 55
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 44 transition count 53
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 44 transition count 53
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 42 transition count 51
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 42 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 52 place count 42 transition count 49
Applied a total of 52 rules in 15 ms. Remains 42 /72 variables (removed 30) and now considering 49/71 (removed 22) transitions.
[2022-05-19 12:08:25] [INFO ] Flow matrix only has 42 transitions (discarded 7 similar events)
// Phase 1: matrix 42 rows 42 cols
[2022-05-19 12:08:25] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-19 12:08:26] [INFO ] Implicit Places using invariants in 33 ms returned []
[2022-05-19 12:08:26] [INFO ] Flow matrix only has 42 transitions (discarded 7 similar events)
// Phase 1: matrix 42 rows 42 cols
[2022-05-19 12:08:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:08:26] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-05-19 12:08:26] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2022-05-19 12:08:26] [INFO ] Flow matrix only has 42 transitions (discarded 7 similar events)
// Phase 1: matrix 42 rows 42 cols
[2022-05-19 12:08:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:08:26] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/72 places, 49/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/72 places, 49/71 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(GEQ s40 1), p1:(OR (LT s6 1) (LT s33 1)), p0:(AND (GEQ s5 1) (GEQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLFireability-03 finished in 303 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||G(p1)))'
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 71/71 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 61 transition count 71
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 17 place count 55 transition count 65
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 55 transition count 65
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 49 transition count 59
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 49 transition count 59
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 44 transition count 54
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 44 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 44 transition count 53
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 40 transition count 49
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 40 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 40 transition count 47
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 58 place count 38 transition count 45
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 38 transition count 45
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 38 transition count 43
Applied a total of 62 rules in 12 ms. Remains 38 /72 variables (removed 34) and now considering 43/71 (removed 28) transitions.
[2022-05-19 12:08:26] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 38 cols
[2022-05-19 12:08:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:08:26] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-05-19 12:08:26] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 38 cols
[2022-05-19 12:08:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:08:26] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-05-19 12:08:26] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2022-05-19 12:08:26] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 38 cols
[2022-05-19 12:08:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:08:26] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 38/72 places, 43/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/72 places, 43/71 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLFireability-06 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=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}, { cond=p1, acceptance={} source=6 dest: 2}]], initial=4, aps=[p0:(LT s5 1), p1:(OR (LT s6 1) (LT s8 1) (LT s32 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 161 ms.
Product exploration explored 100000 steps with 0 reset in 133 ms.
Computed a total of 9 stabilizing places and 11 stable transitions
Graph (complete) has 87 edges and 38 vertex of which 32 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 9 stabilizing places and 11 stable transitions
Detected a total of 9/38 stabilizing places and 11/43 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 5 factoid took 273 ms. Reduced automaton from 7 states, 14 edges and 2 AP to 6 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 12:08:27] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 38 cols
[2022-05-19 12:08:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:08:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-19 12:08:27] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) p0)), (F (AND p1 p0)), (F p0), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 361 ms. Reduced automaton from 6 states, 11 edges and 2 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 172 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2022-05-19 12:08:28] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 38 cols
[2022-05-19 12:08:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:08:28] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-05-19 12:08:28] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 38 cols
[2022-05-19 12:08:28] [INFO ] Computed 2 place invariants in 8 ms
[2022-05-19 12:08:28] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-05-19 12:08:28] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2022-05-19 12:08:28] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 38 cols
[2022-05-19 12:08:28] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:08:28] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 43/43 transitions.
Computed a total of 9 stabilizing places and 11 stable transitions
Graph (complete) has 87 edges and 38 vertex of which 32 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 9 stabilizing places and 11 stable transitions
Detected a total of 9/38 stabilizing places and 11/43 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 151 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :2
Finished Best-First random walk after 184 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=184 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p0)), (F (AND p1 p0)), (F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 144 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 171 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 184 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 85 ms.
Product exploration explored 100000 steps with 1 reset in 147 ms.
Applying partial POR strategy [true, false, true, true, false, false]
Stuttering acceptance computed with spot in 161 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 43/43 transitions.
Graph (complete) has 87 edges and 38 vertex of which 32 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 31 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 31 transition count 39
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 29 transition count 37
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 29 transition count 37
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 10 place count 26 transition count 34
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 26 transition count 34
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 16 place count 23 transition count 31
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 23 transition count 31
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 22 place count 20 transition count 28
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 20 transition count 28
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 28 place count 20 transition count 25
Applied a total of 28 rules in 12 ms. Remains 20 /38 variables (removed 18) and now considering 25/43 (removed 18) transitions.
[2022-05-19 12:08:29] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:08:29] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
// Phase 1: matrix 23 rows 20 cols
[2022-05-19 12:08:29] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:08:29] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/38 places, 25/43 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/38 places, 25/43 transitions.
Product exploration explored 100000 steps with 0 reset in 147 ms.
Product exploration explored 100000 steps with 0 reset in 136 ms.
Built C files in :
/tmp/ltsmin16446021917517904670
[2022-05-19 12:08:30] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16446021917517904670
Running compilation step : cd /tmp/ltsmin16446021917517904670;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 275 ms.
Running link step : cd /tmp/ltsmin16446021917517904670;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16446021917517904670;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15837844520424205061.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2022-05-19 12:08:45] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 38 cols
[2022-05-19 12:08:45] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:08:45] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-05-19 12:08:45] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 38 cols
[2022-05-19 12:08:45] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:08:45] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-05-19 12:08:45] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-19 12:08:45] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 38 cols
[2022-05-19 12:08:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:08:45] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 43/43 transitions.
Built C files in :
/tmp/ltsmin15867009253485364232
[2022-05-19 12:08:45] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15867009253485364232
Running compilation step : cd /tmp/ltsmin15867009253485364232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin15867009253485364232;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin15867009253485364232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9431463402460699103.hoa' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.002: LTL layer using automaton file : /tmp/stateBased9431463402460699103.hoa
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.009: "(LTLAPp1==true)&&(LTLAPp0==true)" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.010: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.080: DFS-FIFO for weak LTL, using special progress label 46
pins2lts-mc-linux64( 0/ 8), 0.080: There are 47 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.080: State length is 39, there are 57 groups
pins2lts-mc-linux64( 0/ 8), 0.080: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.080: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.080: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.080: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.097: ~1 levels ~960 states ~8208 transitions
pins2lts-mc-linux64( 0/ 8), 0.105: ~1 levels ~1920 states ~17264 transitions
pins2lts-mc-linux64( 0/ 8), 0.117: ~1 levels ~3840 states ~33152 transitions
pins2lts-mc-linux64( 0/ 8), 0.142: ~1 levels ~7680 states ~66400 transitions
pins2lts-mc-linux64( 0/ 8), 0.203: ~1 levels ~15360 states ~137488 transitions
pins2lts-mc-linux64( 0/ 8), 0.366: ~1 levels ~30720 states ~271856 transitions
pins2lts-mc-linux64( 0/ 8), 0.608: ~1 levels ~61440 states ~563584 transitions
pins2lts-mc-linux64( 3/ 8), 1.223: ~11069 levels ~122880 states ~756784 transitions
pins2lts-mc-linux64( 3/ 8), 1.492: ~26429 levels ~245760 states ~1248304 transitions
pins2lts-mc-linux64( 3/ 8), 1.818: ~57149 levels ~491520 states ~2231344 transitions
pins2lts-mc-linux64( 3/ 8), 2.368: ~118589 levels ~983040 states ~4197424 transitions
pins2lts-mc-linux64( 3/ 8), 3.398: ~241469 levels ~1966080 states ~8129584 transitions
pins2lts-mc-linux64( 3/ 8), 6.257: ~487229 levels ~3932160 states ~15993904 transitions
pins2lts-mc-linux64( 4/ 8), 12.349: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 12.559:
pins2lts-mc-linux64( 0/ 8), 12.559: mean standard work distribution: 50.1% (states) 12.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 12.560:
pins2lts-mc-linux64( 0/ 8), 12.560: Explored 2454492 states 26976440 transitions, fanout: 10.991
pins2lts-mc-linux64( 0/ 8), 12.560: Total exploration time 12.460 sec (12.230 sec minimum, 12.309 sec on average)
pins2lts-mc-linux64( 0/ 8), 12.560: States per second: 196990, Transitions per second: 2165043
pins2lts-mc-linux64( 0/ 8), 12.560:
pins2lts-mc-linux64( 0/ 8), 12.560: Progress states detected: 1167359
pins2lts-mc-linux64( 0/ 8), 12.560: Redundant explorations: -89.1031
pins2lts-mc-linux64( 0/ 8), 12.560:
pins2lts-mc-linux64( 0/ 8), 12.560: Queue width: 8B, total height: 3500502, memory: 26.71MB
pins2lts-mc-linux64( 0/ 8), 12.560: Tree memory: 427.8MB, 19.9 B/state, compr.: 12.6%
pins2lts-mc-linux64( 0/ 8), 12.560: Tree fill ratio (roots/leafs): 16.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 12.560: Stored 43 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 12.560: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 12.560: Est. total memory use: 454.6MB (~1050.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15867009253485364232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9431463402460699103.hoa' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15867009253485364232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9431463402460699103.hoa' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:117)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 12:08:58] [INFO ] Flatten gal took : 2 ms
[2022-05-19 12:08:58] [INFO ] Flatten gal took : 3 ms
[2022-05-19 12:08:58] [INFO ] Time to serialize gal into /tmp/LTL7654702516004243705.gal : 1 ms
[2022-05-19 12:08:58] [INFO ] Time to serialize properties into /tmp/LTL13941580309130014687.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7654702516004243705.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13941580309130014687.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7654702...267
Read 1 LTL properties
Checking formula 0 : !(((X(X(G("(p5<1)"))))||(G("(((p16<1)||(p42<1))||(p87<1))"))))
Formula 0 simplified : !(XXG"(p5<1)" | G"(((p16<1)||(p42<1))||(p87<1))")
Detected timeout of ITS tools.
[2022-05-19 12:09:13] [INFO ] Flatten gal took : 2 ms
[2022-05-19 12:09:13] [INFO ] Applying decomposition
[2022-05-19 12:09:13] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14395516265974045908.txt' '-o' '/tmp/graph14395516265974045908.bin' '-w' '/tmp/graph14395516265974045908.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14395516265974045908.bin' '-l' '-1' '-v' '-w' '/tmp/graph14395516265974045908.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:09:13] [INFO ] Decomposing Gal with order
[2022-05-19 12:09:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:09:13] [INFO ] Removed a total of 9 redundant transitions.
[2022-05-19 12:09:13] [INFO ] Flatten gal took : 30 ms
[2022-05-19 12:09:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2022-05-19 12:09:13] [INFO ] Time to serialize gal into /tmp/LTL11184741651851040869.gal : 1 ms
[2022-05-19 12:09:13] [INFO ] Time to serialize properties into /tmp/LTL12969767324876335319.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11184741651851040869.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12969767324876335319.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1118474...247
Read 1 LTL properties
Checking formula 0 : !(((X(X(G("(i0.u2.p5<1)"))))||(G("(((i0.u0.p16<1)||(i0.u2.p42<1))||(i0.u0.p87<1))"))))
Formula 0 simplified : !(XXG"(i0.u2.p5<1)" | G"(((i0.u0.p16<1)||(i0.u2.p42<1))||(i0.u0.p87<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin129767426042561248
[2022-05-19 12:09:28] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin129767426042561248
Running compilation step : cd /tmp/ltsmin129767426042561248;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 89 ms.
Running link step : cd /tmp/ltsmin129767426042561248;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin129767426042561248;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X([]((LTLAPp0==true))))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: LTL layer: formula: (X(X([]((LTLAPp0==true))))||[]((LTLAPp1==true)))
pins2lts-mc-linux64( 0/ 8), 0.002: "(X(X([]((LTLAPp0==true))))||[]((LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: buchi has 7 states
pins2lts-mc-linux64( 0/ 8), 0.012: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.075: DFS-FIFO for weak LTL, using special progress label 46
pins2lts-mc-linux64( 0/ 8), 0.076: There are 47 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.076: State length is 39, there are 57 groups
pins2lts-mc-linux64( 0/ 8), 0.076: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.076: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.076: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.076: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.087: ~1 levels ~960 states ~7952 transitions
pins2lts-mc-linux64( 2/ 8), 0.222: ~1 levels ~1920 states ~16240 transitions
pins2lts-mc-linux64( 2/ 8), 0.272: ~1 levels ~3840 states ~33896 transitions
pins2lts-mc-linux64( 2/ 8), 0.366: ~1 levels ~7680 states ~68304 transitions
pins2lts-mc-linux64( 2/ 8), 0.526: ~1 levels ~15360 states ~146240 transitions
pins2lts-mc-linux64( 2/ 8), 0.876: ~1 levels ~30720 states ~283656 transitions
pins2lts-mc-linux64( 7/ 8), 1.597: ~1 levels ~61440 states ~713624 transitions
pins2lts-mc-linux64( 6/ 8), 2.433: ~1 levels ~122880 states ~1378336 transitions
pins2lts-mc-linux64( 7/ 8), 3.060: ~1 levels ~245760 states ~3006848 transitions
pins2lts-mc-linux64( 0/ 8), 3.591: ~1 levels ~491520 states ~5490536 transitions
pins2lts-mc-linux64( 0/ 8), 4.494: ~1 levels ~983040 states ~10985296 transitions
pins2lts-mc-linux64( 0/ 8), 6.335: ~1 levels ~1966080 states ~22052632 transitions
pins2lts-mc-linux64( 2/ 8), 13.350: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 13.645:
pins2lts-mc-linux64( 0/ 8), 13.645: mean standard work distribution: 37.0% (states) 12.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 13.645:
pins2lts-mc-linux64( 0/ 8), 13.645: Explored 2236027 states 32729139 transitions, fanout: 14.637
pins2lts-mc-linux64( 0/ 8), 13.645: Total exploration time 13.560 sec (13.320 sec minimum, 13.420 sec on average)
pins2lts-mc-linux64( 0/ 8), 13.645: States per second: 164899, Transitions per second: 2413653
pins2lts-mc-linux64( 0/ 8), 13.645:
pins2lts-mc-linux64( 0/ 8), 13.645: Progress states detected: 1669774
pins2lts-mc-linux64( 0/ 8), 13.645: Redundant explorations: -91.3431
pins2lts-mc-linux64( 0/ 8), 13.645:
pins2lts-mc-linux64( 0/ 8), 13.645: Queue width: 8B, total height: 3364604, memory: 25.67MB
pins2lts-mc-linux64( 0/ 8), 13.645: Tree memory: 453.1MB, 18.4 B/state, compr.: 11.6%
pins2lts-mc-linux64( 0/ 8), 13.645: Tree fill ratio (roots/leafs): 19.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 13.645: Stored 43 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 13.645: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 13.645: Est. total memory use: 478.7MB (~1049.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin129767426042561248;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X([]((LTLAPp0==true))))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin129767426042561248;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X([]((LTLAPp0==true))))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property SemanticWebServices-PT-S064P12-LTLFireability-06 finished in 76083 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 5 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 71/71 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 62 transition count 71
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 16 place count 56 transition count 65
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 56 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 56 transition count 64
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 28 place count 51 transition count 59
Iterating global reduction 2 with 5 rules applied. Total rules applied 33 place count 51 transition count 59
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 37 place count 47 transition count 55
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 47 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 47 transition count 54
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 45 place count 44 transition count 51
Iterating global reduction 3 with 3 rules applied. Total rules applied 48 place count 44 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 44 transition count 50
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 51 place count 42 transition count 48
Iterating global reduction 4 with 2 rules applied. Total rules applied 53 place count 42 transition count 48
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 55 place count 42 transition count 46
Applied a total of 55 rules in 8 ms. Remains 42 /72 variables (removed 30) and now considering 46/71 (removed 25) transitions.
[2022-05-19 12:09:42] [INFO ] Flow matrix only has 41 transitions (discarded 5 similar events)
// Phase 1: matrix 41 rows 42 cols
[2022-05-19 12:09:42] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 12:09:42] [INFO ] Implicit Places using invariants in 39 ms returned []
[2022-05-19 12:09:42] [INFO ] Flow matrix only has 41 transitions (discarded 5 similar events)
// Phase 1: matrix 41 rows 42 cols
[2022-05-19 12:09:42] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 12:09:42] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-19 12:09:42] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2022-05-19 12:09:42] [INFO ] Flow matrix only has 41 transitions (discarded 5 similar events)
// Phase 1: matrix 41 rows 42 cols
[2022-05-19 12:09:42] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 12:09:42] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/72 places, 46/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/72 places, 46/71 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s35 1) (GEQ s40 1)), p0:(AND (GEQ s7 1) (GEQ s31 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 115 ms.
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLFireability-07 finished in 350 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F((F(p0)||X(p1)))))||X(p0)))'
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 71/71 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 62 transition count 71
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 16 place count 56 transition count 65
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 56 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 56 transition count 64
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 27 place count 52 transition count 60
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 52 transition count 60
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 34 place count 49 transition count 57
Iterating global reduction 2 with 3 rules applied. Total rules applied 37 place count 49 transition count 57
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 40 place count 46 transition count 54
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 46 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 46 transition count 53
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 46 place count 44 transition count 51
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 44 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 44 transition count 49
Applied a total of 50 rules in 9 ms. Remains 44 /72 variables (removed 28) and now considering 49/71 (removed 22) transitions.
[2022-05-19 12:09:42] [INFO ] Flow matrix only has 43 transitions (discarded 6 similar events)
// Phase 1: matrix 43 rows 44 cols
[2022-05-19 12:09:42] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 12:09:42] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-05-19 12:09:42] [INFO ] Flow matrix only has 43 transitions (discarded 6 similar events)
// Phase 1: matrix 43 rows 44 cols
[2022-05-19 12:09:42] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 12:09:42] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-05-19 12:09:42] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2022-05-19 12:09:42] [INFO ] Flow matrix only has 43 transitions (discarded 6 similar events)
// Phase 1: matrix 43 rows 44 cols
[2022-05-19 12:09:42] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 12:09:42] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 44/72 places, 49/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/72 places, 49/71 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s41 1)), p1:(AND (GEQ s7 1) (GEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Product exploration explored 100000 steps with 50000 reset in 99 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 97 edges and 44 vertex of which 38 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 46 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SemanticWebServices-PT-S064P12-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P12-LTLFireability-08 finished in 549 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(p0))))'
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 71/71 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 61 transition count 71
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 18 place count 54 transition count 64
Iterating global reduction 1 with 7 rules applied. Total rules applied 25 place count 54 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 54 transition count 63
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 32 place count 48 transition count 57
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 48 transition count 57
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 43 transition count 52
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 43 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 43 transition count 51
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 53 place count 39 transition count 47
Iterating global reduction 3 with 4 rules applied. Total rules applied 57 place count 39 transition count 47
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 59 place count 39 transition count 45
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 61 place count 37 transition count 43
Iterating global reduction 4 with 2 rules applied. Total rules applied 63 place count 37 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 65 place count 37 transition count 41
Applied a total of 65 rules in 12 ms. Remains 37 /72 variables (removed 35) and now considering 41/71 (removed 30) transitions.
[2022-05-19 12:09:43] [INFO ] Flow matrix only has 37 transitions (discarded 4 similar events)
// Phase 1: matrix 37 rows 37 cols
[2022-05-19 12:09:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:09:43] [INFO ] Implicit Places using invariants in 19 ms returned []
[2022-05-19 12:09:43] [INFO ] Flow matrix only has 37 transitions (discarded 4 similar events)
// Phase 1: matrix 37 rows 37 cols
[2022-05-19 12:09:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:09:43] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-05-19 12:09:43] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-19 12:09:43] [INFO ] Flow matrix only has 37 transitions (discarded 4 similar events)
// Phase 1: matrix 37 rows 37 cols
[2022-05-19 12:09:43] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:09:43] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 37/72 places, 41/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/72 places, 41/71 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s9 1) (LT s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 82 edges and 37 vertex of which 31 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SemanticWebServices-PT-S064P12-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P12-LTLFireability-09 finished in 395 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U !X(F(p0)))||X(p1))))'
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 71/71 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 61 transition count 71
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 18 place count 54 transition count 64
Iterating global reduction 1 with 7 rules applied. Total rules applied 25 place count 54 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 54 transition count 63
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 31 place count 49 transition count 58
Iterating global reduction 2 with 5 rules applied. Total rules applied 36 place count 49 transition count 58
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 40 place count 45 transition count 54
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 45 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 45 transition count 53
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 48 place count 42 transition count 50
Iterating global reduction 3 with 3 rules applied. Total rules applied 51 place count 42 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 42 transition count 49
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 54 place count 40 transition count 47
Iterating global reduction 4 with 2 rules applied. Total rules applied 56 place count 40 transition count 47
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 58 place count 40 transition count 45
Applied a total of 58 rules in 11 ms. Remains 40 /72 variables (removed 32) and now considering 45/71 (removed 26) transitions.
[2022-05-19 12:09:43] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
// Phase 1: matrix 40 rows 40 cols
[2022-05-19 12:09:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:09:43] [INFO ] Implicit Places using invariants in 29 ms returned []
[2022-05-19 12:09:43] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
// Phase 1: matrix 40 rows 40 cols
[2022-05-19 12:09:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:09:43] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-05-19 12:09:43] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2022-05-19 12:09:43] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
// Phase 1: matrix 40 rows 40 cols
[2022-05-19 12:09:43] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:09:43] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 40/72 places, 45/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/72 places, 45/71 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(GEQ s5 1), p1:(AND (GEQ s6 1) (GEQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 100 ms.
Product exploration explored 100000 steps with 0 reset in 168 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 85 edges and 40 vertex of which 34 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Detected a total of 8/40 stabilizing places and 9/45 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 380 ms. Reduced automaton from 6 states, 15 edges and 2 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 101 ms :[p0, p0, p0, true]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 332 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 81 ms :[p0, p0, p0, true]
Stuttering acceptance computed with spot in 92 ms :[p0, p0, p0, true]
[2022-05-19 12:09:45] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
// Phase 1: matrix 40 rows 40 cols
[2022-05-19 12:09:45] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-19 12:09:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-19 12:09:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:09:45] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-19 12:09:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:09:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-19 12:09:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:09:45] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-19 12:09:45] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-05-19 12:09:45] [INFO ] [Nat]Added 31 Read/Feed constraints in 3 ms returned sat
[2022-05-19 12:09:45] [INFO ] Computed and/alt/rep : 41/54/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 12:09:45] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 40 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2022-05-19 12:09:45] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
// Phase 1: matrix 40 rows 40 cols
[2022-05-19 12:09:45] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:09:45] [INFO ] Implicit Places using invariants in 20 ms returned []
[2022-05-19 12:09:45] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
// Phase 1: matrix 40 rows 40 cols
[2022-05-19 12:09:45] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:09:45] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-05-19 12:09:45] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-19 12:09:45] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
// Phase 1: matrix 40 rows 40 cols
[2022-05-19 12:09:45] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:09:45] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 45/45 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 85 edges and 40 vertex of which 34 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Detected a total of 8/40 stabilizing places and 9/45 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 125 ms :[p0, p0, p0, true]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[p0, p0, p0, true]
Stuttering acceptance computed with spot in 91 ms :[p0, p0, p0, true]
[2022-05-19 12:09:45] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
// Phase 1: matrix 40 rows 40 cols
[2022-05-19 12:09:45] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:09:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-19 12:09:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:09:45] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-19 12:09:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:09:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-19 12:09:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:09:46] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-19 12:09:46] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-05-19 12:09:46] [INFO ] [Nat]Added 31 Read/Feed constraints in 2 ms returned sat
[2022-05-19 12:09:46] [INFO ] Computed and/alt/rep : 41/54/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 12:09:46] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 100 ms :[p0, p0, p0, true]
Product exploration explored 100000 steps with 1 reset in 123 ms.
Product exploration explored 100000 steps with 0 reset in 173 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 96 ms :[p0, p0, p0, true]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 45/45 transitions.
Graph (complete) has 85 edges and 40 vertex of which 34 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 1 places
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 31 transition count 40
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 31 transition count 40
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 7 place count 29 transition count 38
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 29 transition count 38
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 12 place count 26 transition count 35
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 26 transition count 35
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 19 place count 22 transition count 31
Iterating global reduction 0 with 4 rules applied. Total rules applied 23 place count 22 transition count 31
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 27 place count 18 transition count 27
Iterating global reduction 0 with 4 rules applied. Total rules applied 31 place count 18 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 35 place count 18 transition count 23
Applied a total of 35 rules in 7 ms. Remains 18 /40 variables (removed 22) and now considering 23/45 (removed 22) transitions.
[2022-05-19 12:09:46] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:09:46] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 18 cols
[2022-05-19 12:09:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:09:46] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/40 places, 23/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/40 places, 23/45 transitions.
Product exploration explored 100000 steps with 0 reset in 82 ms.
Product exploration explored 100000 steps with 0 reset in 64 ms.
Built C files in :
/tmp/ltsmin2622263779485705820
[2022-05-19 12:09:46] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2622263779485705820
Running compilation step : cd /tmp/ltsmin2622263779485705820;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 84 ms.
Running link step : cd /tmp/ltsmin2622263779485705820;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin2622263779485705820;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14216991283342902099.hoa' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.001: LTL layer using automaton file : /tmp/stateBased14216991283342902099.hoa
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.007: "(LTLAPp0==true)" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.011: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.069: DFS-FIFO for weak LTL, using special progress label 47
pins2lts-mc-linux64( 0/ 8), 0.069: There are 48 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.069: State length is 41, there are 51 groups
pins2lts-mc-linux64( 0/ 8), 0.069: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.069: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.069: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.069: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.106: ~80 levels ~960 states ~7200 transitions
pins2lts-mc-linux64( 0/ 8), 0.150: ~166 levels ~1920 states ~15128 transitions
pins2lts-mc-linux64( 0/ 8), 0.223: ~341 levels ~3840 states ~30992 transitions
pins2lts-mc-linux64( 0/ 8), 0.344: ~669 levels ~7680 states ~62376 transitions
pins2lts-mc-linux64( 0/ 8), 0.515: ~1344 levels ~15360 states ~124968 transitions
pins2lts-mc-linux64( 0/ 8), 0.745: ~2676 levels ~30720 states ~249912 transitions
pins2lts-mc-linux64( 0/ 8), 1.011: ~5346 levels ~61440 states ~501632 transitions
pins2lts-mc-linux64( 0/ 8), 1.277: ~10743 levels ~122880 states ~1005816 transitions
pins2lts-mc-linux64( 0/ 8), 1.561: ~21471 levels ~245760 states ~2012888 transitions
pins2lts-mc-linux64( 0/ 8), 2.037: ~43021 levels ~491520 states ~4029352 transitions
pins2lts-mc-linux64( 0/ 8), 3.012: ~86052 levels ~983040 states ~8060056 transitions
pins2lts-mc-linux64( 0/ 8), 5.024: ~172137 levels ~1966080 states ~16121664 transitions
pins2lts-mc-linux64( 1/ 8), 11.784: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 12.404:
pins2lts-mc-linux64( 0/ 8), 12.405: mean standard work distribution: 49.6% (states) 9.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 12.405:
pins2lts-mc-linux64( 0/ 8), 12.405: Explored 1781626 states 30781664 transitions, fanout: 17.277
pins2lts-mc-linux64( 0/ 8), 12.405: Total exploration time 12.310 sec (11.700 sec minimum, 11.881 sec on average)
pins2lts-mc-linux64( 0/ 8), 12.405: States per second: 144730, Transitions per second: 2500541
pins2lts-mc-linux64( 0/ 8), 12.405:
pins2lts-mc-linux64( 0/ 8), 12.405: Progress states detected: 4036804
pins2lts-mc-linux64( 0/ 8), 12.405: Redundant explorations: -93.3662
pins2lts-mc-linux64( 0/ 8), 12.405:
pins2lts-mc-linux64( 0/ 8), 12.405: Queue width: 8B, total height: 5449817, memory: 41.58MB
pins2lts-mc-linux64( 0/ 8), 12.405: Tree memory: 460.9MB, 18.0 B/state, compr.: 10.8%
pins2lts-mc-linux64( 0/ 8), 12.405: Tree fill ratio (roots/leafs): 20.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 12.405: Stored 45 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 12.405: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 12.405: Est. total memory use: 502.5MB (~1065.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2622263779485705820;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14216991283342902099.hoa' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2622263779485705820;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14216991283342902099.hoa' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:117)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 45/45 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 38 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 38 transition count 44
Applied a total of 3 rules in 2 ms. Remains 38 /40 variables (removed 2) and now considering 44/45 (removed 1) transitions.
[2022-05-19 12:09:59] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
// Phase 1: matrix 39 rows 38 cols
[2022-05-19 12:09:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:09:59] [INFO ] Implicit Places using invariants in 21 ms returned []
[2022-05-19 12:09:59] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
// Phase 1: matrix 39 rows 38 cols
[2022-05-19 12:09:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:09:59] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-19 12:09:59] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-19 12:09:59] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
// Phase 1: matrix 39 rows 38 cols
[2022-05-19 12:09:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:09:59] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 38/40 places, 44/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/40 places, 44/45 transitions.
Built C files in :
/tmp/ltsmin16833750957942229645
[2022-05-19 12:09:59] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16833750957942229645
Running compilation step : cd /tmp/ltsmin16833750957942229645;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 87 ms.
Running link step : cd /tmp/ltsmin16833750957942229645;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin16833750957942229645;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7729968247347750851.hoa' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.181: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.181: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.181: LTL layer using automaton file : /tmp/stateBased7729968247347750851.hoa
pins2lts-mc-linux64( 4/ 8), 0.184: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.184: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.184: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.185: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.184: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.185: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.184: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.184: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.189: "(LTLAPp0==true)" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.189: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.189: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.191: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.191: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.190: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.190: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.192: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.272: DFS-FIFO for weak LTL, using special progress label 46
pins2lts-mc-linux64( 0/ 8), 0.272: There are 47 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.272: State length is 39, there are 50 groups
pins2lts-mc-linux64( 0/ 8), 0.272: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.272: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.272: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.272: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.315: ~92 levels ~960 states ~7752 transitions
pins2lts-mc-linux64( 0/ 8), 0.358: ~175 levels ~1920 states ~15472 transitions
pins2lts-mc-linux64( 0/ 8), 0.427: ~333 levels ~3840 states ~30352 transitions
pins2lts-mc-linux64( 0/ 8), 0.532: ~662 levels ~7680 states ~61664 transitions
pins2lts-mc-linux64( 0/ 8), 0.715: ~1341 levels ~15360 states ~124784 transitions
pins2lts-mc-linux64( 0/ 8), 0.938: ~2671 levels ~30720 states ~249064 transitions
pins2lts-mc-linux64( 0/ 8), 1.202: ~5312 levels ~61440 states ~498696 transitions
pins2lts-mc-linux64( 0/ 8), 1.469: ~10679 levels ~122880 states ~1002448 transitions
pins2lts-mc-linux64( 0/ 8), 1.748: ~21408 levels ~245760 states ~2007824 transitions
pins2lts-mc-linux64( 0/ 8), 2.208: ~42901 levels ~491520 states ~4020808 transitions
pins2lts-mc-linux64( 0/ 8), 3.155: ~85923 levels ~983040 states ~8051416 transitions
pins2lts-mc-linux64( 0/ 8), 5.118: ~171891 levels ~1966080 states ~16111336 transitions
pins2lts-mc-linux64( 2/ 8), 12.012: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 12.563:
pins2lts-mc-linux64( 0/ 8), 12.563: mean standard work distribution: 44.1% (states) 11.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 12.563:
pins2lts-mc-linux64( 0/ 8), 12.563: Explored 1730846 states 31245207 transitions, fanout: 18.052
pins2lts-mc-linux64( 0/ 8), 12.563: Total exploration time 12.270 sec (11.740 sec minimum, 11.919 sec on average)
pins2lts-mc-linux64( 0/ 8), 12.563: States per second: 141063, Transitions per second: 2546472
pins2lts-mc-linux64( 0/ 8), 12.563:
pins2lts-mc-linux64( 0/ 8), 12.564: Progress states detected: 4145241
pins2lts-mc-linux64( 0/ 8), 12.564: Redundant explorations: -93.7965
pins2lts-mc-linux64( 0/ 8), 12.564:
pins2lts-mc-linux64( 0/ 8), 12.564: Queue width: 8B, total height: 5541165, memory: 42.28MB
pins2lts-mc-linux64( 0/ 8), 12.564: Tree memory: 468.9MB, 17.6 B/state, compr.: 11.2%
pins2lts-mc-linux64( 0/ 8), 12.564: Tree fill ratio (roots/leafs): 20.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 12.564: Stored 44 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 12.564: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 12.564: Est. total memory use: 511.1MB (~1066.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16833750957942229645;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7729968247347750851.hoa' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16833750957942229645;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7729968247347750851.hoa' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:117)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 12:10:12] [INFO ] Flatten gal took : 2 ms
[2022-05-19 12:10:12] [INFO ] Flatten gal took : 2 ms
[2022-05-19 12:10:12] [INFO ] Time to serialize gal into /tmp/LTL1847858918669223050.gal : 1 ms
[2022-05-19 12:10:12] [INFO ] Time to serialize properties into /tmp/LTL11562852331432796949.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1847858918669223050.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11562852331432796949.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1847858...267
Read 1 LTL properties
Checking formula 0 : !((G((("(p5>=1)")U(!(X(F("(p5>=1)")))))||(X("((p39>=1)&&(p93>=1))")))))
Formula 0 simplified : !G(("(p5>=1)" U !XF"(p5>=1)") | X"((p39>=1)&&(p93>=1))")
Detected timeout of ITS tools.
[2022-05-19 12:10:27] [INFO ] Flatten gal took : 3 ms
[2022-05-19 12:10:27] [INFO ] Applying decomposition
[2022-05-19 12:10:27] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3031226607265251224.txt' '-o' '/tmp/graph3031226607265251224.bin' '-w' '/tmp/graph3031226607265251224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3031226607265251224.bin' '-l' '-1' '-v' '-w' '/tmp/graph3031226607265251224.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:10:27] [INFO ] Decomposing Gal with order
[2022-05-19 12:10:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:10:27] [INFO ] Removed a total of 10 redundant transitions.
[2022-05-19 12:10:27] [INFO ] Flatten gal took : 3 ms
[2022-05-19 12:10:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2022-05-19 12:10:27] [INFO ] Time to serialize gal into /tmp/LTL3649021647714106444.gal : 1 ms
[2022-05-19 12:10:27] [INFO ] Time to serialize properties into /tmp/LTL14350912969368358057.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3649021647714106444.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14350912969368358057.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3649021...246
Read 1 LTL properties
Checking formula 0 : !((G((("(i0.u3.p5>=1)")U(!(X(F("(i0.u3.p5>=1)")))))||(X("((u14.p39>=1)&&(u14.p93>=1))")))))
Formula 0 simplified : !G(("(i0.u3.p5>=1)" U !XF"(i0.u3.p5>=1)") | X"((u14.p39>=1)&&(u14.p93>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12857580426724763930
[2022-05-19 12:10:42] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12857580426724763930
Running compilation step : cd /tmp/ltsmin12857580426724763930;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin12857580426724763930;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin12857580426724763930;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((((LTLAPp0==true) U !X(<>((LTLAPp0==true))))||X((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: LTL layer: formula: []((((LTLAPp0==true) U !X(<>((LTLAPp0==true))))||X((LTLAPp1==true))))
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: "[]((((LTLAPp0==true) U !X(<>((LTLAPp0==true))))||X((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.025: There are 48 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.025: State length is 41, there are 60 groups
pins2lts-mc-linux64( 0/ 8), 0.025: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.025: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.025: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.025: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.100: [Blue] ~119 levels ~960 states ~3800 transitions
pins2lts-mc-linux64( 2/ 8), 0.212: [Blue] ~239 levels ~1920 states ~7640 transitions
pins2lts-mc-linux64( 2/ 8), 0.461: [Blue] ~479 levels ~3840 states ~15320 transitions
pins2lts-mc-linux64( 2/ 8), 0.534: [Blue] ~959 levels ~7680 states ~30680 transitions
pins2lts-mc-linux64( 2/ 8), 0.667: [Blue] ~1919 levels ~15360 states ~61400 transitions
pins2lts-mc-linux64( 2/ 8), 0.831: [Blue] ~3839 levels ~30720 states ~122840 transitions
pins2lts-mc-linux64( 2/ 8), 1.032: [Blue] ~7679 levels ~61440 states ~245720 transitions
pins2lts-mc-linux64( 2/ 8), 1.279: [Blue] ~15359 levels ~122880 states ~491480 transitions
pins2lts-mc-linux64( 2/ 8), 1.532: [Blue] ~30719 levels ~245760 states ~983000 transitions
pins2lts-mc-linux64( 2/ 8), 1.832: [Blue] ~61439 levels ~491520 states ~1966040 transitions
pins2lts-mc-linux64( 2/ 8), 2.405: [Blue] ~122879 levels ~983040 states ~3932120 transitions
pins2lts-mc-linux64( 2/ 8), 3.645: [Blue] ~245759 levels ~1966080 states ~7864280 transitions
pins2lts-mc-linux64( 2/ 8), 6.357: [Blue] ~491519 levels ~3932160 states ~15728600 transitions
pins2lts-mc-linux64( 5/ 8), 8.611: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 8.824:
pins2lts-mc-linux64( 0/ 8), 8.825: Explored 2235130 states 22897008 transitions, fanout: 10.244
pins2lts-mc-linux64( 0/ 8), 8.825: Total exploration time 8.780 sec (8.580 sec minimum, 8.668 sec on average)
pins2lts-mc-linux64( 0/ 8), 8.825: States per second: 254571, Transitions per second: 2607860
pins2lts-mc-linux64( 0/ 8), 8.825:
pins2lts-mc-linux64( 0/ 8), 8.825: State space has 22343880 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 8.825: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 8.825: blue states: 2235130 (10.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 8.825: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 8.825: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 8.825:
pins2lts-mc-linux64( 0/ 8), 8.825: Total memory used for local state coloring: 34.1MB
pins2lts-mc-linux64( 0/ 8), 8.825:
pins2lts-mc-linux64( 0/ 8), 8.825: Queue width: 8B, total height: 2235128, memory: 17.05MB
pins2lts-mc-linux64( 0/ 8), 8.825: Tree memory: 426.5MB, 20.0 B/state, compr.: 12.1%
pins2lts-mc-linux64( 0/ 8), 8.825: Tree fill ratio (roots/leafs): 16.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 8.825: Stored 45 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 8.825: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 8.825: Est. total memory use: 443.5MB (~1041.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12857580426724763930;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((((LTLAPp0==true) U !X(<>((LTLAPp0==true))))||X((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12857580426724763930;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((((LTLAPp0==true) U !X(<>((LTLAPp0==true))))||X((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property SemanticWebServices-PT-S064P12-LTLFireability-10 finished in 67869 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (F(X(p1))||!F(p1)))))'
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 71/71 transitions.
Graph (complete) has 197 edges and 72 vertex of which 66 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 10 places
Reduce places removed 11 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 48 transition count 60
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 48 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 48 transition count 59
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 42 transition count 53
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 42 transition count 53
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 36 transition count 47
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 36 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 36 transition count 46
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 45 place count 32 transition count 42
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 32 transition count 42
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 27 transition count 37
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 27 transition count 37
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 64 place count 27 transition count 32
Applied a total of 64 rules in 8 ms. Remains 27 /72 variables (removed 45) and now considering 32/71 (removed 39) transitions.
[2022-05-19 12:10:51] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 27 cols
[2022-05-19 12:10:51] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:10:51] [INFO ] Implicit Places using invariants in 21 ms returned []
[2022-05-19 12:10:51] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 27 cols
[2022-05-19 12:10:51] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:10:51] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-19 12:10:51] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-19 12:10:51] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:10:51] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 27 cols
[2022-05-19 12:10:51] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:10:51] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/72 places, 32/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/72 places, 32/71 transitions.
Stuttering acceptance computed with spot in 100 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s18 1)), p0:(AND (GEQ s2 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3 reset in 58 ms.
Product exploration explored 100000 steps with 0 reset in 70 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 75 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 24 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2022-05-19 12:10:52] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 27 cols
[2022-05-19 12:10:52] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:10:52] [INFO ] Implicit Places using invariants in 17 ms returned []
[2022-05-19 12:10:52] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 27 cols
[2022-05-19 12:10:52] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:10:52] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-19 12:10:52] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-19 12:10:52] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:10:52] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 27 cols
[2022-05-19 12:10:52] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:10:52] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 32/32 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 3371 steps, including 1 resets, run visited all 2 properties in 7 ms. (steps per millisecond=481 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 85 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 81 ms.
Product exploration explored 100000 steps with 1 reset in 70 ms.
Built C files in :
/tmp/ltsmin17664495551092646511
[2022-05-19 12:10:53] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2022-05-19 12:10:53] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:10:53] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2022-05-19 12:10:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:10:53] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2022-05-19 12:10:53] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:10:53] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17664495551092646511
Running compilation step : cd /tmp/ltsmin17664495551092646511;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 77 ms.
Running link step : cd /tmp/ltsmin17664495551092646511;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin17664495551092646511;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8256104858856620181.hoa' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Initializing POR dependencies: labels 34, guards 32
pins2lts-mc-linux64( 1/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.003: LTL layer using automaton file : /tmp/stateBased8256104858856620181.hoa
pins2lts-mc-linux64( 5/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.013: "(LTLAPp1==true)&&(LTLAPp0==true)" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.013: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.014: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.025: There are 36 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.025: State length is 28, there are 36 groups
pins2lts-mc-linux64( 0/ 8), 0.025: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.025: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.025: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.025: Visible groups: 0 / 36, labels: 2 / 36
pins2lts-mc-linux64( 0/ 8), 0.025: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.025: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.033: [Blue] ~119 levels ~960 states ~1016 transitions
pins2lts-mc-linux64( 0/ 8), 0.042: [Blue] ~240 levels ~1920 states ~1976 transitions
pins2lts-mc-linux64( 0/ 8), 0.053: [Blue] ~480 levels ~3840 states ~3896 transitions
pins2lts-mc-linux64( 0/ 8), 0.075: [Blue] ~960 levels ~7680 states ~7736 transitions
pins2lts-mc-linux64( 0/ 8), 0.114: [Blue] ~1920 levels ~15360 states ~15416 transitions
pins2lts-mc-linux64( 5/ 8), 0.200: [Blue] ~3840 levels ~30720 states ~30776 transitions
pins2lts-mc-linux64( 5/ 8), 0.334: [Blue] ~7680 levels ~61440 states ~61496 transitions
pins2lts-mc-linux64( 6/ 8), 0.490: [Blue] ~15360 levels ~122880 states ~122936 transitions
pins2lts-mc-linux64( 6/ 8), 0.724: [Blue] ~30720 levels ~245760 states ~245816 transitions
pins2lts-mc-linux64( 6/ 8), 1.089: [Blue] ~61440 levels ~491520 states ~491576 transitions
pins2lts-mc-linux64( 6/ 8), 1.604: [Blue] ~122880 levels ~983040 states ~983096 transitions
pins2lts-mc-linux64( 5/ 8), 1.604: [Blue] ~122880 levels ~1966080 states ~983096 transitions
pins2lts-mc-linux64( 6/ 8), 3.533: [Blue] ~491520 levels ~3932160 states ~3932216 transitions
pins2lts-mc-linux64( 0/ 8), 6.067: [Blue] ~983040 levels ~7864320 states ~7864376 transitions
pins2lts-mc-linux64( 4/ 8), 13.098: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 13.309:
pins2lts-mc-linux64( 0/ 8), 13.309: Explored 14435788 states 14435864 transitions, fanout: 1.000
pins2lts-mc-linux64( 0/ 8), 13.309: Total exploration time 13.280 sec (13.060 sec minimum, 13.116 sec on average)
pins2lts-mc-linux64( 0/ 8), 13.309: States per second: 1087032, Transitions per second: 1087038
pins2lts-mc-linux64( 0/ 8), 13.309:
pins2lts-mc-linux64( 0/ 8), 13.309: State space has 12540514 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 13.309: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 13.309: blue states: 14435788 (115.11%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 13.309: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 13.309: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 13.309:
pins2lts-mc-linux64( 0/ 8), 13.309: Total memory used for local state coloring: 220.3MB
pins2lts-mc-linux64( 0/ 8), 13.309:
pins2lts-mc-linux64( 0/ 8), 13.309: Queue width: 8B, total height: 14435787, memory: 110.14MB
pins2lts-mc-linux64( 0/ 8), 13.309: Tree memory: 351.7MB, 29.4 B/state, compr.: 25.8%
pins2lts-mc-linux64( 0/ 8), 13.309: Tree fill ratio (roots/leafs): 9.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 13.309: Stored 32 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 13.309: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 13.309: Est. total memory use: 461.8MB (~1134.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17664495551092646511;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8256104858856620181.hoa' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17664495551092646511;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8256104858856620181.hoa' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:117)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2022-05-19 12:11:06] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 27 cols
[2022-05-19 12:11:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:11:06] [INFO ] Implicit Places using invariants in 30 ms returned []
[2022-05-19 12:11:06] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 27 cols
[2022-05-19 12:11:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:11:06] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-19 12:11:06] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-19 12:11:06] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:11:06] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 27 cols
[2022-05-19 12:11:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:11:06] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 32/32 transitions.
Built C files in :
/tmp/ltsmin10413333387038615239
[2022-05-19 12:11:06] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2022-05-19 12:11:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:11:06] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2022-05-19 12:11:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:11:06] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2022-05-19 12:11:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:11:06] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10413333387038615239
Running compilation step : cd /tmp/ltsmin10413333387038615239;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 72 ms.
Running link step : cd /tmp/ltsmin10413333387038615239;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin10413333387038615239;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12594043664552507088.hoa' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Initializing POR dependencies: labels 34, guards 32
pins2lts-mc-linux64( 0/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.002: LTL layer using automaton file : /tmp/stateBased12594043664552507088.hoa
pins2lts-mc-linux64( 1/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.009: "(LTLAPp1==true)&&(LTLAPp0==true)" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.009: buchi has 3 states
pins2lts-mc-linux64( 0/ 8), 0.010: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.010: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.015: There are 36 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.015: State length is 28, there are 36 groups
pins2lts-mc-linux64( 0/ 8), 0.015: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.015: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.015: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.015: Visible groups: 0 / 36, labels: 2 / 36
pins2lts-mc-linux64( 0/ 8), 0.015: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.015: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.023: [Blue] ~120 levels ~960 states ~1016 transitions
pins2lts-mc-linux64( 1/ 8), 0.030: [Blue] ~240 levels ~1920 states ~1976 transitions
pins2lts-mc-linux64( 1/ 8), 0.065: [Blue] ~480 levels ~3840 states ~3896 transitions
pins2lts-mc-linux64( 1/ 8), 0.116: [Blue] ~960 levels ~7680 states ~7736 transitions
pins2lts-mc-linux64( 2/ 8), 0.244: [Blue] ~1920 levels ~15360 states ~15416 transitions
pins2lts-mc-linux64( 2/ 8), 0.438: [Blue] ~3840 levels ~30720 states ~30776 transitions
pins2lts-mc-linux64( 2/ 8), 0.585: [Blue] ~7680 levels ~61440 states ~61496 transitions
pins2lts-mc-linux64( 1/ 8), 0.775: [Blue] ~15360 levels ~122880 states ~122936 transitions
pins2lts-mc-linux64( 3/ 8), 1.049: [Blue] ~30720 levels ~245760 states ~245816 transitions
pins2lts-mc-linux64( 5/ 8), 1.422: [Blue] ~61440 levels ~491520 states ~491576 transitions
pins2lts-mc-linux64( 3/ 8), 1.876: [Blue] ~122880 levels ~983040 states ~983096 transitions
pins2lts-mc-linux64( 7/ 8), 2.501: [Blue] ~245760 levels ~1966080 states ~1966136 transitions
pins2lts-mc-linux64( 5/ 8), 3.686: [Blue] ~491520 levels ~3932160 states ~3932216 transitions
pins2lts-mc-linux64( 5/ 8), 6.128: [Blue] ~983040 levels ~7864320 states ~7864376 transitions
pins2lts-mc-linux64( 3/ 8), 12.463: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 12.674:
pins2lts-mc-linux64( 0/ 8), 12.674: Explored 13394059 states 13394139 transitions, fanout: 1.000
pins2lts-mc-linux64( 0/ 8), 12.674: Total exploration time 12.610 sec (12.420 sec minimum, 12.499 sec on average)
pins2lts-mc-linux64( 0/ 8), 12.674: States per second: 1062178, Transitions per second: 1062184
pins2lts-mc-linux64( 0/ 8), 12.674:
pins2lts-mc-linux64( 0/ 8), 12.674: State space has 13394078 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 12.674: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 12.674: blue states: 13394059 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 12.674: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 12.674: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 12.674:
pins2lts-mc-linux64( 0/ 8), 12.674: Total memory used for local state coloring: 204.4MB
pins2lts-mc-linux64( 0/ 8), 12.674:
pins2lts-mc-linux64( 0/ 8), 12.674: Queue width: 8B, total height: 13394058, memory: 102.19MB
pins2lts-mc-linux64( 0/ 8), 12.674: Tree memory: 358.2MB, 28.0 B/state, compr.: 24.6%
pins2lts-mc-linux64( 0/ 8), 12.674: Tree fill ratio (roots/leafs): 9.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 12.674: Stored 32 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 12.674: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 12.674: Est. total memory use: 460.4MB (~1126.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10413333387038615239;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12594043664552507088.hoa' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10413333387038615239;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12594043664552507088.hoa' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:117)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 12:11:19] [INFO ] Flatten gal took : 1 ms
[2022-05-19 12:11:19] [INFO ] Flatten gal took : 1 ms
[2022-05-19 12:11:19] [INFO ] Time to serialize gal into /tmp/LTL8388041803886286783.gal : 1 ms
[2022-05-19 12:11:19] [INFO ] Time to serialize properties into /tmp/LTL17735189406945891585.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8388041803886286783.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17735189406945891585.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8388041...267
Read 1 LTL properties
Checking formula 0 : !((G((X("((p11>=1)&&(p82>=1))"))U((F(X("((p7>=1)&&(p77>=1))")))||(!(F("((p7>=1)&&(p77>=1))")))))))
Formula 0 simplified : !G(X"((p11>=1)&&(p82>=1))" U (FX"((p7>=1)&&(p77>=1))" | !F"((p7>=1)&&(p77>=1))"))
Detected timeout of ITS tools.
[2022-05-19 12:11:34] [INFO ] Flatten gal took : 3 ms
[2022-05-19 12:11:34] [INFO ] Applying decomposition
[2022-05-19 12:11:34] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3136587250636039875.txt' '-o' '/tmp/graph3136587250636039875.bin' '-w' '/tmp/graph3136587250636039875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3136587250636039875.bin' '-l' '-1' '-v' '-w' '/tmp/graph3136587250636039875.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:11:34] [INFO ] Decomposing Gal with order
[2022-05-19 12:11:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:11:34] [INFO ] Removed a total of 5 redundant transitions.
[2022-05-19 12:11:34] [INFO ] Flatten gal took : 2 ms
[2022-05-19 12:11:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 0 ms.
[2022-05-19 12:11:34] [INFO ] Time to serialize gal into /tmp/LTL2370377275424416257.gal : 0 ms
[2022-05-19 12:11:34] [INFO ] Time to serialize properties into /tmp/LTL3796229796269067902.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2370377275424416257.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3796229796269067902.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2370377...245
Read 1 LTL properties
Checking formula 0 : !((G((X("((i1.u2.p11>=1)&&(i1.u2.p82>=1))"))U((F(X("((i1.u2.p7>=1)&&(u7.p77>=1))")))||(!(F("((i1.u2.p7>=1)&&(u7.p77>=1))")))))))
Formula 0 simplified : !G(X"((i1.u2.p11>=1)&&(i1.u2.p82>=1))" U (FX"((i1.u2.p7>=1)&&(u7.p77>=1))" | !F"((i1.u2.p7>=1)&&(u7.p77>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10037070081390209707
[2022-05-19 12:11:49] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10037070081390209707
Running compilation step : cd /tmp/ltsmin10037070081390209707;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 68 ms.
Running link step : cd /tmp/ltsmin10037070081390209707;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin10037070081390209707;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true)) U (<>(X((LTLAPp1==true)))||!<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SemanticWebServices-PT-S064P12-LTLFireability-11 finished in 73393 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&X((X(F(X(p1)))||p2)))))'
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 71/71 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 61 transition count 71
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 18 place count 54 transition count 64
Iterating global reduction 1 with 7 rules applied. Total rules applied 25 place count 54 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 54 transition count 63
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 32 place count 48 transition count 57
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 48 transition count 57
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 44 transition count 53
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 44 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 44 transition count 52
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 50 place count 41 transition count 49
Iterating global reduction 3 with 3 rules applied. Total rules applied 53 place count 41 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 54 place count 41 transition count 48
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 56 place count 39 transition count 46
Iterating global reduction 4 with 2 rules applied. Total rules applied 58 place count 39 transition count 46
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 60 place count 39 transition count 44
Applied a total of 60 rules in 3 ms. Remains 39 /72 variables (removed 33) and now considering 44/71 (removed 27) transitions.
[2022-05-19 12:12:04] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
// Phase 1: matrix 39 rows 39 cols
[2022-05-19 12:12:04] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:12:04] [INFO ] Implicit Places using invariants in 29 ms returned []
[2022-05-19 12:12:04] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
// Phase 1: matrix 39 rows 39 cols
[2022-05-19 12:12:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:12:04] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-19 12:12:04] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2022-05-19 12:12:04] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
// Phase 1: matrix 39 rows 39 cols
[2022-05-19 12:12:04] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:12:05] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 39/72 places, 44/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/72 places, 44/71 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s9 1), p2:(GEQ s19 1), p1:(OR (LT s6 1) (LT s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 115 ms.
Product exploration explored 100000 steps with 1 reset in 143 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 83 edges and 39 vertex of which 33 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Detected a total of 8/39 stabilizing places and 9/44 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (NOT p0)), (X p0), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 309 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 5 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p1)]
Finished random walk after 10 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p0 (NOT p2) p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (NOT p0)), (X p0), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F p2)]
Knowledge based reduction with 4 factoid took 342 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 5 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p1)]
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 44/44 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2022-05-19 12:12:06] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
// Phase 1: matrix 39 rows 39 cols
[2022-05-19 12:12:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:12:06] [INFO ] Implicit Places using invariants in 25 ms returned []
[2022-05-19 12:12:06] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
// Phase 1: matrix 39 rows 39 cols
[2022-05-19 12:12:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:12:06] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-19 12:12:06] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-05-19 12:12:06] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
// Phase 1: matrix 39 rows 39 cols
[2022-05-19 12:12:06] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:12:06] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 44/44 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 83 edges and 39 vertex of which 33 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Detected a total of 8/39 stabilizing places and 9/44 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (NOT p0)), (X p0), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 269 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 5 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p1)]
Finished random walk after 3416 steps, including 2 resets, run visited all 3 properties in 27 ms. (steps per millisecond=126 )
Knowledge obtained : [(AND p0 (NOT p2) p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (NOT p0)), (X p0), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F p2)]
Knowledge based reduction with 4 factoid took 315 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 5 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 54 ms.
Product exploration explored 100000 steps with 0 reset in 164 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p1)]
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 44/44 transitions.
Graph (complete) has 83 edges and 39 vertex of which 33 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 32 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 32 transition count 40
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 30 transition count 38
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 30 transition count 38
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 10 place count 27 transition count 35
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 27 transition count 35
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 16 place count 24 transition count 32
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 24 transition count 32
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 22 place count 21 transition count 29
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 21 transition count 29
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 28 place count 21 transition count 26
Applied a total of 28 rules in 9 ms. Remains 21 /39 variables (removed 18) and now considering 26/44 (removed 18) transitions.
[2022-05-19 12:12:08] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:12:08] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 21 cols
[2022-05-19 12:12:08] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:12:08] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/39 places, 26/44 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/39 places, 26/44 transitions.
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLFireability-12 finished in 3529 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((G((G(p0)&&p1))&&p2)))))'
Support contains 8 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 71/71 transitions.
Ensure Unique test removed 11 places
Reduce places removed 12 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 53 transition count 63
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 53 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 53 transition count 62
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 21 place count 47 transition count 56
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 47 transition count 56
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 43 transition count 52
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 43 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 43 transition count 51
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 41 transition count 49
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 41 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 40 transition count 48
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 40 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 40 transition count 47
Applied a total of 43 rules in 19 ms. Remains 40 /72 variables (removed 32) and now considering 47/71 (removed 24) transitions.
[2022-05-19 12:12:08] [INFO ] Flow matrix only has 40 transitions (discarded 7 similar events)
// Phase 1: matrix 40 rows 40 cols
[2022-05-19 12:12:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:12:08] [INFO ] Implicit Places using invariants in 20 ms returned []
[2022-05-19 12:12:08] [INFO ] Flow matrix only has 40 transitions (discarded 7 similar events)
// Phase 1: matrix 40 rows 40 cols
[2022-05-19 12:12:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:12:08] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-05-19 12:12:08] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-19 12:12:08] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:12:08] [INFO ] Flow matrix only has 40 transitions (discarded 7 similar events)
// Phase 1: matrix 40 rows 40 cols
[2022-05-19 12:12:08] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:12:08] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/72 places, 47/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/72 places, 47/71 transitions.
Stuttering acceptance computed with spot in 30 ms :[(OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1)), p1:(GEQ s20 1), p2:(OR (GEQ s26 1) (AND (GEQ s5 1) (GEQ s32 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 0 reset in 112 ms.
Product exploration explored 100000 steps with 0 reset in 120 ms.
Computed a total of 7 stabilizing places and 8 stable transitions
Graph (complete) has 88 edges and 40 vertex of which 34 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 p1 p2))), (X (X (OR (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 148 ms. Reduced automaton from 1 states, 2 edges and 3 AP to 1 states, 2 edges and 3 AP.
Stuttering acceptance computed with spot in 35 ms :[(OR (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 6827 steps, including 2 resets, run visited all 2 properties in 30 ms. (steps per millisecond=227 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 p1 p2))), (X (X (OR (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(F (AND p0 p1 p2)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 5 factoid took 143 ms. Reduced automaton from 1 states, 2 edges and 3 AP to 1 states, 2 edges and 3 AP.
Stuttering acceptance computed with spot in 24 ms :[(OR (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 26 ms :[(OR (NOT p0) (NOT p1) (NOT p2))]
[2022-05-19 12:12:09] [INFO ] Flow matrix only has 40 transitions (discarded 7 similar events)
// Phase 1: matrix 40 rows 40 cols
[2022-05-19 12:12:09] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:12:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-19 12:12:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:12:09] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-19 12:12:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:12:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-19 12:12:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:12:09] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-19 12:12:09] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-05-19 12:12:09] [INFO ] [Nat]Added 23 Read/Feed constraints in 1 ms returned unsat
Proved EG (NOT p0)
[2022-05-19 12:12:09] [INFO ] Flow matrix only has 40 transitions (discarded 7 similar events)
// Phase 1: matrix 40 rows 40 cols
[2022-05-19 12:12:09] [INFO ] Computed 2 place invariants in 1 ms
Proved EG (NOT p1)
[2022-05-19 12:12:09] [INFO ] Flow matrix only has 40 transitions (discarded 7 similar events)
// Phase 1: matrix 40 rows 40 cols
[2022-05-19 12:12:09] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:12:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-19 12:12:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:12:09] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-19 12:12:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:12:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-19 12:12:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:12:09] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-19 12:12:09] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-05-19 12:12:09] [INFO ] [Nat]Added 23 Read/Feed constraints in 2 ms returned sat
[2022-05-19 12:12:09] [INFO ] Computed and/alt/rep : 34/47/27 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 12:12:09] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 p1 p2))), (X (X (OR (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(F (AND p0 p1 p2)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (G (NOT p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA SemanticWebServices-PT-S064P12-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P12-LTLFireability-13 finished in 1102 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(F((X(p0)||G(p0)))))))'
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 71/71 transitions.
Graph (complete) has 197 edges and 72 vertex of which 66 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 11 places
Reduce places removed 12 places and 1 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 46 transition count 59
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 46 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 46 transition count 58
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 38 transition count 50
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 38 transition count 50
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 31 transition count 43
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 31 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 31 transition count 42
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 25 transition count 36
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 25 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 25 transition count 35
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 67 place count 20 transition count 30
Iterating global reduction 3 with 5 rules applied. Total rules applied 72 place count 20 transition count 30
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 77 place count 20 transition count 25
Applied a total of 77 rules in 10 ms. Remains 20 /72 variables (removed 52) and now considering 25/71 (removed 46) transitions.
[2022-05-19 12:12:09] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 20 cols
[2022-05-19 12:12:09] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:12:09] [INFO ] Implicit Places using invariants in 15 ms returned []
[2022-05-19 12:12:09] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 20 cols
[2022-05-19 12:12:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:12:09] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-19 12:12:09] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-19 12:12:09] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:12:09] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 20 cols
[2022-05-19 12:12:09] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:12:09] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/72 places, 25/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/72 places, 25/71 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s15 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 3 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLFireability-14 finished in 156 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)&&F(X(G(p1)))))&&F(X(G(p0)))))'
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 71/71 transitions.
Graph (complete) has 197 edges and 72 vertex of which 66 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 11 places
Reduce places removed 12 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 47 transition count 60
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 47 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 47 transition count 59
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 23 place count 40 transition count 52
Iterating global reduction 1 with 7 rules applied. Total rules applied 30 place count 40 transition count 52
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 37 place count 33 transition count 45
Iterating global reduction 1 with 7 rules applied. Total rules applied 44 place count 33 transition count 45
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 26 transition count 38
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 26 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 60 place count 26 transition count 36
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 65 place count 21 transition count 31
Iterating global reduction 2 with 5 rules applied. Total rules applied 70 place count 21 transition count 31
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 75 place count 21 transition count 26
Applied a total of 75 rules in 6 ms. Remains 21 /72 variables (removed 51) and now considering 26/71 (removed 45) transitions.
[2022-05-19 12:12:09] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 21 cols
[2022-05-19 12:12:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:12:09] [INFO ] Implicit Places using invariants in 18 ms returned []
[2022-05-19 12:12:09] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 21 cols
[2022-05-19 12:12:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:12:09] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-19 12:12:09] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2022-05-19 12:12:09] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:12:09] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 21 cols
[2022-05-19 12:12:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:12:09] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/72 places, 26/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/72 places, 26/71 transitions.
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s6 1), p1:(AND (GEQ s1 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLFireability-15 finished in 157 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||G(p1)))'
Found a SL insensitive property : SemanticWebServices-PT-S064P12-LTLFireability-06
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 72/72 places, 71/71 transitions.
Graph (complete) has 197 edges and 72 vertex of which 66 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 11 places
Reduce places removed 12 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 47 transition count 60
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 47 transition count 60
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 23 place count 39 transition count 52
Iterating global reduction 0 with 8 rules applied. Total rules applied 31 place count 39 transition count 52
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 39 place count 31 transition count 44
Iterating global reduction 0 with 8 rules applied. Total rules applied 47 place count 31 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 48 place count 31 transition count 43
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 55 place count 24 transition count 36
Iterating global reduction 1 with 7 rules applied. Total rules applied 62 place count 24 transition count 36
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 64 place count 24 transition count 34
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 19 transition count 29
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 19 transition count 29
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 79 place count 19 transition count 24
Applied a total of 79 rules in 6 ms. Remains 19 /72 variables (removed 53) and now considering 24/71 (removed 47) transitions.
[2022-05-19 12:12:10] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 19 cols
[2022-05-19 12:12:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:12:10] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-05-19 12:12:10] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 19 cols
[2022-05-19 12:12:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:12:10] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-19 12:12:10] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-19 12:12:10] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 19 cols
[2022-05-19 12:12:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:12:10] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 19/72 places, 24/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/72 places, 24/71 transitions.
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLFireability-06 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=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}, { cond=p1, acceptance={} source=6 dest: 2}]], initial=4, aps=[p0:(LT s0 1), p1:(OR (LT s1 1) (LT s3 1) (LT s15 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, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 117 ms.
Product exploration explored 100000 steps with 0 reset in 58 ms.
Computed a total of 6 stabilizing places and 9 stable transitions
Computed a total of 6 stabilizing places and 9 stable transitions
Detected a total of 6/19 stabilizing places and 9/24 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 5 factoid took 254 ms. Reduced automaton from 7 states, 14 edges and 2 AP to 6 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 12:12:10] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 19 cols
[2022-05-19 12:12:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:12:11] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 12:12:11] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) p0)), (F (AND p1 p0)), (F p0), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 410 ms. Reduced automaton from 6 states, 11 edges and 2 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 203 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 157 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 24/24 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2022-05-19 12:12:11] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 19 cols
[2022-05-19 12:12:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:12:11] [INFO ] Implicit Places using invariants in 16 ms returned []
[2022-05-19 12:12:11] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 19 cols
[2022-05-19 12:12:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:12:11] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-19 12:12:11] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2022-05-19 12:12:11] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 19 cols
[2022-05-19 12:12:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:12:11] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/19 places, 24/24 transitions.
Computed a total of 6 stabilizing places and 9 stable transitions
Computed a total of 6 stabilizing places and 9 stable transitions
Detected a total of 6/19 stabilizing places and 9/24 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 160 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 9 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p0)), (F (AND p1 p0)), (F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 262 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 126 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1 reset in 123 ms.
Product exploration explored 100000 steps with 2 reset in 89 ms.
Applying partial POR strategy [true, false, true, true, false, false]
Stuttering acceptance computed with spot in 154 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2022-05-19 12:12:13] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:12:13] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 19 cols
[2022-05-19 12:12:13] [INFO ] Computed 1 place invariants in 13 ms
[2022-05-19 12:12:13] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/19 places, 24/24 transitions.
Product exploration explored 100000 steps with 0 reset in 54 ms.
Product exploration explored 100000 steps with 0 reset in 91 ms.
Built C files in :
/tmp/ltsmin1409827395051376874
[2022-05-19 12:12:13] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1409827395051376874
Running compilation step : cd /tmp/ltsmin1409827395051376874;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 61 ms.
Running link step : cd /tmp/ltsmin1409827395051376874;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin1409827395051376874;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3834927597659410719.hoa' '--buchi-type=spotba'
LTSmin run took 898 ms.
Treatment of property SemanticWebServices-PT-S064P12-LTLFireability-06 finished in 4736 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLFireability-06 FALSE TECHNIQUES SL_INSENSITIVE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U !X(F(p0)))||X(p1))))'
Found a SL insensitive property : SemanticWebServices-PT-S064P12-LTLFireability-10
Stuttering acceptance computed with spot in 152 ms :[true, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 72/72 places, 71/71 transitions.
Graph (complete) has 197 edges and 72 vertex of which 66 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 11 places
Reduce places removed 12 places and 1 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 46 transition count 59
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 46 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 46 transition count 58
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 39 transition count 51
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 39 transition count 51
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 32 transition count 44
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 32 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 32 transition count 43
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 53 place count 26 transition count 37
Iterating global reduction 2 with 6 rules applied. Total rules applied 59 place count 26 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 26 transition count 36
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 65 place count 21 transition count 31
Iterating global reduction 3 with 5 rules applied. Total rules applied 70 place count 21 transition count 31
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 75 place count 21 transition count 26
Applied a total of 75 rules in 6 ms. Remains 21 /72 variables (removed 51) and now considering 26/71 (removed 45) transitions.
[2022-05-19 12:12:14] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 21 cols
[2022-05-19 12:12:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:12:14] [INFO ] Implicit Places using invariants in 17 ms returned []
[2022-05-19 12:12:14] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 21 cols
[2022-05-19 12:12:14] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:12:14] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-19 12:12:14] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-19 12:12:14] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 21 cols
[2022-05-19 12:12:14] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:12:14] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 21/72 places, 26/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/72 places, 26/71 transitions.
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(GEQ s0 1), p1:(AND (GEQ s1 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 95 ms.
Product exploration explored 100000 steps with 2 reset in 96 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Detected a total of 5/21 stabilizing places and 7/26 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 404 ms. Reduced automaton from 6 states, 15 edges and 2 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[p0, p0, p0, true]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 372 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 82 ms :[p0, p0, p0, true]
Stuttering acceptance computed with spot in 93 ms :[p0, p0, p0, true]
[2022-05-19 12:12:16] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 21 cols
[2022-05-19 12:12:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:12:16] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 12:12:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:12:16] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-19 12:12:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:12:16] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 12:12:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:12:16] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-19 12:12:16] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-19 12:12:16] [INFO ] [Nat]Added 14 Read/Feed constraints in 12 ms returned sat
[2022-05-19 12:12:16] [INFO ] Computed and/alt/rep : 18/26/15 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 12:12:16] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2022-05-19 12:12:16] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 21 cols
[2022-05-19 12:12:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:12:16] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-05-19 12:12:16] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 21 cols
[2022-05-19 12:12:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:12:16] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-19 12:12:16] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2022-05-19 12:12:16] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 21 cols
[2022-05-19 12:12:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:12:16] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 26/26 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Detected a total of 5/21 stabilizing places and 7/26 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 89 ms :[p0, p0, p0, true]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 94 ms :[p0, p0, p0, true]
Stuttering acceptance computed with spot in 92 ms :[p0, p0, p0, true]
[2022-05-19 12:12:16] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 21 cols
[2022-05-19 12:12:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:12:16] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 12:12:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:12:16] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-19 12:12:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:12:17] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 12:12:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:12:17] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-19 12:12:17] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-19 12:12:17] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2022-05-19 12:12:17] [INFO ] Computed and/alt/rep : 18/26/15 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 12:12:17] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 103 ms :[p0, p0, p0, true]
Product exploration explored 100000 steps with 0 reset in 49 ms.
Product exploration explored 100000 steps with 1 reset in 177 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 107 ms :[p0, p0, p0, true]
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 26/26 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 25
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 25
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 18 transition count 24
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 18 transition count 24
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 17 transition count 23
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 17 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 17 transition count 22
Applied a total of 7 rules in 5 ms. Remains 17 /21 variables (removed 4) and now considering 22/26 (removed 4) transitions.
[2022-05-19 12:12:17] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:12:17] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 17 cols
[2022-05-19 12:12:17] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:12:17] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/21 places, 22/26 transitions.
Finished structural reductions, in 1 iterations. Remains : 17/21 places, 22/26 transitions.
Product exploration explored 100000 steps with 0 reset in 40 ms.
Product exploration explored 100000 steps with 0 reset in 62 ms.
Built C files in :
/tmp/ltsmin8963939135455953872
[2022-05-19 12:12:17] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8963939135455953872
Running compilation step : cd /tmp/ltsmin8963939135455953872;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 68 ms.
Running link step : cd /tmp/ltsmin8963939135455953872;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8963939135455953872;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13894242131573841065.hoa' '--buchi-type=spotba'
LTSmin run took 126 ms.
Treatment of property SemanticWebServices-PT-S064P12-LTLFireability-10 finished in 3318 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLFireability-10 FALSE TECHNIQUES SL_INSENSITIVE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (F(X(p1))||!F(p1)))))'
[2022-05-19 12:12:18] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
[2022-05-19 12:12:18] [INFO ] Applying decomposition
[2022-05-19 12:12:18] [INFO ] Flatten gal took : 2 ms
Built C files in :
/tmp/ltsmin6356301811164747306
[2022-05-19 12:12:18] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2022-05-19 12:12:18] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:12:18] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2022-05-19 12:12:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:12:18] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2022-05-19 12:12:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:12:18] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6356301811164747306
Running compilation step : cd /tmp/ltsmin6356301811164747306;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9753901558055235724.txt' '-o' '/tmp/graph9753901558055235724.bin' '-w' '/tmp/graph9753901558055235724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9753901558055235724.bin' '-l' '-1' '-v' '-w' '/tmp/graph9753901558055235724.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:12:18] [INFO ] Decomposing Gal with order
[2022-05-19 12:12:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:12:18] [INFO ] Removed a total of 16 redundant transitions.
[2022-05-19 12:12:18] [INFO ] Flatten gal took : 4 ms
[2022-05-19 12:12:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 0 ms.
[2022-05-19 12:12:18] [INFO ] Time to serialize gal into /tmp/LTLFireability15387538079233396706.gal : 1 ms
[2022-05-19 12:12:18] [INFO ] Time to serialize properties into /tmp/LTLFireability8021859935198622867.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15387538079233396706.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8021859935198622867.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((G((X("((i6.u16.p11>=1)&&(i6.u5.p82>=1))"))U((F(X("((i4.u13.p7>=1)&&(i4.u13.p77>=1))")))||(!(F("((i4.u13.p7>=1)&&(i4.u13.p77>=1))"))...160
Formula 0 simplified : !G(X"((i6.u16.p11>=1)&&(i6.u5.p82>=1))" U (FX"((i4.u13.p7>=1)&&(i4.u13.p77>=1))" | !F"((i4.u13.p7>=1)&&(i4.u13.p77>=1))"))
Compilation finished in 129 ms.
Running link step : cd /tmp/ltsmin6356301811164747306;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6356301811164747306;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp3==true)) U (<>(X((LTLAPp4==true)))||!<>((LTLAPp4==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: LTL layer: formula: []((X((LTLAPp3==true)) U (<>(X((LTLAPp4==true)))||!<>((LTLAPp4==true)))))
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: "[]((X((LTLAPp3==true)) U (<>(X((LTLAPp4==true)))||!<>((LTLAPp4==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: buchi has 3 states
pins2lts-mc-linux64( 0/ 8), 0.012: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.058: DFS-FIFO for weak LTL, using special progress label 77
pins2lts-mc-linux64( 0/ 8), 0.059: There are 78 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.059: State length is 73, there are 75 groups
pins2lts-mc-linux64( 0/ 8), 0.059: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.059: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.059: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.059: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.072: ~1 levels ~960 states ~13632 transitions
pins2lts-mc-linux64( 2/ 8), 0.116: ~1 levels ~1920 states ~28952 transitions
pins2lts-mc-linux64( 5/ 8), 0.270: ~1 levels ~3840 states ~58632 transitions
pins2lts-mc-linux64( 5/ 8), 0.392: ~1 levels ~7680 states ~114216 transitions
pins2lts-mc-linux64( 5/ 8), 0.626: ~1 levels ~15360 states ~243280 transitions
pins2lts-mc-linux64( 5/ 8), 0.799: ~1 levels ~30720 states ~466040 transitions
pins2lts-mc-linux64( 5/ 8), 1.136: ~1 levels ~61440 states ~923344 transitions
pins2lts-mc-linux64( 5/ 8), 1.696: ~1 levels ~122880 states ~1788128 transitions
pins2lts-mc-linux64( 5/ 8), 2.448: ~1 levels ~245760 states ~3914432 transitions
pins2lts-mc-linux64( 5/ 8), 3.444: ~1 levels ~491520 states ~7614664 transitions
pins2lts-mc-linux64( 5/ 8), 5.508: ~1 levels ~983040 states ~14926592 transitions
pins2lts-mc-linux64( 6/ 8), 10.776: ~1 levels ~1966080 states ~32295520 transitions
pins2lts-mc-linux64( 6/ 8), 19.516: ~1 levels ~3932160 states ~64923104 transitions
pins2lts-mc-linux64( 3/ 8), 36.861: ~1 levels ~7864320 states ~132011080 transitions
pins2lts-mc-linux64( 3/ 8), 72.341: ~1 levels ~15728640 states ~269489408 transitions
pins2lts-mc-linux64( 0/ 8), 144.870: ~1 levels ~31457280 states ~539419728 transitions
pins2lts-mc-linux64( 0/ 8), 183.978: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 184.007:
pins2lts-mc-linux64( 0/ 8), 184.007: mean standard work distribution: 3.0% (states) 1.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 184.007:
pins2lts-mc-linux64( 0/ 8), 184.007: Explored 34893928 states 618612737 transitions, fanout: 17.728
pins2lts-mc-linux64( 0/ 8), 184.007: Total exploration time 183.930 sec (183.910 sec minimum, 183.916 sec on average)
pins2lts-mc-linux64( 0/ 8), 184.007: States per second: 189713, Transitions per second: 3363306
pins2lts-mc-linux64( 0/ 8), 184.007:
pins2lts-mc-linux64( 0/ 8), 184.007: Progress states detected: 134216399
pins2lts-mc-linux64( 0/ 8), 184.007: Redundant explorations: -74.0018
pins2lts-mc-linux64( 0/ 8), 184.007:
pins2lts-mc-linux64( 0/ 8), 184.007: Queue width: 8B, total height: 156306752, memory: 1192.53MB
pins2lts-mc-linux64( 0/ 8), 184.007: Tree memory: 1081.4MB, 8.4 B/state, compr.: 2.9%
pins2lts-mc-linux64( 0/ 8), 184.007: Tree fill ratio (roots/leafs): 99.0%/22.0%
pins2lts-mc-linux64( 0/ 8), 184.007: Stored 71 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 184.007: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 184.007: Est. total memory use: 2274.0MB (~2216.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6356301811164747306;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp3==true)) U (<>(X((LTLAPp4==true)))||!<>((LTLAPp4==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6356301811164747306;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp3==true)) U (<>(X((LTLAPp4==true)))||!<>((LTLAPp4==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 12:33:37] [INFO ] Flatten gal took : 2 ms
[2022-05-19 12:33:37] [INFO ] Time to serialize gal into /tmp/LTLFireability11953575967198706575.gal : 4 ms
[2022-05-19 12:33:37] [INFO ] Time to serialize properties into /tmp/LTLFireability14671554622432962074.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11953575967198706575.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14671554622432962074.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...290
Read 1 LTL properties
Checking formula 0 : !((G((X("((p11>=1)&&(p82>=1))"))U((F(X("((p7>=1)&&(p77>=1))")))||(!(F("((p7>=1)&&(p77>=1))")))))))
Formula 0 simplified : !G(X"((p11>=1)&&(p82>=1))" U (FX"((p7>=1)&&(p77>=1))" | !F"((p7>=1)&&(p77>=1))"))
Detected timeout of ITS tools.
[2022-05-19 12:54:57] [INFO ] Flatten gal took : 90 ms
[2022-05-19 12:54:57] [INFO ] Input system was already deterministic with 71 transitions.
[2022-05-19 12:54:57] [INFO ] Transformed 72 places.
[2022-05-19 12:54:57] [INFO ] Transformed 71 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 12:54:57] [INFO ] Time to serialize gal into /tmp/LTLFireability205935637204720152.gal : 2 ms
[2022-05-19 12:54:57] [INFO ] Time to serialize properties into /tmp/LTLFireability9602994408387765478.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability205935637204720152.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9602994408387765478.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...332
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((X("((p11>=1)&&(p82>=1))"))U((F(X("((p7>=1)&&(p77>=1))")))||(!(F("((p7>=1)&&(p77>=1))")))))))
Formula 0 simplified : !G(X"((p11>=1)&&(p82>=1))" U (FX"((p7>=1)&&(p77>=1))" | !F"((p7>=1)&&(p77>=1))"))

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is SemanticWebServices-PT-S064P12, 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 r204-oct2-165281599100356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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