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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 6.4K Apr 29 12:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 29 12:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 29 12:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 29 12:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 18K 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 137K 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-S064P15-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652963092860

Running Version 202205111006
[2022-05-19 12:24:53] [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:24:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 12:24:54] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2022-05-19 12:24:54] [INFO ] Transformed 118 places.
[2022-05-19 12:24:54] [INFO ] Transformed 194 transitions.
[2022-05-19 12:24:54] [INFO ] Parsed PT model containing 118 places and 194 transitions in 177 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 101 transitions
Reduce redundant transitions removed 101 transitions.
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 91/91 transitions.
Ensure Unique test removed 33 places
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 82 transition count 91
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 75 transition count 84
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 75 transition count 84
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 75 transition count 83
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 71 transition count 79
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 71 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 69 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 69 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 68 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 68 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 67 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 67 transition count 75
Applied a total of 65 rules in 19 ms. Remains 67 /116 variables (removed 49) and now considering 75/91 (removed 16) transitions.
[2022-05-19 12:24:54] [INFO ] Flow matrix only has 66 transitions (discarded 9 similar events)
// Phase 1: matrix 66 rows 67 cols
[2022-05-19 12:24:54] [INFO ] Computed 3 place invariants in 7 ms
[2022-05-19 12:24:54] [INFO ] Implicit Places using invariants in 134 ms returned []
[2022-05-19 12:24:54] [INFO ] Flow matrix only has 66 transitions (discarded 9 similar events)
// Phase 1: matrix 66 rows 67 cols
[2022-05-19 12:24:54] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 12:24:54] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-19 12:24:54] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2022-05-19 12:24:54] [INFO ] Flow matrix only has 66 transitions (discarded 9 similar events)
// Phase 1: matrix 66 rows 67 cols
[2022-05-19 12:24:54] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 12:24:54] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/116 places, 75/91 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/116 places, 75/91 transitions.
Support contains 24 out of 67 places after structural reductions.
[2022-05-19 12:24:54] [INFO ] Flatten gal took : 17 ms
[2022-05-19 12:24:54] [INFO ] Flatten gal took : 6 ms
[2022-05-19 12:24:54] [INFO ] Input system was already deterministic with 75 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 12:24:55] [INFO ] Flow matrix only has 66 transitions (discarded 9 similar events)
// Phase 1: matrix 66 rows 67 cols
[2022-05-19 12:24:55] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 12:24:55] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:24:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-19 12:24:55] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 12:24:55] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:24:55] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-19 12:24:55] [INFO ] After 8ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:24:55] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-19 12:24:55] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 67/67 places, 75/75 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 66 transition count 75
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 1 place count 66 transition count 73
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 64 transition count 73
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 10 place count 59 transition count 68
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 59 transition count 68
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 55 transition count 64
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 55 transition count 64
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 51 transition count 60
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 51 transition count 60
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 49 transition count 58
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 49 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 49 transition count 57
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 48 transition count 56
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 48 transition count 56
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 47 transition count 55
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 47 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 47 transition count 54
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 47 transition count 50
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 50 place count 43 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 42 transition count 48
Applied a total of 51 rules in 34 ms. Remains 42 /67 variables (removed 25) and now considering 48/75 (removed 27) transitions.
Finished structural reductions, in 1 iterations. Remains : 42/67 places, 48/75 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2685683 steps, run timeout after 3001 ms. (steps per millisecond=894 ) properties seen :{}
Probabilistic random walk after 2685683 steps, saw 2298891 distinct states, run finished after 3002 ms. (steps per millisecond=894 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-19 12:24:58] [INFO ] Flow matrix only has 41 transitions (discarded 7 similar events)
// Phase 1: matrix 41 rows 42 cols
[2022-05-19 12:24:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:24:58] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:24:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-19 12:24:58] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:24:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-19 12:24:58] [INFO ] After 6ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:24:58] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-19 12:24:58] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 42/42 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 42/42 places, 48/48 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 42/42 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2022-05-19 12:24:58] [INFO ] Flow matrix only has 41 transitions (discarded 7 similar events)
// Phase 1: matrix 41 rows 42 cols
[2022-05-19 12:24:58] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:24:58] [INFO ] Implicit Places using invariants in 20 ms returned []
[2022-05-19 12:24:58] [INFO ] Flow matrix only has 41 transitions (discarded 7 similar events)
// Phase 1: matrix 41 rows 42 cols
[2022-05-19 12:24:58] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-19 12:24:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-19 12:24:58] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2022-05-19 12:24:58] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:24:58] [INFO ] Flow matrix only has 41 transitions (discarded 7 similar events)
// Phase 1: matrix 41 rows 42 cols
[2022-05-19 12:24:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:24:58] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/42 places, 48/48 transitions.
Graph (complete) has 6 edges and 42 vertex of which 7 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.3 ms
Discarding 35 places :
Also discarding 0 output transitions
Drop transitions removed 41 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 7 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 6 transition count 5
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 6 transition count 5
Applied a total of 47 rules in 4 ms. Remains 6 /42 variables (removed 36) and now considering 5/48 (removed 43) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 6 cols
[2022-05-19 12:24:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:24:58] [INFO ] After 13ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:24:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-19 12:24:58] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:24:58] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-19 12:24:58] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:24:58] [INFO ] Flatten gal took : 1 ms
[2022-05-19 12:24:58] [INFO ] Flatten gal took : 1 ms
[2022-05-19 12:24:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4630068013340657454.gal : 1 ms
[2022-05-19 12:24:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2320814561004967571.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms5830785836837907111;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4630068013340657454.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2320814561004967571.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality2320814561004967571.prop.
Reachability property AtomicPropp8 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,12,0.0143,3356,2,12,7,51,6,0,23,34,0
Total reachable state count : 12

Verifying 1 reachability properties.
Reachability property AtomicPropp8 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp8,2,0.014788,3780,2,7,7,51,7,0,28,34,0
Computed a total of 9 stabilizing places and 9 stable transitions
Graph (complete) has 145 edges and 67 vertex of which 60 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(X(p0))))))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 75/75 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 75
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 60 transition count 70
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 60 transition count 70
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 56 transition count 66
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 56 transition count 66
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 52 transition count 62
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 52 transition count 62
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 49 transition count 59
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 49 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 49 transition count 58
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 48 transition count 57
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 48 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 48 transition count 56
Applied a total of 38 rules in 6 ms. Remains 48 /67 variables (removed 19) and now considering 56/75 (removed 19) transitions.
[2022-05-19 12:24:58] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
// Phase 1: matrix 49 rows 48 cols
[2022-05-19 12:24:58] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:24:58] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-05-19 12:24:58] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
// Phase 1: matrix 49 rows 48 cols
[2022-05-19 12:24:58] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:24:58] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-05-19 12:24:58] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2022-05-19 12:24:58] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
// Phase 1: matrix 49 rows 48 cols
[2022-05-19 12:24:58] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:24:58] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/67 places, 56/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/67 places, 56/75 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(LEQ s37 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 241 ms.
Product exploration explored 100000 steps with 0 reset in 138 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 100 edges and 48 vertex of which 42 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 6 states, 7 edges and 1 AP to 6 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3356 steps, including 2 resets, run visited all 1 properties in 13 ms. (steps per millisecond=258 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 6 states, 7 edges and 1 AP to 6 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2022-05-19 12:25:00] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
// Phase 1: matrix 49 rows 48 cols
[2022-05-19 12:25:00] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-19 12:25:00] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-05-19 12:25:00] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
// Phase 1: matrix 49 rows 48 cols
[2022-05-19 12:25:00] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-19 12:25:00] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-05-19 12:25:00] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2022-05-19 12:25:00] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
// Phase 1: matrix 49 rows 48 cols
[2022-05-19 12:25:00] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-19 12:25:00] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 56/56 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 100 edges and 48 vertex of which 42 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 6 states, 7 edges and 1 AP to 6 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 6 states, 7 edges and 1 AP to 6 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 153 ms.
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 2 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLCardinality-01 finished in 2684 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 75/75 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 75
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 60 transition count 70
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 60 transition count 70
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 56 transition count 66
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 56 transition count 66
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 52 transition count 62
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 52 transition count 62
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 49 transition count 59
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 49 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 49 transition count 58
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 48 transition count 57
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 48 transition count 57
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 47 transition count 56
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 47 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 40 place count 47 transition count 55
Applied a total of 40 rules in 6 ms. Remains 47 /67 variables (removed 20) and now considering 55/75 (removed 20) transitions.
[2022-05-19 12:25:01] [INFO ] Flow matrix only has 48 transitions (discarded 7 similar events)
// Phase 1: matrix 48 rows 47 cols
[2022-05-19 12:25:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:25:01] [INFO ] Implicit Places using invariants in 23 ms returned []
[2022-05-19 12:25:01] [INFO ] Flow matrix only has 48 transitions (discarded 7 similar events)
// Phase 1: matrix 48 rows 47 cols
[2022-05-19 12:25:01] [INFO ] Computed 1 place invariants in 8 ms
[2022-05-19 12:25:01] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-05-19 12:25:01] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-05-19 12:25:01] [INFO ] Flow matrix only has 48 transitions (discarded 7 similar events)
// Phase 1: matrix 48 rows 47 cols
[2022-05-19 12:25:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:25:01] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/67 places, 55/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/67 places, 55/75 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 1 s36)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLCardinality-03 finished in 250 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&(p1||F(G(p2)))) U X(G(p2)))))'
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 75/75 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 63 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 63 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 62 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 61 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 61 transition count 71
Applied a total of 10 rules in 12 ms. Remains 61 /67 variables (removed 6) and now considering 71/75 (removed 4) transitions.
[2022-05-19 12:25:01] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
// Phase 1: matrix 62 rows 61 cols
[2022-05-19 12:25:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:25:01] [INFO ] Implicit Places using invariants in 52 ms returned []
[2022-05-19 12:25:01] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
// Phase 1: matrix 62 rows 61 cols
[2022-05-19 12:25:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:25:01] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-19 12:25:01] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2022-05-19 12:25:01] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
// Phase 1: matrix 62 rows 61 cols
[2022-05-19 12:25:01] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-19 12:25:01] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/67 places, 71/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/67 places, 71/75 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ s38 s12), p0:(LEQ 1 s53), p1:(LEQ s26 s34)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLCardinality-04 finished in 475 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U p1))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 75/75 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 75
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 60 transition count 70
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 60 transition count 70
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 56 transition count 66
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 56 transition count 66
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 52 transition count 62
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 52 transition count 62
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 49 transition count 59
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 49 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 49 transition count 58
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 47 transition count 56
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 47 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 40 place count 47 transition count 55
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 46 transition count 54
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 46 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 46 transition count 53
Applied a total of 43 rules in 8 ms. Remains 46 /67 variables (removed 21) and now considering 53/75 (removed 22) transitions.
[2022-05-19 12:25:02] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
// Phase 1: matrix 47 rows 46 cols
[2022-05-19 12:25:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:25:02] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-05-19 12:25:02] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
// Phase 1: matrix 47 rows 46 cols
[2022-05-19 12:25:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:25:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-19 12:25:02] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-19 12:25:02] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
// Phase 1: matrix 47 rows 46 cols
[2022-05-19 12:25:02] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-19 12:25:02] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/67 places, 53/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/67 places, 53/75 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 3 s8), p0:(LEQ s7 s44)], 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 122 ms.
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLCardinality-06 finished in 321 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(p0) U !(p1 U p2))) U p3)))'
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 75/75 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 66 transition count 75
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 62 transition count 71
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 62 transition count 71
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 59 transition count 68
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 59 transition count 68
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 56 transition count 65
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 56 transition count 65
Applied a total of 21 rules in 7 ms. Remains 56 /67 variables (removed 11) and now considering 65/75 (removed 10) transitions.
[2022-05-19 12:25:02] [INFO ] Flow matrix only has 56 transitions (discarded 9 similar events)
// Phase 1: matrix 56 rows 56 cols
[2022-05-19 12:25:02] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-19 12:25:02] [INFO ] Implicit Places using invariants in 30 ms returned []
[2022-05-19 12:25:02] [INFO ] Flow matrix only has 56 transitions (discarded 9 similar events)
// Phase 1: matrix 56 rows 56 cols
[2022-05-19 12:25:02] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:25:02] [INFO ] State equation strengthened by 47 read => feed constraints.
[2022-05-19 12:25:02] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2022-05-19 12:25:02] [INFO ] Flow matrix only has 56 transitions (discarded 9 similar events)
// Phase 1: matrix 56 rows 56 cols
[2022-05-19 12:25:02] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-19 12:25:02] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 56/67 places, 65/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 56/67 places, 65/75 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p3), (NOT p3), (NOT p0), p2, p2, (AND (NOT p0) p2), true, p2]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 3}, { cond=(NOT p3), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=p2, acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p2, acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(LEQ 3 s47), p2:(LEQ 1 s44), p1:(LEQ s6 s54), p0:(OR (LEQ 3 s47) (LEQ s53 s39))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 51 steps with 12 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLCardinality-07 finished in 452 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G(!(X(G(p0))||(G(p1)&&p1))) U G(p2)))'
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 75/75 transitions.
Graph (complete) has 145 edges and 67 vertex of which 60 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 53 transition count 66
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 53 transition count 66
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 48 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 48 transition count 61
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 24 place count 45 transition count 58
Iterating global reduction 0 with 3 rules applied. Total rules applied 27 place count 45 transition count 58
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 29 place count 43 transition count 56
Iterating global reduction 0 with 2 rules applied. Total rules applied 31 place count 43 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 32 place count 43 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 42 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 42 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 42 transition count 53
Applied a total of 35 rules in 15 ms. Remains 42 /67 variables (removed 25) and now considering 53/75 (removed 22) transitions.
[2022-05-19 12:25:02] [INFO ] Flow matrix only has 45 transitions (discarded 8 similar events)
// Phase 1: matrix 45 rows 42 cols
[2022-05-19 12:25:02] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 12:25:02] [INFO ] Implicit Places using invariants in 19 ms returned []
[2022-05-19 12:25:02] [INFO ] Flow matrix only has 45 transitions (discarded 8 similar events)
// Phase 1: matrix 45 rows 42 cols
[2022-05-19 12:25:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:25:02] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-05-19 12:25:02] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-19 12:25:02] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-19 12:25:02] [INFO ] Flow matrix only has 45 transitions (discarded 8 similar events)
// Phase 1: matrix 45 rows 42 cols
[2022-05-19 12:25:02] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 12:25:02] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/67 places, 53/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/67 places, 53/75 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={1} source=0 dest: 0}, { cond=(NOT p2), acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ 1 s28), p0:(LEQ s1 s35), p1:(LEQ s19 s11)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 62 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLCardinality-11 finished in 177 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0)&&G(p1)))))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 75/75 transitions.
Graph (complete) has 145 edges and 67 vertex of which 60 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 53 transition count 66
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 53 transition count 66
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 48 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 48 transition count 61
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 26 place count 43 transition count 56
Iterating global reduction 0 with 5 rules applied. Total rules applied 31 place count 43 transition count 56
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 34 place count 40 transition count 53
Iterating global reduction 0 with 3 rules applied. Total rules applied 37 place count 40 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 38 place count 40 transition count 52
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 38 transition count 50
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 38 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 38 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 37 transition count 48
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 37 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 37 transition count 47
Applied a total of 46 rules in 6 ms. Remains 37 /67 variables (removed 30) and now considering 47/75 (removed 28) transitions.
[2022-05-19 12:25:03] [INFO ] Flow matrix only has 40 transitions (discarded 7 similar events)
// Phase 1: matrix 40 rows 37 cols
[2022-05-19 12:25:03] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 12:25:03] [INFO ] Implicit Places using invariants in 18 ms returned []
[2022-05-19 12:25:03] [INFO ] Flow matrix only has 40 transitions (discarded 7 similar events)
// Phase 1: matrix 40 rows 37 cols
[2022-05-19 12:25:03] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 12:25:03] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-05-19 12:25:03] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-19 12:25:03] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:25:03] [INFO ] Flow matrix only has 40 transitions (discarded 7 similar events)
// Phase 1: matrix 40 rows 37 cols
[2022-05-19 12:25:03] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 12:25:03] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/67 places, 47/75 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/67 places, 47/75 transitions.
Stuttering acceptance computed with spot in 31 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLCardinality-14 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:(GT 2 s31), p1:(LEQ s25 s30)], 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 118 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLCardinality-14 finished in 147 ms.
All properties solved by simple procedures.
Total runtime 9244 ms.

BK_STOP 1652963103284

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

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