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.r356-tall-171683760800308.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 ShieldIIPt-PT-040A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760800308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 22:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 22:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 22:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 212K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-040A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716939289176

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 23:34:50] [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-28 23:34:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 23:34:50] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-05-28 23:34:50] [INFO ] Transformed 763 places.
[2024-05-28 23:34:50] [INFO ] Transformed 563 transitions.
[2024-05-28 23:34:50] [INFO ] Found NUPN structural information;
[2024-05-28 23:34:50] [INFO ] Parsed PT model containing 763 places and 563 transitions and 2406 arcs in 234 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-040A-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 64 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2024-05-28 23:34:50] [INFO ] Computed 361 invariants in 31 ms
[2024-05-28 23:34:51] [INFO ] Implicit Places using invariants in 656 ms returned []
[2024-05-28 23:34:51] [INFO ] Invariant cache hit.
[2024-05-28 23:34:52] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-28 23:34:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30042 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30020 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60319ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60338ms
Finished structural reductions in LTL mode , in 1 iterations and 61876 ms. Remains : 763/763 places, 562/562 transitions.
Support contains 57 out of 763 places after structural reductions.
[2024-05-28 23:35:52] [INFO ] Flatten gal took : 122 ms
[2024-05-28 23:35:52] [INFO ] Flatten gal took : 56 ms
[2024-05-28 23:35:53] [INFO ] Input system was already deterministic with 562 transitions.
Support contains 54 out of 763 places (down from 57) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 29 to 27
RANDOM walk for 40000 steps (8 resets) in 2284 ms. (17 steps per ms) remains 18/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 18/18 properties
[2024-05-28 23:35:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 44/82 variables, 37/75 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 44/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 681/763 variables, 324/443 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 681/1124 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/1325 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1252 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 44/82 variables, 37/75 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 44/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 681/763 variables, 324/443 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 681/1124 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 18/1905 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1325 variables, 0/1905 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 0/1325 variables, 0/1905 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 1905 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2524 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 3795ms problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 8180 ms.
Support contains 38 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Partial Free-agglomeration rule applied 76 times.
Drop transitions (Partial Free agglomeration) removed 76 transitions
Iterating global reduction 0 with 76 rules applied. Total rules applied 80 place count 761 transition count 560
Applied a total of 80 rules in 169 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 761/763 places, 560/562 transitions.
RANDOM walk for 40000 steps (8 resets) in 1136 ms. (35 steps per ms) remains 11/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 224 ms. (177 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 207 ms. (192 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 203 ms. (196 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 218 ms. (182 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 208 ms. (191 steps per ms) remains 11/11 properties
// Phase 1: matrix 560 rows 761 cols
[2024-05-28 23:36:07] [INFO ] Computed 361 invariants in 3 ms
[2024-05-28 23:36:07] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 27/51 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 27/74 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 710/761 variables, 338/412 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/761 variables, 710/1122 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/761 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 560/1321 variables, 761/1883 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1321 variables, 41/1924 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1321 variables, 0/1924 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/1321 variables, 0/1924 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1321/1321 variables, and 1924 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1042 ms.
Refiners :[Domain max(s): 761/761 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 761/761 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 27/51 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 27/74 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 710/761 variables, 338/412 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/761 variables, 710/1122 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/761 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 560/1321 variables, 761/1883 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1321 variables, 41/1924 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1321 variables, 11/1935 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1321 variables, 0/1935 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/1321 variables, 0/1935 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1321/1321 variables, and 1935 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2027 ms.
Refiners :[Domain max(s): 761/761 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 761/761 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 3089ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 10 properties in 10325 ms.
Support contains 5 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 560/560 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 76 ms. Remains 761 /761 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 761/761 places, 560/560 transitions.
RANDOM walk for 40000 steps (8 resets) in 367 ms. (108 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 92514 steps, run visited all 1 properties in 968 ms. (steps per millisecond=95 )
Probabilistic random walk after 92514 steps, saw 88973 distinct states, run finished after 975 ms. (steps per millisecond=94 ) properties seen :1
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||(p1 U p2)||F(p3)) U (G((p0||(p1 U p2)||F(p3)))||((p0||(p1 U p2)||F(p3))&&X(X(!p2))))))'
Support contains 6 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 13 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2024-05-28 23:36:22] [INFO ] Computed 361 invariants in 10 ms
[2024-05-28 23:36:22] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-28 23:36:22] [INFO ] Invariant cache hit.
[2024-05-28 23:36:23] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-28 23:36:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30016 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30035 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60213ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60219ms
Finished structural reductions in LTL mode , in 1 iterations and 61373 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 343 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), false, (AND (NOT p3) p2), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 1986 ms.
Product exploration explored 100000 steps with 50000 reset in 2014 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X p3), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X p3)), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 22 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040A-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040A-LTLFireability-00 finished in 65845 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))'
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 49 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
// Phase 1: matrix 560 rows 761 cols
[2024-05-28 23:37:28] [INFO ] Computed 361 invariants in 4 ms
[2024-05-28 23:37:28] [INFO ] Implicit Places using invariants in 382 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 384 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/763 places, 560/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 559
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 559
Applied a total of 2 rules in 27 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2024-05-28 23:37:28] [INFO ] Computed 359 invariants in 5 ms
[2024-05-28 23:37:29] [INFO ] Implicit Places using invariants in 381 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 384 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/763 places, 559/562 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 756 transition count 558
Applied a total of 2 rules in 35 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2024-05-28 23:37:29] [INFO ] Computed 358 invariants in 4 ms
[2024-05-28 23:37:29] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-28 23:37:29] [INFO ] Invariant cache hit.
[2024-05-28 23:37:30] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 756/763 places, 558/562 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1928 ms. Remains : 756/763 places, 558/562 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-01
Product exploration explored 100000 steps with 12 reset in 661 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 1 ms.
FORMULA ShieldIIPt-PT-040A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLFireability-01 finished in 2640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p0 U (p1||G(p0)))))))'
Support contains 1 out of 763 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 : 763/763 places, 562/562 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 762 transition count 560
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 760 transition count 560
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 758 transition count 559
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 758 transition count 558
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 757 transition count 558
Applied a total of 8 rules in 50 ms. Remains 757 /763 variables (removed 6) and now considering 558/562 (removed 4) transitions.
// Phase 1: matrix 558 rows 757 cols
[2024-05-28 23:37:30] [INFO ] Computed 359 invariants in 2 ms
[2024-05-28 23:37:31] [INFO ] Implicit Places using invariants in 379 ms returned [746]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 382 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 756/763 places, 558/562 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 755 transition count 557
Applied a total of 2 rules in 27 ms. Remains 755 /756 variables (removed 1) and now considering 557/558 (removed 1) transitions.
// Phase 1: matrix 557 rows 755 cols
[2024-05-28 23:37:31] [INFO ] Computed 358 invariants in 6 ms
[2024-05-28 23:37:31] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-28 23:37:31] [INFO ] Invariant cache hit.
[2024-05-28 23:37:32] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 755/763 places, 557/562 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1488 ms. Remains : 755/763 places, 557/562 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 664 ms.
Stack based approach found an accepted trace after 3929 steps with 0 reset with depth 3930 and stack size 3365 in 34 ms.
FORMULA ShieldIIPt-PT-040A-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLFireability-02 finished in 2252 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(X((p0 U (!X(p1) U p2)))))'
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 13 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2024-05-28 23:37:33] [INFO ] Computed 361 invariants in 3 ms
[2024-05-28 23:37:33] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-28 23:37:33] [INFO ] Invariant cache hit.
[2024-05-28 23:37:34] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-28 23:37:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30029 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30030 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Finished structural reductions in LTL mode , in 1 iterations and 61330 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p2), (NOT p2), (OR (NOT p2) p1), (NOT p2), true]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 661 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA ShieldIIPt-PT-040A-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLFireability-03 finished in 62224 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)&&X(F(p1)))))'
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 14 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-28 23:38:35] [INFO ] Invariant cache hit.
[2024-05-28 23:38:35] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-28 23:38:35] [INFO ] Invariant cache hit.
[2024-05-28 23:38:36] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-28 23:38:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30022 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30021 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Finished structural reductions in LTL mode , in 1 iterations and 61284 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040A-LTLFireability-04 finished in 61518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&F(p1))))'
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 15 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-28 23:39:36] [INFO ] Invariant cache hit.
[2024-05-28 23:39:37] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-28 23:39:37] [INFO ] Invariant cache hit.
[2024-05-28 23:39:38] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-28 23:39:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30021 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30018 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Finished structural reductions in LTL mode , in 1 iterations and 61275 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040A-LTLFireability-05 finished in 61483 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 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 15 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-28 23:40:38] [INFO ] Invariant cache hit.
[2024-05-28 23:40:38] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-28 23:40:38] [INFO ] Invariant cache hit.
[2024-05-28 23:40:39] [INFO ] Implicit Places using invariants and state equation in 724 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-28 23:40:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 1.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 1.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 1.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 1.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 1.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 1.0)
(s352 1.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 1.0)
(s371 1.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 1.0)
(s390 1.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 1.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 1.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 1.0)
(s428 1.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 1.0)
(s447 1.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 1.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 1.0)
(s466 1.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 1.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 1.0)
(s475 0.0)
(s476 1.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 1.0)
(s485 1.0)
(s486 0.0)
(s487 1.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 1.0)
(s496 0.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 1.0)
(s504 1.0)
(s505 0.0)
(s506 1.0)
(s507 0.0)
(s508 1.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 1.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 1.0)
(s521 0.0)
(s522 1.0)
(s523 1.0)
(s524 0.0)
(s525 1.0)
(s526 timeout
0.0)
(s527 1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30017 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30020 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Finished structural reductions in LTL mode , in 1 iterations and 61312 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 684 ms.
Stack based approach found an accepted trace after 16715 steps with 0 reset with depth 16716 and stack size 13386 in 152 ms.
FORMULA ShieldIIPt-PT-040A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLFireability-08 finished in 62309 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(F(p0))||G((p1 U p2)))))'
Support contains 7 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 12 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-28 23:41:40] [INFO ] Invariant cache hit.
[2024-05-28 23:41:41] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-28 23:41:41] [INFO ] Invariant cache hit.
[2024-05-28 23:41:41] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 1147 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-28 23:41:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30021 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30027 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60171ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Finished structural reductions in LTL mode , in 1 iterations and 61342 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 677 ms.
Product exploration explored 100000 steps with 0 reset in 927 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (OR p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 206 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 393 ms. (101 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8025 steps, run visited all 1 properties in 81 ms. (steps per millisecond=99 )
Probabilistic random walk after 8025 steps, saw 7782 distinct states, run finished after 82 ms. (steps per millisecond=97 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (OR p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 15 factoid took 178 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 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 763 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 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 50 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
// Phase 1: matrix 560 rows 761 cols
[2024-05-28 23:42:44] [INFO ] Computed 361 invariants in 6 ms
[2024-05-28 23:42:45] [INFO ] Implicit Places using invariants in 382 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 384 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/763 places, 560/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 559
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 559
Applied a total of 2 rules in 18 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2024-05-28 23:42:45] [INFO ] Computed 359 invariants in 4 ms
[2024-05-28 23:42:45] [INFO ] Implicit Places using invariants in 397 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 399 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/763 places, 559/562 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 756 transition count 558
Applied a total of 2 rules in 42 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2024-05-28 23:42:45] [INFO ] Computed 358 invariants in 4 ms
[2024-05-28 23:42:46] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-28 23:42:46] [INFO ] Invariant cache hit.
[2024-05-28 23:42:46] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 756/763 places, 558/562 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1960 ms. Remains : 756/763 places, 558/562 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 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 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 297 ms. (134 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7693 steps, run visited all 1 properties in 69 ms. (steps per millisecond=111 )
Probabilistic random walk after 7693 steps, saw 7439 distinct states, run finished after 69 ms. (steps per millisecond=111 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 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 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 646 ms.
Product exploration explored 100000 steps with 0 reset in 882 ms.
Built C files in :
/tmp/ltsmin287354765526507148
[2024-05-28 23:42:49] [INFO ] Computing symmetric may disable matrix : 558 transitions.
[2024-05-28 23:42:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:42:49] [INFO ] Computing symmetric may enable matrix : 558 transitions.
[2024-05-28 23:42:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:42:49] [INFO ] Computing Do-Not-Accords matrix : 558 transitions.
[2024-05-28 23:42:49] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:42:49] [INFO ] Built C files in 101ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin287354765526507148
Running compilation step : cd /tmp/ltsmin287354765526507148;'/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 1762 ms.
Running link step : cd /tmp/ltsmin287354765526507148;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin287354765526507148;'/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/stateBased12282924174546289241.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 756 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 21 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2024-05-28 23:43:04] [INFO ] Invariant cache hit.
[2024-05-28 23:43:04] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-28 23:43:04] [INFO ] Invariant cache hit.
[2024-05-28 23:43:05] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 1069 ms to find 0 implicit places.
[2024-05-28 23:43:05] [INFO ] Redundant transitions in 27 ms returned []
Running 557 sub problems to find dead transitions.
[2024-05-28 23:43:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/755 variables, 755/755 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/755 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (OVERLAPS) 1/756 variables, 358/1113 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/756 variables, 1/1114 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 5 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 1870 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30016 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 557 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/755 variables, 755/755 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/755 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (OVERLAPS) 1/756 variables, 358/1113 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/756 variables, 1/1114 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 5 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1314 variables, 557/2427 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 2427 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30019 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 0/0 constraints]
After SMT, in 60142ms problems are : Problem set: 0 solved, 557 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61269 ms. Remains : 756/756 places, 558/558 transitions.
Built C files in :
/tmp/ltsmin3724234496806335646
[2024-05-28 23:44:05] [INFO ] Computing symmetric may disable matrix : 558 transitions.
[2024-05-28 23:44:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:44:05] [INFO ] Computing symmetric may enable matrix : 558 transitions.
[2024-05-28 23:44:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:44:05] [INFO ] Computing Do-Not-Accords matrix : 558 transitions.
[2024-05-28 23:44:05] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:44:05] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3724234496806335646
Running compilation step : cd /tmp/ltsmin3724234496806335646;'/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 1588 ms.
Running link step : cd /tmp/ltsmin3724234496806335646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin3724234496806335646;'/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/stateBased2888257670057212319.hoa' '--buchi-type=spotba'
LTSmin run took 11698 ms.
FORMULA ShieldIIPt-PT-040A-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-040A-LTLFireability-09 finished in 158311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(!p1&&X(!p0))))))'
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 8 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2024-05-28 23:44:19] [INFO ] Computed 361 invariants in 5 ms
[2024-05-28 23:44:19] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-28 23:44:19] [INFO ] Invariant cache hit.
[2024-05-28 23:44:20] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-28 23:44:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30020 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30021 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Finished structural reductions in LTL mode , in 1 iterations and 61334 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 155 ms :[p0, p0, p0]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-10
Product exploration explored 100000 steps with 87 reset in 669 ms.
Product exploration explored 100000 steps with 73 reset in 821 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 129 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[p0, p0, p0]
RANDOM walk for 40000 steps (8 resets) in 397 ms. (100 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 459 ms. (86 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 369 ms. (108 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 298 ms. (133 steps per ms) remains 3/3 properties
[2024-05-28 23:45:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 6/10 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 753/763 variables, 357/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 753/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1325 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 3 unsolved in 476 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 6/10 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 753/763 variables, 357/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 753/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 3/1890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1325 variables, 0/1890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1325 variables, 0/1890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 1890 constraints, problems are : Problem set: 0 solved, 3 unsolved in 704 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1192ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 7887 ms.
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 84 place count 761 transition count 560
Applied a total of 84 rules in 41 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 761/763 places, 560/562 transitions.
RANDOM walk for 40000 steps (8 resets) in 544 ms. (73 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 382 ms. (104 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 279 ms. (142 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 6357 steps, run visited all 3 properties in 133 ms. (steps per millisecond=47 )
Probabilistic random walk after 6357 steps, saw 6115 distinct states, run finished after 133 ms. (steps per millisecond=47 ) properties seen :3
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 355 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 143 ms :[p0, p0, p0]
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 9 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-28 23:45:33] [INFO ] Invariant cache hit.
[2024-05-28 23:45:33] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-28 23:45:33] [INFO ] Invariant cache hit.
[2024-05-28 23:45:34] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-28 23:45:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30016 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30026 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Finished structural reductions in LTL mode , in 1 iterations and 61309 ms. Remains : 763/763 places, 562/562 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 146 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[p0, p0, p0]
RANDOM walk for 40000 steps (8 resets) in 323 ms. (123 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 206 ms. (193 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 3/3 properties
[2024-05-28 23:46:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 6/10 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 753/763 variables, 357/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 753/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1325 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 3 unsolved in 455 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 6/10 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 753/763 variables, 357/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 753/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 3/1890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1325 variables, 0/1890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1325 variables, 0/1890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 1890 constraints, problems are : Problem set: 0 solved, 3 unsolved in 690 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1153ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 7191 ms.
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 84 place count 761 transition count 560
Applied a total of 84 rules in 41 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 761/763 places, 560/562 transitions.
RANDOM walk for 40000 steps (8 resets) in 465 ms. (85 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 291 ms. (136 steps per ms) remains 1/1 properties
// Phase 1: matrix 560 rows 761 cols
[2024-05-28 23:46:43] [INFO ] Computed 361 invariants in 5 ms
[2024-05-28 23:46:43] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 6/10 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 751/761 variables, 357/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/761 variables, 751/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/761 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 560/1321 variables, 761/1883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1321 variables, 43/1926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1321 variables, 0/1926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1321 variables, 0/1926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1321/1321 variables, and 1926 constraints, problems are : Problem set: 0 solved, 1 unsolved in 369 ms.
Refiners :[Domain max(s): 761/761 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 761/761 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 6/10 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 751/761 variables, 357/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/761 variables, 751/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/761 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 560/1321 variables, 761/1883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1321 variables, 43/1926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1321 variables, 1/1927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1321 variables, 0/1927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1321 variables, 0/1927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1321/1321 variables, and 1927 constraints, problems are : Problem set: 0 solved, 1 unsolved in 891 ms.
Refiners :[Domain max(s): 761/761 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 761/761 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1276ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5845 ms.
Support contains 4 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 560/560 transitions.
Applied a total of 0 rules in 14 ms. Remains 761 /761 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 761/761 places, 560/560 transitions.
RANDOM walk for 40000 steps (8 resets) in 415 ms. (96 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6357 steps, run visited all 1 properties in 69 ms. (steps per millisecond=92 )
Probabilistic random walk after 6357 steps, saw 6115 distinct states, run finished after 69 ms. (steps per millisecond=92 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 349 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 114 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 110 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 64 reset in 674 ms.
Product exploration explored 100000 steps with 73 reset in 827 ms.
Built C files in :
/tmp/ltsmin3814349817897223936
[2024-05-28 23:46:53] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3814349817897223936
Running compilation step : cd /tmp/ltsmin3814349817897223936;'/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 1216 ms.
Running link step : cd /tmp/ltsmin3814349817897223936;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3814349817897223936;'/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/stateBased5597076305521296192.hoa' '--buchi-type=spotba'
LTSmin run took 544 ms.
FORMULA ShieldIIPt-PT-040A-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-040A-LTLFireability-10 finished in 156464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G((X(G(p2))||p1)))))'
Support contains 7 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 16 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2024-05-28 23:46:55] [INFO ] Computed 361 invariants in 5 ms
[2024-05-28 23:46:55] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-05-28 23:46:55] [INFO ] Invariant cache hit.
[2024-05-28 23:46:56] [INFO ] Implicit Places using invariants and state equation in 721 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-28 23:46:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30016 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30020 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Finished structural reductions in LTL mode , in 1 iterations and 61304 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 674 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA ShieldIIPt-PT-040A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLFireability-11 finished in 62256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0 U (p1||G(!p0))))))'
Support contains 7 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 12 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-28 23:47:57] [INFO ] Invariant cache hit.
[2024-05-28 23:47:58] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-28 23:47:58] [INFO ] Invariant cache hit.
[2024-05-28 23:47:58] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-28 23:47:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30019 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30029 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Finished structural reductions in LTL mode , in 1 iterations and 61283 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-13
Product exploration explored 100000 steps with 33333 reset in 1438 ms.
Product exploration explored 100000 steps with 33333 reset in 1529 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040A-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040A-LTLFireability-13 finished in 64427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 762 transition count 560
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 760 transition count 560
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 758 transition count 559
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 758 transition count 558
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 757 transition count 558
Applied a total of 8 rules in 34 ms. Remains 757 /763 variables (removed 6) and now considering 558/562 (removed 4) transitions.
// Phase 1: matrix 558 rows 757 cols
[2024-05-28 23:49:02] [INFO ] Computed 359 invariants in 4 ms
[2024-05-28 23:49:02] [INFO ] Implicit Places using invariants in 394 ms returned [746]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 395 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 756/763 places, 558/562 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 755 transition count 557
Applied a total of 2 rules in 19 ms. Remains 755 /756 variables (removed 1) and now considering 557/558 (removed 1) transitions.
// Phase 1: matrix 557 rows 755 cols
[2024-05-28 23:49:02] [INFO ] Computed 358 invariants in 4 ms
[2024-05-28 23:49:03] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-28 23:49:03] [INFO ] Invariant cache hit.
[2024-05-28 23:49:03] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 755/763 places, 557/562 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1459 ms. Remains : 755/763 places, 557/562 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 649 ms.
Product exploration explored 100000 steps with 0 reset in 854 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 95 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 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 40000 steps (8 resets) in 289 ms. (137 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6223 steps, run visited all 1 properties in 56 ms. (steps per millisecond=111 )
Probabilistic random walk after 6223 steps, saw 5996 distinct states, run finished after 57 ms. (steps per millisecond=109 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 151 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 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 755 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 755/755 places, 557/557 transitions.
Applied a total of 0 rules in 24 ms. Remains 755 /755 variables (removed 0) and now considering 557/557 (removed 0) transitions.
[2024-05-28 23:49:06] [INFO ] Invariant cache hit.
[2024-05-28 23:49:06] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-28 23:49:06] [INFO ] Invariant cache hit.
[2024-05-28 23:49:07] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 1038 ms to find 0 implicit places.
[2024-05-28 23:49:07] [INFO ] Redundant transitions in 9 ms returned []
Running 556 sub problems to find dead transitions.
[2024-05-28 23:49:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/755 variables, 755/755 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/755 variables, 358/1113 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/755 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (OVERLAPS) 557/1312 variables, 755/1868 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1312/1312 variables, and 1868 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30021 ms.
Refiners :[Domain max(s): 755/755 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 755/755 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 556 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/755 variables, 755/755 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/755 variables, 358/1113 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/755 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (OVERLAPS) 557/1312 variables, 755/1868 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1312 variables, 556/2424 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1312 variables, 0/2424 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1312/1312 variables, and 2424 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30022 ms.
Refiners :[Domain max(s): 755/755 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 755/755 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 0/0 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 556 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61202 ms. Remains : 755/755 places, 557/557 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 164 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 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 40000 steps (8 resets) in 435 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 324 ms. (123 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6223 steps, run visited all 1 properties in 57 ms. (steps per millisecond=109 )
Probabilistic random walk after 6223 steps, saw 5996 distinct states, run finished after 58 ms. (steps per millisecond=107 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 125 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 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 633 ms.
Product exploration explored 100000 steps with 0 reset in 825 ms.
Built C files in :
/tmp/ltsmin18145980243075560607
[2024-05-28 23:50:09] [INFO ] Computing symmetric may disable matrix : 557 transitions.
[2024-05-28 23:50:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:50:09] [INFO ] Computing symmetric may enable matrix : 557 transitions.
[2024-05-28 23:50:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:50:09] [INFO ] Computing Do-Not-Accords matrix : 557 transitions.
[2024-05-28 23:50:09] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:50:09] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18145980243075560607
Running compilation step : cd /tmp/ltsmin18145980243075560607;'/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 1587 ms.
Running link step : cd /tmp/ltsmin18145980243075560607;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin18145980243075560607;'/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/stateBased15114157450107568146.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 755 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 755/755 places, 557/557 transitions.
Applied a total of 0 rules in 14 ms. Remains 755 /755 variables (removed 0) and now considering 557/557 (removed 0) transitions.
[2024-05-28 23:50:24] [INFO ] Invariant cache hit.
[2024-05-28 23:50:25] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-28 23:50:25] [INFO ] Invariant cache hit.
[2024-05-28 23:50:26] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 1068 ms to find 0 implicit places.
[2024-05-28 23:50:26] [INFO ] Redundant transitions in 3 ms returned []
Running 556 sub problems to find dead transitions.
[2024-05-28 23:50:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/755 variables, 755/755 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/755 variables, 358/1113 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/755 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (OVERLAPS) 557/1312 variables, 755/1868 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1312/1312 variables, and 1868 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30021 ms.
Refiners :[Domain max(s): 755/755 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 755/755 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 556 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/755 variables, 755/755 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/755 variables, 358/1113 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/755 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (OVERLAPS) 557/1312 variables, 755/1868 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1312 variables, 556/2424 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1312 variables, 0/2424 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1312/1312 variables, and 2424 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30028 ms.
Refiners :[Domain max(s): 755/755 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 755/755 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 556 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61234 ms. Remains : 755/755 places, 557/557 transitions.
Built C files in :
/tmp/ltsmin12330508064351221912
[2024-05-28 23:51:26] [INFO ] Computing symmetric may disable matrix : 557 transitions.
[2024-05-28 23:51:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:51:26] [INFO ] Computing symmetric may enable matrix : 557 transitions.
[2024-05-28 23:51:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:51:26] [INFO ] Computing Do-Not-Accords matrix : 557 transitions.
[2024-05-28 23:51:26] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:51:26] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12330508064351221912
Running compilation step : cd /tmp/ltsmin12330508064351221912;'/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 1611 ms.
Running link step : cd /tmp/ltsmin12330508064351221912;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12330508064351221912;'/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/stateBased486253957136986534.hoa' '--buchi-type=spotba'
LTSmin run took 8568 ms.
FORMULA ShieldIIPt-PT-040A-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-040A-LTLFireability-14 finished in 154354 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((X(p1)||p0)))'
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 16 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2024-05-28 23:51:36] [INFO ] Computed 361 invariants in 3 ms
[2024-05-28 23:51:36] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-28 23:51:36] [INFO ] Invariant cache hit.
[2024-05-28 23:51:37] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-28 23:51:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 1.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 1.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 1.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 1.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 1.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30021 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30026 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Finished structural reductions in LTL mode , in 1 iterations and 61333 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 641 ms.
Product exploration explored 100000 steps with 0 reset in 840 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 140 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 659 ms. (60 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 767 ms. (52 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 600 ms. (66 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 496 ms. (80 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 470 ms. (84 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 219948 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :3 out of 4
Probabilistic random walk after 219948 steps, saw 217436 distinct states, run finished after 3004 ms. (steps per millisecond=73 ) properties seen :3
[2024-05-28 23:52:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/12 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 751/763 variables, 356/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 751/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1325 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 1 unsolved in 502 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/12 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 751/763 variables, 356/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 751/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 1/1888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1325 variables, 0/1888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1325 variables, 0/1888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 1888 constraints, problems are : Problem set: 0 solved, 1 unsolved in 469 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 992ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1184 ms.
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 84 place count 761 transition count 560
Applied a total of 84 rules in 52 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 761/763 places, 560/562 transitions.
RANDOM walk for 40000 steps (8 resets) in 627 ms. (63 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 491 ms. (81 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 67889 steps, run visited all 1 properties in 600 ms. (steps per millisecond=113 )
Probabilistic random walk after 67889 steps, saw 65621 distinct states, run finished after 602 ms. (steps per millisecond=112 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F p1)]
Knowledge based reduction with 9 factoid took 200 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 9 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-28 23:52:47] [INFO ] Invariant cache hit.
[2024-05-28 23:52:47] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-28 23:52:47] [INFO ] Invariant cache hit.
[2024-05-28 23:52:48] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-28 23:52:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30018 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30016 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Finished structural reductions in LTL mode , in 1 iterations and 61315 ms. Remains : 763/763 places, 562/562 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 170 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 1206 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 417 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 369 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 458 ms. (87 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 401 ms. (99 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 296099 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :3 out of 4
Probabilistic random walk after 296099 steps, saw 292768 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :3
[2024-05-28 23:53:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/12 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 751/763 variables, 356/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 751/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1325 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 1 unsolved in 360 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/12 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 751/763 variables, 356/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 751/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 1/1888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1325 variables, 0/1888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1325 variables, 0/1888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 1888 constraints, problems are : Problem set: 0 solved, 1 unsolved in 492 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 875ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1099 ms.
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 84 place count 761 transition count 560
Applied a total of 84 rules in 35 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 761/763 places, 560/562 transitions.
RANDOM walk for 40000 steps (8 resets) in 469 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 67889 steps, run visited all 1 properties in 609 ms. (steps per millisecond=111 )
Probabilistic random walk after 67889 steps, saw 65621 distinct states, run finished after 611 ms. (steps per millisecond=111 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F p1)]
Knowledge based reduction with 9 factoid took 249 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 679 ms.
Product exploration explored 100000 steps with 0 reset in 843 ms.
Built C files in :
/tmp/ltsmin17458343249177099024
[2024-05-28 23:53:57] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17458343249177099024
Running compilation step : cd /tmp/ltsmin17458343249177099024;'/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 1228 ms.
Running link step : cd /tmp/ltsmin17458343249177099024;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17458343249177099024;'/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/stateBased14590796702476025771.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 14 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-28 23:54:12] [INFO ] Invariant cache hit.
[2024-05-28 23:54:13] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-05-28 23:54:13] [INFO ] Invariant cache hit.
[2024-05-28 23:54:14] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1177 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-28 23:54:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30018 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30018 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Finished structural reductions in LTL mode , in 1 iterations and 61356 ms. Remains : 763/763 places, 562/562 transitions.
Built C files in :
/tmp/ltsmin1211072593553675828
[2024-05-28 23:55:14] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1211072593553675828
Running compilation step : cd /tmp/ltsmin1211072593553675828;'/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 1139 ms.
Running link step : cd /tmp/ltsmin1211072593553675828;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1211072593553675828;'/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/stateBased4261483503207261580.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 23:55:29] [INFO ] Flatten gal took : 43 ms
[2024-05-28 23:55:29] [INFO ] Flatten gal took : 39 ms
[2024-05-28 23:55:29] [INFO ] Time to serialize gal into /tmp/LTL2950097244271155834.gal : 15 ms
[2024-05-28 23:55:29] [INFO ] Time to serialize properties into /tmp/LTL5968145750948326.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2950097244271155834.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7719497301132331528.hoa' '-atoms' '/tmp/LTL5968145750948326.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...314
Loading property file /tmp/LTL5968145750948326.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7719497301132331528.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-28 23:55:44] [INFO ] Flatten gal took : 34 ms
[2024-05-28 23:55:44] [INFO ] Flatten gal took : 31 ms
[2024-05-28 23:55:44] [INFO ] Time to serialize gal into /tmp/LTL15912134869597255148.gal : 9 ms
[2024-05-28 23:55:44] [INFO ] Time to serialize properties into /tmp/LTL18017673460532953483.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15912134869597255148.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18017673460532953483.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((("((p32==0)||(p38==0))")||(("(p40==0)")||(X("(((p32==1)&&(p38==1))&&(p40==1))"))))||("((p255==1)&&(p266==1))"))))
Formula 0 simplified : F(!"((p32==0)||(p38==0))" & !"((p255==1)&&(p266==1))" & !"(p40==0)" & X!"(((p32==1)&&(p38==1))&&(p40==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-28 23:55:59] [INFO ] Flatten gal took : 34 ms
[2024-05-28 23:55:59] [INFO ] Applying decomposition
[2024-05-28 23:55:59] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5543625944769287622.txt' '-o' '/tmp/graph5543625944769287622.bin' '-w' '/tmp/graph5543625944769287622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5543625944769287622.bin' '-l' '-1' '-v' '-w' '/tmp/graph5543625944769287622.weights' '-q' '0' '-e' '0.001'
[2024-05-28 23:55:59] [INFO ] Decomposing Gal with order
[2024-05-28 23:56:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 23:56:00] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-28 23:56:00] [INFO ] Flatten gal took : 76 ms
[2024-05-28 23:56:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 33 ms.
[2024-05-28 23:56:00] [INFO ] Time to serialize gal into /tmp/LTL13217459468978272955.gal : 13 ms
[2024-05-28 23:56:00] [INFO ] Time to serialize properties into /tmp/LTL3591612964957481105.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13217459468978272955.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3591612964957481105.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((("((i1.u12.p32==0)||(i0.i1.i0.u15.p38==0))")||(("(i0.i1.i1.u16.p40==0)")||(X("(((i1.u12.p32==1)&&(i0.i1.i0.u15.p38==1))&&(i0.i1....222
Formula 0 simplified : F(!"((i1.u12.p32==0)||(i0.i1.i0.u15.p38==0))" & !"((i6.u106.p255==1)&&(i6.u111.p266==1))" & !"(i0.i1.i1.u16.p40==0)" & X!"(((i1.u12....212
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property ShieldIIPt-PT-040A-LTLFireability-15 finished in 278744 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((X(p1)||p0)))'
Found a Lengthening insensitive property : ShieldIIPt-PT-040A-LTLFireability-15
Stuttering acceptance computed with spot in 85 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 28 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
// Phase 1: matrix 560 rows 761 cols
[2024-05-28 23:56:15] [INFO ] Computed 361 invariants in 3 ms
[2024-05-28 23:56:15] [INFO ] Implicit Places using invariants in 418 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 419 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 759/763 places, 560/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 559
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 559
Applied a total of 2 rules in 17 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2024-05-28 23:56:15] [INFO ] Computed 359 invariants in 3 ms
[2024-05-28 23:56:16] [INFO ] Implicit Places using invariants in 381 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 384 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 757/763 places, 559/562 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 756 transition count 558
Applied a total of 2 rules in 30 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2024-05-28 23:56:16] [INFO ] Computed 358 invariants in 3 ms
[2024-05-28 23:56:16] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-28 23:56:16] [INFO ] Invariant cache hit.
[2024-05-28 23:56:17] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 756/763 places, 558/562 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 1955 ms. Remains : 756/763 places, 558/562 transitions.
Running random walk in product with property : ShieldIIPt-PT-040A-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 646 ms.
Product exploration explored 100000 steps with 0 reset in 917 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 1297 ms. (30 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 504 ms. (79 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 434 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 440 ms. (90 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 531 ms. (75 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 272639 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :3 out of 4
Probabilistic random walk after 272639 steps, saw 269235 distinct states, run finished after 3002 ms. (steps per millisecond=90 ) properties seen :3
[2024-05-28 23:56:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/12 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 744/756 variables, 353/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 744/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1314 variables, 0/1870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1314 variables, 0/1870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 1870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 340 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/12 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 744/756 variables, 353/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 744/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1314 variables, 1/1871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1314 variables, 0/1871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1314 variables, 0/1871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 1871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 485 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 837ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1180 ms.
Support contains 5 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions (Partial Free agglomeration) removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 756 transition count 558
Applied a total of 79 rules in 23 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 756/756 places, 558/558 transitions.
RANDOM walk for 40000 steps (8 resets) in 422 ms. (94 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 287 ms. (138 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 67870 steps, run visited all 1 properties in 553 ms. (steps per millisecond=122 )
Probabilistic random walk after 67870 steps, saw 65623 distinct states, run finished after 556 ms. (steps per millisecond=122 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F p1)]
Knowledge based reduction with 9 factoid took 250 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 756 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 15 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2024-05-28 23:56:26] [INFO ] Invariant cache hit.
[2024-05-28 23:56:26] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-05-28 23:56:26] [INFO ] Invariant cache hit.
[2024-05-28 23:56:27] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
Running 557 sub problems to find dead transitions.
[2024-05-28 23:56:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/755 variables, 755/755 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/755 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (OVERLAPS) 1/756 variables, 358/1113 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/756 variables, 1/1114 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 5 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 1870 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30021 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 557 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/755 variables, 755/755 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/755 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (OVERLAPS) 1/756 variables, 358/1113 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/756 variables, 1/1114 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 5 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1314 variables, 557/2427 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 2427 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30026 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 557 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Finished structural reductions in LTL mode , in 1 iterations and 61226 ms. Remains : 756/756 places, 558/558 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 1471 ms. (27 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 379 ms. (105 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 380 ms. (104 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 422 ms. (94 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 371 ms. (107 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 264842 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :3 out of 4
Probabilistic random walk after 264842 steps, saw 261533 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :3
[2024-05-28 23:57:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/12 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 744/756 variables, 353/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 744/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1314 variables, 0/1870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1314 variables, 0/1870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 1870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 337 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/12 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 744/756 variables, 353/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 744/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1314 variables, 1/1871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1314 variables, 0/1871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1314 variables, 0/1871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 1871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 490 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 836ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1194 ms.
Support contains 5 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions (Partial Free agglomeration) removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 756 transition count 558
Applied a total of 79 rules in 25 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 756/756 places, 558/558 transitions.
RANDOM walk for 40000 steps (8 resets) in 389 ms. (102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 67870 steps, run visited all 1 properties in 704 ms. (steps per millisecond=96 )
Probabilistic random walk after 67870 steps, saw 65623 distinct states, run finished after 705 ms. (steps per millisecond=96 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F p1)]
Knowledge based reduction with 9 factoid took 264 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 697 ms.
Product exploration explored 100000 steps with 0 reset in 839 ms.
Built C files in :
/tmp/ltsmin10088220222354365661
[2024-05-28 23:57:36] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10088220222354365661
Running compilation step : cd /tmp/ltsmin10088220222354365661;'/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 1202 ms.
Running link step : cd /tmp/ltsmin10088220222354365661;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10088220222354365661;'/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/stateBased3288867243701607889.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 756 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 15 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2024-05-28 23:57:52] [INFO ] Invariant cache hit.
[2024-05-28 23:57:52] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-28 23:57:52] [INFO ] Invariant cache hit.
[2024-05-28 23:57:53] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 1062 ms to find 0 implicit places.
Running 557 sub problems to find dead transitions.
[2024-05-28 23:57:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/755 variables, 755/755 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/755 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (OVERLAPS) 1/756 variables, 358/1113 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/756 variables, 1/1114 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 5 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 1870 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30015 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 557 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/755 variables, 755/755 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/755 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (OVERLAPS) 1/756 variables, 358/1113 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/756 variables, 1/1114 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 5 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1314 variables, 557/2427 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 2427 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30027 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 0/0 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 557 unsolved
Search for dead transitions found 0 dead transitions in 60194ms
Finished structural reductions in LTL mode , in 1 iterations and 61273 ms. Remains : 756/756 places, 558/558 transitions.
Built C files in :
/tmp/ltsmin14396736824710097413
[2024-05-28 23:58:53] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14396736824710097413
Running compilation step : cd /tmp/ltsmin14396736824710097413;'/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 1155 ms.
Running link step : cd /tmp/ltsmin14396736824710097413;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14396736824710097413;'/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/stateBased9706972622768440592.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 23:59:08] [INFO ] Flatten gal took : 50 ms
[2024-05-28 23:59:08] [INFO ] Flatten gal took : 41 ms
[2024-05-28 23:59:08] [INFO ] Time to serialize gal into /tmp/LTL4037632730191791835.gal : 19 ms
[2024-05-28 23:59:08] [INFO ] Time to serialize properties into /tmp/LTL15392374908860049454.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4037632730191791835.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7331353447869250732.hoa' '-atoms' '/tmp/LTL15392374908860049454.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...318
Loading property file /tmp/LTL15392374908860049454.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7331353447869250732.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-28 23:59:23] [INFO ] Flatten gal took : 25 ms
[2024-05-28 23:59:23] [INFO ] Flatten gal took : 25 ms
[2024-05-28 23:59:23] [INFO ] Time to serialize gal into /tmp/LTL591845714059501469.gal : 3 ms
[2024-05-28 23:59:23] [INFO ] Time to serialize properties into /tmp/LTL1788626477502939745.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL591845714059501469.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1788626477502939745.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G((("((p32==0)||(p38==0))")||(("(p40==0)")||(X("(((p32==1)&&(p38==1))&&(p40==1))"))))||("((p255==1)&&(p266==1))"))))
Formula 0 simplified : F(!"((p32==0)||(p38==0))" & !"((p255==1)&&(p266==1))" & !"(p40==0)" & X!"(((p32==1)&&(p38==1))&&(p40==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-28 23:59:38] [INFO ] Flatten gal took : 42 ms
[2024-05-28 23:59:38] [INFO ] Applying decomposition
[2024-05-28 23:59:38] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3687649767666078042.txt' '-o' '/tmp/graph3687649767666078042.bin' '-w' '/tmp/graph3687649767666078042.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3687649767666078042.bin' '-l' '-1' '-v' '-w' '/tmp/graph3687649767666078042.weights' '-q' '0' '-e' '0.001'
[2024-05-28 23:59:38] [INFO ] Decomposing Gal with order
[2024-05-28 23:59:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 23:59:38] [INFO ] Removed a total of 119 redundant transitions.
[2024-05-28 23:59:38] [INFO ] Flatten gal took : 34 ms
[2024-05-28 23:59:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2024-05-28 23:59:39] [INFO ] Time to serialize gal into /tmp/LTL12054349100324334708.gal : 10 ms
[2024-05-28 23:59:39] [INFO ] Time to serialize properties into /tmp/LTL4302083750147089853.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12054349100324334708.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4302083750147089853.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((("((i1.u12.p32==0)||(i1.u15.p38==0))")||(("(i1.u16.p40==0)")||(X("(((i1.u12.p32==1)&&(i1.u15.p38==1))&&(i1.u16.p40==1))"))))||("...210
Formula 0 simplified : F(!"((i1.u12.p32==0)||(i1.u15.p38==0))" & !"((i8.i1.i1.u106.p255==1)&&(i8.i1.i0.u111.p266==1))" & !"(i1.u16.p40==0)" & X!"(((i1.u12....200
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property ShieldIIPt-PT-040A-LTLFireability-15 finished in 218792 ms.
[2024-05-28 23:59:54] [INFO ] Flatten gal took : 48 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15599772269210455868
[2024-05-28 23:59:54] [INFO ] Applying decomposition
[2024-05-28 23:59:54] [INFO ] Computing symmetric may disable matrix : 562 transitions.
[2024-05-28 23:59:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:59:54] [INFO ] Computing symmetric may enable matrix : 562 transitions.
[2024-05-28 23:59:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:59:54] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8363086015425567788.txt' '-o' '/tmp/graph8363086015425567788.bin' '-w' '/tmp/graph8363086015425567788.weights'
[2024-05-28 23:59:54] [INFO ] Computing Do-Not-Accords matrix : 562 transitions.
[2024-05-28 23:59:54] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8363086015425567788.bin' '-l' '-1' '-v' '-w' '/tmp/graph8363086015425567788.weights' '-q' '0' '-e' '0.001'
[2024-05-28 23:59:54] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15599772269210455868
Running compilation step : cd /tmp/ltsmin15599772269210455868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 23:59:54] [INFO ] Decomposing Gal with order
[2024-05-28 23:59:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 23:59:54] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-28 23:59:54] [INFO ] Flatten gal took : 34 ms
[2024-05-28 23:59:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 32 ms.
[2024-05-28 23:59:54] [INFO ] Time to serialize gal into /tmp/LTLFireability13852820022602439138.gal : 12 ms
[2024-05-28 23:59:54] [INFO ] Time to serialize properties into /tmp/LTLFireability9236163817479749393.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13852820022602439138.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9236163817479749393.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("(((i1.i0.i3.u12.p32==0)||(i0.i1.i0.u15.p38==0))||((i0.i1.i1.u16.p40==0)||((i6.i0.i2.u106.p255==1)&&(i6.i0.i0.u111.p266==1))))")...238
Formula 0 simplified : F(!"(((i1.i0.i3.u12.p32==0)||(i0.i1.i0.u15.p38==0))||((i0.i1.i1.u16.p40==0)||((i6.i0.i2.u106.p255==1)&&(i6.i0.i0.u111.p266==1))))" &...232
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 1577 ms.
Running link step : cd /tmp/ltsmin15599772269210455868;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15599772269210455868;'/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' '--ltl' '[]((X((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.038: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.038: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.044: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.044: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.070: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.070: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.270: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.270: LTL layer: formula: []((X((LTLAPp1==true))||(LTLAPp0==true)))
pins2lts-mc-linux64( 2/ 8), 0.270: "[]((X((LTLAPp1==true))||(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.271: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.289: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.302: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.336: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.340: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.345: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.356: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.361: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.363: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.531: DFS-FIFO for weak LTL, using special progress label 565
pins2lts-mc-linux64( 0/ 8), 0.531: There are 566 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.531: State length is 764, there are 568 groups
pins2lts-mc-linux64( 0/ 8), 0.531: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.531: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.531: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.531: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.630: ~1 levels ~960 states ~4464 transitions
pins2lts-mc-linux64( 1/ 8), 0.682: ~1 levels ~1920 states ~9872 transitions
pins2lts-mc-linux64( 1/ 8), 0.781: ~1 levels ~3840 states ~21360 transitions
pins2lts-mc-linux64( 3/ 8), 1.002: ~1 levels ~7680 states ~56168 transitions
pins2lts-mc-linux64( 3/ 8), 1.346: ~1 levels ~15360 states ~118704 transitions
pins2lts-mc-linux64( 1/ 8), 1.936: ~1 levels ~30720 states ~215824 transitions
pins2lts-mc-linux64( 4/ 8), 3.041: ~1 levels ~61440 states ~474184 transitions
pins2lts-mc-linux64( 4/ 8), 5.090: ~1 levels ~122880 states ~1016008 transitions
pins2lts-mc-linux64( 1/ 8), 17.546: ~1 levels ~245760 states ~2123416 transitions
pins2lts-mc-linux64( 5/ 8), 40.310: ~1 levels ~491520 states ~4995112 transitions
pins2lts-mc-linux64( 4/ 8), 58.714: ~1 levels ~983040 states ~9472712 transitions
pins2lts-mc-linux64( 4/ 8), 88.174: ~1 levels ~1966080 states ~20156976 transitions
pins2lts-mc-linux64( 4/ 8), 151.467: ~1 levels ~3932160 states ~41914008 transitions
pins2lts-mc-linux64( 2/ 8), 244.488: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 244.670:
pins2lts-mc-linux64( 0/ 8), 244.670: mean standard work distribution: 2.0% (states) 2.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 244.670:
pins2lts-mc-linux64( 0/ 8), 244.670: Explored 5915383 states 67212080 transitions, fanout: 11.362
pins2lts-mc-linux64( 0/ 8), 244.670: Total exploration time 244.100 sec (243.910 sec minimum, 244.000 sec on average)
pins2lts-mc-linux64( 0/ 8), 244.670: States per second: 24233, Transitions per second: 275346
pins2lts-mc-linux64( 0/ 8), 244.670:
pins2lts-mc-linux64( 0/ 8), 244.670: Progress states detected: 11661867
pins2lts-mc-linux64( 0/ 8), 244.670: Redundant explorations: -49.2760
pins2lts-mc-linux64( 0/ 8), 244.670:
pins2lts-mc-linux64( 0/ 8), 244.670: Queue width: 8B, total height: 9718393, memory: 74.15MB
pins2lts-mc-linux64( 0/ 8), 244.670: Tree memory: 345.0MB, 31.0 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 244.670: Tree fill ratio (roots/leafs): 8.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 244.670: Stored 569 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 244.670: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 244.670: Est. total memory use: 419.1MB (~1098.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15599772269210455868;'/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' '--ltl' '[]((X((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15599772269210455868;'/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' '--ltl' '[]((X((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-29 00:22:26] [INFO ] Applying decomposition
[2024-05-29 00:22:26] [INFO ] Flatten gal took : 26 ms
[2024-05-29 00:22:26] [INFO ] Decomposing Gal with order
[2024-05-29 00:22:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:22:26] [INFO ] Removed a total of 160 redundant transitions.
[2024-05-29 00:22:26] [INFO ] Flatten gal took : 35 ms
[2024-05-29 00:22:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2024-05-29 00:22:26] [INFO ] Time to serialize gal into /tmp/LTLFireability16670852317511061621.gal : 8 ms
[2024-05-29 00:22:26] [INFO ] Time to serialize properties into /tmp/LTLFireability3306570039277420396.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16670852317511061621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3306570039277420396.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("(((u17.p32==0)||(u20.p38==0))||((u21.p40==0)||((i106.u135.p255==1)&&(u140.p266==1))))")||(X("(((u17.p32==1)&&(u20.p38==1))&&(u2...171
Formula 0 simplified : F(!"(((u17.p32==0)||(u20.p38==0))||((u21.p40==0)||((i106.u135.p255==1)&&(u140.p266==1))))" & X!"(((u17.p32==1)&&(u20.p38==1))&&(u21....165
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
2620 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,26.308,773208,1,0,1.6722e+06,1099,8917,2.82524e+06,45,803,2985361
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040A-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 2888927 ms.

BK_STOP 1716942179353

--------------------
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="ShieldIIPt-PT-040A"
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 ShieldIIPt-PT-040A, 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 r356-tall-171683760800308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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