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-165281599100355.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599100355
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652961939208

Running Version 202205111006
[2022-05-19 12:05:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:05:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 12:05:40] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2022-05-19 12:05:40] [INFO ] Transformed 104 places.
[2022-05-19 12:05:40] [INFO ] Transformed 158 transitions.
[2022-05-19 12:05:40] [INFO ] Parsed PT model containing 104 places and 158 transitions in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 2 places in 0 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-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 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 25 places
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 77 transition count 79
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 73 transition count 75
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 73 transition count 75
Applied a total of 33 rules in 33 ms. Remains 73 /102 variables (removed 29) and now considering 75/79 (removed 4) transitions.
[2022-05-19 12:05:41] [INFO ] Flow matrix only has 66 transitions (discarded 9 similar events)
// Phase 1: matrix 66 rows 73 cols
[2022-05-19 12:05:41] [INFO ] Computed 10 place invariants in 13 ms
[2022-05-19 12:05:41] [INFO ] Implicit Places using invariants in 206 ms returned []
[2022-05-19 12:05:41] [INFO ] Flow matrix only has 66 transitions (discarded 9 similar events)
// Phase 1: matrix 66 rows 73 cols
[2022-05-19 12:05:41] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-19 12:05:41] [INFO ] State equation strengthened by 56 read => feed constraints.
[2022-05-19 12:05:41] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2022-05-19 12:05:41] [INFO ] Flow matrix only has 66 transitions (discarded 9 similar events)
// Phase 1: matrix 66 rows 73 cols
[2022-05-19 12:05:41] [INFO ] Computed 10 place invariants in 15 ms
[2022-05-19 12:05:41] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 73/102 places, 75/79 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/102 places, 75/79 transitions.
Support contains 49 out of 73 places after structural reductions.
[2022-05-19 12:05:42] [INFO ] Flatten gal took : 54 ms
[2022-05-19 12:05:42] [INFO ] Flatten gal took : 8 ms
[2022-05-19 12:05:42] [INFO ] Input system was already deterministic with 75 transitions.
Support contains 44 out of 73 places (down from 49) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 31) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2022-05-19 12:05:42] [INFO ] Flow matrix only has 66 transitions (discarded 9 similar events)
// Phase 1: matrix 66 rows 73 cols
[2022-05-19 12:05:42] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-19 12:05:42] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 12:05:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-19 12:05:43] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-19 12:05:43] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 5 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 238 edges and 73 vertex of which 65 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 75/75 transitions.
Ensure Unique test removed 7 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 64 transition count 75
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 17 place count 56 transition count 67
Iterating global reduction 1 with 8 rules applied. Total rules applied 25 place count 56 transition count 67
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 56 transition count 66
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 31 place count 51 transition count 61
Iterating global reduction 2 with 5 rules applied. Total rules applied 36 place count 51 transition count 61
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 48 transition count 58
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 48 transition count 58
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 45 transition count 55
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 45 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 49 place count 45 transition count 54
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 43 transition count 52
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 43 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 43 transition count 50
Applied a total of 55 rules in 14 ms. Remains 43 /73 variables (removed 30) and now considering 50/75 (removed 25) transitions.
[2022-05-19 12:05:43] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
// Phase 1: matrix 44 rows 43 cols
[2022-05-19 12:05:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:05:43] [INFO ] Implicit Places using invariants in 67 ms returned []
[2022-05-19 12:05:43] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
// Phase 1: matrix 44 rows 43 cols
[2022-05-19 12:05:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:05:43] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-05-19 12:05:43] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2022-05-19 12:05:43] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
// Phase 1: matrix 44 rows 43 cols
[2022-05-19 12:05:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:05:43] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/73 places, 50/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 43/73 places, 50/75 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s13 s35), p1:(LEQ s42 s25)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 355 ms.
Product exploration explored 100000 steps with 22 reset in 274 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 89 edges and 43 vertex of which 37 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 : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 367 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 6717 steps, including 2 resets, run visited all 3 properties in 90 ms. (steps per millisecond=74 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p0)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 446 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2022-05-19 12:05:45] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
// Phase 1: matrix 44 rows 43 cols
[2022-05-19 12:05:45] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:05:46] [INFO ] Implicit Places using invariants in 49 ms returned []
[2022-05-19 12:05:46] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
// Phase 1: matrix 44 rows 43 cols
[2022-05-19 12:05:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:05:46] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-05-19 12:05:46] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2022-05-19 12:05:46] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
// Phase 1: matrix 44 rows 43 cols
[2022-05-19 12:05:46] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:05:46] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 43/43 places, 50/50 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 89 edges and 43 vertex of which 37 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 : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 5 factoid took 225 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 56 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-19 12:05:46] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
// Phase 1: matrix 44 rows 43 cols
[2022-05-19 12:05:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:05:46] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 12:05:46] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 12:05:46] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 12:05:46] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-05-19 12:05:46] [INFO ] After 12ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 12:05:46] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-19 12:05:46] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 43/43 places, 50/50 transitions.
Graph (complete) has 53 edges and 43 vertex of which 15 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.0 ms
Discarding 28 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 15 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 14 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 13 transition count 13
Applied a total of 15 rules in 3 ms. Remains 13 /43 variables (removed 30) and now considering 13/50 (removed 37) transitions.
Finished structural reductions, in 1 iterations. Remains : 13/43 places, 13/50 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 13 rows 13 cols
[2022-05-19 12:05:46] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-19 12:05:46] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:05:47] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:05:47] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-19 12:05:47] [INFO ] After 15ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:05:47] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-19 12:05:47] [INFO ] After 168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT p0)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 444 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering criterion allowed to conclude after 35 steps with 2 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-00 finished in 4349 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0) U p0))&&X(p1)))'
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 75/75 transitions.
Ensure Unique test removed 7 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 64 transition count 75
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 16 place count 57 transition count 68
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 57 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 57 transition count 67
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 53 transition count 63
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 53 transition count 63
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 50 transition count 60
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 50 transition count 60
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 48 transition count 58
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 48 transition count 58
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 46 transition count 56
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 46 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 46 transition count 54
Applied a total of 48 rules in 13 ms. Remains 46 /73 variables (removed 27) and now considering 54/75 (removed 21) transitions.
[2022-05-19 12:05:47] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
// Phase 1: matrix 47 rows 46 cols
[2022-05-19 12:05:47] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:05:47] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-05-19 12:05:47] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
// Phase 1: matrix 47 rows 46 cols
[2022-05-19 12:05:47] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:05:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-19 12:05:48] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-05-19 12:05:48] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
// Phase 1: matrix 47 rows 46 cols
[2022-05-19 12:05:48] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:05:48] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/73 places, 54/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/73 places, 54/75 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s12 s33), p1:(LEQ s9 s2)], 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 50000 reset in 214 ms.
Product exploration explored 100000 steps with 50000 reset in 192 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 96 edges and 46 vertex of which 40 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 p1), (X p1), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-01 finished in 883 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&F(!p0)))'
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 75/75 transitions.
Graph (complete) has 238 edges and 73 vertex of which 65 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 7 places
Reduce places removed 8 places and 1 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 49 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 49 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 18 place count 49 transition count 62
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 43 transition count 56
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 43 transition count 56
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 38 transition count 51
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 38 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 34 transition count 47
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 34 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 49 place count 34 transition count 46
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 31 transition count 43
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 31 transition count 43
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 31 transition count 40
Applied a total of 58 rules in 8 ms. Remains 31 /73 variables (removed 42) and now considering 40/75 (removed 35) transitions.
[2022-05-19 12:05:48] [INFO ] Flow matrix only has 34 transitions (discarded 6 similar events)
// Phase 1: matrix 34 rows 31 cols
[2022-05-19 12:05:48] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 12:05:48] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-05-19 12:05:48] [INFO ] Flow matrix only has 34 transitions (discarded 6 similar events)
// Phase 1: matrix 34 rows 31 cols
[2022-05-19 12:05:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:05:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-19 12:05:48] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2022-05-19 12:05:48] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:05:48] [INFO ] Flow matrix only has 34 transitions (discarded 6 similar events)
// Phase 1: matrix 34 rows 31 cols
[2022-05-19 12:05:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:05:48] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/73 places, 40/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/73 places, 40/75 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, p0, (OR (NOT p1) p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(LEQ s10 s17), p1:(LEQ 3 s30)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-02 finished in 289 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0) U F(p1))||G(p0))))'
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 75/75 transitions.
Ensure Unique test removed 7 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 64 transition count 75
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 16 place count 57 transition count 68
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 57 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 57 transition count 67
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 52 transition count 62
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 52 transition count 62
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 49 transition count 59
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 49 transition count 59
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 47 transition count 57
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 47 transition count 57
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 46 transition count 56
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 46 transition count 56
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 46 transition count 55
Applied a total of 47 rules in 8 ms. Remains 46 /73 variables (removed 27) and now considering 55/75 (removed 20) transitions.
[2022-05-19 12:05:49] [INFO ] Flow matrix only has 47 transitions (discarded 8 similar events)
// Phase 1: matrix 47 rows 46 cols
[2022-05-19 12:05:49] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:05:49] [INFO ] Implicit Places using invariants in 52 ms returned []
[2022-05-19 12:05:49] [INFO ] Flow matrix only has 47 transitions (discarded 8 similar events)
// Phase 1: matrix 47 rows 46 cols
[2022-05-19 12:05:49] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:05:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-19 12:05:49] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2022-05-19 12:05:49] [INFO ] Flow matrix only has 47 transitions (discarded 8 similar events)
// Phase 1: matrix 47 rows 46 cols
[2022-05-19 12:05:49] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:05:49] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/73 places, 55/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/73 places, 55/75 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GT s20 s22), p0:(LEQ s39 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 129 ms.
Product exploration explored 100000 steps with 0 reset in 177 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 97 edges and 46 vertex of which 40 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.14 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 245 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 149 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 3561 steps, including 1 resets, run visited all 3 properties in 10 ms. (steps per millisecond=356 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 260 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 118 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2022-05-19 12:05:50] [INFO ] Flow matrix only has 47 transitions (discarded 8 similar events)
// Phase 1: matrix 47 rows 46 cols
[2022-05-19 12:05:50] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:05:50] [INFO ] Implicit Places using invariants in 29 ms returned []
[2022-05-19 12:05:50] [INFO ] Flow matrix only has 47 transitions (discarded 8 similar events)
// Phase 1: matrix 47 rows 46 cols
[2022-05-19 12:05:50] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-19 12:05:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-19 12:05:50] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2022-05-19 12:05:50] [INFO ] Flow matrix only has 47 transitions (discarded 8 similar events)
// Phase 1: matrix 47 rows 46 cols
[2022-05-19 12:05:50] [INFO ] Computed 1 place invariants in 15 ms
[2022-05-19 12:05:50] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 55/55 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 97 edges and 46 vertex of which 40 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 : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 252 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 130 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 3733 steps, including 1 resets, run visited all 3 properties in 24 ms. (steps per millisecond=155 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 252 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 128 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2 reset in 73 ms.
Product exploration explored 100000 steps with 0 reset in 237 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 55/55 transitions.
Graph (complete) has 97 edges and 46 vertex of which 40 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 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 39 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 38 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 38 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 37 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 37 transition count 49
Applied a total of 7 rules in 4 ms. Remains 37 /46 variables (removed 9) and now considering 49/55 (removed 6) transitions.
[2022-05-19 12:05:52] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-19 12:05:52] [INFO ] Flow matrix only has 40 transitions (discarded 9 similar events)
// Phase 1: matrix 40 rows 37 cols
[2022-05-19 12:05:52] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:05:52] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/46 places, 49/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/46 places, 49/55 transitions.
Product exploration explored 100000 steps with 0 reset in 187 ms.
Stuttering criterion allowed to conclude after 438 steps with 3 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-03 finished in 4015 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U false) U G((p0 U p1))))'
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 75/75 transitions.
Graph (complete) has 238 edges and 73 vertex of which 65 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 7 places
Reduce places removed 8 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 48 transition count 62
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 48 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 48 transition count 61
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 41 transition count 54
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 41 transition count 54
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 36 transition count 49
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 36 transition count 49
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 31 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 31 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 55 place count 31 transition count 43
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 27 transition count 39
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 27 transition count 39
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 27 transition count 35
Applied a total of 67 rules in 4 ms. Remains 27 /73 variables (removed 46) and now considering 35/75 (removed 40) transitions.
[2022-05-19 12:05:53] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
// Phase 1: matrix 30 rows 27 cols
[2022-05-19 12:05:53] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:05:53] [INFO ] Implicit Places using invariants in 102 ms returned []
[2022-05-19 12:05:53] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
// Phase 1: matrix 30 rows 27 cols
[2022-05-19 12:05:53] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 12:05:53] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-05-19 12:05:53] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2022-05-19 12:05:53] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:05:53] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
// Phase 1: matrix 30 rows 27 cols
[2022-05-19 12:05:53] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:05:53] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/73 places, 35/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/73 places, 35/75 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 s3), p0:(LEQ s17 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-05 finished in 347 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(p0)||p1) U p2)))'
Support contains 5 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 75/75 transitions.
Graph (complete) has 238 edges and 73 vertex of which 65 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 7 places
Reduce places removed 8 places and 1 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 49 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 49 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 18 place count 49 transition count 62
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 44 transition count 57
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 44 transition count 57
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 40 transition count 53
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 40 transition count 53
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 36 transition count 49
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 36 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 36 transition count 48
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 34 transition count 46
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 34 transition count 46
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 34 transition count 44
Applied a total of 51 rules in 16 ms. Remains 34 /73 variables (removed 39) and now considering 44/75 (removed 31) transitions.
[2022-05-19 12:05:53] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
// Phase 1: matrix 37 rows 34 cols
[2022-05-19 12:05:53] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 12:05:53] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-05-19 12:05:53] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
// Phase 1: matrix 37 rows 34 cols
[2022-05-19 12:05:53] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:05:53] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-05-19 12:05:53] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2022-05-19 12:05:53] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:05:53] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
// Phase 1: matrix 37 rows 34 cols
[2022-05-19 12:05:53] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:05:53] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/73 places, 44/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/73 places, 44/75 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (NOT p0), (NOT p2)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ s33 s26), p1:(LEQ s7 s22), p0:(LEQ 3 s32)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 222 ms.
Stuttering criterion allowed to conclude after 217 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-06 finished in 668 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 75/75 transitions.
Ensure Unique test removed 7 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 64 transition count 75
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 17 place count 56 transition count 67
Iterating global reduction 1 with 8 rules applied. Total rules applied 25 place count 56 transition count 67
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 56 transition count 66
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 32 place count 50 transition count 60
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 50 transition count 60
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 46 transition count 56
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 46 transition count 56
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 43 transition count 53
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 43 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 53 place count 43 transition count 52
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 42 transition count 51
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 42 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 56 place count 42 transition count 50
Applied a total of 56 rules in 8 ms. Remains 42 /73 variables (removed 31) and now considering 50/75 (removed 25) transitions.
[2022-05-19 12:05:54] [INFO ] Flow matrix only has 43 transitions (discarded 7 similar events)
// Phase 1: matrix 43 rows 42 cols
[2022-05-19 12:05:54] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:05:54] [INFO ] Implicit Places using invariants in 53 ms returned []
[2022-05-19 12:05:54] [INFO ] Flow matrix only has 43 transitions (discarded 7 similar events)
// Phase 1: matrix 43 rows 42 cols
[2022-05-19 12:05:54] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:05:54] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-05-19 12:05:54] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2022-05-19 12:05:54] [INFO ] Flow matrix only has 43 transitions (discarded 7 similar events)
// Phase 1: matrix 43 rows 42 cols
[2022-05-19 12:05:54] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:05:54] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/73 places, 50/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/73 places, 50/75 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 s9)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-07 finished in 288 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(F(X((G(p1) U F(p1))))||G(p2))))'
Support contains 5 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 75/75 transitions.
Ensure Unique test removed 7 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 64 transition count 75
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 16 place count 57 transition count 68
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 57 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 57 transition count 67
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 54 transition count 64
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 54 transition count 64
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 33 place count 51 transition count 61
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 51 transition count 61
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 49 transition count 59
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 49 transition count 59
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 47 transition count 57
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 47 transition count 57
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 47 transition count 55
Applied a total of 46 rules in 4 ms. Remains 47 /73 variables (removed 26) and now considering 55/75 (removed 20) transitions.
[2022-05-19 12:05:54] [INFO ] Flow matrix only has 48 transitions (discarded 7 similar events)
// Phase 1: matrix 48 rows 47 cols
[2022-05-19 12:05:54] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:05:54] [INFO ] Implicit Places using invariants in 22 ms returned []
[2022-05-19 12:05:54] [INFO ] Flow matrix only has 48 transitions (discarded 7 similar events)
// Phase 1: matrix 48 rows 47 cols
[2022-05-19 12:05:54] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:05:54] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-05-19 12:05:54] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2022-05-19 12:05:54] [INFO ] Flow matrix only has 48 transitions (discarded 7 similar events)
// Phase 1: matrix 48 rows 47 cols
[2022-05-19 12:05:54] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:05:55] [INFO ] Dead Transitions using invariants and state equation in 1332 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/73 places, 55/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/73 places, 55/75 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GT 1 s45), p0:(LEQ s40 s23), p1:(LEQ s8 s36)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 99 ms.
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 98 edges and 47 vertex of which 41 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 : [(AND p2 p0 p1), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND p2 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), true, (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 9 factoid took 190 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-08 finished in 2016 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))&&p1)))'
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 75/75 transitions.
Graph (complete) has 238 edges and 73 vertex of which 65 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 7 places
Reduce places removed 8 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 50 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 50 transition count 64
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 21 place count 44 transition count 58
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 44 transition count 58
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 32 place count 39 transition count 53
Iterating global reduction 0 with 5 rules applied. Total rules applied 37 place count 39 transition count 53
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 40 place count 36 transition count 50
Iterating global reduction 0 with 3 rules applied. Total rules applied 43 place count 36 transition count 50
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 46 place count 33 transition count 47
Iterating global reduction 0 with 3 rules applied. Total rules applied 49 place count 33 transition count 47
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 52 place count 33 transition count 44
Applied a total of 52 rules in 11 ms. Remains 33 /73 variables (removed 40) and now considering 44/75 (removed 31) transitions.
[2022-05-19 12:05:56] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
// Phase 1: matrix 37 rows 33 cols
[2022-05-19 12:05:56] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:05:56] [INFO ] Implicit Places using invariants in 57 ms returned []
[2022-05-19 12:05:56] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
// Phase 1: matrix 37 rows 33 cols
[2022-05-19 12:05:56] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:05:56] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-05-19 12:05:56] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2022-05-19 12:05:56] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:05:56] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
// Phase 1: matrix 37 rows 33 cols
[2022-05-19 12:05:56] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:05:56] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/73 places, 44/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/73 places, 44/75 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s14 s32), p1:(LEQ s12 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-09 finished in 362 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0) U (G(X(p0))||(X(p0)&&G(p1))))))'
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 75/75 transitions.
Ensure Unique test removed 7 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 64 transition count 75
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 17 place count 56 transition count 67
Iterating global reduction 1 with 8 rules applied. Total rules applied 25 place count 56 transition count 67
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 56 transition count 66
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 32 place count 50 transition count 60
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 50 transition count 60
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 46 transition count 56
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 46 transition count 56
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 43 transition count 53
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 43 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 53 place count 43 transition count 52
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 41 transition count 50
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 41 transition count 50
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 41 transition count 48
Applied a total of 59 rules in 13 ms. Remains 41 /73 variables (removed 32) and now considering 48/75 (removed 27) transitions.
[2022-05-19 12:05:56] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 41 cols
[2022-05-19 12:05:56] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:05:56] [INFO ] Implicit Places using invariants in 36 ms returned []
[2022-05-19 12:05:56] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 41 cols
[2022-05-19 12:05:56] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:05:56] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-05-19 12:05:56] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2022-05-19 12:05:56] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 41 cols
[2022-05-19 12:05:56] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:05:56] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41/73 places, 48/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/73 places, 48/75 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(GT 2 s36), p0:(GT s22 s11)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2 reset in 108 ms.
Product exploration explored 100000 steps with 2 reset in 164 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 85 edges and 41 vertex of which 35 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 754 ms. Reduced automaton from 3 states, 13 edges and 2 AP to 3 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :3
Finished Best-First random walk after 3766 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1255 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 796 ms. Reduced automaton from 3 states, 13 edges and 2 AP to 3 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
[2022-05-19 12:05:59] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 41 cols
[2022-05-19 12:05:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:05:59] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 12:05:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:05:59] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2022-05-19 12:05:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:05:59] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 12:05:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:05:59] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-19 12:05:59] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-05-19 12:05:59] [INFO ] [Nat]Added 33 Read/Feed constraints in 2 ms returned sat
[2022-05-19 12:05:59] [INFO ] Computed and/alt/rep : 44/56/38 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 12:05:59] [INFO ] Added : 0 causal constraints over 0 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 41 /41 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2022-05-19 12:05:59] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 41 cols
[2022-05-19 12:05:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:05:59] [INFO ] Implicit Places using invariants in 36 ms returned []
[2022-05-19 12:05:59] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 41 cols
[2022-05-19 12:05:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:05:59] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-05-19 12:05:59] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2022-05-19 12:05:59] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 41 cols
[2022-05-19 12:05:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:05:59] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 48/48 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 85 edges and 41 vertex of which 35 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 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 5 factoid took 448 ms. Reduced automaton from 3 states, 13 edges and 2 AP to 3 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :3
Finished Best-First random walk after 568 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=568 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 590 ms. Reduced automaton from 3 states, 13 edges and 2 AP to 3 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
[2022-05-19 12:06:01] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 41 cols
[2022-05-19 12:06:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:06:01] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 12:06:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:06:01] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-19 12:06:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:06:01] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 12:06:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:06:01] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-19 12:06:01] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-05-19 12:06:01] [INFO ] [Nat]Added 33 Read/Feed constraints in 3 ms returned sat
[2022-05-19 12:06:01] [INFO ] Computed and/alt/rep : 44/56/38 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-19 12:06:01] [INFO ] Added : 0 causal constraints over 0 iterations in 33 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 161 ms.
Product exploration explored 100000 steps with 0 reset in 119 ms.
Built C files in :
/tmp/ltsmin6348609906498666748
[2022-05-19 12:06:02] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6348609906498666748
Running compilation step : cd /tmp/ltsmin6348609906498666748;'/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 227 ms.
Running link step : cd /tmp/ltsmin6348609906498666748;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6348609906498666748;'/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/stateBased3467577473729779102.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2022-05-19 12:06:17] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 41 cols
[2022-05-19 12:06:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:06:17] [INFO ] Implicit Places using invariants in 119 ms returned []
[2022-05-19 12:06:17] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 41 cols
[2022-05-19 12:06:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:06:17] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-05-19 12:06:17] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2022-05-19 12:06:17] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 41 cols
[2022-05-19 12:06:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:06:17] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 48/48 transitions.
Built C files in :
/tmp/ltsmin16797136412782453412
[2022-05-19 12:06:17] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16797136412782453412
Running compilation step : cd /tmp/ltsmin16797136412782453412;'/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 110 ms.
Running link step : cd /tmp/ltsmin16797136412782453412;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin16797136412782453412;'/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/stateBased5035698184557167411.hoa' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
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.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.005: LTL layer using automaton file : /tmp/stateBased5035698184557167411.hoa
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( 7/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
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.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.015: "(LTLAPp0==true)&&(LTLAPp1==true)" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.015: buchi has 5 states
pins2lts-mc-linux64( 0/ 8), 0.022: There are 51 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.022: State length is 42, there are 67 groups
pins2lts-mc-linux64( 0/ 8), 0.022: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.022: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.022: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.022: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.208: [Blue] ~120 levels ~960 states ~10432 transitions
pins2lts-mc-linux64( 6/ 8), 0.330: [Blue] ~240 levels ~1920 states ~21576 transitions
pins2lts-mc-linux64( 6/ 8), 0.578: [Blue] ~480 levels ~3840 states ~44616 transitions
pins2lts-mc-linux64( 6/ 8), 0.980: [Blue] ~960 levels ~7680 states ~90696 transitions
pins2lts-mc-linux64( 6/ 8), 1.577: [Blue] ~1920 levels ~15360 states ~182856 transitions
pins2lts-mc-linux64( 6/ 8), 2.321: [Blue] ~3840 levels ~30720 states ~367176 transitions
pins2lts-mc-linux64( 6/ 8), 3.023: [Blue] ~7680 levels ~61440 states ~735816 transitions
pins2lts-mc-linux64( 6/ 8), 3.651: [Blue] ~15360 levels ~122880 states ~1473096 transitions
pins2lts-mc-linux64( 6/ 8), 4.330: [Blue] ~30720 levels ~245760 states ~2947656 transitions
pins2lts-mc-linux64( 6/ 8), 5.084: [Blue] ~61440 levels ~491520 states ~5896776 transitions
pins2lts-mc-linux64( 5/ 8), 6.693: [Blue] ~122880 levels ~983040 states ~11794784 transitions
pins2lts-mc-linux64( 6/ 8), 10.191: [Blue] ~245760 levels ~1966080 states ~23591496 transitions
pins2lts-mc-linux64( 6/ 8), 13.444: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 13.663:
pins2lts-mc-linux64( 0/ 8), 13.663: Explored 2083166 states 28214190 transitions, fanout: 13.544
pins2lts-mc-linux64( 0/ 8), 13.663: Total exploration time 13.630 sec (13.410 sec minimum, 13.479 sec on average)
pins2lts-mc-linux64( 0/ 8), 13.663: States per second: 152837, Transitions per second: 2070007
pins2lts-mc-linux64( 0/ 8), 13.663:
pins2lts-mc-linux64( 0/ 8), 13.663: State space has 27412745 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 13.663: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 13.663: blue states: 2083166 (7.60%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 13.663: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 13.663: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 13.663:
pins2lts-mc-linux64( 0/ 8), 13.663: Total memory used for local state coloring: 31.8MB
pins2lts-mc-linux64( 0/ 8), 13.663:
pins2lts-mc-linux64( 0/ 8), 13.663: Queue width: 8B, total height: 2083166, memory: 15.89MB
pins2lts-mc-linux64( 0/ 8), 13.663: Tree memory: 465.1MB, 17.8 B/state, compr.: 10.5%
pins2lts-mc-linux64( 0/ 8), 13.663: Tree fill ratio (roots/leafs): 20.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 13.663: Stored 48 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 13.663: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 13.663: Est. total memory use: 481.0MB (~1039.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16797136412782453412;'/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/stateBased5035698184557167411.hoa' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16797136412782453412;'/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/stateBased5035698184557167411.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:06:31] [INFO ] Flatten gal took : 2 ms
[2022-05-19 12:06:31] [INFO ] Flatten gal took : 1 ms
[2022-05-19 12:06:31] [INFO ] Time to serialize gal into /tmp/LTL1535146299838524422.gal : 1 ms
[2022-05-19 12:06:31] [INFO ] Time to serialize properties into /tmp/LTL8797292142507181874.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/LTL1535146299838524422.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8797292142507181874.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/LTL1535146...266
Read 1 LTL properties
Checking formula 0 : !((F((X("(p57>p34)"))U((G(X("(p57>p34)")))||((X("(p57>p34)"))&&(G("(p87<2)")))))))
Formula 0 simplified : !F(X"(p57>p34)" U (GX"(p57>p34)" | (X"(p57>p34)" & G"(p87<2)")))
Detected timeout of ITS tools.
[2022-05-19 12:06:46] [INFO ] Flatten gal took : 7 ms
[2022-05-19 12:06:46] [INFO ] Applying decomposition
[2022-05-19 12:06:46] [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/graph4510416313984405148.txt' '-o' '/tmp/graph4510416313984405148.bin' '-w' '/tmp/graph4510416313984405148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4510416313984405148.bin' '-l' '-1' '-v' '-w' '/tmp/graph4510416313984405148.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:06:46] [INFO ] Decomposing Gal with order
[2022-05-19 12:06:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:06:46] [INFO ] Removed a total of 12 redundant transitions.
[2022-05-19 12:06:46] [INFO ] Flatten gal took : 28 ms
[2022-05-19 12:06:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 2 ms.
[2022-05-19 12:06:46] [INFO ] Time to serialize gal into /tmp/LTL15897920939129315112.gal : 1 ms
[2022-05-19 12:06:46] [INFO ] Time to serialize properties into /tmp/LTL1930710824012292388.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/LTL15897920939129315112.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1930710824012292388.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/LTL1589792...267
Read 1 LTL properties
Checking formula 0 : !((F((X("(gu5.p57>gu5.p34)"))U((G(X("(gu5.p57>gu5.p34)")))||((X("(gu5.p57>gu5.p34)"))&&(G("(gi2.gu13.p87<2)")))))))
Formula 0 simplified : !F(X"(gu5.p57>gu5.p34)" U (GX"(gu5.p57>gu5.p34)" | (X"(gu5.p57>gu5.p34)" & G"(gi2.gu13.p87<2)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13866620735318399358
[2022-05-19 12:07:01] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13866620735318399358
Running compilation step : cd /tmp/ltsmin13866620735318399358;'/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 92 ms.
Running link step : cd /tmp/ltsmin13866620735318399358;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13866620735318399358;'/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((LTLAPp0==true)))||(X((LTLAPp0==true))&&[]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-10 finished in 79936 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X((!(p0 U p1)||X(!p1)))))))'
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 75/75 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 66 transition count 75
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 15 place count 58 transition count 67
Iterating global reduction 1 with 8 rules applied. Total rules applied 23 place count 58 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 58 transition count 66
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 30 place count 52 transition count 60
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 52 transition count 60
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 40 place count 48 transition count 56
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 48 transition count 56
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 44 transition count 52
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 44 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 53 place count 44 transition count 51
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 43 transition count 50
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 43 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 56 place count 43 transition count 49
Applied a total of 56 rules in 4 ms. Remains 43 /73 variables (removed 30) and now considering 49/75 (removed 26) transitions.
[2022-05-19 12:07:16] [INFO ] Flow matrix only has 42 transitions (discarded 7 similar events)
// Phase 1: matrix 42 rows 43 cols
[2022-05-19 12:07:16] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 12:07:16] [INFO ] Implicit Places using invariants in 31 ms returned []
[2022-05-19 12:07:16] [INFO ] Flow matrix only has 42 transitions (discarded 7 similar events)
// Phase 1: matrix 42 rows 43 cols
[2022-05-19 12:07:16] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 12:07:16] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-05-19 12:07:16] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2022-05-19 12:07:16] [INFO ] Flow matrix only has 42 transitions (discarded 7 similar events)
// Phase 1: matrix 42 rows 43 cols
[2022-05-19 12:07:16] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-19 12:07:16] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/73 places, 49/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 43/73 places, 49/75 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, p1, p1, p1, p1, p1]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(OR p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(LEQ 3 s9), p0:(OR (LEQ s35 s6) (LEQ 3 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-11 finished in 322 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((G(F(p0))&&X(G(p1)))))))'
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 75/75 transitions.
Graph (complete) has 238 edges and 73 vertex of which 65 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 7 places
Reduce places removed 8 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 50 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 50 transition count 64
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 50 transition count 63
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 45 transition count 58
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 45 transition count 58
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 40 transition count 53
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 40 transition count 53
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 36 transition count 49
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 36 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 36 transition count 48
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 34 transition count 46
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 34 transition count 46
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 34 transition count 44
Applied a total of 51 rules in 12 ms. Remains 34 /73 variables (removed 39) and now considering 44/75 (removed 31) transitions.
[2022-05-19 12:07:17] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
// Phase 1: matrix 37 rows 34 cols
[2022-05-19 12:07:17] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:07:17] [INFO ] Implicit Places using invariants in 22 ms returned []
[2022-05-19 12:07:17] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
// Phase 1: matrix 37 rows 34 cols
[2022-05-19 12:07:17] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:07:17] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-05-19 12:07:17] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-19 12:07:17] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-19 12:07:17] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
// Phase 1: matrix 37 rows 34 cols
[2022-05-19 12:07:17] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 12:07:17] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/73 places, 44/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/73 places, 44/75 transitions.
Stuttering acceptance computed with spot in 49 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s32), p0:(LEQ s16 s28)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-12 finished in 174 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((G(p0)&&p1)))))'
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 75/75 transitions.
Graph (complete) has 238 edges and 73 vertex of which 65 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 7 places
Reduce places removed 8 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 48 transition count 62
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 48 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 48 transition count 61
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 42 transition count 55
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 42 transition count 55
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 37 transition count 50
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 37 transition count 50
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 32 transition count 45
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 32 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 32 transition count 44
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 28 transition count 40
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 28 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 65 place count 28 transition count 36
Applied a total of 65 rules in 11 ms. Remains 28 /73 variables (removed 45) and now considering 36/75 (removed 39) transitions.
[2022-05-19 12:07:17] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 28 cols
[2022-05-19 12:07:17] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:07:17] [INFO ] Implicit Places using invariants in 17 ms returned []
[2022-05-19 12:07:17] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 28 cols
[2022-05-19 12:07:17] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:07:17] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-19 12:07:17] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-19 12:07:17] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:07:17] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 28 cols
[2022-05-19 12:07:17] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:07:17] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/73 places, 36/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/73 places, 36/75 transitions.
Stuttering acceptance computed with spot in 37 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s19 s26), p1:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-13 finished in 135 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p0)))))'
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 75/75 transitions.
Graph (complete) has 238 edges and 73 vertex of which 65 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 7 places
Reduce places removed 8 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 48 transition count 62
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 48 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 48 transition count 61
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 41 transition count 54
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 41 transition count 54
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 35 transition count 48
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 35 transition count 48
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 31 transition count 44
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 31 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 55 place count 31 transition count 43
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 28 transition count 40
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 28 transition count 40
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 28 transition count 37
Applied a total of 64 rules in 7 ms. Remains 28 /73 variables (removed 45) and now considering 37/75 (removed 38) transitions.
[2022-05-19 12:07:17] [INFO ] Flow matrix only has 31 transitions (discarded 6 similar events)
// Phase 1: matrix 31 rows 28 cols
[2022-05-19 12:07:17] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:07:17] [INFO ] Implicit Places using invariants in 20 ms returned []
[2022-05-19 12:07:17] [INFO ] Flow matrix only has 31 transitions (discarded 6 similar events)
// Phase 1: matrix 31 rows 28 cols
[2022-05-19 12:07:17] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 12:07:17] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-05-19 12:07:17] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-19 12:07:17] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-19 12:07:17] [INFO ] Flow matrix only has 31 transitions (discarded 6 similar events)
// Phase 1: matrix 31 rows 28 cols
[2022-05-19 12:07:17] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 12:07:17] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/73 places, 37/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/73 places, 37/75 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s17 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-14 finished in 126 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0) U (G(X(p0))||(X(p0)&&G(p1))))))'
Found a CL insensitive property : SemanticWebServices-PT-S064P12-LTLCardinality-10
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 73/73 places, 75/75 transitions.
Graph (complete) has 238 edges and 73 vertex of which 65 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 7 places
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 49 transition count 63
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 49 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 20 place count 49 transition count 62
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 42 transition count 55
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 42 transition count 55
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 36 transition count 49
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 36 transition count 49
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 52 place count 30 transition count 43
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 30 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 59 place count 30 transition count 42
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 25 transition count 37
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 25 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 74 place count 25 transition count 32
Applied a total of 74 rules in 7 ms. Remains 25 /73 variables (removed 48) and now considering 32/75 (removed 43) transitions.
[2022-05-19 12:07:17] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 25 cols
[2022-05-19 12:07:17] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:07:17] [INFO ] Implicit Places using invariants in 21 ms returned []
[2022-05-19 12:07:17] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 25 cols
[2022-05-19 12:07:17] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 12:07:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-19 12:07:17] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-19 12:07:17] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 25 cols
[2022-05-19 12:07:17] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:07:17] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 25/73 places, 32/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/73 places, 32/75 transitions.
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(GT 2 s22), p0:(GT s17 s7)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-10 finished in 258 ms.
CL/SL decision was in the wrong direction : CL + false
[2022-05-19 12:07:17] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16286524957155826272
[2022-05-19 12:07:17] [INFO ] Applying decomposition
[2022-05-19 12:07:17] [INFO ] Computing symmetric may disable matrix : 75 transitions.
[2022-05-19 12:07:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:07:17] [INFO ] Computing symmetric may enable matrix : 75 transitions.
[2022-05-19 12:07:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:07:17] [INFO ] Computing Do-Not-Accords matrix : 75 transitions.
[2022-05-19 12:07:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:07:17] [INFO ] Flatten gal took : 3 ms
[2022-05-19 12:07:17] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16286524957155826272
Running compilation step : cd /tmp/ltsmin16286524957155826272;'/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/graph6703145761329907541.txt' '-o' '/tmp/graph6703145761329907541.bin' '-w' '/tmp/graph6703145761329907541.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6703145761329907541.bin' '-l' '-1' '-v' '-w' '/tmp/graph6703145761329907541.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:07:17] [INFO ] Decomposing Gal with order
[2022-05-19 12:07:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:07:17] [INFO ] Removed a total of 77 redundant transitions.
[2022-05-19 12:07:17] [INFO ] Flatten gal took : 7 ms
[2022-05-19 12:07:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 2 ms.
[2022-05-19 12:07:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality2652492354817606498.gal : 1 ms
[2022-05-19 12:07:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality9602917933709070024.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/LTLCardinality2652492354817606498.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9602917933709070024.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/LTLCardina...288
Read 1 LTL properties
Checking formula 0 : !((F((X("(gu9.p57>gu9.p34)"))U((G(X("(gu9.p57>gu9.p34)")))||((X("(gu9.p57>gu9.p34)"))&&(G("(gi0.gi0.gu0.p87<2)")))))))
Formula 0 simplified : !F(X"(gu9.p57>gu9.p34)" U (GX"(gu9.p57>gu9.p34)" | (X"(gu9.p57>gu9.p34)" & G"(gi0.gi0.gu0.p87<2)")))
Compilation finished in 179 ms.
Running link step : cd /tmp/ltsmin16286524957155826272;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 17 ms.
Running LTSmin : cd /tmp/ltsmin16286524957155826272;'/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((LTLAPp0==true)))||(X((LTLAPp0==true))&&[]((LTLAPp1==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: LTL layer: formula: <>((X((LTLAPp0==true)) U ([](X((LTLAPp0==true)))||(X((LTLAPp0==true))&&[]((LTLAPp1==true))))))
pins2lts-mc-linux64( 1/ 8), 0.009: "<>((X((LTLAPp0==true)) U ([](X((LTLAPp0==true)))||(X((LTLAPp0==true))&&[]((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.009: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.020: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: completed 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( 4/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.027: There are 78 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.027: State length is 74, there are 94 groups
pins2lts-mc-linux64( 0/ 8), 0.027: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.027: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.027: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.027: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.094: [Blue] ~120 levels ~960 states ~14232 transitions
pins2lts-mc-linux64( 5/ 8), 0.202: [Blue] ~240 levels ~1920 states ~24832 transitions
pins2lts-mc-linux64( 3/ 8), 0.316: [Blue] ~480 levels ~3840 states ~50760 transitions
pins2lts-mc-linux64( 0/ 8), 0.470: [Blue] ~960 levels ~7680 states ~83744 transitions
pins2lts-mc-linux64( 0/ 8), 0.759: [Blue] ~1920 levels ~15360 states ~201216 transitions
pins2lts-mc-linux64( 5/ 8), 1.185: [Blue] ~3840 levels ~30720 states ~399232 transitions
pins2lts-mc-linux64( 5/ 8), 1.548: [Blue] ~7680 levels ~61440 states ~798592 transitions
pins2lts-mc-linux64( 4/ 8), 1.850: [Blue] ~15360 levels ~122880 states ~1597312 transitions
pins2lts-mc-linux64( 4/ 8), 2.435: [Blue] ~30720 levels ~245760 states ~3194752 transitions
pins2lts-mc-linux64( 4/ 8), 3.646: [Blue] ~61440 levels ~491520 states ~6389632 transitions
pins2lts-mc-linux64( 4/ 8), 6.407: [Blue] ~122880 levels ~983040 states ~12779392 transitions
pins2lts-mc-linux64( 0/ 8), 12.118: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 12.705:
pins2lts-mc-linux64( 0/ 8), 12.705: Explored 1197277 states 20309041 transitions, fanout: 16.963
pins2lts-mc-linux64( 0/ 8), 12.705: Total exploration time 12.660 sec (12.070 sec minimum, 12.384 sec on average)
pins2lts-mc-linux64( 0/ 8), 12.705: States per second: 94572, Transitions per second: 1604190
pins2lts-mc-linux64( 0/ 8), 12.705:
pins2lts-mc-linux64( 0/ 8), 12.705: State space has 19604690 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 12.705: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 12.705: blue states: 1197277 (6.11%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 12.705: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 12.705: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 12.705:
pins2lts-mc-linux64( 0/ 8), 12.705: Total memory used for local state coloring: 18.3MB
pins2lts-mc-linux64( 0/ 8), 12.705:
pins2lts-mc-linux64( 0/ 8), 12.705: Queue width: 8B, total height: 1197277, memory: 9.13MB
pins2lts-mc-linux64( 0/ 8), 12.705: Tree memory: 405.6MB, 21.7 B/state, compr.: 7.3%
pins2lts-mc-linux64( 0/ 8), 12.705: Tree fill ratio (roots/leafs): 14.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 12.705: Stored 75 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 12.705: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 12.705: Est. total memory use: 414.7MB (~1033.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16286524957155826272;'/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((LTLAPp0==true)))||(X((LTLAPp0==true))&&[]((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16286524957155826272;'/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((LTLAPp0==true)))||(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)
Detected timeout of ITS tools.
[2022-05-19 12:27:50] [INFO ] Flatten gal took : 3 ms
[2022-05-19 12:27:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality4238433461280609604.gal : 10 ms
[2022-05-19 12:27:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality18373460839607703010.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/LTLCardinality4238433461280609604.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18373460839607703010.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/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((F((X("(p57>p34)"))U((G(X("(p57>p34)")))||((X("(p57>p34)"))&&(G("(p87<2)")))))))
Formula 0 simplified : !F(X"(p57>p34)" U (GX"(p57>p34)" | (X"(p57>p34)" & G"(p87<2)")))
Detected timeout of ITS tools.
[2022-05-19 12:48:22] [INFO ] Flatten gal took : 3 ms
[2022-05-19 12:48:22] [INFO ] Input system was already deterministic with 75 transitions.
[2022-05-19 12:48:22] [INFO ] Transformed 73 places.
[2022-05-19 12:48:22] [INFO ] Transformed 75 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:48:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality6330169463962663980.gal : 1 ms
[2022-05-19 12:48:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality10569224783358520193.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/LTLCardinality6330169463962663980.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10569224783358520193.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/LTLCardina...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((X("(p57>p34)"))U((G(X("(p57>p34)")))||((X("(p57>p34)"))&&(G("(p87<2)")))))))
Formula 0 simplified : !F(X"(p57>p34)" U (GX"(p57>p34)" | (X"(p57>p34)" & G"(p87<2)")))

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-165281599100355"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;