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.r092-tall-171624189300468.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 DBSingleClientW-PT-d0m08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189300468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 119K May 18 16:42 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 DBSingleClientW-PT-d0m08-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716318057217

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 19:00:58] [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-21 19:00:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:00:58] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-21 19:00:58] [INFO ] Transformed 553 places.
[2024-05-21 19:00:58] [INFO ] Transformed 150 transitions.
[2024-05-21 19:00:58] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 164 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 6 formulas.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 33 place count 87 transition count 115
Iterating global reduction 1 with 15 rules applied. Total rules applied 48 place count 87 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 87 transition count 112
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 82 transition count 107
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 82 transition count 107
Applied a total of 61 rules in 29 ms. Remains 82 /109 variables (removed 27) and now considering 107/150 (removed 43) transitions.
// Phase 1: matrix 107 rows 82 cols
[2024-05-21 19:00:58] [INFO ] Computed 2 invariants in 6 ms
[2024-05-21 19:00:59] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-21 19:00:59] [INFO ] Invariant cache hit.
[2024-05-21 19:00:59] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-21 19:00:59] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-05-21 19:00:59] [INFO ] Invariant cache hit.
[2024-05-21 19:00:59] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/189 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 39/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 123 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2258 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/189 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 39/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 106/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 229 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3987 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 6469ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 6480ms
Starting structural reductions in LTL mode, iteration 1 : 82/109 places, 107/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6899 ms. Remains : 82/109 places, 107/150 transitions.
Support contains 31 out of 82 places after structural reductions.
[2024-05-21 19:01:05] [INFO ] Flatten gal took : 36 ms
[2024-05-21 19:01:05] [INFO ] Flatten gal took : 13 ms
[2024-05-21 19:01:05] [INFO ] Input system was already deterministic with 107 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (9182 resets) in 2414 ms. (16 steps per ms) remains 10/24 properties
BEST_FIRST walk for 40003 steps (1933 resets) in 502 ms. (79 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1991 resets) in 366 ms. (109 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1980 resets) in 154 ms. (258 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (4033 resets) in 165 ms. (240 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1944 resets) in 145 ms. (273 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (3972 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1975 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1241 resets) in 136 ms. (291 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (4147 resets) in 120 ms. (330 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1983 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
[2024-05-21 19:01:07] [INFO ] Invariant cache hit.
[2024-05-21 19:01:07] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/46 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 20/66 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 99/165 variables, 66/68 constraints. Problems are: Problem set: 2 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 31/99 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/99 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 8 (OVERLAPS) 24/189 variables, 16/115 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 8/123 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/123 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/189 variables, 0/123 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 123 constraints, problems are : Problem set: 3 solved, 7 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 28/39 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 23/62 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 87/149 variables, 62/64 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 19/83 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/83 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 40/189 variables, 20/103 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 20/123 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 7/130 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 0/130 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/189 variables, 0/130 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 130 constraints, problems are : Problem set: 3 solved, 7 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 7/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 805ms problems are : Problem set: 3 solved, 7 unsolved
Parikh walk visited 0 properties in 718 ms.
Support contains 11 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 107/107 transitions.
Graph (complete) has 244 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 106
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 75 transition count 96
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 75 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 74 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 74 transition count 95
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 73 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 73 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 73 transition count 92
Applied a total of 19 rules in 24 ms. Remains 73 /82 variables (removed 9) and now considering 92/107 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 73/82 places, 92/107 transitions.
RANDOM walk for 40000 steps (9143 resets) in 168 ms. (236 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1959 resets) in 51 ms. (769 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (2005 resets) in 51 ms. (769 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (3976 resets) in 65 ms. (606 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (2012 resets) in 48 ms. (816 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (4103 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (4126 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1989 resets) in 41 ms. (952 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 8776 steps, run visited all 7 properties in 57 ms. (steps per millisecond=153 )
Probabilistic random walk after 8776 steps, saw 3879 distinct states, run finished after 61 ms. (steps per millisecond=143 ) properties seen :7
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 13 stable transitions
Graph (complete) has 270 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-07 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(F(p0))&&(((!p0 U (p1||G(!p0))) U p2) U p3)))'
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 107/107 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 73 transition count 94
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 73 transition count 94
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 68 transition count 87
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 65 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 63 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 63 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 63 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 62 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 62 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 61 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 61 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 48 place count 61 transition count 72
Applied a total of 48 rules in 11 ms. Remains 61 /82 variables (removed 21) and now considering 72/107 (removed 35) transitions.
// Phase 1: matrix 72 rows 61 cols
[2024-05-21 19:01:09] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:01:09] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 19:01:09] [INFO ] Invariant cache hit.
[2024-05-21 19:01:09] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 19:01:09] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 71 sub problems to find dead transitions.
[2024-05-21 19:01:09] [INFO ] Invariant cache hit.
[2024-05-21 19:01:09] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/133 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 25/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/133 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 88 constraints, problems are : Problem set: 0 solved, 71 unsolved in 971 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/133 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 25/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 71/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 159 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1728 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 2752ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2757ms
Starting structural reductions in LTL mode, iteration 1 : 61/82 places, 72/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2884 ms. Remains : 61/82 places, 72/107 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p3) (NOT p0)), true, (NOT p0), (AND (NOT p1) p0), (NOT p2), (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-00
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-00 finished in 3268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p1))))'
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 107/107 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 88
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 67 transition count 82
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 67 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 67 transition count 80
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 64 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 63 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 63 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 63 transition count 72
Applied a total of 43 rules in 16 ms. Remains 63 /82 variables (removed 19) and now considering 72/107 (removed 35) transitions.
// Phase 1: matrix 72 rows 63 cols
[2024-05-21 19:01:12] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:01:12] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 19:01:12] [INFO ] Invariant cache hit.
[2024-05-21 19:01:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 19:01:12] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 71 sub problems to find dead transitions.
[2024-05-21 19:01:12] [INFO ] Invariant cache hit.
[2024-05-21 19:01:12] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/135 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 87 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/135 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 71/158 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 158 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1596 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 2664ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2665ms
Starting structural reductions in LTL mode, iteration 1 : 63/82 places, 72/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2810 ms. Remains : 63/82 places, 72/107 transitions.
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-01 finished in 3102 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((X(p0)||G((G(p1)&&(!p0 U G(p2))))))))'
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 107/107 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 91
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 91
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 69 transition count 88
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 69 transition count 88
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 67 transition count 85
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 67 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 66 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 66 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 65 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 64 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 64 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 64 transition count 78
Applied a total of 39 rules in 27 ms. Remains 64 /82 variables (removed 18) and now considering 78/107 (removed 29) transitions.
// Phase 1: matrix 78 rows 64 cols
[2024-05-21 19:01:15] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:01:15] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 19:01:15] [INFO ] Invariant cache hit.
[2024-05-21 19:01:16] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 19:01:16] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-21 19:01:16] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-21 19:01:16] [INFO ] Invariant cache hit.
[2024-05-21 19:01:16] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 24/90 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-21 19:01:17] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 6 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/142 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 91 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1971 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 78/142 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 24/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 77/168 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 168 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2170 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 1/1 constraints]
After SMT, in 4189ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 4191ms
Starting structural reductions in SI_LTL mode, iteration 1 : 64/82 places, 78/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4340 ms. Remains : 64/82 places, 78/107 transitions.
Stuttering acceptance computed with spot in 132 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 p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-02
Product exploration explored 100000 steps with 23023 reset in 206 ms.
Product exploration explored 100000 steps with 22859 reset in 149 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 209 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 289 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 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 p1)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (9175 resets) in 384 ms. (103 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (4017 resets) in 114 ms. (347 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40001 steps (2046 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1980 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (2015 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (2052 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
[2024-05-21 19:01:21] [INFO ] Invariant cache hit.
[2024-05-21 19:01:21] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 22/27 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 20/47 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 64/111 variables, 47/49 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 10/59 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 29/140 variables, 16/75 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 13/88 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/142 variables, 1/89 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/142 variables, 1/90 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/142 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/142 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 90 constraints, problems are : Problem set: 1 solved, 3 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/27 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/47 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 64/111 variables, 47/49 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 10/59 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 29/140 variables, 16/75 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 13/88 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 3/91 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/142 variables, 1/92 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/142 variables, 1/93 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/142 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/142 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 93 constraints, problems are : Problem set: 1 solved, 3 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 248ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 163 ms.
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 78/78 transitions.
Graph (complete) has 191 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 77
Applied a total of 2 rules in 7 ms. Remains 63 /64 variables (removed 1) and now considering 77/78 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 63/64 places, 77/78 transitions.
RANDOM walk for 40000 steps (9181 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (2006 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (2039 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1927 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 17222 steps, run visited all 3 properties in 69 ms. (steps per millisecond=249 )
Probabilistic random walk after 17222 steps, saw 7724 distinct states, run finished after 70 ms. (steps per millisecond=246 ) properties seen :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (OR (NOT p2) p0))]
False Knowledge obtained : [(F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p0 p1))), (F p1)]
Knowledge based reduction with 16 factoid took 322 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 64 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 : 64/64 places, 78/78 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-21 19:01:22] [INFO ] Invariant cache hit.
[2024-05-21 19:01:22] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 19:01:22] [INFO ] Invariant cache hit.
[2024-05-21 19:01:22] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 19:01:22] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-21 19:01:22] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-21 19:01:22] [INFO ] Invariant cache hit.
[2024-05-21 19:01:22] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 24/90 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-21 19:01:23] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/142 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 91 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 78/142 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 24/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 77/168 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 168 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 1/1 constraints]
After SMT, in 4230ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 4231ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4346 ms. Remains : 64/64 places, 78/78 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 209 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9201 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
BEST_FIRST walk for 18836 steps (984 resets) in 17 ms. (1046 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 84 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 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22845 reset in 158 ms.
Product exploration explored 100000 steps with 23021 reset in 132 ms.
Built C files in :
/tmp/ltsmin4866156556989791134
[2024-05-21 19:01:27] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2024-05-21 19:01:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:01:27] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2024-05-21 19:01:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:01:27] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2024-05-21 19:01:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:01:27] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4866156556989791134
Running compilation step : cd /tmp/ltsmin4866156556989791134;'/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 303 ms.
Running link step : cd /tmp/ltsmin4866156556989791134;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4866156556989791134;'/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/stateBased1801443717427822849.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 78/78 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 62 transition count 74
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 62 transition count 74
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 60 transition count 70
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 59 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 58 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 58 transition count 64
Applied a total of 16 rules in 10 ms. Remains 58 /64 variables (removed 6) and now considering 64/78 (removed 14) transitions.
// Phase 1: matrix 64 rows 58 cols
[2024-05-21 19:01:42] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:01:42] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 19:01:42] [INFO ] Invariant cache hit.
[2024-05-21 19:01:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:01:42] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-21 19:01:43] [INFO ] Redundant transitions in 0 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-21 19:01:43] [INFO ] Invariant cache hit.
[2024-05-21 19:01:43] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 80 constraints, problems are : Problem set: 0 solved, 63 unsolved in 817 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 63/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 143 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1567 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 2419ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2420ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/64 places, 64/78 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2591 ms. Remains : 58/64 places, 64/78 transitions.
Built C files in :
/tmp/ltsmin9496249150297883311
[2024-05-21 19:01:45] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-21 19:01:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:01:45] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-21 19:01:45] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:01:45] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-21 19:01:45] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:01:45] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9496249150297883311
Running compilation step : cd /tmp/ltsmin9496249150297883311;'/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 164 ms.
Running link step : cd /tmp/ltsmin9496249150297883311;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9496249150297883311;'/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/stateBased13164477149470861598.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 19:02:00] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:02:00] [INFO ] Flatten gal took : 13 ms
[2024-05-21 19:02:00] [INFO ] Time to serialize gal into /tmp/LTL9784098080050794763.gal : 7 ms
[2024-05-21 19:02:00] [INFO ] Time to serialize properties into /tmp/LTL6850427195820894345.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/LTL9784098080050794763.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7691278387115182199.hoa' '-atoms' '/tmp/LTL6850427195820894345.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/LTL6850427195820894345.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7691278387115182199.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t30, t65, t77, t78, t79, t80, t82, t83, t84, t85, t86, t87, t88, t89, t9...290
Computing Next relation with stutter on 1.52391e+06 deadlock states
10 unique states visited
0 strongly connected components in search stack
18 transitions explored
10 items max in DFS search stack
434 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,4.36594,138356,1,0,168,479282,158,90,2081,589371,270
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-02 finished in 49591 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)&&(X(!p1) U !p2)))'
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 107/107 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 89
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 67 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 67 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 67 transition count 80
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 64 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 63 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 63 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 63 transition count 73
Applied a total of 42 rules in 9 ms. Remains 63 /82 variables (removed 19) and now considering 73/107 (removed 34) transitions.
// Phase 1: matrix 73 rows 63 cols
[2024-05-21 19:02:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:02:05] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 19:02:05] [INFO ] Invariant cache hit.
[2024-05-21 19:02:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 19:02:05] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-21 19:02:05] [INFO ] Invariant cache hit.
[2024-05-21 19:02:05] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 87 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 72/159 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 159 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1796 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 2874ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2876ms
Starting structural reductions in LTL mode, iteration 1 : 63/82 places, 73/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3041 ms. Remains : 63/82 places, 73/107 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) p2), (NOT p0), (OR p2 p1), true]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-05
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-05 finished in 3189 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(G((!p0&&(F(p1) U p2)))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 107/107 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 92
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 92
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 66 transition count 85
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 66 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 66 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 64 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 64 transition count 79
Applied a total of 39 rules in 9 ms. Remains 64 /82 variables (removed 18) and now considering 79/107 (removed 28) transitions.
// Phase 1: matrix 79 rows 64 cols
[2024-05-21 19:02:08] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:02:08] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-21 19:02:08] [INFO ] Invariant cache hit.
[2024-05-21 19:02:08] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-21 19:02:08] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-21 19:02:08] [INFO ] Invariant cache hit.
[2024-05-21 19:02:08] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/143 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 27/93 constraints. Problems are: Problem set: 0 solved, 78 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/143 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 93 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1043 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/143 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 27/93 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 78/171 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/143 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 171 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1901 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 2992ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 2992ms
Starting structural reductions in LTL mode, iteration 1 : 64/82 places, 79/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3120 ms. Remains : 64/82 places, 79/107 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), true, (NOT p1), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-11
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-11 finished in 3315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(p1)))))'
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 107/107 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 90
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 90
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 67 transition count 84
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 65 transition count 82
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 65 transition count 82
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 63 transition count 79
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 63 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 63 transition count 77
Applied a total of 40 rules in 10 ms. Remains 63 /82 variables (removed 19) and now considering 77/107 (removed 30) transitions.
// Phase 1: matrix 77 rows 63 cols
[2024-05-21 19:02:11] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:02:12] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 19:02:12] [INFO ] Invariant cache hit.
[2024-05-21 19:02:12] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 19:02:12] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-21 19:02:12] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-21 19:02:12] [INFO ] Invariant cache hit.
[2024-05-21 19:02:12] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 90 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1084 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 76/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 166 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1863 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 2991ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 2992ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/82 places, 77/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3136 ms. Remains : 63/82 places, 77/107 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-12
Product exploration explored 100000 steps with 22849 reset in 82 ms.
Product exploration explored 100000 steps with 22990 reset in 90 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 206 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
RANDOM walk for 40000 steps (9174 resets) in 53 ms. (740 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (1985 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
[2024-05-21 19:02:15] [INFO ] Invariant cache hit.
[2024-05-21 19:02:15] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/107 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 31/138 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/140 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 90 constraints, problems are : Problem set: 0 solved, 1 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/107 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 31/138 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/140 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 159ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 77/77 transitions.
Graph (complete) has 188 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 61 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 61 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 60 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 59 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 59 transition count 69
Applied a total of 11 rules in 8 ms. Remains 59 /63 variables (removed 4) and now considering 69/77 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 59/63 places, 69/77 transitions.
RANDOM walk for 40000 steps (9153 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (2032 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4280 steps, run visited all 1 properties in 7 ms. (steps per millisecond=611 )
Probabilistic random walk after 4280 steps, saw 1938 distinct states, run finished after 7 ms. (steps per millisecond=611 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 141 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 77/77 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-21 19:02:16] [INFO ] Invariant cache hit.
[2024-05-21 19:02:16] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 19:02:16] [INFO ] Invariant cache hit.
[2024-05-21 19:02:16] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 19:02:16] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-21 19:02:16] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-21 19:02:16] [INFO ] Invariant cache hit.
[2024-05-21 19:02:16] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 90 constraints, problems are : Problem set: 0 solved, 76 unsolved in 999 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 76/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 166 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1840 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 2883ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 2883ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2998 ms. Remains : 63/63 places, 77/77 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 206 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
RANDOM walk for 40000 steps (9124 resets) in 54 ms. (727 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (1966 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
[2024-05-21 19:02:19] [INFO ] Invariant cache hit.
[2024-05-21 19:02:19] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/107 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 31/138 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/140 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 90 constraints, problems are : Problem set: 0 solved, 1 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/107 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 31/138 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/140 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 149ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 77/77 transitions.
Graph (complete) has 188 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 61 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 61 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 60 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 59 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 59 transition count 69
Applied a total of 11 rules in 7 ms. Remains 59 /63 variables (removed 4) and now considering 69/77 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 59/63 places, 69/77 transitions.
RANDOM walk for 40000 steps (9249 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (2029 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4280 steps, run visited all 1 properties in 8 ms. (steps per millisecond=535 )
Probabilistic random walk after 4280 steps, saw 1938 distinct states, run finished after 8 ms. (steps per millisecond=535 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Product exploration explored 100000 steps with 22865 reset in 89 ms.
Product exploration explored 100000 steps with 22926 reset in 91 ms.
Built C files in :
/tmp/ltsmin13138982358871887813
[2024-05-21 19:02:20] [INFO ] Computing symmetric may disable matrix : 77 transitions.
[2024-05-21 19:02:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:02:20] [INFO ] Computing symmetric may enable matrix : 77 transitions.
[2024-05-21 19:02:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:02:20] [INFO ] Computing Do-Not-Accords matrix : 77 transitions.
[2024-05-21 19:02:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:02:20] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13138982358871887813
Running compilation step : cd /tmp/ltsmin13138982358871887813;'/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 207 ms.
Running link step : cd /tmp/ltsmin13138982358871887813;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13138982358871887813;'/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/stateBased18240373913724841604.hoa' '--buchi-type=spotba'
LTSmin run took 292 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-12 finished in 8852 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((X(((!p0 U (p1||G(!p0))) U ((!p2&&(!p0 U (p1||G(!p0))))||G((!p0 U (p1||G(!p0)))))))&&p3))))'
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 107/107 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 93
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 93
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 68 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 68 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 68 transition count 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 66 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 66 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 66 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 65 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 64 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 64 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 63 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 63 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 63 transition count 77
Applied a total of 43 rules in 5 ms. Remains 63 /82 variables (removed 19) and now considering 77/107 (removed 30) transitions.
// Phase 1: matrix 77 rows 63 cols
[2024-05-21 19:02:20] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:02:20] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 19:02:20] [INFO ] Invariant cache hit.
[2024-05-21 19:02:20] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-21 19:02:20] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-21 19:02:20] [INFO ] Invariant cache hit.
[2024-05-21 19:02:20] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 76 unsolved in 977 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 76/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 167 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2080 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 3102ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3103ms
Starting structural reductions in LTL mode, iteration 1 : 63/82 places, 77/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3229 ms. Remains : 63/82 places, 77/107 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-14
Product exploration explored 100000 steps with 22940 reset in 103 ms.
Product exploration explored 100000 steps with 22959 reset in 108 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 206 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) (NOT p2)), (X p3), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 87 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (9180 resets) in 95 ms. (416 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40002 steps (1968 resets) in 215 ms. (185 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4074 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
[2024-05-21 19:02:24] [INFO ] Invariant cache hit.
[2024-05-21 19:02:24] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 63/109 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 29/138 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/140 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 63/109 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 29/138 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/140 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/140 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 212ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 77/77 transitions.
Graph (complete) has 188 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 76
Applied a total of 2 rules in 3 ms. Remains 62 /63 variables (removed 1) and now considering 76/77 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 62/63 places, 76/77 transitions.
RANDOM walk for 40000 steps (9124 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1986 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4076 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 9592 steps, run visited all 2 properties in 22 ms. (steps per millisecond=436 )
Probabilistic random walk after 9592 steps, saw 4136 distinct states, run finished after 22 ms. (steps per millisecond=436 ) properties seen :2
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) (NOT p2)), (X p3), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT p3)), (F p2), (F (NOT (OR (NOT p0) p1 (NOT p3)))), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p1) (NOT p2))))), (F p1), (F p0)]
Knowledge based reduction with 10 factoid took 303 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 77/77 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-21 19:02:25] [INFO ] Invariant cache hit.
[2024-05-21 19:02:25] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 19:02:25] [INFO ] Invariant cache hit.
[2024-05-21 19:02:26] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-21 19:02:26] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-21 19:02:26] [INFO ] Invariant cache hit.
[2024-05-21 19:02:26] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 76/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 167 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2059 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 3131ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3132ms
Finished structural reductions in LTL mode , in 1 iterations and 3248 ms. Remains : 63/63 places, 77/77 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 206 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1) (NOT p2)), (X p3), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p3)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 109 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (9183 resets) in 102 ms. (388 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40001 steps (2019 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4066 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
[2024-05-21 19:02:29] [INFO ] Invariant cache hit.
[2024-05-21 19:02:29] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 63/109 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 29/138 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/140 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 63/109 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 29/138 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/140 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/140 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 214ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 63 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 77/77 transitions.
Graph (complete) has 188 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 61 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 61 transition count 71
Applied a total of 4 rules in 5 ms. Remains 61 /63 variables (removed 2) and now considering 71/77 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 61/63 places, 71/77 transitions.
RANDOM walk for 40000 steps (9143 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4030 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5839 steps, run visited all 1 properties in 8 ms. (steps per millisecond=729 )
Probabilistic random walk after 5839 steps, saw 2564 distinct states, run finished after 8 ms. (steps per millisecond=729 ) properties seen :1
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1) (NOT p2)), (X p3), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p3)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT p3)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p0) p1 (NOT p3)))), (F p2), (F p1), (F p0)]
Knowledge based reduction with 10 factoid took 307 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 22954 reset in 97 ms.
Product exploration explored 100000 steps with 22933 reset in 110 ms.
Built C files in :
/tmp/ltsmin8283289348817439763
[2024-05-21 19:02:31] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8283289348817439763
Running compilation step : cd /tmp/ltsmin8283289348817439763;'/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 181 ms.
Running link step : cd /tmp/ltsmin8283289348817439763;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin8283289348817439763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6630501396549994073.hoa' '--buchi-type=spotba'
LTSmin run took 55 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-14 finished in 10532 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)||X(G(p1))))'
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 107/107 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 90
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 90
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 67 transition count 84
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 65 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 64 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 64 transition count 75
Applied a total of 41 rules in 2 ms. Remains 64 /82 variables (removed 18) and now considering 75/107 (removed 32) transitions.
// Phase 1: matrix 75 rows 64 cols
[2024-05-21 19:02:31] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:02:31] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 19:02:31] [INFO ] Invariant cache hit.
[2024-05-21 19:02:31] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 19:02:31] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-21 19:02:31] [INFO ] Invariant cache hit.
[2024-05-21 19:02:31] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/139 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 91 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1096 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/139 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 74/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 165 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1968 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 3106ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 3107ms
Starting structural reductions in LTL mode, iteration 1 : 64/82 places, 75/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3242 ms. Remains : 64/82 places, 75/107 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-15
Stuttering criterion allowed to conclude after 19 steps with 3 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-15 finished in 3365 ms.
All properties solved by simple procedures.
Total runtime 96427 ms.

BK_STOP 1716318154772

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="DBSingleClientW-PT-d0m08"
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 DBSingleClientW-PT-d0m08, 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 r092-tall-171624189300468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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