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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 19 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 11:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 13 11:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 11:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 13 11:10 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 88K 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 ShieldPPPs-PT-010A-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716965789148

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-010A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 06:56:30] [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-29 06:56:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 06:56:30] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-05-29 06:56:30] [INFO ] Transformed 313 places.
[2024-05-29 06:56:30] [INFO ] Transformed 263 transitions.
[2024-05-29 06:56:30] [INFO ] Found NUPN structural information;
[2024-05-29 06:56:30] [INFO ] Parsed PT model containing 313 places and 263 transitions and 1006 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPs-PT-010A-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 35 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 06:56:30] [INFO ] Computed 111 invariants in 14 ms
[2024-05-29 06:56:31] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-29 06:56:31] [INFO ] Invariant cache hit.
[2024-05-29 06:56:31] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 06:56:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:56:37] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:56:41] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:56:41] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 3 ms to minimize.
[2024-05-29 06:56:42] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:56:42] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:56:42] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:56:42] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 06:56:43] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 18404 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:56:58] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30035 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 48581ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 48599ms
Finished structural reductions in LTL mode , in 1 iterations and 49442 ms. Remains : 313/313 places, 263/263 transitions.
Support contains 55 out of 313 places after structural reductions.
[2024-05-29 06:57:20] [INFO ] Flatten gal took : 50 ms
[2024-05-29 06:57:20] [INFO ] Flatten gal took : 22 ms
[2024-05-29 06:57:20] [INFO ] Input system was already deterministic with 263 transitions.
Support contains 54 out of 313 places (down from 55) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 36049 steps (47 resets) in 1823 ms. (19 steps per ms) remains 0/29 properties
FORMULA ShieldPPPs-PT-010A-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(X((G(F(p0))||(X(p1)&&G(p2)))))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 16 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-29 06:57:21] [INFO ] Invariant cache hit.
[2024-05-29 06:57:21] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-29 06:57:21] [INFO ] Invariant cache hit.
[2024-05-29 06:57:21] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 06:57:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:57:27] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:57:31] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-29 06:57:31] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-29 06:57:31] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:57:32] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 06:57:32] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:57:32] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:57:33] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 17694 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:57:47] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30023 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 47761ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 47767ms
Finished structural reductions in LTL mode , in 1 iterations and 48221 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 366 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-00
Product exploration explored 100000 steps with 310 reset in 565 ms.
Product exploration explored 100000 steps with 283 reset in 488 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 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 118 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (54 resets) in 512 ms. (77 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 1/1 properties
[2024-05-29 06:58:11] [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) 13/18 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 295/313 variables, 106/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 295/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/576 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 737 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 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) 13/18 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 295/313 variables, 106/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 295/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/576 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 576/576 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 415 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 635ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1096 steps, including 49 resets, run visited all 1 properties in 16 ms. (steps per millisecond=68 )
Parikh walk visited 1 properties in 20 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 10 factoid took 244 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 127 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 57 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 06:58:12] [INFO ] Computed 111 invariants in 3 ms
[2024-05-29 06:58:13] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-29 06:58:13] [INFO ] Invariant cache hit.
[2024-05-29 06:58:13] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-05-29 06:58:13] [INFO ] Redundant transitions in 11 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 06:58:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:58:20] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:58:24] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-29 06:58:25] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18803 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:58:57] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 4 ms to minimize.
[2024-05-29 06:58:59] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30018 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48861ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48864ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49430 ms. Remains : 311/313 places, 261/263 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 p2 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 203 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 98 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 30969 steps (43 resets) in 837 ms. (36 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 146 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 :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 142 reset in 430 ms.
Product exploration explored 100000 steps with 145 reset in 429 ms.
Built C files in :
/tmp/ltsmin4052002712467203461
[2024-05-29 06:59:04] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 06:59:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:59:04] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 06:59:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:59:04] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 06:59:04] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:59:04] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4052002712467203461
Running compilation step : cd /tmp/ltsmin4052002712467203461;'/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 865 ms.
Running link step : cd /tmp/ltsmin4052002712467203461;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin4052002712467203461;'/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/stateBased16904268572441305064.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 16 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 06:59:19] [INFO ] Invariant cache hit.
[2024-05-29 06:59:19] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-29 06:59:19] [INFO ] Invariant cache hit.
[2024-05-29 06:59:19] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2024-05-29 06:59:19] [INFO ] Redundant transitions in 3 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 06:59:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:59:26] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:59:31] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:59:32] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18655 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:00:04] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:00:05] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30022 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48716ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48718ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49186 ms. Remains : 311/311 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin2344703895636118538
[2024-05-29 07:00:08] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:00:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:00:08] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:00:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:00:08] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:00:08] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:00:08] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2344703895636118538
Running compilation step : cd /tmp/ltsmin2344703895636118538;'/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 595 ms.
Running link step : cd /tmp/ltsmin2344703895636118538;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2344703895636118538;'/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/stateBased14634322473912643058.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 07:00:23] [INFO ] Flatten gal took : 18 ms
[2024-05-29 07:00:23] [INFO ] Flatten gal took : 17 ms
[2024-05-29 07:00:23] [INFO ] Time to serialize gal into /tmp/LTL9151560628944806129.gal : 5 ms
[2024-05-29 07:00:23] [INFO ] Time to serialize properties into /tmp/LTL15637215954654305152.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9151560628944806129.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14817876969019651448.hoa' '-atoms' '/tmp/LTL15637215954654305152.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15637215954654305152.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14817876969019651448.hoa
Detected timeout of ITS tools.
[2024-05-29 07:00:38] [INFO ] Flatten gal took : 16 ms
[2024-05-29 07:00:38] [INFO ] Flatten gal took : 16 ms
[2024-05-29 07:00:38] [INFO ] Time to serialize gal into /tmp/LTL11541985996295239881.gal : 3 ms
[2024-05-29 07:00:38] [INFO ] Time to serialize properties into /tmp/LTL4051251077443122860.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/LTL11541985996295239881.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4051251077443122860.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(((p13==0)||(p32==0))||(p177==0))")))||((X("((p13==0)||(p32==0))"))&&(G("((p127==0)||(p154==0))"))))))
Formula 0 simplified : X(FG!"(((p13==0)||(p32==0))||(p177==0))" & (X!"((p13==0)||(p32==0))" | F!"((p127==0)||(p154==0))"))
Detected timeout of ITS tools.
[2024-05-29 07:00:54] [INFO ] Flatten gal took : 16 ms
[2024-05-29 07:00:54] [INFO ] Applying decomposition
[2024-05-29 07:00:54] [INFO ] Flatten gal took : 14 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/graph5012256854354338173.txt' '-o' '/tmp/graph5012256854354338173.bin' '-w' '/tmp/graph5012256854354338173.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5012256854354338173.bin' '-l' '-1' '-v' '-w' '/tmp/graph5012256854354338173.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:00:54] [INFO ] Decomposing Gal with order
[2024-05-29 07:00:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:00:54] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 07:00:54] [INFO ] Flatten gal took : 54 ms
[2024-05-29 07:00:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 12 ms.
[2024-05-29 07:00:54] [INFO ] Time to serialize gal into /tmp/LTL17745471965655157225.gal : 6 ms
[2024-05-29 07:00:54] [INFO ] Time to serialize properties into /tmp/LTL15321315934336295545.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/LTL17745471965655157225.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15321315934336295545.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...256
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(((i0.i3.u5.p13==0)||(i0.i3.u11.p32==0))||(i5.i0.u63.p177==0))")))||((X("((i0.i3.u5.p13==0)||(i0.i3.u11.p32==0))"))&&(G("((...202
Formula 0 simplified : X(FG!"(((i0.i3.u5.p13==0)||(i0.i3.u11.p32==0))||(i5.i0.u63.p177==0))" & (X!"((i0.i3.u5.p13==0)||(i0.i3.u11.p32==0))" | F!"((i4.i1.u4...190
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-00 finished in 227917 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(p1)&&X(G(p2))&&p0)))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Reduce places removed 1 places and 1 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 311 transition count 261
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 310 transition count 260
Applied a total of 4 rules in 19 ms. Remains 310 /313 variables (removed 3) and now considering 260/263 (removed 3) transitions.
// Phase 1: matrix 260 rows 310 cols
[2024-05-29 07:01:09] [INFO ] Computed 111 invariants in 7 ms
[2024-05-29 07:01:09] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-29 07:01:09] [INFO ] Invariant cache hit.
[2024-05-29 07:01:09] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-05-29 07:01:09] [INFO ] Redundant transitions in 2 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-29 07:01:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:01:16] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
[2024-05-29 07:01:16] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 4 ms to minimize.
[2024-05-29 07:01:16] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:01:16] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:01:16] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:01:16] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 4 ms to minimize.
[2024-05-29 07:01:16] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:01:16] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:01:16] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 07:01:16] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:01:17] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
[2024-05-29 07:01:17] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:01:17] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:01:17] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:01:17] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/570 variables, 15/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 746 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13901 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 15/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 260/570 variables, 310/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 258/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:01:37] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/570 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 1005 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30013 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 16/16 constraints]
After SMT, in 43952ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 43955ms
Starting structural reductions in SI_LTL mode, iteration 1 : 310/313 places, 260/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44382 ms. Remains : 310/313 places, 260/263 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-01
Stuttering criterion allowed to conclude after 695 steps with 0 reset in 5 ms.
FORMULA ShieldPPPs-PT-010A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010A-LTLFireability-01 finished in 44568 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)||G(F(p1)))))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 13 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 07:01:53] [INFO ] Computed 111 invariants in 4 ms
[2024-05-29 07:01:54] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-29 07:01:54] [INFO ] Invariant cache hit.
[2024-05-29 07:01:54] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2024-05-29 07:01:54] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:01:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:02:01] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:02:05] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:02:06] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18999 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:02:38] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 2 ms to minimize.
[2024-05-29 07:02:40] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30019 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49055ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49058ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49504 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-03
Product exploration explored 100000 steps with 196 reset in 400 ms.
Product exploration explored 100000 steps with 192 reset in 459 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) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 92 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 9599 steps (11 resets) in 55 ms. (171 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 265 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 11 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:02:44] [INFO ] Invariant cache hit.
[2024-05-29 07:02:45] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-29 07:02:45] [INFO ] Invariant cache hit.
[2024-05-29 07:02:45] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2024-05-29 07:02:45] [INFO ] Redundant transitions in 0 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:02:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:02:52] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:02:56] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 2 ms to minimize.
[2024-05-29 07:02:57] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18429 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:03:29] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-29 07:03:31] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30016 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48490ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48492ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48973 ms. Remains : 311/311 places, 261/261 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) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 11560 steps (14 resets) in 66 ms. (172 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 191 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 192 reset in 397 ms.
Product exploration explored 100000 steps with 194 reset in 440 ms.
Built C files in :
/tmp/ltsmin847648060441529207
[2024-05-29 07:03:35] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:03:35] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:03:35] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:03:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:03:35] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:03:35] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:03:35] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin847648060441529207
Running compilation step : cd /tmp/ltsmin847648060441529207;'/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 592 ms.
Running link step : cd /tmp/ltsmin847648060441529207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin847648060441529207;'/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/stateBased7892072940637031454.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 13 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:03:50] [INFO ] Invariant cache hit.
[2024-05-29 07:03:50] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-29 07:03:50] [INFO ] Invariant cache hit.
[2024-05-29 07:03:50] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-05-29 07:03:50] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:03:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:03:58] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:04:02] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:04:03] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18714 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:04:34] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:04:36] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30030 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48776ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48779ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49234 ms. Remains : 311/311 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin15824769527698320437
[2024-05-29 07:04:39] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:04:39] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:04:39] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:04:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:04:39] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:04:39] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:04:39] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15824769527698320437
Running compilation step : cd /tmp/ltsmin15824769527698320437;'/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 594 ms.
Running link step : cd /tmp/ltsmin15824769527698320437;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15824769527698320437;'/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/stateBased16308356031698374942.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 07:04:54] [INFO ] Flatten gal took : 14 ms
[2024-05-29 07:04:54] [INFO ] Flatten gal took : 12 ms
[2024-05-29 07:04:54] [INFO ] Time to serialize gal into /tmp/LTL8090591067535240247.gal : 2 ms
[2024-05-29 07:04:54] [INFO ] Time to serialize properties into /tmp/LTL11263081593771788523.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/LTL8090591067535240247.gal' '-t' 'CGAL' '-hoa' '/tmp/aut747156084942153281.hoa' '-atoms' '/tmp/LTL11263081593771788523.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL11263081593771788523.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut747156084942153281.hoa
Detected timeout of ITS tools.
[2024-05-29 07:05:09] [INFO ] Flatten gal took : 15 ms
[2024-05-29 07:05:10] [INFO ] Flatten gal took : 11 ms
[2024-05-29 07:05:10] [INFO ] Time to serialize gal into /tmp/LTL14892553548793207919.gal : 2 ms
[2024-05-29 07:05:10] [INFO ] Time to serialize properties into /tmp/LTL4282958650249834899.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/LTL14892553548793207919.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4282958650249834899.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((p263==1)&&(p305==1))"))||(G(F("((p43==0)||(p45==0))"))))))
Formula 0 simplified : G(F!"((p263==1)&&(p305==1))" & FG!"((p43==0)||(p45==0))")
Detected timeout of ITS tools.
[2024-05-29 07:05:25] [INFO ] Flatten gal took : 13 ms
[2024-05-29 07:05:25] [INFO ] Applying decomposition
[2024-05-29 07:05:25] [INFO ] Flatten gal took : 22 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/graph2016674931734722948.txt' '-o' '/tmp/graph2016674931734722948.bin' '-w' '/tmp/graph2016674931734722948.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2016674931734722948.bin' '-l' '-1' '-v' '-w' '/tmp/graph2016674931734722948.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:05:25] [INFO ] Decomposing Gal with order
[2024-05-29 07:05:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:05:25] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 07:05:25] [INFO ] Flatten gal took : 46 ms
[2024-05-29 07:05:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 41 ms.
[2024-05-29 07:05:25] [INFO ] Time to serialize gal into /tmp/LTL13660698750126573887.gal : 8 ms
[2024-05-29 07:05:25] [INFO ] Time to serialize properties into /tmp/LTL5298129699945451592.ltl : 30 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/LTL13660698750126573887.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5298129699945451592.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 : !((F((G("((i8.i2.u94.p263==1)&&(i9.i2.u109.p305==1))"))||(G(F("((i1.i1.u15.p43==0)||(i1.i3.u16.p45==0))"))))))
Formula 0 simplified : G(F!"((i8.i2.u94.p263==1)&&(i9.i2.u109.p305==1))" & FG!"((i1.i1.u15.p43==0)||(i1.i3.u16.p45==0))")
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-03 finished in 226437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Reduce places removed 1 places and 1 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 311 transition count 261
Applied a total of 2 rules in 12 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 07:05:40] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 07:05:40] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-29 07:05:40] [INFO ] Invariant cache hit.
[2024-05-29 07:05:40] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2024-05-29 07:05:40] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:05:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 109/419 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/311 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:05:50] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:05:50] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-29 07:05:50] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:05:50] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 4/737 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:05:52] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-29 07:05:52] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:05:56] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:05:56] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 12 (OVERLAPS) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 741 constraints, problems are : Problem set: 0 solved, 260 unsolved in 23445 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 109/419 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 8/427 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 1/311 variables, 2/429 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 261/572 variables, 311/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 260/1001 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:06:10] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-29 07:06:11] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:06:11] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 3/1004 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 1004 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30023 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 11/11 constraints]
After SMT, in 53499ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 53502ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53982 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-04
Product exploration explored 100000 steps with 141 reset in 375 ms.
Product exploration explored 100000 steps with 139 reset in 428 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 39964 steps (54 resets) in 296 ms. (134 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 10 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:06:35] [INFO ] Invariant cache hit.
[2024-05-29 07:06:35] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-29 07:06:35] [INFO ] Invariant cache hit.
[2024-05-29 07:06:36] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2024-05-29 07:06:36] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:06:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 109/419 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/311 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:06:45] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:06:46] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:06:46] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:06:46] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 4/737 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:06:47] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-29 07:06:48] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:06:51] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-29 07:06:51] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 12 (OVERLAPS) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 741 constraints, problems are : Problem set: 0 solved, 260 unsolved in 23212 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 109/419 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 8/427 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 1/311 variables, 2/429 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 261/572 variables, 311/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 260/1001 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:07:06] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:07:06] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:07:06] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 3/1004 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 1004 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30015 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 11/11 constraints]
After SMT, in 53258ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 53260ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53782 ms. Remains : 311/311 places, 261/261 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 40000 steps (53 resets) in 253 ms. (157 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 738655 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :0 out of 1
Probabilistic random walk after 738655 steps, saw 150101 distinct states, run finished after 3009 ms. (steps per millisecond=245 ) properties seen :0
[2024-05-29 07:07:32] [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, 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) 10/14 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/18 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 22/40 variables, 18/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 40/80 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/80 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/80 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/80 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/84 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/84 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/84 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/84 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/88 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/88 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/88 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 57/145 variables, 29/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 25/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/145 variables, 6/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/145 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 6/151 variables, 5/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/151 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/151 variables, 6/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/151 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/153 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/153 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/153 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 66/219 variables, 32/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/219 variables, 30/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/219 variables, 5/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/219 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 8/227 variables, 7/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/227 variables, 8/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/227 variables, 8/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/227 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 8/235 variables, 4/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/235 variables, 8/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/235 variables, 8/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/235 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 49/284 variables, 21/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/284 variables, 21/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/284 variables, 5/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/284 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 6/290 variables, 4/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/290 variables, 6/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/290 variables, 6/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/290 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 49/339 variables, 25/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/339 variables, 25/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/339 variables, 3/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/339 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 6/345 variables, 8/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/345 variables, 6/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/345 variables, 6/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/345 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 4/349 variables, 2/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/349 variables, 4/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/349 variables, 4/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/349 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 49/398 variables, 21/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/398 variables, 21/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/398 variables, 5/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/398 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 6/404 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/404 variables, 6/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/404 variables, 6/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/404 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 49/453 variables, 25/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/453 variables, 25/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/453 variables, 3/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/453 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 6/459 variables, 8/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/459 variables, 6/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/459 variables, 6/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/459 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 4/463 variables, 2/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/463 variables, 4/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/463 variables, 4/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/463 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 49/512 variables, 21/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/512 variables, 21/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/512 variables, 5/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/512 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 6/518 variables, 4/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/518 variables, 6/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/518 variables, 6/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/518 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 41/559 variables, 24/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/559 variables, 24/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/559 variables, 4/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/559 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 4/563 variables, 6/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/563 variables, 4/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/563 variables, 4/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/563 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 2/565 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/565 variables, 2/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/565 variables, 2/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/565 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 7/572 variables, 6/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/572 variables, 6/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/572 variables, 3/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/572 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 0/572 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 733 constraints, problems are : Problem set: 0 solved, 1 unsolved in 347 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 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) 10/14 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/18 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 22/40 variables, 18/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 40/80 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/80 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/80 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/80 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/80 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/84 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/84 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/84 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/84 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/88 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/88 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/88 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 57/145 variables, 29/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/145 variables, 25/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/145 variables, 6/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/145 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 6/151 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/151 variables, 6/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/151 variables, 6/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/151 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 2/153 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/153 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/153 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 66/219 variables, 32/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/219 variables, 30/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/219 variables, 5/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/219 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 8/227 variables, 7/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/227 variables, 8/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/227 variables, 8/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/227 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 8/235 variables, 4/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/235 variables, 8/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/235 variables, 8/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/235 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 49/284 variables, 21/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/284 variables, 21/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/284 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/284 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 6/290 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/290 variables, 6/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/290 variables, 6/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/290 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 49/339 variables, 25/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/339 variables, 25/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/339 variables, 3/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/339 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 6/345 variables, 8/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/345 variables, 6/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/345 variables, 6/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/345 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 4/349 variables, 2/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/349 variables, 4/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/349 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/349 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 49/398 variables, 21/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/398 variables, 21/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/398 variables, 5/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/398 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 6/404 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/404 variables, 6/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/404 variables, 6/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/404 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 49/453 variables, 25/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/453 variables, 25/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/453 variables, 3/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/453 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 6/459 variables, 8/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/459 variables, 6/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/459 variables, 6/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/459 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 4/463 variables, 2/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/463 variables, 4/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/463 variables, 4/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/463 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 49/512 variables, 21/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/512 variables, 21/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/512 variables, 5/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 07:07:33] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 88 (INCLUDED_ONLY) 0/512 variables, 1/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/512 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 6/518 variables, 4/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/518 variables, 6/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/518 variables, 6/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 07:07:33] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-29 07:07:33] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-29 07:07:33] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
At refinement iteration 93 (INCLUDED_ONLY) 0/518 variables, 3/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/518 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 41/559 variables, 24/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/559 variables, 24/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/559 variables, 4/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/559 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 4/563 variables, 6/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/563 variables, 4/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/563 variables, 4/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/563 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 2/565 variables, 1/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/565 variables, 2/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/565 variables, 2/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/565 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 7/572 variables, 6/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/572 variables, 6/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/572 variables, 3/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/572 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 0/572 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 572/572 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 831 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1197ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 261/261 transitions.
Partial Free-agglomeration rule applied 56 times.
Drop transitions (Partial Free agglomeration) removed 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 311 transition count 261
Applied a total of 56 rules in 14 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 311/311 places, 261/261 transitions.
RANDOM walk for 15561 steps (6 resets) in 99 ms. (155 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Product exploration explored 100000 steps with 139 reset in 405 ms.
Product exploration explored 100000 steps with 139 reset in 414 ms.
Built C files in :
/tmp/ltsmin4444539339203599749
[2024-05-29 07:07:35] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:07:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:07:35] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:07:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:07:35] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:07:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:07:35] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4444539339203599749
Running compilation step : cd /tmp/ltsmin4444539339203599749;'/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 599 ms.
Running link step : cd /tmp/ltsmin4444539339203599749;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4444539339203599749;'/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/stateBased15080177390811090244.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 15 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:07:50] [INFO ] Invariant cache hit.
[2024-05-29 07:07:50] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-29 07:07:50] [INFO ] Invariant cache hit.
[2024-05-29 07:07:50] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2024-05-29 07:07:50] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:07:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 109/419 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/311 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:08:00] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:08:01] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:08:01] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-29 07:08:01] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 4/737 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:08:02] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-29 07:08:03] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:08:06] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:08:06] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 12 (OVERLAPS) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 741 constraints, problems are : Problem set: 0 solved, 260 unsolved in 23799 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 109/419 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 8/427 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 1/311 variables, 2/429 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 261/572 variables, 311/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 260/1001 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:08:21] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:08:21] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:08:21] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 3/1004 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 1004 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30020 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 11/11 constraints]
After SMT, in 53850ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 53853ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54346 ms. Remains : 311/311 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin13951909500670621638
[2024-05-29 07:08:44] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:08:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:08:44] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:08:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:08:44] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:08:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:08:44] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13951909500670621638
Running compilation step : cd /tmp/ltsmin13951909500670621638;'/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 585 ms.
Running link step : cd /tmp/ltsmin13951909500670621638;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13951909500670621638;'/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/stateBased12836100714624711797.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 07:08:59] [INFO ] Flatten gal took : 9 ms
[2024-05-29 07:08:59] [INFO ] Flatten gal took : 8 ms
[2024-05-29 07:08:59] [INFO ] Time to serialize gal into /tmp/LTL7228858011244097078.gal : 2 ms
[2024-05-29 07:08:59] [INFO ] Time to serialize properties into /tmp/LTL7752326289582280396.prop : 2 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/LTL7228858011244097078.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3495781900502599089.hoa' '-atoms' '/tmp/LTL7752326289582280396.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7752326289582280396.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3495781900502599089.hoa
Detected timeout of ITS tools.
[2024-05-29 07:09:14] [INFO ] Flatten gal took : 9 ms
[2024-05-29 07:09:14] [INFO ] Flatten gal took : 8 ms
[2024-05-29 07:09:14] [INFO ] Time to serialize gal into /tmp/LTL17684823825266814290.gal : 2 ms
[2024-05-29 07:09:14] [INFO ] Time to serialize properties into /tmp/LTL14321491777685846470.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/LTL17684823825266814290.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14321491777685846470.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 : !((F(G("(((p8==0)||(p28==0))||((p297==0)||(p306==0)))"))))
Formula 0 simplified : GF!"(((p8==0)||(p28==0))||((p297==0)||(p306==0)))"
Detected timeout of ITS tools.
[2024-05-29 07:09:29] [INFO ] Flatten gal took : 11 ms
[2024-05-29 07:09:29] [INFO ] Applying decomposition
[2024-05-29 07:09:29] [INFO ] Flatten gal took : 7 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/graph4791330867616989108.txt' '-o' '/tmp/graph4791330867616989108.bin' '-w' '/tmp/graph4791330867616989108.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4791330867616989108.bin' '-l' '-1' '-v' '-w' '/tmp/graph4791330867616989108.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:09:29] [INFO ] Decomposing Gal with order
[2024-05-29 07:09:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:09:29] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 07:09:29] [INFO ] Flatten gal took : 13 ms
[2024-05-29 07:09:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 3 ms.
[2024-05-29 07:09:29] [INFO ] Time to serialize gal into /tmp/LTL3024334423572706258.gal : 3 ms
[2024-05-29 07:09:29] [INFO ] Time to serialize properties into /tmp/LTL10352346397371089531.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/LTL3024334423572706258.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10352346397371089531.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 : !((F(G("(((i0.i3.u3.p8==0)||(i0.i3.u10.p28==0))||((i9.i2.u106.p297==0)||(i9.i4.u109.p306==0)))"))))
Formula 0 simplified : GF!"(((i0.i3.u3.p8==0)||(i0.i3.u10.p28==0))||((i9.i2.u106.p297==0)||(i9.i4.u109.p306==0)))"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-04 finished in 244538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(!p0&&G(F(!p1)))))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Reduce places removed 1 places and 1 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 311 transition count 261
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 310 transition count 260
Applied a total of 4 rules in 29 ms. Remains 310 /313 variables (removed 3) and now considering 260/263 (removed 3) transitions.
// Phase 1: matrix 260 rows 310 cols
[2024-05-29 07:09:44] [INFO ] Computed 111 invariants in 1 ms
[2024-05-29 07:09:45] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-29 07:09:45] [INFO ] Invariant cache hit.
[2024-05-29 07:09:45] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-05-29 07:09:45] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-29 07:09:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:09:51] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:09:51] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-29 07:09:51] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:09:51] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-29 07:09:51] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:09:51] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:09:51] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:09:52] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:09:52] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:09:52] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-29 07:09:52] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-29 07:09:52] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-29 07:09:52] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:09:52] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:09:53] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/570 variables, 15/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 746 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13401 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 15/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 260/570 variables, 310/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 258/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:10:12] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/570 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 1005 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30021 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 16/16 constraints]
After SMT, in 43449ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 43452ms
Starting structural reductions in SI_LTL mode, iteration 1 : 310/313 places, 260/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44014 ms. Remains : 310/313 places, 260/263 transitions.
Stuttering acceptance computed with spot in 148 ms :[p0, true, (AND p0 p1), p1, p1]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-05
Product exploration explored 100000 steps with 186 reset in 367 ms.
Product exploration explored 100000 steps with 185 reset in 414 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 (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 86 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND p0 p1), p1, p1]
RANDOM walk for 7562 steps (8 resets) in 58 ms. (128 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 147 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND p0 p1), p1, p1]
Stuttering acceptance computed with spot in 89 ms :[(AND p0 p1), p1, p1]
Support contains 4 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 260/260 transitions.
Applied a total of 0 rules in 10 ms. Remains 310 /310 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-29 07:10:30] [INFO ] Invariant cache hit.
[2024-05-29 07:10:30] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-29 07:10:30] [INFO ] Invariant cache hit.
[2024-05-29 07:10:30] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2024-05-29 07:10:30] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-29 07:10:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:10:36] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:10:36] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:10:36] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-29 07:10:36] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-29 07:10:36] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:10:37] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-29 07:10:37] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:10:37] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:10:37] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 2 ms to minimize.
[2024-05-29 07:10:37] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-29 07:10:37] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:10:37] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:10:37] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-29 07:10:38] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:10:38] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/570 variables, 15/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 746 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13338 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 15/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 260/570 variables, 310/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 258/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:10:57] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/570 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 1005 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30013 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 16/16 constraints]
After SMT, in 43388ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 43391ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43847 ms. Remains : 310/310 places, 260/260 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 (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 199 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 102 ms :[(AND p0 p1), p1, p1]
RANDOM walk for 3123 steps (1 resets) in 24 ms. (124 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 152 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 95 ms :[(AND p0 p1), p1, p1]
Stuttering acceptance computed with spot in 92 ms :[(AND p0 p1), p1, p1]
Stuttering acceptance computed with spot in 93 ms :[(AND p0 p1), p1, p1]
Product exploration explored 100000 steps with 191 reset in 371 ms.
Product exploration explored 100000 steps with 194 reset in 408 ms.
Built C files in :
/tmp/ltsmin12314264354901954317
[2024-05-29 07:11:15] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2024-05-29 07:11:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:11:15] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2024-05-29 07:11:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:11:15] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2024-05-29 07:11:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:11:15] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12314264354901954317
Running compilation step : cd /tmp/ltsmin12314264354901954317;'/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 575 ms.
Running link step : cd /tmp/ltsmin12314264354901954317;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12314264354901954317;'/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/stateBased457209689902674875.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 260/260 transitions.
Applied a total of 0 rules in 13 ms. Remains 310 /310 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-29 07:11:30] [INFO ] Invariant cache hit.
[2024-05-29 07:11:31] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-29 07:11:31] [INFO ] Invariant cache hit.
[2024-05-29 07:11:31] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2024-05-29 07:11:31] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-29 07:11:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:11:37] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:11:37] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 07:11:37] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-29 07:11:37] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-29 07:11:37] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:11:37] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:11:38] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:11:38] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 07:11:38] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:11:38] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-29 07:11:38] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:11:38] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:11:38] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-29 07:11:38] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 2 ms to minimize.
[2024-05-29 07:11:39] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/570 variables, 15/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 746 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13558 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 15/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 260/570 variables, 310/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 258/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:11:58] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/570 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 1005 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30014 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 16/16 constraints]
After SMT, in 43603ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 43606ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44047 ms. Remains : 310/310 places, 260/260 transitions.
Built C files in :
/tmp/ltsmin11925228674959225745
[2024-05-29 07:12:14] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2024-05-29 07:12:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:12:14] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2024-05-29 07:12:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:12:14] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2024-05-29 07:12:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:12:14] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11925228674959225745
Running compilation step : cd /tmp/ltsmin11925228674959225745;'/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 583 ms.
Running link step : cd /tmp/ltsmin11925228674959225745;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11925228674959225745;'/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/stateBased11459479589775960501.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 07:12:30] [INFO ] Flatten gal took : 8 ms
[2024-05-29 07:12:30] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:12:30] [INFO ] Time to serialize gal into /tmp/LTL7069224924714281570.gal : 1 ms
[2024-05-29 07:12:30] [INFO ] Time to serialize properties into /tmp/LTL9704722969311598800.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7069224924714281570.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14183168314992287717.hoa' '-atoms' '/tmp/LTL9704722969311598800.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/LTL9704722969311598800.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14183168314992287717.hoa
Detected timeout of ITS tools.
[2024-05-29 07:12:45] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:12:45] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:12:45] [INFO ] Time to serialize gal into /tmp/LTL5892799849615924616.gal : 2 ms
[2024-05-29 07:12:45] [INFO ] Time to serialize properties into /tmp/LTL7141357843816336695.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/LTL5892799849615924616.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7141357843816336695.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G("((p110==0)||(p112==0))"))||(G(F("((p106==0)||(p125==0))")))))
Formula 0 simplified : F!"((p110==0)||(p112==0))" & FG!"((p106==0)||(p125==0))"
Detected timeout of ITS tools.
[2024-05-29 07:13:00] [INFO ] Flatten gal took : 14 ms
[2024-05-29 07:13:00] [INFO ] Applying decomposition
[2024-05-29 07:13:00] [INFO ] Flatten gal took : 8 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/graph6395369953721972669.txt' '-o' '/tmp/graph6395369953721972669.bin' '-w' '/tmp/graph6395369953721972669.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6395369953721972669.bin' '-l' '-1' '-v' '-w' '/tmp/graph6395369953721972669.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:13:00] [INFO ] Decomposing Gal with order
[2024-05-29 07:13:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:13:00] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 07:13:00] [INFO ] Flatten gal took : 24 ms
[2024-05-29 07:13:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 2 ms.
[2024-05-29 07:13:00] [INFO ] Time to serialize gal into /tmp/LTL18131218134403137620.gal : 3 ms
[2024-05-29 07:13:00] [INFO ] Time to serialize properties into /tmp/LTL7745542936303836517.ltl : 102 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/LTL18131218134403137620.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7745542936303836517.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("((i3.i2.u39.p110==0)||(i3.i3.u40.p112==0))"))||(G(F("((i3.i2.u38.p106==0)||(i3.i2.u44.p125==0))")))))
Formula 0 simplified : F!"((i3.i2.u39.p110==0)||(i3.i3.u40.p112==0))" & FG!"((i3.i2.u38.p106==0)||(i3.i2.u44.p125==0))"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-05 finished in 210628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 9 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 07:13:15] [INFO ] Computed 111 invariants in 3 ms
[2024-05-29 07:13:15] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-29 07:13:15] [INFO ] Invariant cache hit.
[2024-05-29 07:13:15] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-05-29 07:13:15] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:13:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:13:23] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:13:27] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:13:28] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19037 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:14:00] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-29 07:14:02] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30015 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49082ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49085ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49534 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-06
Product exploration explored 100000 steps with 141 reset in 406 ms.
Product exploration explored 100000 steps with 141 reset in 435 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
RANDOM walk for 185 steps (0 resets) in 5 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 14 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:14:06] [INFO ] Invariant cache hit.
[2024-05-29 07:14:06] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-29 07:14:06] [INFO ] Invariant cache hit.
[2024-05-29 07:14:06] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2024-05-29 07:14:06] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:14:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:14:13] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:14:18] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 07:14:19] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18883 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:14:51] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:14:52] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30016 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48940ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48943ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49397 ms. Remains : 311/311 places, 261/261 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 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
RANDOM walk for 223 steps (0 resets) in 11 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 140 reset in 383 ms.
Product exploration explored 100000 steps with 142 reset in 425 ms.
Built C files in :
/tmp/ltsmin9899807565903518006
[2024-05-29 07:14:56] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:14:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:14:56] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:14:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:14:56] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:14:56] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:14:56] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9899807565903518006
Running compilation step : cd /tmp/ltsmin9899807565903518006;'/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 621 ms.
Running link step : cd /tmp/ltsmin9899807565903518006;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9899807565903518006;'/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/stateBased16524891541517974438.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 14 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:15:12] [INFO ] Invariant cache hit.
[2024-05-29 07:15:12] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-29 07:15:12] [INFO ] Invariant cache hit.
[2024-05-29 07:15:12] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2024-05-29 07:15:12] [INFO ] Redundant transitions in 0 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:15:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:15:19] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:15:23] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:15:24] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18474 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:15:56] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:15:58] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30011 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48521ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48523ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48979 ms. Remains : 311/311 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin5996905238479048192
[2024-05-29 07:16:01] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:16:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:16:01] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:16:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:16:01] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:16:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:16:01] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5996905238479048192
Running compilation step : cd /tmp/ltsmin5996905238479048192;'/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 609 ms.
Running link step : cd /tmp/ltsmin5996905238479048192;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin5996905238479048192;'/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/stateBased11878465606022171147.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 07:16:16] [INFO ] Flatten gal took : 20 ms
[2024-05-29 07:16:16] [INFO ] Flatten gal took : 8 ms
[2024-05-29 07:16:16] [INFO ] Time to serialize gal into /tmp/LTL2901430502396133766.gal : 72 ms
[2024-05-29 07:16:16] [INFO ] Time to serialize properties into /tmp/LTL7646111102424186695.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2901430502396133766.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2279035881171654107.hoa' '-atoms' '/tmp/LTL7646111102424186695.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7646111102424186695.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2279035881171654107.hoa
Detected timeout of ITS tools.
[2024-05-29 07:16:31] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:16:31] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:16:31] [INFO ] Time to serialize gal into /tmp/LTL1363467133055680480.gal : 1 ms
[2024-05-29 07:16:31] [INFO ] Time to serialize properties into /tmp/LTL16550998948347069814.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/LTL1363467133055680480.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16550998948347069814.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p202==0)||(p219==0))"))))
Formula 0 simplified : GF!"((p202==0)||(p219==0))"
Detected timeout of ITS tools.
[2024-05-29 07:16:46] [INFO ] Flatten gal took : 11 ms
[2024-05-29 07:16:46] [INFO ] Applying decomposition
[2024-05-29 07:16:46] [INFO ] Flatten gal took : 7 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/graph14051184734811316901.txt' '-o' '/tmp/graph14051184734811316901.bin' '-w' '/tmp/graph14051184734811316901.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14051184734811316901.bin' '-l' '-1' '-v' '-w' '/tmp/graph14051184734811316901.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:16:46] [INFO ] Decomposing Gal with order
[2024-05-29 07:16:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:16:46] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 07:16:46] [INFO ] Flatten gal took : 15 ms
[2024-05-29 07:16:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 4 ms.
[2024-05-29 07:16:46] [INFO ] Time to serialize gal into /tmp/LTL7429561494834889044.gal : 4 ms
[2024-05-29 07:16:46] [INFO ] Time to serialize properties into /tmp/LTL12437243294062347537.ltl : 62 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/LTL7429561494834889044.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12437243294062347537.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 : !((F(G("((i6.i3.u72.p202==0)||(i6.i3.u77.p219==0))"))))
Formula 0 simplified : GF!"((i6.i3.u72.p202==0)||(i6.i3.u77.p219==0))"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-06 finished in 226016 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)||G(p1))))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 12 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
[2024-05-29 07:17:01] [INFO ] Invariant cache hit.
[2024-05-29 07:17:01] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-29 07:17:01] [INFO ] Invariant cache hit.
[2024-05-29 07:17:01] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2024-05-29 07:17:01] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:17:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:17:08] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:17:13] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-29 07:17:14] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18643 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:17:45] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-29 07:17:47] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30015 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48701ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48703ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49142 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-08
Product exploration explored 100000 steps with 142 reset in 406 ms.
Product exploration explored 100000 steps with 141 reset in 463 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) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 107 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 4217 steps (3 resets) in 32 ms. (127 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 13 factoid took 346 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 6 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:17:52] [INFO ] Invariant cache hit.
[2024-05-29 07:17:52] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-29 07:17:52] [INFO ] Invariant cache hit.
[2024-05-29 07:17:52] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-05-29 07:17:52] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:17:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:17:59] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:18:03] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-29 07:18:04] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18712 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:18:36] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:18:38] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30020 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48765ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48767ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49216 ms. Remains : 311/311 places, 261/261 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 (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 120 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 3116 steps (2 resets) in 31 ms. (97 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 13 factoid took 333 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 141 reset in 435 ms.
Product exploration explored 100000 steps with 141 reset in 463 ms.
Built C files in :
/tmp/ltsmin5248357016484151174
[2024-05-29 07:18:42] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:18:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:18:42] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:18:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:18:43] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:18:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:18:43] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5248357016484151174
Running compilation step : cd /tmp/ltsmin5248357016484151174;'/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 599 ms.
Running link step : cd /tmp/ltsmin5248357016484151174;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5248357016484151174;'/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/stateBased10299486732445380425.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 6 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:18:58] [INFO ] Invariant cache hit.
[2024-05-29 07:18:58] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-29 07:18:58] [INFO ] Invariant cache hit.
[2024-05-29 07:18:58] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2024-05-29 07:18:58] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:18:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:19:05] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:19:09] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:19:10] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18640 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:19:42] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 2 ms to minimize.
[2024-05-29 07:19:44] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30021 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48689ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48692ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49192 ms. Remains : 311/311 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin9996273825818278001
[2024-05-29 07:19:47] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:19:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:19:47] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:19:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:19:47] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:19:47] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:19:47] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9996273825818278001
Running compilation step : cd /tmp/ltsmin9996273825818278001;'/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 595 ms.
Running link step : cd /tmp/ltsmin9996273825818278001;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9996273825818278001;'/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/stateBased13351723549834392410.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 07:20:02] [INFO ] Flatten gal took : 12 ms
[2024-05-29 07:20:02] [INFO ] Flatten gal took : 9 ms
[2024-05-29 07:20:02] [INFO ] Time to serialize gal into /tmp/LTL14362339559508049165.gal : 2 ms
[2024-05-29 07:20:02] [INFO ] Time to serialize properties into /tmp/LTL10396396513578159911.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/LTL14362339559508049165.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5476584132537166902.hoa' '-atoms' '/tmp/LTL10396396513578159911.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10396396513578159911.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5476584132537166902.hoa
Detected timeout of ITS tools.
[2024-05-29 07:20:17] [INFO ] Flatten gal took : 8 ms
[2024-05-29 07:20:17] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:20:17] [INFO ] Time to serialize gal into /tmp/LTL7988633537770664340.gal : 2 ms
[2024-05-29 07:20:17] [INFO ] Time to serialize properties into /tmp/LTL17756350629574775305.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/LTL7988633537770664340.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17756350629574775305.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((p77==0)||(p119==0))"))||(G("((p11==1)&&(p23==1))")))))
Formula 0 simplified : G(F!"((p77==0)||(p119==0))" & F!"((p11==1)&&(p23==1))")
Detected timeout of ITS tools.
[2024-05-29 07:20:32] [INFO ] Flatten gal took : 12 ms
[2024-05-29 07:20:32] [INFO ] Applying decomposition
[2024-05-29 07:20:32] [INFO ] Flatten gal took : 8 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/graph10837712403244817530.txt' '-o' '/tmp/graph10837712403244817530.bin' '-w' '/tmp/graph10837712403244817530.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10837712403244817530.bin' '-l' '-1' '-v' '-w' '/tmp/graph10837712403244817530.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:20:32] [INFO ] Decomposing Gal with order
[2024-05-29 07:20:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:20:32] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 07:20:32] [INFO ] Flatten gal took : 14 ms
[2024-05-29 07:20:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 4 ms.
[2024-05-29 07:20:32] [INFO ] Time to serialize gal into /tmp/LTL1174958929738574564.gal : 3 ms
[2024-05-29 07:20:32] [INFO ] Time to serialize properties into /tmp/LTL12630350753923360145.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/LTL1174958929738574564.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12630350753923360145.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 : !((F((G("((i2.i1.u28.p77==0)||(i3.i2.u43.p119==0))"))||(G("((i0.i3.u4.p11==1)&&(i0.i3.u8.p23==1))")))))
Formula 0 simplified : G(F!"((i2.i1.u28.p77==0)||(i3.i2.u43.p119==0))" & F!"((i0.i3.u4.p11==1)&&(i0.i3.u8.p23==1))")
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-08 finished in 226140 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(X(p0))||F((X(p1)&&F(p2))))))'
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 6 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 07:20:47] [INFO ] Computed 111 invariants in 7 ms
[2024-05-29 07:20:47] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-29 07:20:47] [INFO ] Invariant cache hit.
[2024-05-29 07:20:48] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 07:20:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:20:53] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:20:57] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-29 07:20:57] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-29 07:20:58] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-29 07:20:58] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 07:20:58] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:20:58] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:20:59] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 17634 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:21:13] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:21:23] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 2/1009 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1009 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30027 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 10/10 constraints]
After SMT, in 47720ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 47723ms
Finished structural reductions in LTL mode , in 1 iterations and 48192 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-09
Product exploration explored 100000 steps with 456 reset in 343 ms.
Product exploration explored 100000 steps with 450 reset in 376 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 p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 150 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
RANDOM walk for 14704 steps (18 resets) in 75 ms. (193 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F p1), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p2 p1))), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 11 factoid took 396 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 400 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 240 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
[2024-05-29 07:21:38] [INFO ] Invariant cache hit.
[2024-05-29 07:21:38] [INFO ] [Real]Absence check using 111 positive place invariants in 34 ms returned sat
[2024-05-29 07:21:38] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2024-05-29 07:21:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:21:39] [INFO ] [Nat]Absence check using 111 positive place invariants in 52 ms returned sat
[2024-05-29 07:21:39] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2024-05-29 07:21:39] [INFO ] Computed and/alt/rep : 262/723/262 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-29 07:21:42] [INFO ] Added : 262 causal constraints over 55 iterations in 3600 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 2 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-29 07:21:43] [INFO ] Invariant cache hit.
[2024-05-29 07:21:43] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-29 07:21:43] [INFO ] Invariant cache hit.
[2024-05-29 07:21:43] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 07:21:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:21:48] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:21:52] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-29 07:21:52] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:21:53] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:21:53] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 07:21:53] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-29 07:21:53] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:21:54] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 17292 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:22:08] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30014 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 47339ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 47341ms
Finished structural reductions in LTL mode , in 1 iterations and 47800 ms. Remains : 313/313 places, 263/263 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 p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 127 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
RANDOM walk for 8570 steps (10 resets) in 64 ms. (131 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F p1), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p2 p1))), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 11 factoid took 464 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 312 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
[2024-05-29 07:22:32] [INFO ] Invariant cache hit.
[2024-05-29 07:22:32] [INFO ] [Real]Absence check using 111 positive place invariants in 35 ms returned sat
[2024-05-29 07:22:32] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2024-05-29 07:22:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:22:33] [INFO ] [Nat]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-05-29 07:22:33] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2024-05-29 07:22:33] [INFO ] Computed and/alt/rep : 262/723/262 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-29 07:22:36] [INFO ] Added : 262 causal constraints over 55 iterations in 3479 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 318 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 455 reset in 349 ms.
Product exploration explored 100000 steps with 453 reset in 381 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 297 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 313 transition count 263
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 34 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-29 07:22:38] [INFO ] Redundant transitions in 1 ms returned []
Running 262 sub problems to find dead transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 07:22:38] [INFO ] Computed 111 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:22:42] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-05-29 07:22:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
Problem TDEAD88 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 2/426 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/426 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/739 constraints. Problems are: Problem set: 2 solved, 260 unsolved
[2024-05-29 07:22:47] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 1/740 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/740 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/740 constraints. Problems are: Problem set: 2 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 740 constraints, problems are : Problem set: 2 solved, 260 unsolved in 16576 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 2 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 3/313 variables, 111/421 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 3/424 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 3/427 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/427 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/740 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 260/1000 constraints. Problems are: Problem set: 2 solved, 260 unsolved
[2024-05-29 07:23:01] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:23:02] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 2/1002 constraints. Problems are: Problem set: 2 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1002 constraints, problems are : Problem set: 2 solved, 260 unsolved in 30016 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 260/262 constraints, Known Traps: 5/5 constraints]
After SMT, in 46631ms problems are : Problem set: 2 solved, 260 unsolved
Search for dead transitions found 2 dead transitions in 46633ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 313/313 places, 261/263 transitions.
Graph (complete) has 822 edges and 313 vertex of which 311 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 20 ms. Remains 311 /313 variables (removed 2) and now considering 261/261 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46698 ms. Remains : 311/313 places, 261/263 transitions.
Built C files in :
/tmp/ltsmin17191481969710063136
[2024-05-29 07:23:25] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17191481969710063136
Running compilation step : cd /tmp/ltsmin17191481969710063136;'/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 505 ms.
Running link step : cd /tmp/ltsmin17191481969710063136;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17191481969710063136;'/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/stateBased14229441333832431713.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 6 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 07:23:40] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 07:23:40] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-29 07:23:40] [INFO ] Invariant cache hit.
[2024-05-29 07:23:40] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 07:23:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:23:46] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:23:50] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:23:50] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-29 07:23:50] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 07:23:50] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:23:50] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:23:51] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:23:52] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 18026 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:24:06] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30017 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 48073ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 48075ms
Finished structural reductions in LTL mode , in 1 iterations and 48498 ms. Remains : 313/313 places, 263/263 transitions.
Built C files in :
/tmp/ltsmin5587226130698834562
[2024-05-29 07:24:28] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5587226130698834562
Running compilation step : cd /tmp/ltsmin5587226130698834562;'/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 533 ms.
Running link step : cd /tmp/ltsmin5587226130698834562;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5587226130698834562;'/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/stateBased7654633085691918912.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 07:24:43] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:24:43] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:24:43] [INFO ] Time to serialize gal into /tmp/LTL1868397855307338687.gal : 2 ms
[2024-05-29 07:24:43] [INFO ] Time to serialize properties into /tmp/LTL6529089619680168871.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/LTL1868397855307338687.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1493647836595817318.hoa' '-atoms' '/tmp/LTL6529089619680168871.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6529089619680168871.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1493647836595817318.hoa
Detected timeout of ITS tools.
[2024-05-29 07:24:58] [INFO ] Flatten gal took : 10 ms
[2024-05-29 07:24:58] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:24:58] [INFO ] Time to serialize gal into /tmp/LTL5629985611877005292.gal : 1 ms
[2024-05-29 07:24:58] [INFO ] Time to serialize properties into /tmp/LTL9026143688229429456.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/LTL5629985611877005292.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9026143688229429456.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((X(X("((p15==1)&&(p57==1))")))||(F((X("((p104==1)&&(p116==1))"))&&(F("((p130==0)||(p147==0))")))))))
Formula 0 simplified : F(XX!"((p15==1)&&(p57==1))" & G(X!"((p104==1)&&(p116==1))" | G!"((p130==0)||(p147==0))"))
Detected timeout of ITS tools.
[2024-05-29 07:25:14] [INFO ] Flatten gal took : 11 ms
[2024-05-29 07:25:14] [INFO ] Applying decomposition
[2024-05-29 07:25:14] [INFO ] Flatten gal took : 7 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/graph11972388819693283105.txt' '-o' '/tmp/graph11972388819693283105.bin' '-w' '/tmp/graph11972388819693283105.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11972388819693283105.bin' '-l' '-1' '-v' '-w' '/tmp/graph11972388819693283105.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:25:14] [INFO ] Decomposing Gal with order
[2024-05-29 07:25:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:25:14] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 07:25:14] [INFO ] Flatten gal took : 14 ms
[2024-05-29 07:25:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 6 ms.
[2024-05-29 07:25:14] [INFO ] Time to serialize gal into /tmp/LTL13932897571621421072.gal : 3 ms
[2024-05-29 07:25:14] [INFO ] Time to serialize properties into /tmp/LTL3654910567653917140.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/LTL13932897571621421072.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3654910567653917140.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((X(X("((i0.u7.p15==1)&&(i1.u21.p57==1))")))||(F((X("((i3.u37.p104==1)&&(i3.u41.p116==1))"))&&(F("((i4.u46.p130==0)||(i4.u52.p147=...167
Formula 0 simplified : F(XX!"((i0.u7.p15==1)&&(i1.u21.p57==1))" & G(X!"((i3.u37.p104==1)&&(i3.u41.p116==1))" | G!"((i4.u46.p130==0)||(i4.u52.p147==0))"))
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-09 finished in 281466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 18 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 07:25:29] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 07:25:29] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-29 07:25:29] [INFO ] Invariant cache hit.
[2024-05-29 07:25:29] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2024-05-29 07:25:29] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:25:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:25:36] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:25:41] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:25:42] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19058 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:26:14] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:26:16] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30010 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49103ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49106ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49560 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-10
Product exploration explored 100000 steps with 2173 reset in 280 ms.
Product exploration explored 100000 steps with 2157 reset in 314 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 (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 217 steps (0 resets) in 6 ms. (31 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 124 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 79 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
[2024-05-29 07:26:20] [INFO ] Invariant cache hit.
[2024-05-29 07:26:20] [INFO ] [Real]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-05-29 07:26:20] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2024-05-29 07:26:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:26:20] [INFO ] [Nat]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-05-29 07:26:20] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2024-05-29 07:26:21] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-29 07:26:24] [INFO ] Added : 259 causal constraints over 56 iterations in 3038 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 311 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 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:26:24] [INFO ] Invariant cache hit.
[2024-05-29 07:26:24] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-29 07:26:24] [INFO ] Invariant cache hit.
[2024-05-29 07:26:24] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2024-05-29 07:26:24] [INFO ] Redundant transitions in 0 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:26:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:26:31] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:26:35] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:26:36] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18698 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:27:08] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-29 07:27:10] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30014 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48754ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48757ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49195 ms. Remains : 311/311 places, 261/261 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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 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 83 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 173 steps (0 resets) in 5 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 95 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 74 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
[2024-05-29 07:27:13] [INFO ] Invariant cache hit.
[2024-05-29 07:27:13] [INFO ] [Real]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-05-29 07:27:14] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2024-05-29 07:27:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:27:14] [INFO ] [Nat]Absence check using 111 positive place invariants in 32 ms returned sat
[2024-05-29 07:27:14] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2024-05-29 07:27:14] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-29 07:27:17] [INFO ] Added : 259 causal constraints over 56 iterations in 3211 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2167 reset in 279 ms.
Product exploration explored 100000 steps with 2172 reset in 312 ms.
Built C files in :
/tmp/ltsmin6074152956707139011
[2024-05-29 07:27:18] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:27:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:27:18] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:27:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:27:18] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:27:18] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:27:18] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6074152956707139011
Running compilation step : cd /tmp/ltsmin6074152956707139011;'/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 619 ms.
Running link step : cd /tmp/ltsmin6074152956707139011;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6074152956707139011;'/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/stateBased14447565526929355717.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 11 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:27:33] [INFO ] Invariant cache hit.
[2024-05-29 07:27:33] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-29 07:27:33] [INFO ] Invariant cache hit.
[2024-05-29 07:27:34] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2024-05-29 07:27:34] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:27:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:27:41] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:27:45] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:27:46] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18964 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:28:18] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:28:20] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30021 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49013ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49015ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49460 ms. Remains : 311/311 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin8412992913528138480
[2024-05-29 07:28:23] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:28:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:28:23] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:28:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:28:23] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:28:23] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:28:23] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8412992913528138480
Running compilation step : cd /tmp/ltsmin8412992913528138480;'/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 626 ms.
Running link step : cd /tmp/ltsmin8412992913528138480;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8412992913528138480;'/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/stateBased4373601844593255847.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 07:28:38] [INFO ] Flatten gal took : 9 ms
[2024-05-29 07:28:38] [INFO ] Flatten gal took : 6 ms
[2024-05-29 07:28:38] [INFO ] Time to serialize gal into /tmp/LTL17374887975406005537.gal : 2 ms
[2024-05-29 07:28:38] [INFO ] Time to serialize properties into /tmp/LTL1399997168381882915.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/LTL17374887975406005537.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10548423764025287776.hoa' '-atoms' '/tmp/LTL1399997168381882915.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1399997168381882915.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10548423764025287776.hoa
Detected timeout of ITS tools.
[2024-05-29 07:28:53] [INFO ] Flatten gal took : 8 ms
[2024-05-29 07:28:53] [INFO ] Flatten gal took : 6 ms
[2024-05-29 07:28:53] [INFO ] Time to serialize gal into /tmp/LTL6512432297951747391.gal : 14 ms
[2024-05-29 07:28:53] [INFO ] Time to serialize properties into /tmp/LTL1620560891476988042.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/LTL6512432297951747391.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1620560891476988042.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G("((p111==1)&&(p122==1))"))||(F("((p221==1)&&(p242==1))"))))
Formula 0 simplified : F!"((p111==1)&&(p122==1))" & G!"((p221==1)&&(p242==1))"
Detected timeout of ITS tools.
[2024-05-29 07:29:08] [INFO ] Flatten gal took : 12 ms
[2024-05-29 07:29:08] [INFO ] Applying decomposition
[2024-05-29 07:29:08] [INFO ] Flatten gal took : 7 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/graph15143015648638073802.txt' '-o' '/tmp/graph15143015648638073802.bin' '-w' '/tmp/graph15143015648638073802.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15143015648638073802.bin' '-l' '-1' '-v' '-w' '/tmp/graph15143015648638073802.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:29:08] [INFO ] Decomposing Gal with order
[2024-05-29 07:29:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:29:08] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 07:29:08] [INFO ] Flatten gal took : 19 ms
[2024-05-29 07:29:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 5 ms.
[2024-05-29 07:29:08] [INFO ] Time to serialize gal into /tmp/LTL8611099382524287527.gal : 3 ms
[2024-05-29 07:29:08] [INFO ] Time to serialize properties into /tmp/LTL11540192316051563149.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/LTL8611099382524287527.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11540192316051563149.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("((i3.i3.u40.p111==1)&&(i3.i3.u43.p122==1))"))||(F("((i7.i0.u78.p221==1)&&(i7.i0.u86.p242==1))"))))
Formula 0 simplified : F!"((i3.i3.u40.p111==1)&&(i3.i3.u43.p122==1))" & G!"((i7.i0.u78.p221==1)&&(i7.i0.u86.p242==1))"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-10 finished in 234376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 07:29:23] [INFO ] Computed 111 invariants in 1 ms
[2024-05-29 07:29:23] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-29 07:29:23] [INFO ] Invariant cache hit.
[2024-05-29 07:29:23] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 07:29:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:29:29] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:29:33] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:29:33] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:29:33] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 07:29:34] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:29:34] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:29:34] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:29:35] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 17785 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:29:49] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30015 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 47834ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 47836ms
Finished structural reductions in LTL mode , in 1 iterations and 48249 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-12
Product exploration explored 100000 steps with 674 reset in 362 ms.
Product exploration explored 100000 steps with 633 reset in 396 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) p0), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 1176 steps (0 resets) in 11 ms. (98 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 101 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 59 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p1), (NOT p1)]
[2024-05-29 07:30:13] [INFO ] Invariant cache hit.
[2024-05-29 07:30:13] [INFO ] [Real]Absence check using 111 positive place invariants in 38 ms returned sat
[2024-05-29 07:30:13] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2024-05-29 07:30:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:30:13] [INFO ] [Nat]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-05-29 07:30:14] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2024-05-29 07:30:14] [INFO ] Computed and/alt/rep : 262/723/262 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-29 07:30:18] [INFO ] Added : 260 causal constraints over 55 iterations in 3883 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 313 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 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 16 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 07:30:18] [INFO ] Computed 111 invariants in 1 ms
[2024-05-29 07:30:18] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-29 07:30:18] [INFO ] Invariant cache hit.
[2024-05-29 07:30:18] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2024-05-29 07:30:18] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:30:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:30:25] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:30:29] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-29 07:30:30] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18131 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:31:02] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:31:04] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30035 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48206ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48209ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48752 ms. Remains : 311/313 places, 261/263 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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 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 62 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 1092 steps (0 resets) in 9 ms. (109 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 88 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 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
[2024-05-29 07:31:07] [INFO ] Invariant cache hit.
[2024-05-29 07:31:07] [INFO ] [Real]Absence check using 111 positive place invariants in 39 ms returned sat
[2024-05-29 07:31:07] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2024-05-29 07:31:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:31:07] [INFO ] [Nat]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-05-29 07:31:07] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2024-05-29 07:31:08] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-29 07:31:10] [INFO ] Added : 247 causal constraints over 53 iterations in 2696 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 357 reset in 347 ms.
Product exploration explored 100000 steps with 353 reset in 386 ms.
Built C files in :
/tmp/ltsmin899078209413997834
[2024-05-29 07:31:11] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:31:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:31:11] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:31:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:31:11] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:31:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:31:11] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin899078209413997834
Running compilation step : cd /tmp/ltsmin899078209413997834;'/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 597 ms.
Running link step : cd /tmp/ltsmin899078209413997834;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin899078209413997834;'/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/stateBased16286122890284810641.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 4 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:31:26] [INFO ] Invariant cache hit.
[2024-05-29 07:31:26] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-29 07:31:26] [INFO ] Invariant cache hit.
[2024-05-29 07:31:27] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2024-05-29 07:31:27] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:31:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:31:34] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:31:38] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:31:39] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18441 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:32:11] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-29 07:32:12] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30016 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48500ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48503ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48987 ms. Remains : 311/311 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin7323671048454321812
[2024-05-29 07:32:15] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:32:15] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:32:15] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:32:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:32:15] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:32:15] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:32:15] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7323671048454321812
Running compilation step : cd /tmp/ltsmin7323671048454321812;'/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 638 ms.
Running link step : cd /tmp/ltsmin7323671048454321812;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7323671048454321812;'/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/stateBased2000929399618148929.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 07:32:30] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:32:30] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:32:30] [INFO ] Time to serialize gal into /tmp/LTL11370497493749161857.gal : 2 ms
[2024-05-29 07:32:30] [INFO ] Time to serialize properties into /tmp/LTL1409186807635508553.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/LTL11370497493749161857.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12905737739520186733.hoa' '-atoms' '/tmp/LTL1409186807635508553.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1409186807635508553.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12905737739520186733.hoa
Detected timeout of ITS tools.
[2024-05-29 07:32:45] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:32:45] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:32:45] [INFO ] Time to serialize gal into /tmp/LTL15179181292514334384.gal : 2 ms
[2024-05-29 07:32:45] [INFO ] Time to serialize properties into /tmp/LTL14215782729831527142.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/LTL15179181292514334384.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14215782729831527142.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 : !(((X("((((p49==1)&&(p60==1))||(p67==0))||(p86==0))"))&&(F("((p67==1)&&(p86==1))"))))
Formula 0 simplified : X!"((((p49==1)&&(p60==1))||(p67==0))||(p86==0))" | G!"((p67==1)&&(p86==1))"
Detected timeout of ITS tools.
[2024-05-29 07:33:00] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:33:00] [INFO ] Applying decomposition
[2024-05-29 07:33:00] [INFO ] Flatten gal took : 7 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/graph11817099925646690103.txt' '-o' '/tmp/graph11817099925646690103.bin' '-w' '/tmp/graph11817099925646690103.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11817099925646690103.bin' '-l' '-1' '-v' '-w' '/tmp/graph11817099925646690103.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:33:01] [INFO ] Decomposing Gal with order
[2024-05-29 07:33:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:33:01] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 07:33:01] [INFO ] Flatten gal took : 25 ms
[2024-05-29 07:33:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 3 ms.
[2024-05-29 07:33:01] [INFO ] Time to serialize gal into /tmp/LTL14010627167932682851.gal : 17 ms
[2024-05-29 07:33:01] [INFO ] Time to serialize properties into /tmp/LTL14118002700625435078.ltl : 15 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/LTL14010627167932682851.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14118002700625435078.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...256
Read 1 LTL properties
Checking formula 0 : !(((X("((((i1.i0.u18.p49==1)&&(i1.i0.u21.p60==1))||(i2.i2.u24.p67==0))||(i2.i3.u31.p86==0))"))&&(F("((i2.i2.u24.p67==1)&&(i2.i3.u31.p8...166
Formula 0 simplified : X!"((((i1.i0.u18.p49==1)&&(i1.i0.u21.p60==1))||(i2.i2.u24.p67==0))||(i2.i3.u31.p86==0))" | G!"((i2.i2.u24.p67==1)&&(i2.i3.u31.p86==1...158
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-12 finished in 232624 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)))'
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 07:33:16] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 07:33:16] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-29 07:33:16] [INFO ] Invariant cache hit.
[2024-05-29 07:33:16] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 07:33:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:33:21] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:33:25] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:33:25] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:33:26] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:33:26] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-29 07:33:26] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 07:33:26] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 07:33:27] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 17629 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:33:42] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-29 07:33:52] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 2/1009 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1009 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30020 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 10/10 constraints]
After SMT, in 47681ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 47683ms
Finished structural reductions in LTL mode , in 1 iterations and 48131 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-13
Stuttering criterion allowed to conclude after 13852 steps with 40 reset in 55 ms.
FORMULA ShieldPPPs-PT-010A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010A-LTLFireability-13 finished in 48289 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||G(p1)||G((F(p2)&&F(p3)))))))'
Support contains 7 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 11 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 07:34:04] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 07:34:04] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-29 07:34:04] [INFO ] Invariant cache hit.
[2024-05-29 07:34:04] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2024-05-29 07:34:04] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:34:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:34:12] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:34:16] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:34:17] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19160 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:34:49] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:34:51] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 8 ms to minimize.
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 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30020 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49214ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49216ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49655 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-14
Product exploration explored 100000 steps with 368 reset in 389 ms.
Product exploration explored 100000 steps with 365 reset in 420 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 p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p1) (NOT p3) (NOT p0))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 227 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
RANDOM walk for 4895 steps (5 resets) in 47 ms. (101 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p1) (NOT p3) (NOT p0))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1) p3))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (OR p0 (NOT p1) p2))), (F p0), (F p2), (F p3), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p1)]
Knowledge based reduction with 17 factoid took 360 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
[2024-05-29 07:34:56] [INFO ] Invariant cache hit.
[2024-05-29 07:34:56] [INFO ] [Real]Absence check using 111 positive place invariants in 31 ms returned sat
[2024-05-29 07:34:56] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2024-05-29 07:34:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:34:56] [INFO ] [Nat]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-05-29 07:34:57] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2024-05-29 07:34:57] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-29 07:34:59] [INFO ] Added : 257 causal constraints over 53 iterations in 2482 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
[2024-05-29 07:34:59] [INFO ] Invariant cache hit.
[2024-05-29 07:34:59] [INFO ] [Real]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-05-29 07:35:00] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2024-05-29 07:35:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:35:00] [INFO ] [Nat]Absence check using 111 positive place invariants in 31 ms returned sat
[2024-05-29 07:35:00] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2024-05-29 07:35:00] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-29 07:35:03] [INFO ] Added : 235 causal constraints over 47 iterations in 3247 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p3))
Support contains 7 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 7 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:35:03] [INFO ] Invariant cache hit.
[2024-05-29 07:35:03] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-29 07:35:03] [INFO ] Invariant cache hit.
[2024-05-29 07:35:04] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2024-05-29 07:35:04] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:35:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:35:11] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:35:15] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:35:16] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18953 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:35:48] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:35:50] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30015 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48998ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49001ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49437 ms. Remains : 311/311 places, 261/261 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) (NOT p2) (NOT p3)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p3)), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 115 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
RANDOM walk for 2336 steps (1 resets) in 26 ms. (86 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p3)), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1) p3))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (OR p0 (NOT p1) p2))), (F p0), (F p2), (F p3), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p1)]
Knowledge based reduction with 17 factoid took 341 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
[2024-05-29 07:35:54] [INFO ] Invariant cache hit.
[2024-05-29 07:35:54] [INFO ] [Real]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-05-29 07:35:54] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2024-05-29 07:35:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:35:54] [INFO ] [Nat]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-05-29 07:35:55] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2024-05-29 07:35:55] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-29 07:35:57] [INFO ] Added : 257 causal constraints over 53 iterations in 2483 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
[2024-05-29 07:35:57] [INFO ] Invariant cache hit.
[2024-05-29 07:35:57] [INFO ] [Real]Absence check using 111 positive place invariants in 40 ms returned sat
[2024-05-29 07:35:57] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2024-05-29 07:35:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:35:58] [INFO ] [Nat]Absence check using 111 positive place invariants in 30 ms returned sat
[2024-05-29 07:35:58] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2024-05-29 07:35:58] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-29 07:36:01] [INFO ] Added : 235 causal constraints over 47 iterations in 3424 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p3))
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 367 reset in 372 ms.
Product exploration explored 100000 steps with 377 reset in 406 ms.
Built C files in :
/tmp/ltsmin13973580003616613198
[2024-05-29 07:36:02] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:36:02] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:36:02] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:36:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:36:02] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:36:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:36:02] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13973580003616613198
Running compilation step : cd /tmp/ltsmin13973580003616613198;'/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 620 ms.
Running link step : cd /tmp/ltsmin13973580003616613198;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13973580003616613198;'/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/stateBased1434158349012586446.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:36:17] [INFO ] Invariant cache hit.
[2024-05-29 07:36:18] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-29 07:36:18] [INFO ] Invariant cache hit.
[2024-05-29 07:36:18] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2024-05-29 07:36:18] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:36:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:36:25] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:36:29] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:36:30] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18790 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:37:02] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:37:04] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30011 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48834ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48837ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49265 ms. Remains : 311/311 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin294267774535666499
[2024-05-29 07:37:07] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:37:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:37:07] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:37:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:37:07] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:37:07] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:37:07] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin294267774535666499
Running compilation step : cd /tmp/ltsmin294267774535666499;'/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 623 ms.
Running link step : cd /tmp/ltsmin294267774535666499;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin294267774535666499;'/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/stateBased8453173932541379446.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 07:37:22] [INFO ] Flatten gal took : 9 ms
[2024-05-29 07:37:22] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:37:22] [INFO ] Time to serialize gal into /tmp/LTL7141003711870496517.gal : 1 ms
[2024-05-29 07:37:22] [INFO ] Time to serialize properties into /tmp/LTL964722181248795613.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/LTL7141003711870496517.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6238923054493219681.hoa' '-atoms' '/tmp/LTL964722181248795613.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...316
Loading property file /tmp/LTL964722181248795613.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6238923054493219681.hoa
Detected timeout of ITS tools.
[2024-05-29 07:37:37] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:37:37] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:37:37] [INFO ] Time to serialize gal into /tmp/LTL9496462126615075838.gal : 2 ms
[2024-05-29 07:37:37] [INFO ] Time to serialize properties into /tmp/LTL914427344290621956.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/LTL9496462126615075838.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL914427344290621956.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(F(((G("(p269==1)"))||(G((F("((p101==1)&&(p122==1))"))&&(F("((p223==1)&&(p239==1))")))))||("((p1==1)&&(p26==1))")))))
Formula 0 simplified : G(F!"(p269==1)" & F(G!"((p101==1)&&(p122==1))" | G!"((p223==1)&&(p239==1))") & FG!"((p1==1)&&(p26==1))")
Detected timeout of ITS tools.
[2024-05-29 07:37:52] [INFO ] Flatten gal took : 11 ms
[2024-05-29 07:37:52] [INFO ] Applying decomposition
[2024-05-29 07:37:52] [INFO ] Flatten gal took : 7 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/graph10763160017835034620.txt' '-o' '/tmp/graph10763160017835034620.bin' '-w' '/tmp/graph10763160017835034620.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10763160017835034620.bin' '-l' '-1' '-v' '-w' '/tmp/graph10763160017835034620.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:37:52] [INFO ] Decomposing Gal with order
[2024-05-29 07:37:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:37:52] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 07:37:52] [INFO ] Flatten gal took : 12 ms
[2024-05-29 07:37:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 3 ms.
[2024-05-29 07:37:52] [INFO ] Time to serialize gal into /tmp/LTL9281427413503388101.gal : 3 ms
[2024-05-29 07:37:52] [INFO ] Time to serialize properties into /tmp/LTL10712223697645564846.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/LTL9281427413503388101.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10712223697645564846.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(((G("(i8.i0.u96.p269==1)"))||(G((F("((i3.i0.u36.p101==1)&&(i3.i0.u43.p122==1))"))&&(F("((i7.i1.u79.p223==1)&&(i7.i1.u85.p239==1...211
Formula 0 simplified : G(F!"(i8.i0.u96.p269==1)" & F(G!"((i3.i0.u36.p101==1)&&(i3.i0.u43.p122==1))" | G!"((i7.i1.u79.p223==1)&&(i7.i1.u85.p239==1))") & FG!...196
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-14 finished in 243126 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&&(p1||F(p2))))))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 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 312 transition count 262
Applied a total of 2 rules in 7 ms. Remains 312 /313 variables (removed 1) and now considering 262/263 (removed 1) transitions.
// Phase 1: matrix 262 rows 312 cols
[2024-05-29 07:38:07] [INFO ] Computed 111 invariants in 3 ms
[2024-05-29 07:38:07] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-29 07:38:07] [INFO ] Invariant cache hit.
[2024-05-29 07:38:08] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2024-05-29 07:38:08] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-29 07:38:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 311/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 111/422 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 262/574 variables, 312/735 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 07:38:17] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:38:18] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:38:18] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-29 07:38:18] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-29 07:38:19] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/574 variables, 5/740 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 07:38:20] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:38:20] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 2/742 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 07:38:25] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
[2024-05-29 07:38:26] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:38:26] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:38:26] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:38:26] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/574 variables, 5/747 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 07:38:28] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 13 (OVERLAPS) 0/574 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 748 constraints, problems are : Problem set: 0 solved, 261 unsolved in 26803 ms.
Refiners :[Domain max(s): 312/312 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 311/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 111/422 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 13/436 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 261/1009 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 07:39:02] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 1010 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30019 ms.
Refiners :[Domain max(s): 312/312 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 14/14 constraints]
After SMT, in 56852ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 56855ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 262/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57299 ms. Remains : 312/313 places, 262/263 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-15
Product exploration explored 100000 steps with 7283 reset in 304 ms.
Product exploration explored 100000 steps with 7177 reset in 343 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) p2), (X p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 160 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (55 resets) in 230 ms. (173 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
[2024-05-29 07:39:06] [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, 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, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 302/312 variables, 108/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 302/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 262/574 variables, 312/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/574 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 735 constraints, problems are : Problem set: 0 solved, 1 unsolved in 153 ms.
Refiners :[Domain max(s): 312/312 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 4/574 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Domain max(s): 4/312 constraints, Positive P Invariants (semi-flows): 0/111 constraints, State Equation: 0/312 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (G (OR p2 (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (OR p2 p0) (OR p2 p1)))), (F p1), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 330 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-29 07:39:06] [INFO ] Invariant cache hit.
[2024-05-29 07:39:06] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-29 07:39:06] [INFO ] Invariant cache hit.
[2024-05-29 07:39:07] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2024-05-29 07:39:07] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-29 07:39:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 311/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 111/422 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 262/574 variables, 312/735 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 07:39:16] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:39:17] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:39:17] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 07:39:18] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-29 07:39:18] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/574 variables, 5/740 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 07:39:19] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 07:39:20] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 2/742 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 07:39:24] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:39:25] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:39:25] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:39:25] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-29 07:39:25] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/574 variables, 5/747 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 07:39:27] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 13 (OVERLAPS) 0/574 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 748 constraints, problems are : Problem set: 0 solved, 261 unsolved in 26862 ms.
Refiners :[Domain max(s): 312/312 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 311/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 111/422 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 13/436 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 261/1009 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 07:40:01] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 1010 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30014 ms.
Refiners :[Domain max(s): 312/312 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 14/14 constraints]
After SMT, in 56908ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 56910ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57330 ms. Remains : 312/312 places, 262/262 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 p2), (X p2), (X (NOT (AND (NOT p2) p0))), (X p0), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 138 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 16 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2), (X p2), (X (NOT (AND (NOT p2) p0))), (X p0), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X p0))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 7 factoid took 187 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 7313 reset in 346 ms.
Product exploration explored 100000 steps with 7428 reset in 347 ms.
Built C files in :
/tmp/ltsmin11166047911262506216
[2024-05-29 07:40:05] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-29 07:40:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:40:05] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-29 07:40:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:40:05] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-29 07:40:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:40:05] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11166047911262506216
Running compilation step : cd /tmp/ltsmin11166047911262506216;'/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 636 ms.
Running link step : cd /tmp/ltsmin11166047911262506216;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11166047911262506216;'/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/stateBased2440943263433383649.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 11 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-29 07:40:20] [INFO ] Invariant cache hit.
[2024-05-29 07:40:20] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-29 07:40:20] [INFO ] Invariant cache hit.
[2024-05-29 07:40:20] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2024-05-29 07:40:20] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-29 07:40:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 311/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 111/422 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 262/574 variables, 312/735 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 07:40:30] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 07:40:31] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:40:31] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:40:31] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-29 07:40:31] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/574 variables, 5/740 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 07:40:32] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:40:33] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 2/742 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 07:40:38] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:40:38] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:40:39] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:40:39] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:40:39] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/574 variables, 5/747 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 07:40:41] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 13 (OVERLAPS) 0/574 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 748 constraints, problems are : Problem set: 0 solved, 261 unsolved in 26647 ms.
Refiners :[Domain max(s): 312/312 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 311/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 111/422 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 13/436 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 261/1009 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-29 07:41:15] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 1010 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30015 ms.
Refiners :[Domain max(s): 312/312 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 14/14 constraints]
After SMT, in 56694ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 56696ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57129 ms. Remains : 312/312 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin2174799640621542657
[2024-05-29 07:41:17] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-29 07:41:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:41:17] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-29 07:41:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:41:17] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-29 07:41:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:41:17] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2174799640621542657
Running compilation step : cd /tmp/ltsmin2174799640621542657;'/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 625 ms.
Running link step : cd /tmp/ltsmin2174799640621542657;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2174799640621542657;'/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/stateBased17587289271879643800.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 07:41:32] [INFO ] Flatten gal took : 9 ms
[2024-05-29 07:41:32] [INFO ] Flatten gal took : 21 ms
[2024-05-29 07:41:32] [INFO ] Time to serialize gal into /tmp/LTL16777335400492184651.gal : 2 ms
[2024-05-29 07:41:32] [INFO ] Time to serialize properties into /tmp/LTL7628543020189127446.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/LTL16777335400492184651.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13371750100448525173.hoa' '-atoms' '/tmp/LTL7628543020189127446.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7628543020189127446.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13371750100448525173.hoa
Detected timeout of ITS tools.
[2024-05-29 07:41:47] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:41:47] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:41:47] [INFO ] Time to serialize gal into /tmp/LTL8909961867753819260.gal : 1 ms
[2024-05-29 07:41:47] [INFO ] Time to serialize properties into /tmp/LTL16979915297751036857.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/LTL8909961867753819260.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16979915297751036857.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p296==0)||(p298==0))")&&((F("((p295==0)||(p312==0))"))||("((p296==1)&&(p298==1))"))))))
Formula 0 simplified : GF(!"((p296==0)||(p298==0))" | (!"((p296==1)&&(p298==1))" & G!"((p295==0)||(p312==0))"))
Detected timeout of ITS tools.
[2024-05-29 07:42:02] [INFO ] Flatten gal took : 12 ms
[2024-05-29 07:42:02] [INFO ] Applying decomposition
[2024-05-29 07:42:02] [INFO ] Flatten gal took : 7 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/graph15213212877756184294.txt' '-o' '/tmp/graph15213212877756184294.bin' '-w' '/tmp/graph15213212877756184294.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15213212877756184294.bin' '-l' '-1' '-v' '-w' '/tmp/graph15213212877756184294.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:42:02] [INFO ] Decomposing Gal with order
[2024-05-29 07:42:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:42:02] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 07:42:03] [INFO ] Flatten gal took : 13 ms
[2024-05-29 07:42:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 5 ms.
[2024-05-29 07:42:03] [INFO ] Time to serialize gal into /tmp/LTL13530548568070720424.gal : 3 ms
[2024-05-29 07:42:03] [INFO ] Time to serialize properties into /tmp/LTL67355416731836180.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/LTL13530548568070720424.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL67355416731836180.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...253
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i9.i1.u105.p296==0)||(i9.i1.u106.p298==0))")&&((F("((i9.i1.u105.p295==0)||(i9.i0.u110.p312==0))"))||("((i9.i1.u105.p296==1)...185
Formula 0 simplified : GF(!"((i9.i1.u105.p296==0)||(i9.i1.u106.p298==0))" | (!"((i9.i1.u105.p296==1)&&(i9.i1.u106.p298==1))" & G!"((i9.i1.u105.p295==0)||(i...177
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-15 finished in 250501 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))||(X(p1)&&G(p2)))))'
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)||G(F(p1)))))'
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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(!p0&&G(F(!p1)))))'
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)))'
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)||G(p1))))'
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(X(p0))||F((X(p1)&&F(p2))))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-010A-LTLFireability-09
Stuttering acceptance computed with spot in 316 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 9 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 07:42:19] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 07:42:19] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-29 07:42:19] [INFO ] Invariant cache hit.
[2024-05-29 07:42:19] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-05-29 07:42:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:42:26] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:42:30] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:42:31] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18736 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:43:03] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:43:05] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30017 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48785ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48787ms
Starting structural reductions in LI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 49208 ms. Remains : 311/313 places, 261/263 transitions.
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-09
Product exploration explored 100000 steps with 472 reset in 342 ms.
Product exploration explored 100000 steps with 465 reset in 384 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 p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 127 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
RANDOM walk for 3782 steps (3 resets) in 32 ms. (114 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F p1), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p2 p1))), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 11 factoid took 445 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 317 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
[2024-05-29 07:43:10] [INFO ] Invariant cache hit.
[2024-05-29 07:43:10] [INFO ] [Real]Absence check using 111 positive place invariants in 30 ms returned sat
[2024-05-29 07:43:10] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2024-05-29 07:43:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:43:11] [INFO ] [Nat]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-05-29 07:43:11] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2024-05-29 07:43:11] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-29 07:43:14] [INFO ] Added : 258 causal constraints over 54 iterations in 2742 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 3 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:43:14] [INFO ] Invariant cache hit.
[2024-05-29 07:43:14] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-29 07:43:14] [INFO ] Invariant cache hit.
[2024-05-29 07:43:14] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-05-29 07:43:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:43:21] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:43:25] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:43:26] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18962 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:43:59] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:44:01] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 1)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 1)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 1)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 1)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 1)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 1)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 1)
(s209 0)
(s210 0)
(s211 1)
(s212 0)
(s213 0)
(s214 1)
(s215 0)
(s216 1)
(s217 0)
(s218 0)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(s223 0)
(s224 1)
(s225 0)
(s226 1)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 1)
(s232 0)
(s233 0)
(s234 1)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 1)
(s256 1)
(s257 0)
(s258 0)
(s259 1)
(s260 0)
(s261 0)
(s262 1)
(s263 0)
(s264 0)
(s265 1)
(s266 0)
(s267 1)
(s268 0)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 1)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 0)
(s279 0)
(s280 1)
(s281 0)
(s282 1)
(s283 0)
(s284 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30020 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49019ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49023ms
Finished structural reductions in LTL mode , in 1 iterations and 49432 ms. Remains : 311/311 places, 261/261 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 p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 117 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
RANDOM walk for 4738 steps (4 resets) in 69 ms. (67 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F p1), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p2 p1))), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 11 factoid took 429 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 300 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
[2024-05-29 07:44:05] [INFO ] Invariant cache hit.
[2024-05-29 07:44:05] [INFO ] [Real]Absence check using 111 positive place invariants in 31 ms returned sat
[2024-05-29 07:44:05] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2024-05-29 07:44:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:44:05] [INFO ] [Nat]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-05-29 07:44:06] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2024-05-29 07:44:06] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-29 07:44:08] [INFO ] Added : 258 causal constraints over 54 iterations in 2855 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 303 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 465 reset in 362 ms.
Product exploration explored 100000 steps with 463 reset in 396 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 308 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
Support contains 6 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 6 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:44:10] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:44:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:44:17] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:44:21] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:44:22] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18686 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:44:54] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-29 07:44:56] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30011 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48731ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48734ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48747 ms. Remains : 311/311 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin8137022030605331842
[2024-05-29 07:44:59] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8137022030605331842
Running compilation step : cd /tmp/ltsmin8137022030605331842;'/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 493 ms.
Running link step : cd /tmp/ltsmin8137022030605331842;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8137022030605331842;'/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/stateBased2294944272430141963.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 3 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:45:14] [INFO ] Invariant cache hit.
[2024-05-29 07:45:14] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-29 07:45:14] [INFO ] Invariant cache hit.
[2024-05-29 07:45:14] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-05-29 07:45:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:45:21] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:45:26] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:45:27] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18835 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:45:59] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:46:01] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30020 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48888ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48890ms
Finished structural reductions in LTL mode , in 1 iterations and 49432 ms. Remains : 311/311 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin17173393918471966745
[2024-05-29 07:46:03] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17173393918471966745
Running compilation step : cd /tmp/ltsmin17173393918471966745;'/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 509 ms.
Running link step : cd /tmp/ltsmin17173393918471966745;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17173393918471966745;'/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/stateBased16721377362634501498.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 07:46:18] [INFO ] Flatten gal took : 8 ms
[2024-05-29 07:46:18] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:46:18] [INFO ] Time to serialize gal into /tmp/LTL16638971006101261672.gal : 2 ms
[2024-05-29 07:46:18] [INFO ] Time to serialize properties into /tmp/LTL6440234472628484283.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16638971006101261672.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2925739389813502027.hoa' '-atoms' '/tmp/LTL6440234472628484283.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/LTL6440234472628484283.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2925739389813502027.hoa
Detected timeout of ITS tools.
[2024-05-29 07:46:33] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:46:33] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:46:33] [INFO ] Time to serialize gal into /tmp/LTL3008795369859224141.gal : 1 ms
[2024-05-29 07:46:33] [INFO ] Time to serialize properties into /tmp/LTL4812819145095598511.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/LTL3008795369859224141.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4812819145095598511.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((X(X("((p15==1)&&(p57==1))")))||(F((X("((p104==1)&&(p116==1))"))&&(F("((p130==0)||(p147==0))")))))))
Formula 0 simplified : F(XX!"((p15==1)&&(p57==1))" & G(X!"((p104==1)&&(p116==1))" | G!"((p130==0)||(p147==0))"))
Detected timeout of ITS tools.
[2024-05-29 07:46:48] [INFO ] Flatten gal took : 8 ms
[2024-05-29 07:46:48] [INFO ] Applying decomposition
[2024-05-29 07:46:48] [INFO ] Flatten gal took : 8 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/graph2349408223196987639.txt' '-o' '/tmp/graph2349408223196987639.bin' '-w' '/tmp/graph2349408223196987639.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2349408223196987639.bin' '-l' '-1' '-v' '-w' '/tmp/graph2349408223196987639.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:46:48] [INFO ] Decomposing Gal with order
[2024-05-29 07:46:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:46:48] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 07:46:48] [INFO ] Flatten gal took : 13 ms
[2024-05-29 07:46:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 3 ms.
[2024-05-29 07:46:48] [INFO ] Time to serialize gal into /tmp/LTL11742803151011433332.gal : 3 ms
[2024-05-29 07:46:48] [INFO ] Time to serialize properties into /tmp/LTL16519212112861425789.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/LTL11742803151011433332.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16519212112861425789.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...256
Read 1 LTL properties
Checking formula 0 : !((G((X(X("((i0.i0.u6.p15==1)&&(i1.i3.u21.p57==1))")))||(F((X("((i3.i3.u37.p104==1)&&(i3.i3.u41.p116==1))"))&&(F("((i4.i0.u46.p130==0)...185
Formula 0 simplified : F(XX!"((i0.i0.u6.p15==1)&&(i1.i3.u21.p57==1))" & G(X!"((i3.i3.u37.p104==1)&&(i3.i3.u41.p116==1))" | G!"((i4.i0.u46.p130==0)||(i4.i0....171
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-09 finished in 285282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
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||G(p1)||G((F(p2)&&F(p3)))))))'
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&&(p1||F(p2))))))'
[2024-05-29 07:47:04] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8715196154644336555
[2024-05-29 07:47:04] [INFO ] Applying decomposition
[2024-05-29 07:47:04] [INFO ] Computing symmetric may disable matrix : 263 transitions.
[2024-05-29 07:47:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:47:04] [INFO ] Computing symmetric may enable matrix : 263 transitions.
[2024-05-29 07:47:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:47:04] [INFO ] Flatten gal took : 16 ms
[2024-05-29 07:47:04] [INFO ] Computing Do-Not-Accords matrix : 263 transitions.
[2024-05-29 07:47:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:47:04] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8715196154644336555
Running compilation step : cd /tmp/ltsmin8715196154644336555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '65' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7128148088715014408.txt' '-o' '/tmp/graph7128148088715014408.bin' '-w' '/tmp/graph7128148088715014408.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7128148088715014408.bin' '-l' '-1' '-v' '-w' '/tmp/graph7128148088715014408.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:47:04] [INFO ] Decomposing Gal with order
[2024-05-29 07:47:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:47:04] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 07:47:04] [INFO ] Flatten gal took : 13 ms
[2024-05-29 07:47:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 4 ms.
[2024-05-29 07:47:04] [INFO ] Time to serialize gal into /tmp/LTLFireability2236408323307078602.gal : 3 ms
[2024-05-29 07:47:04] [INFO ] Time to serialize properties into /tmp/LTLFireability1678834932730796727.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/LTLFireability2236408323307078602.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1678834932730796727.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...276
Read 11 LTL properties
Checking formula 0 : !((X((G(F("(((i0.i3.u5.p13==0)||(i0.i3.u11.p32==0))||(i5.i1.u63.p177==0))")))||((X("((i0.i3.u5.p13==0)||(i0.i3.u11.p32==0))"))&&(G("((...202
Formula 0 simplified : X(FG!"(((i0.i3.u5.p13==0)||(i0.i3.u11.p32==0))||(i5.i1.u63.p177==0))" & (X!"((i0.i3.u5.p13==0)||(i0.i3.u11.p32==0))" | F!"((i4.i1.u4...190
Compilation finished in 647 ms.
Running link step : cd /tmp/ltsmin8715196154644336555;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8715196154644336555;'/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(([](<>((LTLAPp0==true)))||(X((LTLAPp1==true))&&[]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin8715196154644336555;'/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(([](<>((LTLAPp0==true)))||(X((LTLAPp1==true))&&[]((LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8715196154644336555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp3==true))||[](<>((LTLAPp4==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin8715196154644336555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp3==true))||[](<>((LTLAPp4==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8715196154644336555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp5==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin8715196154644336555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp5==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8715196154644336555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](!(LTLAPp6==true))||(!(LTLAPp6==true)&&[](<>(!(LTLAPp7==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin8715196154644336555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](!(LTLAPp6==true))||(!(LTLAPp6==true)&&[](<>(!(LTLAPp7==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8715196154644336555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp8==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin8715196154644336555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp8==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8715196154644336555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp9==true))||[]((LTLAPp10==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin8715196154644336555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp9==true))||[]((LTLAPp10==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8715196154644336555;'/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(X((LTLAPp11==true)))||<>((X((LTLAPp12==true))&&<>((LTLAPp13==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin8715196154644336555;'/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(X((LTLAPp11==true)))||<>((X((LTLAPp12==true))&&<>((LTLAPp13==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8715196154644336555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp14==true))||<>((LTLAPp15==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin8715196154644336555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp14==true))||<>((LTLAPp15==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8715196154644336555;'/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((LTLAPp16==true))&&<>((LTLAPp17==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin8715196154644336555;'/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((LTLAPp16==true))&&<>((LTLAPp17==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8715196154644336555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp18==true)||[]((LTLAPp19==true))||[]((<>((LTLAPp20==true))&&<>((LTLAPp21==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin8715196154644336555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp18==true)||[]((LTLAPp19==true))||[]((<>((LTLAPp20==true))&&<>((LTLAPp21==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8715196154644336555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp22==true)&&((LTLAPp23==true)||<>((LTLAPp24==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin8715196154644336555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp22==true)&&((LTLAPp23==true)||<>((LTLAPp24==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 2616 s
Running LTSmin : cd /tmp/ltsmin8715196154644336555;'/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(([](<>((LTLAPp0==true)))||(X((LTLAPp1==true))&&[]((LTLAPp2==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.017: LTL layer: formula: X(([](<>((LTLAPp0==true)))||(X((LTLAPp1==true))&&[]((LTLAPp2==true)))))
pins2lts-mc-linux64( 6/ 8), 0.017: "X(([](<>((LTLAPp0==true)))||(X((LTLAPp1==true))&&[]((LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.017: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.056: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.122: DFS-FIFO for weak LTL, using special progress label 289
pins2lts-mc-linux64( 0/ 8), 0.122: There are 290 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.122: State length is 314, there are 276 groups
pins2lts-mc-linux64( 0/ 8), 0.122: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.122: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.122: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.122: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.141: ~1 levels ~960 states ~3376 transitions
pins2lts-mc-linux64( 0/ 8), 0.203: ~1 levels ~1920 states ~7312 transitions
pins2lts-mc-linux64( 0/ 8), 0.277: ~1 levels ~3840 states ~16408 transitions
pins2lts-mc-linux64( 2/ 8), 0.403: ~1 levels ~7680 states ~42432 transitions
pins2lts-mc-linux64( 2/ 8), 0.557: ~1 levels ~15360 states ~87376 transitions
pins2lts-mc-linux64( 2/ 8), 0.882: ~1 levels ~30720 states ~182504 transitions
pins2lts-mc-linux64( 2/ 8), 1.437: ~1 levels ~61440 states ~386040 transitions
pins2lts-mc-linux64( 4/ 8), 2.365: ~1 levels ~122880 states ~838232 transitions
pins2lts-mc-linux64( 5/ 8), 3.982: ~1 levels ~245760 states ~1710624 transitions
pins2lts-mc-linux64( 0/ 8), 6.638: ~1 levels ~491520 states ~3587280 transitions
pins2lts-mc-linux64( 0/ 8), 11.289: ~1 levels ~983040 states ~7566568 transitions
pins2lts-mc-linux64( 0/ 8), 20.479: ~1 levels ~1966080 states ~15800320 transitions
pins2lts-mc-linux64( 0/ 8), 40.316: ~1 levels ~3932160 states ~32743928 transitions
pins2lts-mc-linux64( 0/ 8), 82.943: ~1 levels ~7864320 states ~68993752 transitions
pins2lts-mc-linux64( 0/ 8), 181.092: ~1 levels ~15728640 states ~142152912 transitions
pins2lts-mc-linux64( 4/ 8), 220.095: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 220.165:
pins2lts-mc-linux64( 0/ 8), 220.165: mean standard work distribution: 1.9% (states) 4.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 220.165:
pins2lts-mc-linux64( 0/ 8), 220.165: Explored 18191985 states 174387048 transitions, fanout: 9.586
pins2lts-mc-linux64( 0/ 8), 220.165: Total exploration time 219.990 sec (219.940 sec minimum, 219.966 sec on average)
pins2lts-mc-linux64( 0/ 8), 220.165: States per second: 82695, Transitions per second: 792704
pins2lts-mc-linux64( 0/ 8), 220.165:
pins2lts-mc-linux64( 0/ 8), 220.165: Progress states detected: 31948565
pins2lts-mc-linux64( 0/ 8), 220.165: Redundant explorations: -43.0585
pins2lts-mc-linux64( 0/ 8), 220.165:
pins2lts-mc-linux64( 0/ 8), 220.165: Queue width: 8B, total height: 24241767, memory: 184.95MB
pins2lts-mc-linux64( 0/ 8), 220.165: Tree memory: 499.7MB, 16.4 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 220.165: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 220.165: Stored 263 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 220.165: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 220.165: Est. total memory use: 684.7MB (~1209.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8715196154644336555;'/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(([](<>((LTLAPp0==true)))||(X((LTLAPp1==true))&&[]((LTLAPp2==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8715196154644336555;'/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(([](<>((LTLAPp0==true)))||(X((LTLAPp1==true))&&[]((LTLAPp2==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:121)
at java.base/java.lang.Thread.run(Thread.java:840)

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="ShieldPPPs-PT-010A"
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 ShieldPPPs-PT-010A, 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-171683761100436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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