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-171679079500044.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 RingSingleMessageInMbox-PT-d0m080, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679079500044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 23:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 12 23:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 12 23:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 23:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 64K 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 RingSingleMessageInMbox-PT-d0m080-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716792164150

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d0m080
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-27 06:42:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 06:42:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 06:42:45] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-05-27 06:42:45] [INFO ] Transformed 385 places.
[2024-05-27 06:42:45] [INFO ] Transformed 59 transitions.
[2024-05-27 06:42:45] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 59/59 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 53 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 53 transition count 58
Applied a total of 4 rules in 19 ms. Remains 53 /56 variables (removed 3) and now considering 58/59 (removed 1) transitions.
// Phase 1: matrix 58 rows 53 cols
[2024-05-27 06:42:45] [INFO ] Computed 3 invariants in 12 ms
[2024-05-27 06:42:45] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-27 06:42:45] [INFO ] Invariant cache hit.
[2024-05-27 06:42:46] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-27 06:42:46] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2024-05-27 06:42:46] [INFO ] Invariant cache hit.
[2024-05-27 06:42:46] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD54 is UNSAT
At refinement iteration 4 (OVERLAPS) 58/111 variables, 53/56 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 27/83 constraints. Problems are: Problem set: 5 solved, 52 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/83 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/111 variables, 0/83 constraints. Problems are: Problem set: 5 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 83 constraints, problems are : Problem set: 5 solved, 52 unsolved in 874 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 2/50 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 3/53 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 58/111 variables, 53/56 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 27/83 constraints. Problems are: Problem set: 5 solved, 52 unsolved
Problem TDEAD49 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 52/135 constraints. Problems are: Problem set: 6 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/135 constraints. Problems are: Problem set: 6 solved, 51 unsolved
[2024-05-27 06:42:47] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 11 ms to minimize.
[2024-05-27 06:42:47] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/111 variables, 2/137 constraints. Problems are: Problem set: 6 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/137 constraints. Problems are: Problem set: 6 solved, 51 unsolved
At refinement iteration 11 (OVERLAPS) 0/111 variables, 0/137 constraints. Problems are: Problem set: 6 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 137 constraints, problems are : Problem set: 6 solved, 51 unsolved in 1776 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 52/57 constraints, Known Traps: 2/2 constraints]
After SMT, in 2727ms problems are : Problem set: 6 solved, 51 unsolved
Search for dead transitions found 6 dead transitions in 2740ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 53/56 places, 52/59 transitions.
Reduce places removed 4 places and 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 49 transition count 51
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 4 rules in 3 ms. Remains 49 /53 variables (removed 4) and now considering 51/52 (removed 1) transitions.
// Phase 1: matrix 51 rows 49 cols
[2024-05-27 06:42:48] [INFO ] Computed 4 invariants in 3 ms
[2024-05-27 06:42:48] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-27 06:42:48] [INFO ] Invariant cache hit.
[2024-05-27 06:42:48] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-27 06:42:48] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 49/56 places, 51/59 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3203 ms. Remains : 49/56 places, 51/59 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Support contains 29 out of 48 places after structural reductions.
[2024-05-27 06:42:49] [INFO ] Flatten gal took : 21 ms
[2024-05-27 06:42:49] [INFO ] Flatten gal took : 9 ms
[2024-05-27 06:42:49] [INFO ] Input system was already deterministic with 51 transitions.
Reduction of identical properties reduced properties to check from 27 to 25
RANDOM walk for 40000 steps (8550 resets) in 2184 ms. (18 steps per ms) remains 7/25 properties
BEST_FIRST walk for 40003 steps (3679 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1913 resets) in 98 ms. (404 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (1956 resets) in 101 ms. (392 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40001 steps (1957 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3757 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3742 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
// Phase 1: matrix 51 rows 48 cols
[2024-05-27 06:42:50] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 06:42:50] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 19/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 8/37 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 43/80 variables, 37/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 8 (OVERLAPS) 19/99 variables, 11/67 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 8/75 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-27 06:42:50] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-27 06:42:50] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 2/77 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-27 06:42:50] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
Problem AtomicPropp12 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/99 variables, 1/78 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/99 variables, 0/78 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/99 variables, 0/78 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 78 constraints, problems are : Problem set: 2 solved, 3 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/27 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/35 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 39/74 variables, 35/38 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 12/50 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 0/50 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 24/98 variables, 12/62 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 12/74 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 3/77 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/98 variables, 1/78 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/98 variables, 0/78 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/99 variables, 1/79 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/99 variables, 2/81 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/99 variables, 0/81 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/99 variables, 0/81 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 81 constraints, problems are : Problem set: 2 solved, 3 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 360ms problems are : Problem set: 2 solved, 3 unsolved
Parikh walk visited 0 properties in 1225 ms.
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 122 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 46 transition count 48
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 43 transition count 43
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 43 transition count 43
Applied a total of 10 rules in 32 ms. Remains 43 /48 variables (removed 5) and now considering 43/51 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 43/48 places, 43/51 transitions.
RANDOM walk for 40000 steps (8757 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1928 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (2009 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3813 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 1432 steps, run visited all 3 properties in 14 ms. (steps per millisecond=102 )
Probabilistic random walk after 1432 steps, saw 664 distinct states, run finished after 17 ms. (steps per millisecond=84 ) properties seen :3
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 12 stable transitions
Graph (complete) has 143 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(((p1&&F((G(F((p2 U (p3||G(p2)))))||(!p4&&F((p2 U (p3||G(p2))))))))||p0)))'
Support contains 9 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 2 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
// Phase 1: matrix 45 rows 43 cols
[2024-05-27 06:42:52] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 06:42:52] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-27 06:42:52] [INFO ] Invariant cache hit.
[2024-05-27 06:42:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-27 06:42:52] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-05-27 06:42:52] [INFO ] Invariant cache hit.
[2024-05-27 06:42:52] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 65 constraints, problems are : Problem set: 0 solved, 44 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 44/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 109 constraints, problems are : Problem set: 0 solved, 44 unsolved in 718 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1181ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1182ms
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 45/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1280 ms. Remains : 43/48 places, 45/51 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 209 ms.
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Computed a total of 4 stabilizing places and 9 stable transitions
Graph (complete) has 130 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p4) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (OR (AND (NOT p0) p1 (NOT p3) (NOT p2)) (AND (NOT p0) p1 (NOT p3) (NOT p4))))), (X p1), (X (NOT (AND (NOT p0) p1 p4))), (X (X (NOT p2))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p3) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 20 ms. Reduced automaton from 5 states, 9 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-01 finished in 2053 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)))||(G(p1)&&X(G(p2)))))'
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 3 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
// Phase 1: matrix 44 rows 42 cols
[2024-05-27 06:42:54] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 06:42:54] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-27 06:42:54] [INFO ] Invariant cache hit.
[2024-05-27 06:42:54] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:42:54] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-05-27 06:42:54] [INFO ] Invariant cache hit.
[2024-05-27 06:42:54] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 689 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1155ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1155ms
Starting structural reductions in LTL mode, iteration 1 : 42/48 places, 44/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1253 ms. Remains : 42/48 places, 44/51 transitions.
Stuttering acceptance computed with spot in 250 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1669 steps with 360 reset in 14 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-02 finished in 1535 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) U (X(G(!p0))||(!p1&&X((!p0&&G(!p2)))))))'
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 4 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
[2024-05-27 06:42:55] [INFO ] Invariant cache hit.
[2024-05-27 06:42:55] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-27 06:42:55] [INFO ] Invariant cache hit.
[2024-05-27 06:42:55] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:42:55] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-05-27 06:42:55] [INFO ] Invariant cache hit.
[2024-05-27 06:42:55] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 701 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1169ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1170ms
Starting structural reductions in LTL mode, iteration 1 : 42/48 places, 44/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1269 ms. Remains : 42/48 places, 44/51 transitions.
Stuttering acceptance computed with spot in 301 ms :[true, p0, p2, (AND p0 p2), p0, p0]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-04 finished in 1594 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))))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 3 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
[2024-05-27 06:42:57] [INFO ] Invariant cache hit.
[2024-05-27 06:42:57] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-27 06:42:57] [INFO ] Invariant cache hit.
[2024-05-27 06:42:57] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:42:57] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-05-27 06:42:57] [INFO ] Invariant cache hit.
[2024-05-27 06:42:57] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 701 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1181ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1182ms
Starting structural reductions in LTL mode, iteration 1 : 42/48 places, 44/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1287 ms. Remains : 42/48 places, 44/51 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-05 finished in 1465 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((p0||(p1 U X(p0))||(!p2&&F(p2)))))'
Support contains 3 out of 48 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 43 transition count 47
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 43 transition count 47
Applied a total of 9 rules in 5 ms. Remains 43 /48 variables (removed 5) and now considering 47/51 (removed 4) transitions.
// Phase 1: matrix 47 rows 43 cols
[2024-05-27 06:42:58] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 06:42:58] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-27 06:42:58] [INFO ] Invariant cache hit.
[2024-05-27 06:42:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-27 06:42:59] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-05-27 06:42:59] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2024-05-27 06:42:59] [INFO ] Invariant cache hit.
[2024-05-27 06:42:59] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 47/90 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 22/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/90 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 67 constraints, problems are : Problem set: 0 solved, 46 unsolved in 3425 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 47/90 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 22/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 46/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/90 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 113 constraints, problems are : Problem set: 0 solved, 46 unsolved in 731 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 4181ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 4182ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/48 places, 47/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4349 ms. Remains : 43/48 places, 47/51 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-07 finished in 4462 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' '!(((p0 U p1)||(F(!p2) U p1)))'
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 4 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
// Phase 1: matrix 45 rows 43 cols
[2024-05-27 06:43:03] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 06:43:03] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-27 06:43:03] [INFO ] Invariant cache hit.
[2024-05-27 06:43:03] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:43:03] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-27 06:43:03] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-27 06:43:03] [INFO ] Invariant cache hit.
[2024-05-27 06:43:03] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 64 constraints, problems are : Problem set: 0 solved, 44 unsolved in 482 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 44/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 108 constraints, problems are : Problem set: 0 solved, 44 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1185ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1186ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/48 places, 45/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1289 ms. Remains : 43/48 places, 45/51 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), p2, (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-09 finished in 1424 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(F(!p0))&&F((G(p2)&&p1))))'
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 5 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
// Phase 1: matrix 45 rows 43 cols
[2024-05-27 06:43:04] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 06:43:04] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-27 06:43:04] [INFO ] Invariant cache hit.
[2024-05-27 06:43:04] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:43:04] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-05-27 06:43:04] [INFO ] Invariant cache hit.
[2024-05-27 06:43:04] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 64 constraints, problems are : Problem set: 0 solved, 44 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 44/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 108 constraints, problems are : Problem set: 0 solved, 44 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1263ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1263ms
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 45/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1349 ms. Remains : 43/48 places, 45/51 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p2) (NOT p1) p0), p0, (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-11
Stuttering criterion allowed to conclude after 6 steps with 2 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-11 finished in 1538 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 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 5 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
// Phase 1: matrix 44 rows 42 cols
[2024-05-27 06:43:06] [INFO ] Computed 2 invariants in 0 ms
[2024-05-27 06:43:06] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-27 06:43:06] [INFO ] Invariant cache hit.
[2024-05-27 06:43:06] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:43:06] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-27 06:43:06] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2024-05-27 06:43:06] [INFO ] Invariant cache hit.
[2024-05-27 06:43:06] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1158ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1159ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/48 places, 44/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1263 ms. Remains : 42/48 places, 44/51 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-13
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-13 finished in 1315 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(p1)&&F(G(p2)))||p0))))'
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 8 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
// Phase 1: matrix 45 rows 43 cols
[2024-05-27 06:43:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 06:43:07] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-27 06:43:07] [INFO ] Invariant cache hit.
[2024-05-27 06:43:07] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:43:07] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-27 06:43:07] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-27 06:43:07] [INFO ] Invariant cache hit.
[2024-05-27 06:43:07] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 64 constraints, problems are : Problem set: 0 solved, 44 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 44/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 108 constraints, problems are : Problem set: 0 solved, 44 unsolved in 769 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1259ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1259ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/48 places, 45/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1365 ms. Remains : 43/48 places, 45/51 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-14
Product exploration explored 100000 steps with 21644 reset in 170 ms.
Product exploration explored 100000 steps with 21652 reset in 137 ms.
Computed a total of 4 stabilizing places and 9 stable transitions
Graph (complete) has 131 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 113 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8555 resets) in 267 ms. (149 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40002 steps (3670 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1961 resets) in 194 ms. (205 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1929 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3750 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
[2024-05-27 06:43:09] [INFO ] Invariant cache hit.
[2024-05-27 06:43:09] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 35/60 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 8 (OVERLAPS) 27/87 variables, 17/53 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 10/63 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/63 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/88 variables, 1/64 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 0/64 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/88 variables, 0/64 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 64 constraints, problems are : Problem set: 3 solved, 1 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/21 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/24 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/59 variables, 24/26 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 9/35 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/87 variables, 18/53 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 10/63 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 1/64 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/87 variables, 0/64 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/88 variables, 1/65 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/88 variables, 0/65 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/88 variables, 0/65 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 65 constraints, problems are : Problem set: 3 solved, 1 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 3 solved, 1 unsolved
Finished Parikh walk after 345 steps, including 24 resets, run visited all 1 properties in 1 ms. (steps per millisecond=345 )
Parikh walk visited 1 properties in 5 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (OR (NOT p2) p0)), (G (OR p0 (NOT p1))), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p0))), (F p2), (F (NOT (OR p0 p1))), (F p1)]
Knowledge based reduction with 20 factoid took 316 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 43 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 43 /43 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-27 06:43:10] [INFO ] Invariant cache hit.
[2024-05-27 06:43:10] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-27 06:43:10] [INFO ] Invariant cache hit.
[2024-05-27 06:43:10] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:43:10] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-27 06:43:10] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-27 06:43:10] [INFO ] Invariant cache hit.
[2024-05-27 06:43:10] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 64 constraints, problems are : Problem set: 0 solved, 44 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 44/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 108 constraints, problems are : Problem set: 0 solved, 44 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1250ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1250ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1340 ms. Remains : 43/43 places, 45/45 transitions.
Computed a total of 4 stabilizing places and 9 stable transitions
Graph (complete) has 131 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 33575 steps (7294 resets) in 59 ms. (559 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21610 reset in 71 ms.
Product exploration explored 100000 steps with 21621 reset in 74 ms.
Built C files in :
/tmp/ltsmin1547838581293261
[2024-05-27 06:43:12] [INFO ] Computing symmetric may disable matrix : 45 transitions.
[2024-05-27 06:43:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 06:43:12] [INFO ] Computing symmetric may enable matrix : 45 transitions.
[2024-05-27 06:43:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 06:43:12] [INFO ] Computing Do-Not-Accords matrix : 45 transitions.
[2024-05-27 06:43:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 06:43:12] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1547838581293261
Running compilation step : cd /tmp/ltsmin1547838581293261;'/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 388 ms.
Running link step : cd /tmp/ltsmin1547838581293261;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1547838581293261;'/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/stateBased4890956992551423391.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 45/45 transitions.
Applied a total of 0 rules in 6 ms. Remains 43 /43 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-27 06:43:27] [INFO ] Invariant cache hit.
[2024-05-27 06:43:28] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-27 06:43:28] [INFO ] Invariant cache hit.
[2024-05-27 06:43:28] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:43:28] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-27 06:43:28] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-27 06:43:28] [INFO ] Invariant cache hit.
[2024-05-27 06:43:28] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 64 constraints, problems are : Problem set: 0 solved, 44 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 44/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 108 constraints, problems are : Problem set: 0 solved, 44 unsolved in 747 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1240ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1241ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1375 ms. Remains : 43/43 places, 45/45 transitions.
Built C files in :
/tmp/ltsmin1559742501901192489
[2024-05-27 06:43:29] [INFO ] Computing symmetric may disable matrix : 45 transitions.
[2024-05-27 06:43:29] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 06:43:29] [INFO ] Computing symmetric may enable matrix : 45 transitions.
[2024-05-27 06:43:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 06:43:29] [INFO ] Computing Do-Not-Accords matrix : 45 transitions.
[2024-05-27 06:43:29] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 06:43:29] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1559742501901192489
Running compilation step : cd /tmp/ltsmin1559742501901192489;'/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 150 ms.
Running link step : cd /tmp/ltsmin1559742501901192489;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1559742501901192489;'/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/stateBased10290268778887774185.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 06:43:44] [INFO ] Flatten gal took : 15 ms
[2024-05-27 06:43:44] [INFO ] Flatten gal took : 4 ms
[2024-05-27 06:43:44] [INFO ] Time to serialize gal into /tmp/LTL5995235696281912564.gal : 2 ms
[2024-05-27 06:43:44] [INFO ] Time to serialize properties into /tmp/LTL9386863122875477475.prop : 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/LTL5995235696281912564.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2249062764048602653.hoa' '-atoms' '/tmp/LTL9386863122875477475.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...317
Loading property file /tmp/LTL9386863122875477475.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2249062764048602653.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t10, t13, t25, t36, t37, t38, t39, t40, t41, t42, t43, t45, t46, t48, Intersection w...238
Computing Next relation with stutter on 1.21276e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-27 06:43:59] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:43:59] [INFO ] Flatten gal took : 5 ms
[2024-05-27 06:43:59] [INFO ] Time to serialize gal into /tmp/LTL7734246042771468195.gal : 2 ms
[2024-05-27 06:43:59] [INFO ] Time to serialize properties into /tmp/LTL9865860410808371378.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/LTL7734246042771468195.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9865860410808371378.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(("((p12<1)||(l0<1))")||((G("((s1>=1)&&(l364>=1))"))&&(F(G("((p17>=1)&&(l285>=1))"))))))))
Formula 0 simplified : G(F(!"((s1>=1)&&(l364>=1))" | GF!"((p17>=1)&&(l285>=1))") & FG!"((p12<1)||(l0<1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t10, t13, t25, t36, t37, t38, t39, t40, t41, t42, t43, t45, t46, t48, Intersection w...238
Computing Next relation with stutter on 1.21276e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-27 06:44:14] [INFO ] Flatten gal took : 5 ms
[2024-05-27 06:44:14] [INFO ] Applying decomposition
[2024-05-27 06:44:14] [INFO ] Flatten gal took : 3 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/graph9485262563844496244.txt' '-o' '/tmp/graph9485262563844496244.bin' '-w' '/tmp/graph9485262563844496244.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9485262563844496244.bin' '-l' '-1' '-v' '-w' '/tmp/graph9485262563844496244.weights' '-q' '0' '-e' '0.001'
[2024-05-27 06:44:14] [INFO ] Decomposing Gal with order
[2024-05-27 06:44:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 06:44:14] [INFO ] Removed a total of 35 redundant transitions.
[2024-05-27 06:44:14] [INFO ] Flatten gal took : 39 ms
[2024-05-27 06:44:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 3 ms.
[2024-05-27 06:44:14] [INFO ] Time to serialize gal into /tmp/LTL5508876580341956513.gal : 2 ms
[2024-05-27 06:44:14] [INFO ] Time to serialize properties into /tmp/LTL18418863153819444622.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/LTL5508876580341956513.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18418863153819444622.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i4.u6.p12<1)||(u0.l0<1))")||((G("((u0.s1>=1)&&(u9.l364>=1))"))&&(F(G("((u9.p17>=1)&&(u8.l285>=1))"))))))))
Formula 0 simplified : G(F(!"((u0.s1>=1)&&(u9.l364>=1))" | GF!"((u9.p17>=1)&&(u8.l285>=1))") & FG!"((i4.u6.p12<1)||(u0.l0<1))")
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-14 finished in 82153 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((F(p0)&&(p0 U !p1))))))'
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 44 transition count 48
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 44 transition count 48
Applied a total of 7 rules in 5 ms. Remains 44 /48 variables (removed 4) and now considering 48/51 (removed 3) transitions.
// Phase 1: matrix 48 rows 44 cols
[2024-05-27 06:44:29] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 06:44:29] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-27 06:44:29] [INFO ] Invariant cache hit.
[2024-05-27 06:44:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-27 06:44:29] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 47 sub problems to find dead transitions.
[2024-05-27 06:44:29] [INFO ] Invariant cache hit.
[2024-05-27 06:44:29] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 48/92 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 22/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/92 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 68 constraints, problems are : Problem set: 0 solved, 47 unsolved in 514 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 48/92 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 22/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 47/115 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/92 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 115 constraints, problems are : Problem set: 0 solved, 47 unsolved in 794 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 1327ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1328ms
Starting structural reductions in LTL mode, iteration 1 : 44/48 places, 48/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1437 ms. Remains : 44/48 places, 48/51 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true, (NOT p0), p1]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-15 finished in 1690 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(p1)&&F(G(p2)))||p0))))'
[2024-05-27 06:44:31] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1714208389041877667
[2024-05-27 06:44:31] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2024-05-27 06:44:31] [INFO ] Applying decomposition
[2024-05-27 06:44:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 06:44:31] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2024-05-27 06:44:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 06:44:31] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:44:31] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2024-05-27 06:44:31] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 06:44:31] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1714208389041877667
Running compilation step : cd /tmp/ltsmin1714208389041877667;'/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/graph2901271432355236453.txt' '-o' '/tmp/graph2901271432355236453.bin' '-w' '/tmp/graph2901271432355236453.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2901271432355236453.bin' '-l' '-1' '-v' '-w' '/tmp/graph2901271432355236453.weights' '-q' '0' '-e' '0.001'
[2024-05-27 06:44:31] [INFO ] Decomposing Gal with order
[2024-05-27 06:44:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 06:44:31] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-27 06:44:31] [INFO ] Flatten gal took : 6 ms
[2024-05-27 06:44:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 2 ms.
[2024-05-27 06:44:31] [INFO ] Time to serialize gal into /tmp/LTLFireability4596918308648950397.gal : 2 ms
[2024-05-27 06:44:31] [INFO ] Time to serialize properties into /tmp/LTLFireability14949979848914804639.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/LTLFireability4596918308648950397.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14949979848914804639.ltl' '-c' '-stutter-deadlock'

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...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i0.u6.p12<1)||(i0.u0.l0<1))")||((G("((i0.u0.s1>=1)&&(i5.u11.l364>=1))"))&&(F(G("((i5.u11.p17>=1)&&(i5.u10.l285>=1))")))))))...156
Formula 0 simplified : G(F(!"((i0.u0.s1>=1)&&(i5.u11.l364>=1))" | GF!"((i5.u11.p17>=1)&&(i5.u10.l285>=1))") & FG!"((i0.u6.p12<1)||(i0.u0.l0<1))")
Compilation finished in 161 ms.
Running link step : cd /tmp/ltsmin1714208389041877667;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin1714208389041877667;'/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' '[](<>((([]((LTLAPp1==true))&&<>([]((LTLAPp2==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: LTL layer: formula: [](<>((([]((LTLAPp1==true))&&<>([]((LTLAPp2==true))))||(LTLAPp0==true))))
pins2lts-mc-linux64( 1/ 8), 0.005: "[](<>((([]((LTLAPp1==true))&&<>([]((LTLAPp2==true))))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Initializing POR dependencies: labels 54, guards 51
pins2lts-mc-linux64( 4/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.033: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.033: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.045: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.050: There are 55 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.050: State length is 49, there are 64 groups
pins2lts-mc-linux64( 0/ 8), 0.050: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.050: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.050: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.050: Visible groups: 0 / 64, labels: 3 / 55
pins2lts-mc-linux64( 0/ 8), 0.050: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.050: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.064: [Blue] ~44 levels ~960 states ~1664 transitions
pins2lts-mc-linux64( 5/ 8), 0.069: [Blue] ~51 levels ~1920 states ~3504 transitions
pins2lts-mc-linux64( 5/ 8), 0.075: [Blue] ~89 levels ~3840 states ~7336 transitions
pins2lts-mc-linux64( 5/ 8), 0.107: [Blue] ~176 levels ~7680 states ~16432 transitions
pins2lts-mc-linux64( 5/ 8), 0.158: [Blue] ~198 levels ~15360 states ~34472 transitions
pins2lts-mc-linux64( 6/ 8), 0.244: [Blue] ~202 levels ~30720 states ~60256 transitions
pins2lts-mc-linux64( 6/ 8), 0.443: [Blue] ~222 levels ~61440 states ~117768 transitions
pins2lts-mc-linux64( 6/ 8), 0.764: [Blue] ~242 levels ~122880 states ~232832 transitions
pins2lts-mc-linux64( 6/ 8), 1.339: [Blue] ~267 levels ~245760 states ~464304 transitions
pins2lts-mc-linux64( 6/ 8), 2.201: [Blue] ~297 levels ~491520 states ~928936 transitions
pins2lts-mc-linux64( 6/ 8), 3.452: [Blue] ~337 levels ~983040 states ~1861392 transitions
pins2lts-mc-linux64( 6/ 8), 5.393: [Blue] ~387 levels ~1966080 states ~3731856 transitions
pins2lts-mc-linux64( 6/ 8), 10.368: [Blue] ~30969 levels ~3932160 states ~9160840 transitions
pins2lts-mc-linux64( 5/ 8), 18.608: [Blue] ~9196 levels ~7864320 states ~18505096 transitions
pins2lts-mc-linux64( 5/ 8), 35.184: [Blue] ~13587 levels ~15728640 states ~36732952 transitions
pins2lts-mc-linux64( 5/ 8), 68.392: [Blue] ~22380 levels ~31457280 states ~73141720 transitions
pins2lts-mc-linux64( 5/ 8), 137.318: [Blue] ~31911 levels ~62914560 states ~145931376 transitions
pins2lts-mc-linux64( 5/ 8), 273.325: [Blue] ~49036 levels ~125829120 states ~292101088 transitions
pins2lts-mc-linux64( 4/ 8), 453.654: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 453.710:
pins2lts-mc-linux64( 0/ 8), 453.710: Explored 161227898 states 471292629 transitions, fanout: 2.923
pins2lts-mc-linux64( 0/ 8), 453.711: Total exploration time 453.640 sec (453.580 sec minimum, 453.604 sec on average)
pins2lts-mc-linux64( 0/ 8), 453.711: States per second: 355409, Transitions per second: 1038913
pins2lts-mc-linux64( 0/ 8), 453.711:
pins2lts-mc-linux64( 0/ 8), 453.711: State space has 134217348 states, 1290778 are accepting
pins2lts-mc-linux64( 0/ 8), 453.711: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 453.711: blue states: 161227898 (120.12%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 453.711: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 453.711: all-red states: 1290778 (0.96%), bogus 728 (0.00%)
pins2lts-mc-linux64( 0/ 8), 453.711:
pins2lts-mc-linux64( 0/ 8), 453.711: Total memory used for local state coloring: 8.9MB
pins2lts-mc-linux64( 0/ 8), 453.711:
pins2lts-mc-linux64( 0/ 8), 453.711: Queue width: 8B, total height: 585113, memory: 4.46MB
pins2lts-mc-linux64( 0/ 8), 453.711: Tree memory: 1060.9MB, 8.3 B/state, compr.: 4.2%
pins2lts-mc-linux64( 0/ 8), 453.711: Tree fill ratio (roots/leafs): 99.0%/14.0%
pins2lts-mc-linux64( 0/ 8), 453.711: Stored 51 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 453.711: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 453.711: Est. total memory use: 1065.4MB (~1028.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1714208389041877667;'/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' '[](<>((([]((LTLAPp1==true))&&<>([]((LTLAPp2==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1714208389041877667;'/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' '[](<>((([]((LTLAPp1==true))&&<>([]((LTLAPp2==true))))||(LTLAPp0==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 07:05:07] [INFO ] Flatten gal took : 3 ms
[2024-05-27 07:05:07] [INFO ] Time to serialize gal into /tmp/LTLFireability7111799319147485440.gal : 5 ms
[2024-05-27 07:05:07] [INFO ] Time to serialize properties into /tmp/LTLFireability10899531102730380510.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/LTLFireability7111799319147485440.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10899531102730380510.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(("((p12<1)||(l0<1))")||((G("((s1>=1)&&(l364>=1))"))&&(F(G("((p17>=1)&&(l285>=1))"))))))))
Formula 0 simplified : G(F(!"((s1>=1)&&(l364>=1))" | GF!"((p17>=1)&&(l285>=1))") & FG!"((p12<1)||(l0<1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t7, t8, t9, t10, t13, t20, t21, t22, t29, t36, t37, t38, t39, t40, t42, t43, t45, t46...265
Computing Next relation with stutter on 2.01175e+08 deadlock states
400 unique states visited
0 strongly connected components in search stack
798 transitions explored
400 items max in DFS search stack
9594 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,95.9536,1343400,1,0,911,6.02834e+06,142,1248,1974,7.84576e+06,4110
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 1446123 ms.

BK_STOP 1716793611428

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is RingSingleMessageInMbox-PT-d0m080, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r334-tall-171679079500044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d0m080.tgz
mv RingSingleMessageInMbox-PT-d0m080 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;