Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r334-tall-171679080400491.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is SemanticWebServices-PT-S064P06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679080400491
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 02:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 12 02:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 02:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 02:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 96K May 18 16:43 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-S064P06-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716836306196

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S064P06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-27 18:58:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 18:58:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 18:58:27] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-27 18:58:27] [INFO ] Transformed 97 places.
[2024-05-27 18:58:27] [INFO ] Transformed 164 transitions.
[2024-05-27 18:58:27] [INFO ] Parsed PT model containing 97 places and 164 transitions and 661 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 80 transitions
Reduce redundant transitions removed 80 transitions.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 82/82 transitions.
Ensure Unique test removed 13 places
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 47 transition count 58
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 44 transition count 55
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 44 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 43 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 43 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 81 place count 43 transition count 53
Applied a total of 81 rules in 23 ms. Remains 43 /95 variables (removed 52) and now considering 53/82 (removed 29) transitions.
[2024-05-27 18:58:27] [INFO ] Flow matrix only has 45 transitions (discarded 8 similar events)
// Phase 1: matrix 45 rows 43 cols
[2024-05-27 18:58:27] [INFO ] Computed 2 invariants in 6 ms
[2024-05-27 18:58:27] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-27 18:58:27] [INFO ] Flow matrix only has 45 transitions (discarded 8 similar events)
[2024-05-27 18:58:27] [INFO ] Invariant cache hit.
[2024-05-27 18:58:27] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-27 18:58:27] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 36 sub problems to find dead transitions.
[2024-05-27 18:58:27] [INFO ] Flow matrix only has 45 transitions (discarded 8 similar events)
[2024-05-27 18:58:27] [INFO ] Invariant cache hit.
[2024-05-27 18:58:27] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 2/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 33/64 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 36 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/64 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/88 variables, and 55 constraints, problems are : Problem set: 0 solved, 36 unsolved in 430 ms.
Refiners :[Generalized P Invariants (flows): 1/2 constraints, State Equation: 31/43 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 2/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 33/64 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 36/91 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/64 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/88 variables, and 91 constraints, problems are : Problem set: 0 solved, 36 unsolved in 448 ms.
Refiners :[Generalized P Invariants (flows): 1/2 constraints, State Equation: 31/43 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 903ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 917ms
Starting structural reductions in LTL mode, iteration 1 : 43/95 places, 53/82 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1190 ms. Remains : 43/95 places, 53/82 transitions.
Support contains 24 out of 43 places after structural reductions.
[2024-05-27 18:58:29] [INFO ] Flatten gal took : 17 ms
[2024-05-27 18:58:29] [INFO ] Flatten gal took : 6 ms
[2024-05-27 18:58:29] [INFO ] Input system was already deterministic with 53 transitions.
RANDOM walk for 40000 steps (8 resets) in 1040 ms. (38 steps per ms) remains 1/20 properties
BEST_FIRST walk for 20179 steps (4 resets) in 20 ms. (960 steps per ms) remains 0/1 properties
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 53/53 transitions.
Graph (complete) has 69 edges and 43 vertex of which 25 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 24 transition count 38
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 19 place count 17 transition count 31
Iterating global reduction 1 with 7 rules applied. Total rules applied 26 place count 17 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 17 transition count 29
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 34 place count 11 transition count 23
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 11 transition count 23
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 46 place count 11 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 49 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 18 edges and 10 vertex of which 9 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 9 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 53 place count 8 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 54 place count 8 transition count 11
Applied a total of 54 rules in 14 ms. Remains 8 /43 variables (removed 35) and now considering 11/53 (removed 42) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-27 18:58:29] [INFO ] Computed 0 invariants in 0 ms
[2024-05-27 18:58:29] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-27 18:58:29] [INFO ] Invariant cache hit.
[2024-05-27 18:58:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-27 18:58:29] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-27 18:58:29] [INFO ] Redundant transitions in 16 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-27 18:58:29] [INFO ] Invariant cache hit.
[2024-05-27 18:58:29] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/14 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/15 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/16 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/19 variables, and 11 constraints, problems are : Problem set: 0 solved, 4 unsolved in 61 ms.
Refiners :[State Equation: 7/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/14 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/15 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/16 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/17 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/18 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 16 constraints, problems are : Problem set: 0 solved, 4 unsolved in 102 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 166ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 167ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/43 places, 11/53 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 246 ms. Remains : 8/43 places, 11/53 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-01 finished in 459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(p1)&&(p2 U (p3||G(p2))))))'
Support contains 8 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 53/53 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 34 transition count 45
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 29 transition count 40
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 29 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 29 transition count 39
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 32 place count 25 transition count 35
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 25 transition count 35
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 40 place count 25 transition count 31
Applied a total of 40 rules in 2 ms. Remains 25 /43 variables (removed 18) and now considering 31/53 (removed 22) transitions.
[2024-05-27 18:58:30] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
// Phase 1: matrix 28 rows 25 cols
[2024-05-27 18:58:30] [INFO ] Computed 1 invariants in 1 ms
[2024-05-27 18:58:30] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-27 18:58:30] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
[2024-05-27 18:58:30] [INFO ] Invariant cache hit.
[2024-05-27 18:58:30] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-27 18:58:30] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 22 sub problems to find dead transitions.
[2024-05-27 18:58:30] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
[2024-05-27 18:58:30] [INFO ] Invariant cache hit.
[2024-05-27 18:58:30] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 2/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 24/46 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/53 variables, and 37 constraints, problems are : Problem set: 0 solved, 22 unsolved in 191 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/25 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 2/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 24/46 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 22/59 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 0/46 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/53 variables, and 59 constraints, problems are : Problem set: 0 solved, 22 unsolved in 196 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/25 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 393ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 394ms
Starting structural reductions in LTL mode, iteration 1 : 25/43 places, 31/53 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 462 ms. Remains : 25/43 places, 31/53 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-03 finished in 806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||G(!p0)||(!p0&&F(p1))))))'
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 53/53 transitions.
Graph (complete) has 69 edges and 43 vertex of which 25 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 24 transition count 38
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 19 transition count 33
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 19 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 19 transition count 32
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 28 place count 14 transition count 27
Iterating global reduction 2 with 5 rules applied. Total rules applied 33 place count 14 transition count 27
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 38 place count 14 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 23 edges and 13 vertex of which 12 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 44 place count 12 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 46 place count 12 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 47 place count 11 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 48 place count 11 transition count 14
Applied a total of 48 rules in 11 ms. Remains 11 /43 variables (removed 32) and now considering 14/53 (removed 39) transitions.
// Phase 1: matrix 14 rows 11 cols
[2024-05-27 18:58:31] [INFO ] Computed 0 invariants in 0 ms
[2024-05-27 18:58:31] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-27 18:58:31] [INFO ] Invariant cache hit.
[2024-05-27 18:58:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-27 18:58:31] [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.
[2024-05-27 18:58:31] [INFO ] Redundant transitions in 35 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-27 18:58:31] [INFO ] Invariant cache hit.
[2024-05-27 18:58:31] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/16 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/18 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/20 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/25 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 59 ms.
Refiners :[State Equation: 9/11 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/16 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/18 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/20 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/21 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/22 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/25 variables, and 20 constraints, problems are : Problem set: 0 solved, 5 unsolved in 86 ms.
Refiners :[State Equation: 10/11 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 161ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 161ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/43 places, 14/53 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 262 ms. Remains : 11/43 places, 14/53 transitions.
Stuttering acceptance computed with spot in 73 ms :[false, false]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 227 ms.
Product exploration explored 100000 steps with 0 reset in 231 ms.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 205 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[false, false]
RANDOM walk for 30021 steps (7 resets) in 190 ms. (157 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 278 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[false, false]
Stuttering acceptance computed with spot in 82 ms :[false, false]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-27 18:58:32] [INFO ] Invariant cache hit.
[2024-05-27 18:58:32] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-27 18:58:32] [INFO ] Invariant cache hit.
[2024-05-27 18:58:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-27 18:58:32] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-27 18:58:32] [INFO ] Redundant transitions in 17 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-27 18:58:32] [INFO ] Invariant cache hit.
[2024-05-27 18:58:32] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/16 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/18 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/20 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/25 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 54 ms.
Refiners :[State Equation: 9/11 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/16 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/18 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/20 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/21 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/22 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/25 variables, and 20 constraints, problems are : Problem set: 0 solved, 5 unsolved in 73 ms.
Refiners :[State Equation: 10/11 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 132ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 133ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 212 ms. Remains : 11/11 places, 14/14 transitions.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 160 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[false, false]
RANDOM walk for 36680 steps (9 resets) in 192 ms. (190 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 274 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[false, false]
Stuttering acceptance computed with spot in 85 ms :[false, false]
Stuttering acceptance computed with spot in 69 ms :[false, false]
Product exploration explored 100000 steps with 0 reset in 126 ms.
Product exploration explored 100000 steps with 0 reset in 180 ms.
Built C files in :
/tmp/ltsmin7260147252728033602
[2024-05-27 18:58:34] [INFO ] Computing symmetric may disable matrix : 14 transitions.
[2024-05-27 18:58:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 18:58:34] [INFO ] Computing symmetric may enable matrix : 14 transitions.
[2024-05-27 18:58:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 18:58:34] [INFO ] Computing Do-Not-Accords matrix : 14 transitions.
[2024-05-27 18:58:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 18:58:34] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7260147252728033602
Running compilation step : cd /tmp/ltsmin7260147252728033602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 215 ms.
Running link step : cd /tmp/ltsmin7260147252728033602;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin7260147252728033602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11124569151878756202.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 14/14 transitions.
Applied a total of 0 rules in 3 ms. Remains 11 /11 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-27 18:58:49] [INFO ] Invariant cache hit.
[2024-05-27 18:58:49] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-27 18:58:49] [INFO ] Invariant cache hit.
[2024-05-27 18:58:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-27 18:58:49] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-27 18:58:49] [INFO ] Redundant transitions in 15 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-27 18:58:49] [INFO ] Invariant cache hit.
[2024-05-27 18:58:49] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/16 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/18 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/20 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/25 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 63 ms.
Refiners :[State Equation: 9/11 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/16 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/18 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/20 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/21 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/22 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/25 variables, and 20 constraints, problems are : Problem set: 0 solved, 5 unsolved in 62 ms.
Refiners :[State Equation: 10/11 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 130ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 215 ms. Remains : 11/11 places, 14/14 transitions.
Built C files in :
/tmp/ltsmin12967705771632718747
[2024-05-27 18:58:49] [INFO ] Computing symmetric may disable matrix : 14 transitions.
[2024-05-27 18:58:49] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 18:58:49] [INFO ] Computing symmetric may enable matrix : 14 transitions.
[2024-05-27 18:58:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 18:58:49] [INFO ] Computing Do-Not-Accords matrix : 14 transitions.
[2024-05-27 18:58:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 18:58:49] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12967705771632718747
Running compilation step : cd /tmp/ltsmin12967705771632718747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 100 ms.
Running link step : cd /tmp/ltsmin12967705771632718747;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12967705771632718747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased869984271934182908.hoa' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.099: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.098: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.099: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.098: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.099: LTL layer using automaton file : /tmp/stateBased869984271934182908.hoa
pins2lts-mc-linux64( 0/ 8), 0.107: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.107: Initializing POR dependencies: labels 16, guards 14
pins2lts-mc-linux64( 0/ 8), 0.107: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.108: "(LTLAPp1==true)&&(LTLAPp0==true)" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.106: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.107: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.106: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.108: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.108: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.108: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.107: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.108: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.107: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.108: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.109: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.111: There are 17 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.111: State length is 12, there are 22 groups
pins2lts-mc-linux64( 0/ 8), 0.111: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.111: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.111: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.111: Visible groups: 0 / 22, labels: 2 / 17
pins2lts-mc-linux64( 0/ 8), 0.111: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.111: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.141: [Blue] ~120 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 0/ 8), 0.153: [Blue] ~240 levels ~1920 states ~1920 transitions
pins2lts-mc-linux64( 0/ 8), 0.176: [Blue] ~480 levels ~3840 states ~3840 transitions
pins2lts-mc-linux64( 0/ 8), 0.223: [Blue] ~960 levels ~7680 states ~7680 transitions
pins2lts-mc-linux64( 6/ 8), 0.285: [Blue] ~1920 levels ~15360 states ~15360 transitions
pins2lts-mc-linux64( 6/ 8), 0.412: [Blue] ~3840 levels ~30720 states ~30720 transitions
pins2lts-mc-linux64( 6/ 8), 0.581: [Blue] ~7680 levels ~61440 states ~61440 transitions
pins2lts-mc-linux64( 6/ 8), 0.816: [Blue] ~15360 levels ~122880 states ~122880 transitions
pins2lts-mc-linux64( 6/ 8), 1.139: [Blue] ~30720 levels ~245760 states ~245760 transitions
pins2lts-mc-linux64( 6/ 8), 1.563: [Blue] ~61440 levels ~491520 states ~491520 transitions
pins2lts-mc-linux64( 4/ 8), 2.010: [Blue] ~122880 levels ~983040 states ~983040 transitions
pins2lts-mc-linux64( 4/ 8), 2.634: [Blue] ~245760 levels ~1966080 states ~1966080 transitions
pins2lts-mc-linux64( 6/ 8), 3.910: [Blue] ~491520 levels ~3932160 states ~3932160 transitions
pins2lts-mc-linux64( 6/ 8), 6.537: [Blue] ~983040 levels ~7864320 states ~7864320 transitions
pins2lts-mc-linux64( 0/ 8), 12.082: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 12.274:
pins2lts-mc-linux64( 0/ 8), 12.274: Explored 9601325 states 9601341 transitions, fanout: 1.000
pins2lts-mc-linux64( 0/ 8), 12.274: Total exploration time 12.140 sec (11.960 sec minimum, 12.015 sec on average)
pins2lts-mc-linux64( 0/ 8), 12.274: States per second: 790883, Transitions per second: 790885
pins2lts-mc-linux64( 0/ 8), 12.274:
pins2lts-mc-linux64( 0/ 8), 12.274: State space has 16963750 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 12.274: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 12.274: blue states: 9601325 (56.60%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 12.274: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 12.274: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 12.274:
pins2lts-mc-linux64( 0/ 8), 12.274: Total memory used for local state coloring: 146.5MB
pins2lts-mc-linux64( 0/ 8), 12.274:
pins2lts-mc-linux64( 0/ 8), 12.274: Queue width: 8B, total height: 9601325, memory: 73.25MB
pins2lts-mc-linux64( 0/ 8), 12.274: Tree memory: 385.4MB, 23.8 B/state, compr.: 47.6%
pins2lts-mc-linux64( 0/ 8), 12.274: Tree fill ratio (roots/leafs): 12.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 12.274: Stored 15 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 12.274: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 12.274: Est. total memory use: 458.7MB (~1097.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12967705771632718747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased869984271934182908.hoa' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12967705771632718747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased869984271934182908.hoa' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:116)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-27 18:59:02] [INFO ] Flatten gal took : 2 ms
[2024-05-27 18:59:02] [INFO ] Flatten gal took : 1 ms
[2024-05-27 18:59:02] [INFO ] Time to serialize gal into /tmp/LTL11989657184601933491.gal : 1 ms
[2024-05-27 18:59:02] [INFO ] Time to serialize properties into /tmp/LTL7396630039780294222.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11989657184601933491.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15069454391520484979.hoa' '-atoms' '/tmp/LTL7396630039780294222.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7396630039780294222.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15069454391520484979.hoa
Detected timeout of ITS tools.
[2024-05-27 18:59:17] [INFO ] Flatten gal took : 2 ms
[2024-05-27 18:59:17] [INFO ] Flatten gal took : 1 ms
[2024-05-27 18:59:17] [INFO ] Time to serialize gal into /tmp/LTL11899869825843727942.gal : 0 ms
[2024-05-27 18:59:17] [INFO ] Time to serialize properties into /tmp/LTL4955695724458107211.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11899869825843727942.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4955695724458107211.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(((G("(p7<=p23)"))||(G("(p7>p23)")))||(("(p7>p23)")&&(F("(p17<3)")))))))
Formula 0 simplified : G(F!"(p7<=p23)" & F!"(p7>p23)" & F(G!"(p17<3)" | G!"(p7>p23)"))
Detected timeout of ITS tools.
[2024-05-27 18:59:32] [INFO ] Flatten gal took : 2 ms
[2024-05-27 18:59:32] [INFO ] Applying decomposition
[2024-05-27 18:59:32] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3679183649123470486.txt' '-o' '/tmp/graph3679183649123470486.bin' '-w' '/tmp/graph3679183649123470486.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3679183649123470486.bin' '-l' '-1' '-v' '-w' '/tmp/graph3679183649123470486.weights' '-q' '0' '-e' '0.001'
[2024-05-27 18:59:32] [INFO ] Decomposing Gal with order
[2024-05-27 18:59:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 18:59:32] [INFO ] Removed a total of 3 redundant transitions.
[2024-05-27 18:59:32] [INFO ] Flatten gal took : 96 ms
[2024-05-27 18:59:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-27 18:59:32] [INFO ] Time to serialize gal into /tmp/LTL8960191595902263291.gal : 0 ms
[2024-05-27 18:59:32] [INFO ] Time to serialize properties into /tmp/LTL6249142130220314255.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8960191595902263291.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6249142130220314255.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(((G("(gu1.p7<=gu1.p23)"))||(G("(gu1.p7>gu1.p23)")))||(("(gu1.p7>gu1.p23)")&&(F("(gi2.gu3.p17<3)")))))))
Formula 0 simplified : G(F!"(gu1.p7<=gu1.p23)" & F!"(gu1.p7>gu1.p23)" & F(G!"(gi2.gu3.p17<3)" | G!"(gu1.p7>gu1.p23)"))
Detected timeout of ITS tools.
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-04 finished in 76419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||(F(!p0)&&G(p1)))))'
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 53/53 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 34 transition count 45
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 27 transition count 38
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 27 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 27 transition count 36
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 38 place count 22 transition count 31
Iterating global reduction 2 with 5 rules applied. Total rules applied 43 place count 22 transition count 31
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 48 place count 22 transition count 26
Applied a total of 48 rules in 9 ms. Remains 22 /43 variables (removed 21) and now considering 26/53 (removed 27) transitions.
[2024-05-27 18:59:47] [INFO ] Flow matrix only has 24 transitions (discarded 2 similar events)
// Phase 1: matrix 24 rows 22 cols
[2024-05-27 18:59:47] [INFO ] Computed 1 invariants in 2 ms
[2024-05-27 18:59:47] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-27 18:59:47] [INFO ] Flow matrix only has 24 transitions (discarded 2 similar events)
[2024-05-27 18:59:47] [INFO ] Invariant cache hit.
[2024-05-27 18:59:47] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-27 18:59:47] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 18 sub problems to find dead transitions.
[2024-05-27 18:59:47] [INFO ] Flow matrix only has 24 transitions (discarded 2 similar events)
[2024-05-27 18:59:47] [INFO ] Invariant cache hit.
[2024-05-27 18:59:47] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 2/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 20/39 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/46 variables, and 31 constraints, problems are : Problem set: 0 solved, 18 unsolved in 139 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/22 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 2/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 20/39 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/46 variables, and 49 constraints, problems are : Problem set: 0 solved, 18 unsolved in 130 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/22 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 273ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 274ms
Starting structural reductions in LTL mode, iteration 1 : 22/43 places, 26/53 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 357 ms. Remains : 22/43 places, 26/53 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-06
Stuttering criterion allowed to conclude after 50 steps with 1 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-06 finished in 476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 53/53 transitions.
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 32 transition count 43
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 25 transition count 36
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 25 transition count 36
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 25 transition count 34
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 42 place count 20 transition count 29
Iterating global reduction 2 with 5 rules applied. Total rules applied 47 place count 20 transition count 29
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 52 place count 20 transition count 24
Applied a total of 52 rules in 2 ms. Remains 20 /43 variables (removed 23) and now considering 24/53 (removed 29) transitions.
[2024-05-27 18:59:48] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 20 cols
[2024-05-27 18:59:48] [INFO ] Computed 1 invariants in 1 ms
[2024-05-27 18:59:48] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-27 18:59:48] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
[2024-05-27 18:59:48] [INFO ] Invariant cache hit.
[2024-05-27 18:59:48] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-27 18:59:48] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Running 18 sub problems to find dead transitions.
[2024-05-27 18:59:48] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
[2024-05-27 18:59:48] [INFO ] Invariant cache hit.
[2024-05-27 18:59:48] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 2/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 20/39 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/42 variables, and 31 constraints, problems are : Problem set: 0 solved, 18 unsolved in 159 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/20 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 2/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 20/39 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/42 variables, and 49 constraints, problems are : Problem set: 0 solved, 18 unsolved in 164 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/20 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 329ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 329ms
Starting structural reductions in LTL mode, iteration 1 : 20/43 places, 24/53 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 390 ms. Remains : 20/43 places, 24/53 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-07 finished in 574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 53/53 transitions.
Graph (complete) has 69 edges and 43 vertex of which 26 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 25 transition count 39
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 19 place count 17 transition count 31
Iterating global reduction 1 with 8 rules applied. Total rules applied 27 place count 17 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 17 transition count 29
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 36 place count 10 transition count 22
Iterating global reduction 2 with 7 rules applied. Total rules applied 43 place count 10 transition count 22
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 50 place count 10 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 15 edges and 9 vertex of which 8 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 8 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 55 place count 8 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 56 place count 7 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 57 place count 7 transition count 10
Applied a total of 57 rules in 4 ms. Remains 7 /43 variables (removed 36) and now considering 10/53 (removed 43) transitions.
// Phase 1: matrix 10 rows 7 cols
[2024-05-27 18:59:48] [INFO ] Computed 0 invariants in 0 ms
[2024-05-27 18:59:48] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-27 18:59:48] [INFO ] Invariant cache hit.
[2024-05-27 18:59:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-27 18:59:48] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-27 18:59:48] [INFO ] Redundant transitions in 12 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-27 18:59:48] [INFO ] Invariant cache hit.
[2024-05-27 18:59:48] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/12 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/17 variables, and 8 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31 ms.
Refiners :[State Equation: 5/7 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/12 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/13 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/14 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/17 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 37 ms.
Refiners :[State Equation: 6/7 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 70ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/43 places, 10/53 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 7/43 places, 10/53 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-08
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-08 finished in 174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 53/53 transitions.
Graph (complete) has 69 edges and 43 vertex of which 25 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 24 transition count 38
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 19 place count 17 transition count 31
Iterating global reduction 1 with 7 rules applied. Total rules applied 26 place count 17 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 17 transition count 29
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 34 place count 11 transition count 23
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 11 transition count 23
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 46 place count 11 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 49 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 18 edges and 10 vertex of which 9 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 9 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 53 place count 8 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 54 place count 8 transition count 11
Applied a total of 54 rules in 12 ms. Remains 8 /43 variables (removed 35) and now considering 11/53 (removed 42) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-27 18:59:48] [INFO ] Computed 0 invariants in 0 ms
[2024-05-27 18:59:48] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-27 18:59:48] [INFO ] Invariant cache hit.
[2024-05-27 18:59:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-27 18:59:48] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-27 18:59:48] [INFO ] Redundant transitions in 15 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-27 18:59:48] [INFO ] Invariant cache hit.
[2024-05-27 18:59:48] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/14 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/15 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/16 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/19 variables, and 11 constraints, problems are : Problem set: 0 solved, 4 unsolved in 43 ms.
Refiners :[State Equation: 7/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/14 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/15 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/16 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/17 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/18 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 16 constraints, problems are : Problem set: 0 solved, 4 unsolved in 49 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 95ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/43 places, 11/53 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 170 ms. Remains : 8/43 places, 11/53 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-09 finished in 326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 53/53 transitions.
Graph (complete) has 69 edges and 43 vertex of which 32 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 0 output transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 32 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 11 place count 32 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 31 transition count 42
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 25 transition count 36
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 25 transition count 36
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 25 transition count 34
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 31 place count 21 transition count 30
Iterating global reduction 2 with 4 rules applied. Total rules applied 35 place count 21 transition count 30
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 21 transition count 26
Applied a total of 39 rules in 10 ms. Remains 21 /43 variables (removed 22) and now considering 26/53 (removed 27) transitions.
[2024-05-27 18:59:49] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 21 cols
[2024-05-27 18:59:49] [INFO ] Computed 1 invariants in 1 ms
[2024-05-27 18:59:49] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-27 18:59:49] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
[2024-05-27 18:59:49] [INFO ] Invariant cache hit.
[2024-05-27 18:59:49] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 18:59:49] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-27 18:59:49] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-27 18:59:49] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
[2024-05-27 18:59:49] [INFO ] Invariant cache hit.
[2024-05-27 18:59:49] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 2/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 21/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/44 variables, and 34 constraints, problems are : Problem set: 0 solved, 20 unsolved in 160 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 2/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 21/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/41 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/44 variables, and 54 constraints, problems are : Problem set: 0 solved, 20 unsolved in 121 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 286ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 286ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/43 places, 26/53 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 369 ms. Remains : 21/43 places, 26/53 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 191 ms.
Product exploration explored 100000 steps with 0 reset in 149 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 165 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 146 ms. (272 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
[2024-05-27 18:59:50] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
[2024-05-27 18:59:50] [INFO ] Invariant cache hit.
[2024-05-27 18:59:50] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/27 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/35 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/35 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/43 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/44 variables, and 35 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/27 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/35 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 35/44 variables, and 27 constraints, problems are : Problem set: 1 solved, 0 unsolved in 29 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 13/21 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 67ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (G (OR p1 p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR (NOT p1) p0))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 19 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-10 finished in 1243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 53/53 transitions.
Graph (complete) has 69 edges and 43 vertex of which 26 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 25 transition count 39
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 19 place count 17 transition count 31
Iterating global reduction 1 with 8 rules applied. Total rules applied 27 place count 17 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 17 transition count 29
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 36 place count 10 transition count 22
Iterating global reduction 2 with 7 rules applied. Total rules applied 43 place count 10 transition count 22
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 50 place count 10 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 15 edges and 9 vertex of which 8 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 8 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 55 place count 8 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 56 place count 7 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 57 place count 7 transition count 10
Applied a total of 57 rules in 11 ms. Remains 7 /43 variables (removed 36) and now considering 10/53 (removed 43) transitions.
// Phase 1: matrix 10 rows 7 cols
[2024-05-27 18:59:50] [INFO ] Computed 0 invariants in 0 ms
[2024-05-27 18:59:50] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-27 18:59:50] [INFO ] Invariant cache hit.
[2024-05-27 18:59:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-27 18:59:50] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-27 18:59:50] [INFO ] Redundant transitions in 14 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-27 18:59:50] [INFO ] Invariant cache hit.
[2024-05-27 18:59:50] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/12 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/17 variables, and 8 constraints, problems are : Problem set: 0 solved, 3 unsolved in 36 ms.
Refiners :[State Equation: 5/7 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/12 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/13 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/14 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/17 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 37 ms.
Refiners :[State Equation: 6/7 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 78ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 78ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/43 places, 10/53 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 7/43 places, 10/53 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-11
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-11 finished in 250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G(p1)))))'
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 53/53 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 34 transition count 45
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 28 transition count 39
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 28 transition count 39
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 28 transition count 37
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 35 place count 24 transition count 33
Iterating global reduction 2 with 4 rules applied. Total rules applied 39 place count 24 transition count 33
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 43 place count 24 transition count 29
Applied a total of 43 rules in 3 ms. Remains 24 /43 variables (removed 19) and now considering 29/53 (removed 24) transitions.
[2024-05-27 18:59:50] [INFO ] Flow matrix only has 26 transitions (discarded 3 similar events)
// Phase 1: matrix 26 rows 24 cols
[2024-05-27 18:59:50] [INFO ] Computed 1 invariants in 0 ms
[2024-05-27 18:59:50] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-27 18:59:50] [INFO ] Flow matrix only has 26 transitions (discarded 3 similar events)
[2024-05-27 18:59:50] [INFO ] Invariant cache hit.
[2024-05-27 18:59:50] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 18:59:50] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Running 21 sub problems to find dead transitions.
[2024-05-27 18:59:50] [INFO ] Flow matrix only has 26 transitions (discarded 3 similar events)
[2024-05-27 18:59:50] [INFO ] Invariant cache hit.
[2024-05-27 18:59:50] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 2/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 22/43 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 21 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/50 variables, and 35 constraints, problems are : Problem set: 0 solved, 21 unsolved in 149 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/24 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 2/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 22/43 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 21/56 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/50 variables, and 56 constraints, problems are : Problem set: 0 solved, 21 unsolved in 148 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/24 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 314ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 314ms
Starting structural reductions in LTL mode, iteration 1 : 24/43 places, 29/53 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 377 ms. Remains : 24/43 places, 29/53 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-14
Stuttering criterion allowed to conclude after 7 steps with 2 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-14 finished in 556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 53/53 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 34 transition count 45
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 27 transition count 38
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 27 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 27 transition count 36
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 38 place count 22 transition count 31
Iterating global reduction 2 with 5 rules applied. Total rules applied 43 place count 22 transition count 31
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 48 place count 22 transition count 26
Applied a total of 48 rules in 6 ms. Remains 22 /43 variables (removed 21) and now considering 26/53 (removed 27) transitions.
[2024-05-27 18:59:51] [INFO ] Flow matrix only has 24 transitions (discarded 2 similar events)
// Phase 1: matrix 24 rows 22 cols
[2024-05-27 18:59:51] [INFO ] Computed 1 invariants in 1 ms
[2024-05-27 18:59:51] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-27 18:59:51] [INFO ] Flow matrix only has 24 transitions (discarded 2 similar events)
[2024-05-27 18:59:51] [INFO ] Invariant cache hit.
[2024-05-27 18:59:51] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-27 18:59:51] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 18 sub problems to find dead transitions.
[2024-05-27 18:59:51] [INFO ] Flow matrix only has 24 transitions (discarded 2 similar events)
[2024-05-27 18:59:51] [INFO ] Invariant cache hit.
[2024-05-27 18:59:51] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 2/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 20/39 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/46 variables, and 31 constraints, problems are : Problem set: 0 solved, 18 unsolved in 126 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/22 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 2/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 20/39 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/46 variables, and 49 constraints, problems are : Problem set: 0 solved, 18 unsolved in 114 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/22 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 245ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 246ms
Starting structural reductions in LTL mode, iteration 1 : 22/43 places, 26/53 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 323 ms. Remains : 22/43 places, 26/53 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-15
Stuttering criterion allowed to conclude after 7 steps with 3 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-15 finished in 502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||G(!p0)||(!p0&&F(p1))))))'
[2024-05-27 18:59:51] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1996517690085743358
[2024-05-27 18:59:51] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2024-05-27 18:59:51] [INFO ] Applying decomposition
[2024-05-27 18:59:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 18:59:51] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2024-05-27 18:59:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 18:59:51] [INFO ] Flatten gal took : 3 ms
[2024-05-27 18:59:51] [INFO ] Computing Do-Not-Accords matrix : 53 transitions.
[2024-05-27 18:59:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 18:59:51] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1996517690085743358
Running compilation step : cd /tmp/ltsmin1996517690085743358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9065043629610821554.txt' '-o' '/tmp/graph9065043629610821554.bin' '-w' '/tmp/graph9065043629610821554.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9065043629610821554.bin' '-l' '-1' '-v' '-w' '/tmp/graph9065043629610821554.weights' '-q' '0' '-e' '0.001'
[2024-05-27 18:59:51] [INFO ] Decomposing Gal with order
[2024-05-27 18:59:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 18:59:51] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-27 18:59:51] [INFO ] Flatten gal took : 4 ms
[2024-05-27 18:59:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 1 ms.
[2024-05-27 18:59:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality10547394413178213527.gal : 1 ms
[2024-05-27 18:59:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality2157418587605457409.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10547394413178213527.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2157418587605457409.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(F(((G("(gu3.p7<=gu3.p23)"))||(G("(gu3.p7>gu3.p23)")))||(("(gu3.p7>gu3.p23)")&&(F("(gi12.gi0.gu11.p17<3)")))))))
Formula 0 simplified : G(F!"(gu3.p7<=gu3.p23)" & F!"(gu3.p7>gu3.p23)" & F(G!"(gi12.gi0.gu11.p17<3)" | G!"(gu3.p7>gu3.p23)"))
Compilation finished in 136 ms.
Running link step : cd /tmp/ltsmin1996517690085743358;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1996517690085743358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||[](!(LTLAPp0==true))||(!(LTLAPp0==true)&&<>((LTLAPp1==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Initializing POR dependencies: labels 55, guards 53
pins2lts-mc-linux64( 1/ 8), 0.003: 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( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: LTL layer: formula: [](<>(([]((LTLAPp0==true))||[](!(LTLAPp0==true))||(!(LTLAPp0==true)&&<>((LTLAPp1==true))))))
pins2lts-mc-linux64( 5/ 8), 0.007: "[](<>(([]((LTLAPp0==true))||[](!(LTLAPp0==true))||(!(LTLAPp0==true)&&<>((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.035: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.038: There are 56 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.038: State length is 44, there are 61 groups
pins2lts-mc-linux64( 0/ 8), 0.038: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.038: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.038: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.038: Visible groups: 0 / 61, labels: 2 / 56
pins2lts-mc-linux64( 0/ 8), 0.038: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.038: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.064: [Blue] ~120 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 1/ 8), 0.086: [Blue] ~240 levels ~1920 states ~1920 transitions
pins2lts-mc-linux64( 1/ 8), 0.118: [Blue] ~480 levels ~3840 states ~3840 transitions
pins2lts-mc-linux64( 5/ 8), 0.162: [Blue] ~960 levels ~7680 states ~7680 transitions
pins2lts-mc-linux64( 5/ 8), 0.270: [Blue] ~1920 levels ~15360 states ~15360 transitions
pins2lts-mc-linux64( 4/ 8), 0.431: [Blue] ~3840 levels ~30720 states ~30720 transitions
pins2lts-mc-linux64( 5/ 8), 0.669: [Blue] ~7680 levels ~61440 states ~61440 transitions
pins2lts-mc-linux64( 4/ 8), 1.046: [Blue] ~15360 levels ~122880 states ~122880 transitions
pins2lts-mc-linux64( 4/ 8), 1.760: [Blue] ~30720 levels ~245760 states ~245760 transitions
pins2lts-mc-linux64( 5/ 8), 3.829: [Blue] ~61440 levels ~491520 states ~491520 transitions
pins2lts-mc-linux64( 5/ 8), 6.255: [Blue] ~122880 levels ~983040 states ~983040 transitions
pins2lts-mc-linux64( 5/ 8), 7.920: [Blue] ~245760 levels ~1966080 states ~1966080 transitions
pins2lts-mc-linux64( 3/ 8), 11.047: [Blue] ~491520 levels ~3932160 states ~3932160 transitions
pins2lts-mc-linux64( 3/ 8), 17.355: [Blue] ~983040 levels ~7864320 states ~7864320 transitions
pins2lts-mc-linux64( 1/ 8), 23.710: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 24.013:
pins2lts-mc-linux64( 0/ 8), 24.013: Explored 8985307 states 8985330 transitions, fanout: 1.000
pins2lts-mc-linux64( 0/ 8), 24.013: Total exploration time 23.930 sec (23.650 sec minimum, 23.740 sec on average)
pins2lts-mc-linux64( 0/ 8), 24.013: States per second: 375483, Transitions per second: 375484
pins2lts-mc-linux64( 0/ 8), 24.013:
pins2lts-mc-linux64( 0/ 8), 24.013: State space has 11668348 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 24.013: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 24.013: blue states: 8985307 (77.01%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 24.013: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 24.013: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 24.013:
pins2lts-mc-linux64( 0/ 8), 24.013: Total memory used for local state coloring: 137.1MB
pins2lts-mc-linux64( 0/ 8), 24.013:
pins2lts-mc-linux64( 0/ 8), 24.013: Queue width: 8B, total height: 8985306, memory: 68.55MB
pins2lts-mc-linux64( 0/ 8), 24.013: Tree memory: 345.0MB, 31.0 B/state, compr.: 17.4%
pins2lts-mc-linux64( 0/ 8), 24.013: Tree fill ratio (roots/leafs): 8.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 24.013: Stored 54 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 24.013: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 24.013: Est. total memory use: 413.6MB (~1092.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1996517690085743358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||[](!(LTLAPp0==true))||(!(LTLAPp0==true)&&<>((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1996517690085743358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||[](!(LTLAPp0==true))||(!(LTLAPp0==true)&&<>((LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-27 19:20:20] [INFO ] Flatten gal took : 4 ms
[2024-05-27 19:20:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality4043088061573971248.gal : 2 ms
[2024-05-27 19:20:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality9627384413898498257.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4043088061573971248.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9627384413898498257.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G(F(((G("(p7<=p23)"))||(G("(p7>p23)")))||(("(p7>p23)")&&(F("(p17<3)")))))))
Formula 0 simplified : G(F!"(p7<=p23)" & F!"(p7>p23)" & F(G!"(p17<3)" | G!"(p7>p23)"))
Detected timeout of ITS tools.
[2024-05-27 19:40:48] [INFO ] Flatten gal took : 5 ms
[2024-05-27 19:40:48] [INFO ] Input system was already deterministic with 53 transitions.
[2024-05-27 19:40:48] [INFO ] Transformed 43 places.
[2024-05-27 19:40:48] [INFO ] Transformed 53 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2024-05-27 19:40:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality9453396964648431495.gal : 5 ms
[2024-05-27 19:40:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality15191866046658282709.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9453396964648431495.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15191866046658282709.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(((G("(p7<=p23)"))||(G("(p7>p23)")))||(("(p7>p23)")&&(F("(p17<3)")))))))
Formula 0 simplified : G(F!"(p7<=p23)" & F!"(p7>p23)" & F(G!"(p17<3)" | G!"(p7>p23)"))

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SemanticWebServices-PT-S064P06"
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-5568"
echo " Executing tool itstools"
echo " Input is SemanticWebServices-PT-S064P06, 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 r334-tall-171679080400491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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