About the Execution of GreatSPN+red for SquareGrid-PT-040204
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
12742.896 | 3600000.00 | 8620184.00 | 7910.90 | F?TFFFFTT??T?F?F | normal |
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.r399-tall-171690529500060.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 greatspnxred
Input is SquareGrid-PT-040204, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690529500060
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 04:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 12 04:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 04:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 04:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rwxr-xr-x 1 mcc users 130K 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 SquareGrid-PT-040204-LTLFireability-00
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-01
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-02
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-03
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-04
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-05
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-06
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-07
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-08
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-09
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-10
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-11
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-12
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-13
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-14
FORMULA_NAME SquareGrid-PT-040204-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716977979898
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SquareGrid-PT-040204
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 10:19:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 10:19:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 10:19:41] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-05-29 10:19:41] [INFO ] Transformed 240 places.
[2024-05-29 10:19:41] [INFO ] Transformed 272 transitions.
[2024-05-29 10:19:41] [INFO ] Parsed PT model containing 240 places and 272 transitions and 1088 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA SquareGrid-PT-040204-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-040204-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-040204-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-040204-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-040204-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 22 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
// Phase 1: matrix 272 rows 240 cols
[2024-05-29 10:19:41] [INFO ] Computed 97 invariants in 39 ms
[2024-05-29 10:19:41] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-29 10:19:41] [INFO ] Invariant cache hit.
[2024-05-29 10:19:42] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 10:19:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 7525 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 13427 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 21124ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 21145ms
Finished structural reductions in LTL mode , in 1 iterations and 21902 ms. Remains : 240/240 places, 272/272 transitions.
Support contains 47 out of 240 places after structural reductions.
[2024-05-29 10:20:03] [INFO ] Flatten gal took : 57 ms
[2024-05-29 10:20:03] [INFO ] Flatten gal took : 27 ms
[2024-05-29 10:20:03] [INFO ] Input system was already deterministic with 272 transitions.
Support contains 46 out of 240 places (down from 47) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 2108 steps (0 resets) in 320 ms. (6 steps per ms) remains 0/22 properties
FORMULA SquareGrid-PT-040204-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 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' '!(G(F(p0)))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 22 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:20:04] [INFO ] Invariant cache hit.
[2024-05-29 10:20:04] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-29 10:20:04] [INFO ] Invariant cache hit.
[2024-05-29 10:20:04] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2024-05-29 10:20:04] [INFO ] Redundant transitions in 12 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-29 10:20:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6997 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12619 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19696ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19700ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20184 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-01
Product exploration explored 100000 steps with 2309 reset in 1155 ms.
Product exploration explored 100000 steps with 2285 reset in 1152 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 157 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 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 58 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 188 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
[2024-05-29 10:20:27] [INFO ] Invariant cache hit.
[2024-05-29 10:20:27] [INFO ] [Real]Absence check using 96 positive place invariants in 20 ms returned sat
[2024-05-29 10:20:27] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 11 ms returned sat
[2024-05-29 10:20:28] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2024-05-29 10:20:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:20:28] [INFO ] [Nat]Absence check using 96 positive place invariants in 22 ms returned sat
[2024-05-29 10:20:28] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-29 10:20:28] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2024-05-29 10:20:28] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-29 10:20:28] [INFO ] Added : 75 causal constraints over 15 iterations in 415 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 10 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:20:28] [INFO ] Invariant cache hit.
[2024-05-29 10:20:29] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-29 10:20:29] [INFO ] Invariant cache hit.
[2024-05-29 10:20:29] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2024-05-29 10:20:29] [INFO ] Redundant transitions in 3 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-29 10:20:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6864 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12568 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19563ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19566ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20116 ms. Remains : 240/240 places, 272/272 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 144 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 p0), (NOT p0)]
RANDOM walk for 52 steps (0 resets) in 6 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 177 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 p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-05-29 10:20:49] [INFO ] Invariant cache hit.
[2024-05-29 10:20:49] [INFO ] [Real]Absence check using 96 positive place invariants in 20 ms returned sat
[2024-05-29 10:20:49] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 10 ms returned sat
[2024-05-29 10:20:50] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2024-05-29 10:20:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:20:50] [INFO ] [Nat]Absence check using 96 positive place invariants in 23 ms returned sat
[2024-05-29 10:20:50] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-29 10:20:50] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2024-05-29 10:20:50] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-29 10:20:50] [INFO ] Added : 75 causal constraints over 15 iterations in 421 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2335 reset in 997 ms.
Product exploration explored 100000 steps with 2297 reset in 1061 ms.
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 9 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:20:52] [INFO ] Invariant cache hit.
[2024-05-29 10:20:53] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-29 10:20:53] [INFO ] Invariant cache hit.
[2024-05-29 10:20:53] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-05-29 10:20:53] [INFO ] Redundant transitions in 3 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-29 10:20:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6958 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12350 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19449ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19453ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19876 ms. Remains : 240/240 places, 272/272 transitions.
Treatment of property SquareGrid-PT-040204-LTLFireability-01 finished in 68688 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))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:21:12] [INFO ] Invariant cache hit.
[2024-05-29 10:21:13] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-29 10:21:13] [INFO ] Invariant cache hit.
[2024-05-29 10:21:13] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 10:21:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6645 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12855 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19576ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19580ms
Finished structural reductions in LTL mode , in 1 iterations and 20395 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SquareGrid-PT-040204-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-040204-LTLFireability-03 finished in 20524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G((F(p1)&&F(G(p0)))))))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 16 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:21:33] [INFO ] Invariant cache hit.
[2024-05-29 10:21:33] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-29 10:21:33] [INFO ] Invariant cache hit.
[2024-05-29 10:21:33] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 10:21:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6546 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12633 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19240ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19243ms
Finished structural reductions in LTL mode , in 1 iterations and 19649 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-04
Stuttering criterion allowed to conclude after 7561 steps with 0 reset in 73 ms.
FORMULA SquareGrid-PT-040204-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-040204-LTLFireability-04 finished in 19940 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U X((!X((G(p3)&&p2))&&p1))))'
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:21:53] [INFO ] Invariant cache hit.
[2024-05-29 10:21:53] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-29 10:21:53] [INFO ] Invariant cache hit.
[2024-05-29 10:21:53] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 10:21:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6630 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12770 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19456ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19458ms
Finished structural reductions in LTL mode , in 1 iterations and 19842 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (NOT p2) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-05
Entered a terminal (fully accepting) state of product in 4 steps with 1 reset in 0 ms.
FORMULA SquareGrid-PT-040204-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-040204-LTLFireability-05 finished in 20052 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((F((G(F(!p0))||(!p1&&F(!p0))))&&(X(!p1) U ((!p0&&X(!p1))||X(G(!p1)))))))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:22:13] [INFO ] Invariant cache hit.
[2024-05-29 10:22:13] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-29 10:22:13] [INFO ] Invariant cache hit.
[2024-05-29 10:22:13] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 10:22:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6343 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12366 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 18773ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18775ms
Finished structural reductions in LTL mode , in 1 iterations and 19156 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 142 ms :[p1, (OR p1 p0), p0, (OR p1 p0)]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 586 ms.
Product exploration explored 100000 steps with 50000 reset in 620 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 (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 84 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SquareGrid-PT-040204-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SquareGrid-PT-040204-LTLFireability-08 finished in 20636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 7 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:22:34] [INFO ] Invariant cache hit.
[2024-05-29 10:22:34] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-29 10:22:34] [INFO ] Invariant cache hit.
[2024-05-29 10:22:34] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2024-05-29 10:22:34] [INFO ] Redundant transitions in 1 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-29 10:22:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6439 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 11855 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 18370ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18383ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18789 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-09
Product exploration explored 100000 steps with 831 reset in 1021 ms.
Product exploration explored 100000 steps with 854 reset in 1091 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]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 165 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 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 486 steps (0 resets) in 10 ms. (44 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 161 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 7 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:22:55] [INFO ] Invariant cache hit.
[2024-05-29 10:22:55] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-29 10:22:55] [INFO ] Invariant cache hit.
[2024-05-29 10:22:56] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2024-05-29 10:22:56] [INFO ] Redundant transitions in 0 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-29 10:22:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6727 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 13122 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19909ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19911ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20462 ms. Remains : 240/240 places, 272/272 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]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 154 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 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 304 steps (0 resets) in 9 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 167 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 861 reset in 1082 ms.
Product exploration explored 100000 steps with 850 reset in 1207 ms.
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 15 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:23:19] [INFO ] Invariant cache hit.
[2024-05-29 10:23:19] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-29 10:23:19] [INFO ] Invariant cache hit.
[2024-05-29 10:23:19] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2024-05-29 10:23:19] [INFO ] Redundant transitions in 0 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-29 10:23:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6658 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12848 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19578ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19583ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20134 ms. Remains : 240/240 places, 272/272 transitions.
Treatment of property SquareGrid-PT-040204-LTLFireability-09 finished in 65116 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&&X(!p1)) U (G((!p0&&X(!p1)))||(X(!p1)&&p2))))))'
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:23:39] [INFO ] Invariant cache hit.
[2024-05-29 10:23:39] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-29 10:23:39] [INFO ] Invariant cache hit.
[2024-05-29 10:23:39] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 10:23:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6705 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12827 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19586ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19589ms
Finished structural reductions in LTL mode , in 1 iterations and 20276 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-10
Product exploration explored 100000 steps with 1020 reset in 1196 ms.
Product exploration explored 100000 steps with 1113 reset in 1210 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 p2) (NOT p0) p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR p2 (NOT p0))), (X (NOT (OR p2 (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p2 p1) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p2 p1) (AND (NOT p0) p1))))), (X (X (OR p2 (NOT p0)))), (X (X (NOT (OR p2 (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 728 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 1570 steps (0 resets) in 53 ms. (29 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR p2 (NOT p0))), (X (NOT (OR p2 (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p2 p1) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p2 p1) (AND (NOT p0) p1))))), (X (X (OR p2 (NOT p0)))), (X (X (NOT (OR p2 (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1)), (F (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))]
Knowledge based reduction with 1 factoid took 897 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Stuttering acceptance computed with spot in 138 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
[2024-05-29 10:24:04] [INFO ] Invariant cache hit.
[2024-05-29 10:24:04] [INFO ] [Real]Absence check using 96 positive place invariants in 29 ms returned sat
[2024-05-29 10:24:04] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 8 ms returned sat
[2024-05-29 10:24:04] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2024-05-29 10:24:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:24:04] [INFO ] [Nat]Absence check using 96 positive place invariants in 27 ms returned sat
[2024-05-29 10:24:04] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-29 10:24:04] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2024-05-29 10:24:04] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-29 10:24:05] [INFO ] Added : 75 causal constraints over 15 iterations in 348 ms. Result :sat
Could not prove EG p1
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:24:05] [INFO ] Invariant cache hit.
[2024-05-29 10:24:05] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-29 10:24:05] [INFO ] Invariant cache hit.
[2024-05-29 10:24:05] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 10:24:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6645 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12838 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19546ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19548ms
Finished structural reductions in LTL mode , in 1 iterations and 19950 ms. Remains : 240/240 places, 272/272 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 p2) p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (NOT p0) p2)), (X (NOT (OR (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (NOT p0) p2))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p1) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 763 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 1377 steps (0 resets) in 45 ms. (29 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (NOT p0) p2)), (X (NOT (OR (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (NOT p0) p2))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p1) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1)), (F (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))]
Knowledge based reduction with 1 factoid took 979 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Stuttering acceptance computed with spot in 113 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
[2024-05-29 10:24:27] [INFO ] Invariant cache hit.
[2024-05-29 10:24:27] [INFO ] [Real]Absence check using 96 positive place invariants in 28 ms returned sat
[2024-05-29 10:24:27] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 9 ms returned sat
[2024-05-29 10:24:27] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2024-05-29 10:24:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:24:27] [INFO ] [Nat]Absence check using 96 positive place invariants in 27 ms returned sat
[2024-05-29 10:24:27] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-29 10:24:28] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2024-05-29 10:24:28] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-29 10:24:28] [INFO ] Added : 75 causal constraints over 15 iterations in 293 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 112 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Product exploration explored 100000 steps with 1026 reset in 1119 ms.
Product exploration explored 100000 steps with 1050 reset in 1196 ms.
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:24:30] [INFO ] Invariant cache hit.
[2024-05-29 10:24:31] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-29 10:24:31] [INFO ] Invariant cache hit.
[2024-05-29 10:24:31] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 10:24:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6603 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12724 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19393ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19396ms
Finished structural reductions in LTL mode , in 1 iterations and 19976 ms. Remains : 240/240 places, 272/272 transitions.
Treatment of property SquareGrid-PT-040204-LTLFireability-10 finished in 71757 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||X(X(p0))||F(p1)))))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:24:51] [INFO ] Invariant cache hit.
[2024-05-29 10:24:51] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-29 10:24:51] [INFO ] Invariant cache hit.
[2024-05-29 10:24:51] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 10:24:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6613 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12924 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19611ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19614ms
Finished structural reductions in LTL mode , in 1 iterations and 20032 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-12
Product exploration explored 100000 steps with 1354 reset in 1063 ms.
Product exploration explored 100000 steps with 1358 reset in 1146 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))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 306 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 682 steps (0 resets) in 14 ms. (45 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 1 factoid took 336 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-29 10:25:14] [INFO ] Invariant cache hit.
[2024-05-29 10:25:14] [INFO ] [Real]Absence check using 96 positive place invariants in 28 ms returned sat
[2024-05-29 10:25:14] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 19 ms returned sat
[2024-05-29 10:25:14] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2024-05-29 10:25:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:25:15] [INFO ] [Nat]Absence check using 96 positive place invariants in 23 ms returned sat
[2024-05-29 10:25:15] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 16 ms returned sat
[2024-05-29 10:25:15] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-05-29 10:25:15] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-29 10:25:15] [INFO ] Added : 76 causal constraints over 16 iterations in 298 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:25:15] [INFO ] Invariant cache hit.
[2024-05-29 10:25:15] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-29 10:25:15] [INFO ] Invariant cache hit.
[2024-05-29 10:25:15] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 10:25:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6822 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12973 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19869ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19872ms
Finished structural reductions in LTL mode , in 1 iterations and 20278 ms. Remains : 240/240 places, 272/272 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))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 259 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 534 steps (0 resets) in 11 ms. (44 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 1 factoid took 363 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-29 10:25:36] [INFO ] Invariant cache hit.
[2024-05-29 10:25:37] [INFO ] [Real]Absence check using 96 positive place invariants in 28 ms returned sat
[2024-05-29 10:25:37] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 19 ms returned sat
[2024-05-29 10:25:37] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2024-05-29 10:25:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:25:37] [INFO ] [Nat]Absence check using 96 positive place invariants in 22 ms returned sat
[2024-05-29 10:25:37] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 16 ms returned sat
[2024-05-29 10:25:37] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2024-05-29 10:25:37] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-29 10:25:38] [INFO ] Added : 76 causal constraints over 16 iterations in 329 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1396 reset in 1088 ms.
Product exploration explored 100000 steps with 1386 reset in 1163 ms.
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 6 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:25:40] [INFO ] Invariant cache hit.
[2024-05-29 10:25:40] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-29 10:25:40] [INFO ] Invariant cache hit.
[2024-05-29 10:25:40] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 10:25:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6773 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 13014 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19858ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19860ms
Finished structural reductions in LTL mode , in 1 iterations and 20286 ms. Remains : 240/240 places, 272/272 transitions.
Treatment of property SquareGrid-PT-040204-LTLFireability-12 finished in 69880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(G(!p1))||p0)) U (p1 U p2))))'
Support contains 6 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:26:00] [INFO ] Invariant cache hit.
[2024-05-29 10:26:01] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-29 10:26:01] [INFO ] Invariant cache hit.
[2024-05-29 10:26:01] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 10:26:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6697 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12989 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19757ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19759ms
Finished structural reductions in LTL mode , in 1 iterations and 20183 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p2), (NOT p2), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0)), p1, true, (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-13
Entered a terminal (fully accepting) state of product in 52 steps with 0 reset in 1 ms.
FORMULA SquareGrid-PT-040204-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-040204-LTLFireability-13 finished in 20456 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) U (p1||G(p2)))))'
Support contains 6 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 5 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:26:21] [INFO ] Invariant cache hit.
[2024-05-29 10:26:21] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-29 10:26:21] [INFO ] Invariant cache hit.
[2024-05-29 10:26:21] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2024-05-29 10:26:21] [INFO ] Redundant transitions in 1 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-29 10:26:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6733 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12903 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19714ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19717ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20155 ms. Remains : 240/240 places, 272/272 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-14
Product exploration explored 100000 steps with 1169 reset in 1036 ms.
Product exploration explored 100000 steps with 1190 reset in 1112 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 p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 1020 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 197 steps (0 resets) in 8 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 2 factoid took 993 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 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
[2024-05-29 10:26:46] [INFO ] Invariant cache hit.
[2024-05-29 10:26:46] [INFO ] [Real]Absence check using 96 positive place invariants in 29 ms returned sat
[2024-05-29 10:26:46] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-29 10:26:46] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-29 10:26:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:26:46] [INFO ] [Nat]Absence check using 96 positive place invariants in 47 ms returned sat
[2024-05-29 10:26:46] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-29 10:26:46] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-05-29 10:26:46] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-29 10:26:46] [INFO ] Added : 75 causal constraints over 15 iterations in 266 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 240 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 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 5 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:26:46] [INFO ] Invariant cache hit.
[2024-05-29 10:26:47] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-29 10:26:47] [INFO ] Invariant cache hit.
[2024-05-29 10:26:47] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2024-05-29 10:26:47] [INFO ] Redundant transitions in 0 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-29 10:26:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6534 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12716 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19309ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19318ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19768 ms. Remains : 240/240 places, 272/272 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 : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 152 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 146 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 487 steps (0 resets) in 12 ms. (37 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 181 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 55 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p1), (NOT p1)]
[2024-05-29 10:27:07] [INFO ] Invariant cache hit.
[2024-05-29 10:27:07] [INFO ] [Real]Absence check using 96 positive place invariants in 28 ms returned sat
[2024-05-29 10:27:07] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-29 10:27:07] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-29 10:27:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:27:07] [INFO ] [Nat]Absence check using 96 positive place invariants in 48 ms returned sat
[2024-05-29 10:27:07] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-29 10:27:08] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2024-05-29 10:27:08] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-29 10:27:08] [INFO ] Added : 75 causal constraints over 15 iterations in 325 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1145 reset in 1044 ms.
Product exploration explored 100000 steps with 1240 reset in 1105 ms.
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 5 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:27:10] [INFO ] Invariant cache hit.
[2024-05-29 10:27:10] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-29 10:27:10] [INFO ] Invariant cache hit.
[2024-05-29 10:27:11] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2024-05-29 10:27:11] [INFO ] Redundant transitions in 0 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-29 10:27:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6567 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12646 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19295ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19297ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19724 ms. Remains : 240/240 places, 272/272 transitions.
Treatment of property SquareGrid-PT-040204-LTLFireability-14 finished in 69069 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)))'
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)))'
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&&X(!p1)) U (G((!p0&&X(!p1)))||(X(!p1)&&p2))))))'
Found a Shortening insensitive property : SquareGrid-PT-040204-LTLFireability-10
Stuttering acceptance computed with spot in 113 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:27:30] [INFO ] Invariant cache hit.
[2024-05-29 10:27:31] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-29 10:27:31] [INFO ] Invariant cache hit.
[2024-05-29 10:27:31] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 10:27:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6549 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12567 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19188ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19191ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 19635 ms. Remains : 240/240 places, 272/272 transitions.
Running random walk in product with property : SquareGrid-PT-040204-LTLFireability-10
Product exploration explored 100000 steps with 1123 reset in 1149 ms.
Product exploration explored 100000 steps with 1059 reset in 1216 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 p2) (NOT p0) p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR p2 (NOT p0))), (X (NOT (OR p2 (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p2 p1) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p2 p1) (AND (NOT p0) p1))))), (X (X (OR p2 (NOT p0)))), (X (X (NOT (OR p2 (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 697 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 431 steps (0 resets) in 20 ms. (20 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR p2 (NOT p0))), (X (NOT (OR p2 (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p2 p1) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p2 p1) (AND (NOT p0) p1))))), (X (X (OR p2 (NOT p0)))), (X (X (NOT (OR p2 (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1)), (F (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))]
Knowledge based reduction with 1 factoid took 879 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Stuttering acceptance computed with spot in 112 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
[2024-05-29 10:27:54] [INFO ] Invariant cache hit.
[2024-05-29 10:27:54] [INFO ] [Real]Absence check using 96 positive place invariants in 28 ms returned sat
[2024-05-29 10:27:54] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 9 ms returned sat
[2024-05-29 10:27:55] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-05-29 10:27:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:27:55] [INFO ] [Nat]Absence check using 96 positive place invariants in 28 ms returned sat
[2024-05-29 10:27:55] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-29 10:27:55] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2024-05-29 10:27:55] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-29 10:27:55] [INFO ] Added : 75 causal constraints over 15 iterations in 269 ms. Result :sat
Could not prove EG p1
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:27:55] [INFO ] Invariant cache hit.
[2024-05-29 10:27:55] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-29 10:27:55] [INFO ] Invariant cache hit.
[2024-05-29 10:27:56] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 10:27:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6705 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12681 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19441ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19443ms
Finished structural reductions in LTL mode , in 1 iterations and 19829 ms. Remains : 240/240 places, 272/272 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 p2) p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (NOT p0) p2)), (X (NOT (OR (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (NOT p0) p2))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p1) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 737 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 1250 steps (0 resets) in 45 ms. (27 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (NOT p0) p2)), (X (NOT (OR (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (NOT p0) p2))), (X (X (NOT (OR (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p1) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1)), (F (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))]
Knowledge based reduction with 1 factoid took 871 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Stuttering acceptance computed with spot in 109 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
[2024-05-29 10:28:17] [INFO ] Invariant cache hit.
[2024-05-29 10:28:17] [INFO ] [Real]Absence check using 96 positive place invariants in 31 ms returned sat
[2024-05-29 10:28:17] [INFO ] [Real]Absence check using 96 positive and 1 generalized place invariants in 9 ms returned sat
[2024-05-29 10:28:17] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2024-05-29 10:28:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:28:18] [INFO ] [Nat]Absence check using 96 positive place invariants in 28 ms returned sat
[2024-05-29 10:28:18] [INFO ] [Nat]Absence check using 96 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-29 10:28:18] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-05-29 10:28:18] [INFO ] Computed and/alt/rep : 208/208/208 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-29 10:28:18] [INFO ] Added : 75 causal constraints over 15 iterations in 274 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 100 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Product exploration explored 100000 steps with 1079 reset in 1108 ms.
Product exploration explored 100000 steps with 1080 reset in 1169 ms.
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 272/272 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-29 10:28:21] [INFO ] Invariant cache hit.
[2024-05-29 10:28:21] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-29 10:28:21] [INFO ] Invariant cache hit.
[2024-05-29 10:28:21] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 10:28:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6581 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12564 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19215ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19217ms
Finished structural reductions in LTL mode , in 1 iterations and 19592 ms. Remains : 240/240 places, 272/272 transitions.
Treatment of property SquareGrid-PT-040204-LTLFireability-10 finished in 70047 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||X(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(p0)||(F(p1) U (p1||G(p2)))))'
[2024-05-29 10:28:40] [INFO ] Flatten gal took : 25 ms
[2024-05-29 10:28:40] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-29 10:28:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 240 places, 272 transitions and 1088 arcs took 6 ms.
Total runtime 539792 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running SquareGrid-PT-040204
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 240
TRANSITIONS: 272
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2693
MODEL NAME: /home/mcc/execution/413/model
240 places, 272 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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="SquareGrid-PT-040204"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is SquareGrid-PT-040204, 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 r399-tall-171690529500060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SquareGrid-PT-040204.tgz
mv SquareGrid-PT-040204 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 '
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 ;