Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r455-smll-167912647300379.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is SquareGrid-PT-100510, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r455-smll-167912647300379
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.6K Feb 25 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 12:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 13:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 13:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 786K Mar 5 18:23 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-100510-LTLCardinality-00
FORMULA_NAME SquareGrid-PT-100510-LTLCardinality-01
FORMULA_NAME SquareGrid-PT-100510-LTLCardinality-02
FORMULA_NAME SquareGrid-PT-100510-LTLCardinality-03
FORMULA_NAME SquareGrid-PT-100510-LTLCardinality-04
FORMULA_NAME SquareGrid-PT-100510-LTLCardinality-05
FORMULA_NAME SquareGrid-PT-100510-LTLCardinality-06
FORMULA_NAME SquareGrid-PT-100510-LTLCardinality-07
FORMULA_NAME SquareGrid-PT-100510-LTLCardinality-08
FORMULA_NAME SquareGrid-PT-100510-LTLCardinality-09
FORMULA_NAME SquareGrid-PT-100510-LTLCardinality-10
FORMULA_NAME SquareGrid-PT-100510-LTLCardinality-11
FORMULA_NAME SquareGrid-PT-100510-LTLCardinality-12
FORMULA_NAME SquareGrid-PT-100510-LTLCardinality-13
FORMULA_NAME SquareGrid-PT-100510-LTLCardinality-14
FORMULA_NAME SquareGrid-PT-100510-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679234682475

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SquareGrid-PT-100510
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 14:04:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 14:04:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 14:04:46] [INFO ] Load time of PNML (sax parser for PT used): 312 ms
[2023-03-19 14:04:46] [INFO ] Transformed 1380 places.
[2023-03-19 14:04:46] [INFO ] Transformed 1640 transitions.
[2023-03-19 14:04:46] [INFO ] Parsed PT model containing 1380 places and 1640 transitions and 6560 arcs in 466 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA SquareGrid-PT-100510-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-100510-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-100510-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 187 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
// Phase 1: matrix 1640 rows 1380 cols
[2023-03-19 14:04:47] [INFO ] Computed 541 place invariants in 119 ms
[2023-03-19 14:04:48] [INFO ] Implicit Places using invariants in 1998 ms returned []
[2023-03-19 14:04:48] [INFO ] Invariant cache hit.
[2023-03-19 14:04:49] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:04:52] [INFO ] Implicit Places using invariants and state equation in 3637 ms returned []
Implicit Place search using SMT with State Equation took 5678 ms to find 0 implicit places.
[2023-03-19 14:04:52] [INFO ] Invariant cache hit.
[2023-03-19 14:04:53] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:04:54] [INFO ] Dead Transitions using invariants and state equation in 1862 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7731 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Support contains 44 out of 1380 places after structural reductions.
[2023-03-19 14:04:55] [INFO ] Flatten gal took : 346 ms
[2023-03-19 14:04:55] [INFO ] Flatten gal took : 145 ms
[2023-03-19 14:04:55] [INFO ] Input system was already deterministic with 1640 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2058 ms. (steps per millisecond=4 ) properties (out of 28) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-19 14:04:59] [INFO ] Invariant cache hit.
[2023-03-19 14:05:00] [INFO ] After 678ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2023-03-19 14:05:00] [INFO ] [Nat]Absence check using 540 positive place invariants in 219 ms returned sat
[2023-03-19 14:05:01] [INFO ] [Nat]Absence check using 540 positive and 1 generalized place invariants in 114 ms returned sat
[2023-03-19 14:05:02] [INFO ] After 1319ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :1
[2023-03-19 14:05:02] [INFO ] After 1452ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :1
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-19 14:05:02] [INFO ] After 2631ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :1
Fused 10 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2659 steps, including 0 resets, run visited all 1 properties in 274 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 278 ms.
Successfully simplified 9 atomic propositions for a total of 13 simplifications.
FORMULA SquareGrid-PT-100510-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-100510-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-100510-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-100510-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA SquareGrid-PT-100510-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 66 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:05:03] [INFO ] Invariant cache hit.
[2023-03-19 14:05:04] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:05:06] [INFO ] Implicit Places using invariants in 3060 ms returned []
[2023-03-19 14:05:06] [INFO ] Invariant cache hit.
[2023-03-19 14:05:07] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:05:10] [INFO ] Implicit Places using invariants and state equation in 3634 ms returned []
Implicit Place search using SMT with State Equation took 6698 ms to find 0 implicit places.
[2023-03-19 14:05:10] [INFO ] Invariant cache hit.
[2023-03-19 14:05:10] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:05:12] [INFO ] Dead Transitions using invariants and state equation in 2184 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8954 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SquareGrid-PT-100510-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s339)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 28356 reset in 7942 ms.
Product exploration explored 100000 steps with 28885 reset in 7917 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 233 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 680 steps, including 0 resets, run visited all 1 properties in 126 ms. (steps per millisecond=5 )
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 223 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 63 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:05:32] [INFO ] Invariant cache hit.
[2023-03-19 14:05:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:05:34] [INFO ] Implicit Places using invariants in 2344 ms returned []
[2023-03-19 14:05:34] [INFO ] Invariant cache hit.
[2023-03-19 14:05:35] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:05:38] [INFO ] Implicit Places using invariants and state equation in 4320 ms returned []
Implicit Place search using SMT with State Equation took 6667 ms to find 0 implicit places.
[2023-03-19 14:05:38] [INFO ] Invariant cache hit.
[2023-03-19 14:05:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:05:40] [INFO ] Dead Transitions using invariants and state equation in 1525 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8259 ms. Remains : 1380/1380 places, 1640/1640 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 125 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 216 steps, including 0 resets, run visited all 1 properties in 22 ms. (steps per millisecond=9 )
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 156 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 31862 reset in 7728 ms.
Product exploration explored 100000 steps with 27760 reset in 8622 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 406 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:06:01] [INFO ] Redundant transitions in 204 ms returned []
[2023-03-19 14:06:01] [INFO ] Invariant cache hit.
[2023-03-19 14:06:01] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:06:02] [INFO ] Dead Transitions using invariants and state equation in 1723 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2346 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 35 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:06:02] [INFO ] Invariant cache hit.
[2023-03-19 14:06:03] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:06:04] [INFO ] Implicit Places using invariants in 1882 ms returned []
[2023-03-19 14:06:04] [INFO ] Invariant cache hit.
[2023-03-19 14:06:05] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:06:09] [INFO ] Implicit Places using invariants and state equation in 4209 ms returned []
Implicit Place search using SMT with State Equation took 6095 ms to find 0 implicit places.
[2023-03-19 14:06:09] [INFO ] Invariant cache hit.
[2023-03-19 14:06:09] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:06:10] [INFO ] Dead Transitions using invariants and state equation in 1867 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7998 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Treatment of property SquareGrid-PT-100510-LTLCardinality-00 finished in 67950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 44 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:06:11] [INFO ] Invariant cache hit.
[2023-03-19 14:06:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:06:12] [INFO ] Implicit Places using invariants in 1653 ms returned []
[2023-03-19 14:06:12] [INFO ] Invariant cache hit.
[2023-03-19 14:06:13] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:06:16] [INFO ] Implicit Places using invariants and state equation in 3815 ms returned []
Implicit Place search using SMT with State Equation took 5475 ms to find 0 implicit places.
[2023-03-19 14:06:16] [INFO ] Invariant cache hit.
[2023-03-19 14:06:17] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:06:18] [INFO ] Dead Transitions using invariants and state equation in 2071 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7593 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : SquareGrid-PT-100510-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(LEQ 2 s1120)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 6004 ms.
Product exploration explored 100000 steps with 33333 reset in 5921 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 50 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SquareGrid-PT-100510-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SquareGrid-PT-100510-LTLCardinality-01 finished in 22408 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F((p1&&X(!p0)))))))'
Support contains 4 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 30 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:06:33] [INFO ] Invariant cache hit.
[2023-03-19 14:06:34] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:06:35] [INFO ] Implicit Places using invariants in 2183 ms returned []
[2023-03-19 14:06:35] [INFO ] Invariant cache hit.
[2023-03-19 14:06:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:06:39] [INFO ] Implicit Places using invariants and state equation in 3497 ms returned []
Implicit Place search using SMT with State Equation took 5684 ms to find 0 implicit places.
[2023-03-19 14:06:39] [INFO ] Invariant cache hit.
[2023-03-19 14:06:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:06:41] [INFO ] Dead Transitions using invariants and state equation in 1776 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7491 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Stuttering acceptance computed with spot in 188 ms :[p0, (OR (NOT p1) p0), true, true, true]
Running random walk in product with property : SquareGrid-PT-100510-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ s691 s589), p1:(GT s817 s669)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 85210 steps with 22 reset in 10001 ms.
Product exploration timeout after 83280 steps with 37 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 209 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Finished random walk after 316 steps, including 0 resets, run visited all 3 properties in 76 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p0 p1), (X p0), true]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 p0))), (F (NOT p1)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 3 factoid took 329 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 222 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 213 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
[2023-03-19 14:07:05] [INFO ] Invariant cache hit.
[2023-03-19 14:07:08] [INFO ] [Real]Absence check using 540 positive place invariants in 869 ms returned sat
[2023-03-19 14:07:09] [INFO ] [Real]Absence check using 540 positive and 1 generalized place invariants in 898 ms returned sat
[2023-03-19 14:07:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 14:07:14] [INFO ] [Real]Absence check using state equation in 4696 ms returned sat
[2023-03-19 14:07:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 14:07:17] [INFO ] [Nat]Absence check using 540 positive place invariants in 918 ms returned sat
[2023-03-19 14:07:17] [INFO ] [Nat]Absence check using 540 positive and 1 generalized place invariants in 89 ms returned sat
[2023-03-19 14:07:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 14:07:21] [INFO ] [Nat]Absence check using state equation in 3922 ms returned sat
[2023-03-19 14:07:21] [INFO ] Computed and/alt/rep : 1240/1240/1240 causal constraints (skipped 0 transitions) in 104 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 14:07:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG p0
Could not prove EG p0
Support contains 4 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 51 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:07:29] [INFO ] Invariant cache hit.
[2023-03-19 14:07:30] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:07:31] [INFO ] Implicit Places using invariants in 1880 ms returned []
[2023-03-19 14:07:31] [INFO ] Invariant cache hit.
[2023-03-19 14:07:31] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:07:35] [INFO ] Implicit Places using invariants and state equation in 3872 ms returned []
Implicit Place search using SMT with State Equation took 5760 ms to find 0 implicit places.
[2023-03-19 14:07:35] [INFO ] Invariant cache hit.
[2023-03-19 14:07:35] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:07:37] [INFO ] Dead Transitions using invariants and state equation in 1977 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7790 ms. Remains : 1380/1380 places, 1640/1640 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 p1 p0)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 93 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 :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Finished random walk after 429 steps, including 0 resets, run visited all 3 properties in 73 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 1 factoid took 224 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 213 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 211 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
[2023-03-19 14:07:40] [INFO ] Invariant cache hit.
[2023-03-19 14:07:44] [INFO ] [Real]Absence check using 540 positive place invariants in 627 ms returned sat
[2023-03-19 14:07:44] [INFO ] [Real]Absence check using 540 positive and 1 generalized place invariants in 712 ms returned sat
[2023-03-19 14:07:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 14:07:49] [INFO ] [Real]Absence check using state equation in 4885 ms returned sat
[2023-03-19 14:07:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 14:07:52] [INFO ] [Nat]Absence check using 540 positive place invariants in 910 ms returned sat
[2023-03-19 14:07:53] [INFO ] [Nat]Absence check using 540 positive and 1 generalized place invariants in 91 ms returned sat
[2023-03-19 14:07:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 14:07:56] [INFO ] [Nat]Absence check using state equation in 3926 ms returned sat
[2023-03-19 14:07:57] [INFO ] Computed and/alt/rep : 1240/1240/1240 causal constraints (skipped 0 transitions) in 121 ms.
[2023-03-19 14:08:04] [INFO ] Added : 230 causal constraints over 46 iterations in 7792 ms. Result :unknown
Could not prove EG p0
Stuttering acceptance computed with spot in 213 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Product exploration timeout after 82650 steps with 36 reset in 10002 ms.
Product exploration timeout after 81370 steps with 39 reset in 10001 ms.
Support contains 4 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 45 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:08:25] [INFO ] Invariant cache hit.
[2023-03-19 14:08:25] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:08:27] [INFO ] Implicit Places using invariants in 2169 ms returned []
[2023-03-19 14:08:27] [INFO ] Invariant cache hit.
[2023-03-19 14:08:27] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:08:31] [INFO ] Implicit Places using invariants and state equation in 4125 ms returned []
Implicit Place search using SMT with State Equation took 6296 ms to find 0 implicit places.
[2023-03-19 14:08:31] [INFO ] Invariant cache hit.
[2023-03-19 14:08:31] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:08:33] [INFO ] Dead Transitions using invariants and state equation in 1573 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7916 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Treatment of property SquareGrid-PT-100510-LTLCardinality-02 finished in 119558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 29 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:08:33] [INFO ] Invariant cache hit.
[2023-03-19 14:08:33] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:08:35] [INFO ] Implicit Places using invariants in 1865 ms returned []
[2023-03-19 14:08:35] [INFO ] Invariant cache hit.
[2023-03-19 14:08:35] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:08:38] [INFO ] Implicit Places using invariants and state equation in 3657 ms returned []
Implicit Place search using SMT with State Equation took 5525 ms to find 0 implicit places.
[2023-03-19 14:08:38] [INFO ] Invariant cache hit.
[2023-03-19 14:08:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:08:40] [INFO ] Dead Transitions using invariants and state equation in 1807 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7364 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SquareGrid-PT-100510-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s636 s698)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 401 reset in 9981 ms.
Product exploration timeout after 96850 steps with 358 reset in 10001 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 121 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 654 steps, including 0 resets, run visited all 1 properties in 71 ms. (steps per millisecond=9 )
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 183 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2023-03-19 14:09:03] [INFO ] Invariant cache hit.
[2023-03-19 14:09:07] [INFO ] [Real]Absence check using 540 positive place invariants in 622 ms returned sat
[2023-03-19 14:09:07] [INFO ] [Real]Absence check using 540 positive and 1 generalized place invariants in 327 ms returned sat
[2023-03-19 14:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 14:09:11] [INFO ] [Real]Absence check using state equation in 4629 ms returned sat
[2023-03-19 14:09:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 14:09:15] [INFO ] [Nat]Absence check using 540 positive place invariants in 655 ms returned sat
[2023-03-19 14:09:15] [INFO ] [Nat]Absence check using 540 positive and 1 generalized place invariants in 354 ms returned sat
[2023-03-19 14:09:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 14:09:19] [INFO ] [Nat]Absence check using state equation in 3802 ms returned sat
[2023-03-19 14:09:19] [INFO ] Computed and/alt/rep : 1240/1240/1240 causal constraints (skipped 0 transitions) in 105 ms.
[2023-03-19 14:09:29] [INFO ] Deduced a trap composed of 2 places in 2786 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 14:09:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 95 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:09:30] [INFO ] Invariant cache hit.
[2023-03-19 14:09:30] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:09:32] [INFO ] Implicit Places using invariants in 2309 ms returned []
[2023-03-19 14:09:32] [INFO ] Invariant cache hit.
[2023-03-19 14:09:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:09:35] [INFO ] Implicit Places using invariants and state equation in 3685 ms returned []
Implicit Place search using SMT with State Equation took 5997 ms to find 0 implicit places.
[2023-03-19 14:09:36] [INFO ] Redundant transitions in 107 ms returned []
[2023-03-19 14:09:36] [INFO ] Invariant cache hit.
[2023-03-19 14:09:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:09:38] [INFO ] Dead Transitions using invariants and state equation in 1914 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8121 ms. Remains : 1380/1380 places, 1640/1640 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 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 69 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=9 )
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 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2023-03-19 14:09:41] [INFO ] Invariant cache hit.
[2023-03-19 14:09:44] [INFO ] [Real]Absence check using 540 positive place invariants in 622 ms returned sat
[2023-03-19 14:09:44] [INFO ] [Real]Absence check using 540 positive and 1 generalized place invariants in 326 ms returned sat
[2023-03-19 14:09:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 14:09:49] [INFO ] [Real]Absence check using state equation in 4600 ms returned sat
[2023-03-19 14:09:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 14:09:52] [INFO ] [Nat]Absence check using 540 positive place invariants in 641 ms returned sat
[2023-03-19 14:09:52] [INFO ] [Nat]Absence check using 540 positive and 1 generalized place invariants in 396 ms returned sat
[2023-03-19 14:09:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 14:09:56] [INFO ] [Nat]Absence check using state equation in 3789 ms returned sat
[2023-03-19 14:09:56] [INFO ] Computed and/alt/rep : 1240/1240/1240 causal constraints (skipped 0 transitions) in 100 ms.
[2023-03-19 14:10:06] [INFO ] Deduced a trap composed of 2 places in 2546 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 14:10:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration timeout after 99230 steps with 395 reset in 10001 ms.
Product exploration timeout after 96060 steps with 337 reset in 10001 ms.
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 46 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:10:26] [INFO ] Invariant cache hit.
[2023-03-19 14:10:27] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:10:28] [INFO ] Implicit Places using invariants in 1427 ms returned []
[2023-03-19 14:10:28] [INFO ] Invariant cache hit.
[2023-03-19 14:10:28] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:10:32] [INFO ] Implicit Places using invariants and state equation in 3868 ms returned []
Implicit Place search using SMT with State Equation took 5296 ms to find 0 implicit places.
[2023-03-19 14:10:32] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-19 14:10:32] [INFO ] Invariant cache hit.
[2023-03-19 14:10:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:10:33] [INFO ] Dead Transitions using invariants and state equation in 1762 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7143 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Treatment of property SquareGrid-PT-100510-LTLCardinality-03 finished in 120840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 3 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 48 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:10:34] [INFO ] Invariant cache hit.
[2023-03-19 14:10:34] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:10:36] [INFO ] Implicit Places using invariants in 1963 ms returned []
[2023-03-19 14:10:36] [INFO ] Invariant cache hit.
[2023-03-19 14:10:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:10:39] [INFO ] Implicit Places using invariants and state equation in 3572 ms returned []
Implicit Place search using SMT with State Equation took 5537 ms to find 0 implicit places.
[2023-03-19 14:10:39] [INFO ] Invariant cache hit.
[2023-03-19 14:10:40] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:10:41] [INFO ] Dead Transitions using invariants and state equation in 1512 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7099 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SquareGrid-PT-100510-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 s609), p1:(GT s577 s695)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SquareGrid-PT-100510-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-100510-LTLCardinality-04 finished in 7241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)||G(p2)))))'
Support contains 6 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 26 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:10:41] [INFO ] Invariant cache hit.
[2023-03-19 14:10:41] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:10:43] [INFO ] Implicit Places using invariants in 1881 ms returned []
[2023-03-19 14:10:43] [INFO ] Invariant cache hit.
[2023-03-19 14:10:43] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:10:47] [INFO ] Implicit Places using invariants and state equation in 3931 ms returned []
Implicit Place search using SMT with State Equation took 5816 ms to find 0 implicit places.
[2023-03-19 14:10:47] [INFO ] Invariant cache hit.
[2023-03-19 14:10:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:10:48] [INFO ] Dead Transitions using invariants and state equation in 1655 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7500 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : SquareGrid-PT-100510-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GT s230 s568), p2:(LEQ s24 s263), p1:(LEQ s53 s683)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 28023 reset in 6298 ms.
Product exploration explored 100000 steps with 27763 reset in 6569 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) p2 p1), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 290 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Finished random walk after 1160 steps, including 0 resets, run visited all 2 properties in 231 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 305 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 6 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 45 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:11:05] [INFO ] Invariant cache hit.
[2023-03-19 14:11:06] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:11:07] [INFO ] Implicit Places using invariants in 2038 ms returned []
[2023-03-19 14:11:07] [INFO ] Invariant cache hit.
[2023-03-19 14:11:08] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:11:11] [INFO ] Implicit Places using invariants and state equation in 3904 ms returned []
Implicit Place search using SMT with State Equation took 5945 ms to find 0 implicit places.
[2023-03-19 14:11:11] [INFO ] Invariant cache hit.
[2023-03-19 14:11:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:11:13] [INFO ] Dead Transitions using invariants and state equation in 1861 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7854 ms. Remains : 1380/1380 places, 1640/1640 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 p1 (NOT p0) p2)]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 612 steps, including 0 resets, run visited all 2 properties in 74 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p1 (NOT p0) p2)]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 1 factoid took 251 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 27399 reset in 6623 ms.
Product exploration explored 100000 steps with 27863 reset in 6563 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 75 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:11:30] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-19 14:11:30] [INFO ] Invariant cache hit.
[2023-03-19 14:11:31] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:11:32] [INFO ] Dead Transitions using invariants and state equation in 1633 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1774 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Support contains 6 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 36 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:11:32] [INFO ] Invariant cache hit.
[2023-03-19 14:11:33] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:11:34] [INFO ] Implicit Places using invariants in 1939 ms returned []
[2023-03-19 14:11:34] [INFO ] Invariant cache hit.
[2023-03-19 14:11:34] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:11:38] [INFO ] Implicit Places using invariants and state equation in 3483 ms returned []
Implicit Place search using SMT with State Equation took 5426 ms to find 0 implicit places.
[2023-03-19 14:11:38] [INFO ] Invariant cache hit.
[2023-03-19 14:11:38] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:11:40] [INFO ] Dead Transitions using invariants and state equation in 1995 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7458 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Treatment of property SquareGrid-PT-100510-LTLCardinality-06 finished in 58786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1||(F((p2&&X(p3)))&&F(p1)))))'
Support contains 5 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 46 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:11:40] [INFO ] Invariant cache hit.
[2023-03-19 14:11:40] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:11:42] [INFO ] Implicit Places using invariants in 2168 ms returned []
[2023-03-19 14:11:42] [INFO ] Invariant cache hit.
[2023-03-19 14:11:42] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:11:45] [INFO ] Implicit Places using invariants and state equation in 3519 ms returned []
Implicit Place search using SMT with State Equation took 5689 ms to find 0 implicit places.
[2023-03-19 14:11:45] [INFO ] Invariant cache hit.
[2023-03-19 14:11:46] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:11:47] [INFO ] Dead Transitions using invariants and state equation in 2152 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7888 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Stuttering acceptance computed with spot in 333 ms :[(NOT p1), (OR (NOT p2) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : SquareGrid-PT-100510-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=0 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p2 p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=4 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p0 (NOT p3)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), acceptance={0} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0) (NOT p3)), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(GT 1 s564), p2:(LEQ s327 s880), p0:(LEQ 1 s777), p3:(LEQ 1 s177)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 92810 steps with 555 reset in 10001 ms.
Product exploration timeout after 91420 steps with 518 reset in 10002 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) p2 p0 p3), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p3)))))]
False Knowledge obtained : [(X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (NOT p1)), (X p1), (X (AND p2 p0 (NOT p3))), (X (NOT (AND p2 p0 (NOT p3)))), (X (AND (NOT p1) p2 p0 (NOT p3))), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p1) p2 p0)), (X (NOT (AND (NOT p1) p2 p0))), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (AND p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 p0 (NOT p3)))), (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (AND (NOT p1) p2 p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))))]
Knowledge based reduction with 23 factoid took 2735 ms. Reduced automaton from 8 states, 32 edges and 4 AP (stutter sensitive) to 8 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 479 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1965 ms. (steps per millisecond=5 ) properties (out of 20) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-19 14:12:18] [INFO ] Invariant cache hit.
[2023-03-19 14:12:18] [INFO ] After 548ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 14:12:19] [INFO ] [Nat]Absence check using 540 positive place invariants in 224 ms returned sat
[2023-03-19 14:12:19] [INFO ] [Nat]Absence check using 540 positive and 1 generalized place invariants in 99 ms returned sat
[2023-03-19 14:12:22] [INFO ] After 1986ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 14:12:24] [INFO ] After 3733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1025 ms.
[2023-03-19 14:12:25] [INFO ] After 6151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 5 different solutions.
Finished Parikh walk after 2446 steps, including 0 resets, run visited all 4 properties in 255 ms. (steps per millisecond=9 )
Parikh walk visited 10 properties in 1964 ms.
Knowledge obtained : [(AND (NOT p1) p2 p0 p3), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p3)))))]
False Knowledge obtained : [(X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (NOT p1)), (X p1), (X (AND p2 p0 (NOT p3))), (X (NOT (AND p2 p0 (NOT p3)))), (X (AND (NOT p1) p2 p0 (NOT p3))), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p1) p2 p0)), (X (NOT (AND (NOT p1) p2 p0))), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (AND p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 p0 (NOT p3)))), (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (AND (NOT p1) p2 p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (F (AND (NOT p0) p2 (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT (AND p0 p2 (NOT p1)))), (F (AND p0 p2 (NOT p3))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) p2 (NOT p3))), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (AND p0 p2))), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND p0 p2 (NOT p3) (NOT p1))), (F (NOT p2)), (F (AND (NOT p0) p2 (NOT p3) (NOT p1))), (F (AND p0 (NOT p2) (NOT p3) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F p1), (F (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))), (F (AND p2 (NOT p3))), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 23 factoid took 3870 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 465 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 468 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
[2023-03-19 14:12:31] [INFO ] Invariant cache hit.
[2023-03-19 14:12:34] [INFO ] [Real]Absence check using 540 positive place invariants in 623 ms returned sat
[2023-03-19 14:12:35] [INFO ] [Real]Absence check using 540 positive and 1 generalized place invariants in 597 ms returned sat
[2023-03-19 14:12:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 14:12:39] [INFO ] [Real]Absence check using state equation in 3966 ms returned sat
[2023-03-19 14:12:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 14:12:42] [INFO ] [Nat]Absence check using 540 positive place invariants in 614 ms returned sat
[2023-03-19 14:12:42] [INFO ] [Nat]Absence check using 540 positive and 1 generalized place invariants in 340 ms returned sat
[2023-03-19 14:12:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 14:12:46] [INFO ] [Nat]Absence check using state equation in 4057 ms returned sat
[2023-03-19 14:12:46] [INFO ] Computed and/alt/rep : 1240/1240/1240 causal constraints (skipped 0 transitions) in 97 ms.
[2023-03-19 14:12:56] [INFO ] Deduced a trap composed of 2 places in 2012 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 14:12:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 5 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 27 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:12:56] [INFO ] Invariant cache hit.
[2023-03-19 14:12:57] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:12:58] [INFO ] Implicit Places using invariants in 1971 ms returned []
[2023-03-19 14:12:58] [INFO ] Invariant cache hit.
[2023-03-19 14:12:59] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:13:02] [INFO ] Implicit Places using invariants and state equation in 3664 ms returned []
Implicit Place search using SMT with State Equation took 5637 ms to find 0 implicit places.
[2023-03-19 14:13:02] [INFO ] Invariant cache hit.
[2023-03-19 14:13:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:13:04] [INFO ] Dead Transitions using invariants and state equation in 1720 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7385 ms. Remains : 1380/1380 places, 1640/1640 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 p2 (NOT p1) p0 p3), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT p1)), (X p1), (X (AND p0 p2 (NOT p3) (NOT p1))), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))))]
Knowledge based reduction with 17 factoid took 1973 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 459 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1986 ms. (steps per millisecond=5 ) properties (out of 20) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-19 14:13:13] [INFO ] Invariant cache hit.
[2023-03-19 14:13:13] [INFO ] After 431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 14:13:14] [INFO ] [Nat]Absence check using 540 positive place invariants in 198 ms returned sat
[2023-03-19 14:13:14] [INFO ] [Nat]Absence check using 540 positive and 1 generalized place invariants in 86 ms returned sat
[2023-03-19 14:13:16] [INFO ] After 1995ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 14:13:18] [INFO ] After 3698ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1009 ms.
[2023-03-19 14:13:19] [INFO ] After 5874ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 9 different solutions.
Finished Parikh walk after 2685 steps, including 0 resets, run visited all 4 properties in 264 ms. (steps per millisecond=10 )
Parikh walk visited 10 properties in 2078 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0 p3), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT p1)), (X p1), (X (AND p0 p2 (NOT p3) (NOT p1))), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p1) (NOT p2) p0)), (F (NOT (AND (NOT p1) p2 p0))), (F (AND p2 p0 (NOT p3))), (F (AND p2 (NOT p0))), (F (AND p2 (NOT p0) (NOT p3))), (F (AND (NOT p2) p0)), (F (AND (NOT p2) p0 (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (AND p2 p0))), (F (AND (NOT p2) (NOT p0) (NOT p3))), (F (AND (NOT p1) p2 p0 (NOT p3))), (F (NOT p2)), (F (AND (NOT p1) p2 (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) p0 (NOT p3))), (F (AND (NOT p2) (NOT p0))), (F p1), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (AND p2 (NOT p3))), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 17 factoid took 2659 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 457 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 457 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
[2023-03-19 14:13:25] [INFO ] Invariant cache hit.
[2023-03-19 14:13:28] [INFO ] [Real]Absence check using 540 positive place invariants in 642 ms returned sat
[2023-03-19 14:13:28] [INFO ] [Real]Absence check using 540 positive and 1 generalized place invariants in 596 ms returned sat
[2023-03-19 14:13:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 14:13:32] [INFO ] [Real]Absence check using state equation in 4014 ms returned sat
[2023-03-19 14:13:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 14:13:35] [INFO ] [Nat]Absence check using 540 positive place invariants in 727 ms returned sat
[2023-03-19 14:13:36] [INFO ] [Nat]Absence check using 540 positive and 1 generalized place invariants in 401 ms returned sat
[2023-03-19 14:13:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 14:13:40] [INFO ] [Nat]Absence check using state equation in 4066 ms returned sat
[2023-03-19 14:13:40] [INFO ] Computed and/alt/rep : 1240/1240/1240 causal constraints (skipped 0 transitions) in 95 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 14:13:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 490 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration timeout after 95140 steps with 599 reset in 10001 ms.
Product exploration timeout after 89860 steps with 444 reset in 10002 ms.
Applying partial POR strategy [false, false, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 5 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 47 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:14:09] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-19 14:14:09] [INFO ] Invariant cache hit.
[2023-03-19 14:14:09] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:14:11] [INFO ] Dead Transitions using invariants and state equation in 2083 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2174 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Support contains 5 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 26 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:14:11] [INFO ] Invariant cache hit.
[2023-03-19 14:14:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:14:13] [INFO ] Implicit Places using invariants in 1949 ms returned []
[2023-03-19 14:14:13] [INFO ] Invariant cache hit.
[2023-03-19 14:14:13] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:14:17] [INFO ] Implicit Places using invariants and state equation in 4119 ms returned []
Implicit Place search using SMT with State Equation took 6072 ms to find 0 implicit places.
[2023-03-19 14:14:17] [INFO ] Invariant cache hit.
[2023-03-19 14:14:17] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:14:19] [INFO ] Dead Transitions using invariants and state equation in 2198 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8298 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Treatment of property SquareGrid-PT-100510-LTLCardinality-08 finished in 159392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 30 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:14:19] [INFO ] Invariant cache hit.
[2023-03-19 14:14:20] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:14:21] [INFO ] Implicit Places using invariants in 1862 ms returned []
[2023-03-19 14:14:21] [INFO ] Invariant cache hit.
[2023-03-19 14:14:21] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:14:25] [INFO ] Implicit Places using invariants and state equation in 4381 ms returned []
Implicit Place search using SMT with State Equation took 6246 ms to find 0 implicit places.
[2023-03-19 14:14:25] [INFO ] Invariant cache hit.
[2023-03-19 14:14:26] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:14:27] [INFO ] Dead Transitions using invariants and state equation in 2059 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8337 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SquareGrid-PT-100510-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GT s310 s424)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA SquareGrid-PT-100510-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-100510-LTLCardinality-12 finished in 8549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : SquareGrid-PT-100510-LTLCardinality-00
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 74 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:14:28] [INFO ] Invariant cache hit.
[2023-03-19 14:14:29] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:14:30] [INFO ] Implicit Places using invariants in 2326 ms returned []
[2023-03-19 14:14:30] [INFO ] Invariant cache hit.
[2023-03-19 14:14:31] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:14:34] [INFO ] Implicit Places using invariants and state equation in 3416 ms returned []
Implicit Place search using SMT with State Equation took 5743 ms to find 0 implicit places.
[2023-03-19 14:14:34] [INFO ] Invariant cache hit.
[2023-03-19 14:14:34] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:14:35] [INFO ] Dead Transitions using invariants and state equation in 1868 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7687 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Running random walk in product with property : SquareGrid-PT-100510-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s339)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 30964 reset in 7397 ms.
Product exploration explored 100000 steps with 28466 reset in 8023 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 127 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1321 steps, including 0 resets, run visited all 1 properties in 148 ms. (steps per millisecond=8 )
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 142 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 45 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:14:54] [INFO ] Invariant cache hit.
[2023-03-19 14:14:55] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:14:56] [INFO ] Implicit Places using invariants in 1971 ms returned []
[2023-03-19 14:14:56] [INFO ] Invariant cache hit.
[2023-03-19 14:14:57] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:15:01] [INFO ] Implicit Places using invariants and state equation in 4463 ms returned []
Implicit Place search using SMT with State Equation took 6435 ms to find 0 implicit places.
[2023-03-19 14:15:01] [INFO ] Invariant cache hit.
[2023-03-19 14:15:01] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:15:03] [INFO ] Dead Transitions using invariants and state equation in 1870 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8352 ms. Remains : 1380/1380 places, 1640/1640 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 122 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 842 steps, including 0 resets, run visited all 1 properties in 161 ms. (steps per millisecond=5 )
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 217 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 34779 reset in 6981 ms.
Product exploration explored 100000 steps with 27819 reset in 8324 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 63 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:15:22] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-19 14:15:22] [INFO ] Invariant cache hit.
[2023-03-19 14:15:22] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:15:24] [INFO ] Dead Transitions using invariants and state equation in 1913 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2033 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 40 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:15:24] [INFO ] Invariant cache hit.
[2023-03-19 14:15:24] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:15:26] [INFO ] Implicit Places using invariants in 2115 ms returned []
[2023-03-19 14:15:26] [INFO ] Invariant cache hit.
[2023-03-19 14:15:26] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:15:30] [INFO ] Implicit Places using invariants and state equation in 3656 ms returned []
Implicit Place search using SMT with State Equation took 5773 ms to find 0 implicit places.
[2023-03-19 14:15:30] [INFO ] Invariant cache hit.
[2023-03-19 14:15:30] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:15:32] [INFO ] Dead Transitions using invariants and state equation in 1938 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7753 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Treatment of property SquareGrid-PT-100510-LTLCardinality-00 finished in 64100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F((p1&&X(!p0)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : SquareGrid-PT-100510-LTLCardinality-03
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 63 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:15:32] [INFO ] Invariant cache hit.
[2023-03-19 14:15:33] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:15:34] [INFO ] Implicit Places using invariants in 2136 ms returned []
[2023-03-19 14:15:34] [INFO ] Invariant cache hit.
[2023-03-19 14:15:35] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:15:38] [INFO ] Implicit Places using invariants and state equation in 3884 ms returned []
Implicit Place search using SMT with State Equation took 6023 ms to find 0 implicit places.
[2023-03-19 14:15:38] [INFO ] Invariant cache hit.
[2023-03-19 14:15:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:15:40] [INFO ] Dead Transitions using invariants and state equation in 1770 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7858 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Running random walk in product with property : SquareGrid-PT-100510-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s636 s698)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 368 reset in 9999 ms.
Product exploration timeout after 96880 steps with 364 reset in 10001 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 113 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=5 )
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 195 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
[2023-03-19 14:16:03] [INFO ] Invariant cache hit.
[2023-03-19 14:16:06] [INFO ] [Real]Absence check using 540 positive place invariants in 823 ms returned sat
[2023-03-19 14:16:07] [INFO ] [Real]Absence check using 540 positive and 1 generalized place invariants in 514 ms returned sat
[2023-03-19 14:16:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 14:16:11] [INFO ] [Real]Absence check using state equation in 4819 ms returned sat
[2023-03-19 14:16:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 14:16:15] [INFO ] [Nat]Absence check using 540 positive place invariants in 659 ms returned sat
[2023-03-19 14:16:15] [INFO ] [Nat]Absence check using 540 positive and 1 generalized place invariants in 356 ms returned sat
[2023-03-19 14:16:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 14:16:19] [INFO ] [Nat]Absence check using state equation in 3882 ms returned sat
[2023-03-19 14:16:19] [INFO ] Computed and/alt/rep : 1240/1240/1240 causal constraints (skipped 0 transitions) in 93 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 14:16:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 64 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:16:27] [INFO ] Invariant cache hit.
[2023-03-19 14:16:27] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:16:29] [INFO ] Implicit Places using invariants in 2183 ms returned []
[2023-03-19 14:16:29] [INFO ] Invariant cache hit.
[2023-03-19 14:16:29] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:16:33] [INFO ] Implicit Places using invariants and state equation in 3726 ms returned []
Implicit Place search using SMT with State Equation took 5912 ms to find 0 implicit places.
[2023-03-19 14:16:33] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-19 14:16:33] [INFO ] Invariant cache hit.
[2023-03-19 14:16:33] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:16:35] [INFO ] Dead Transitions using invariants and state equation in 2059 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8075 ms. Remains : 1380/1380 places, 1640/1640 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 111 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 1201 steps, including 0 resets, run visited all 1 properties in 138 ms. (steps per millisecond=8 )
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 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-19 14:16:38] [INFO ] Invariant cache hit.
[2023-03-19 14:16:41] [INFO ] [Real]Absence check using 540 positive place invariants in 622 ms returned sat
[2023-03-19 14:16:41] [INFO ] [Real]Absence check using 540 positive and 1 generalized place invariants in 327 ms returned sat
[2023-03-19 14:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 14:16:46] [INFO ] [Real]Absence check using state equation in 4797 ms returned sat
[2023-03-19 14:16:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 14:16:50] [INFO ] [Nat]Absence check using 540 positive place invariants in 822 ms returned sat
[2023-03-19 14:16:50] [INFO ] [Nat]Absence check using 540 positive and 1 generalized place invariants in 353 ms returned sat
[2023-03-19 14:16:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 14:16:54] [INFO ] [Nat]Absence check using state equation in 3836 ms returned sat
[2023-03-19 14:16:54] [INFO ] Computed and/alt/rep : 1240/1240/1240 causal constraints (skipped 0 transitions) in 96 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 14:17:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 420 reset in 9911 ms.
Product exploration timeout after 96530 steps with 366 reset in 10001 ms.
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 37 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:17:21] [INFO ] Invariant cache hit.
[2023-03-19 14:17:22] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:17:23] [INFO ] Implicit Places using invariants in 1987 ms returned []
[2023-03-19 14:17:23] [INFO ] Invariant cache hit.
[2023-03-19 14:17:24] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:17:27] [INFO ] Implicit Places using invariants and state equation in 3742 ms returned []
Implicit Place search using SMT with State Equation took 5730 ms to find 0 implicit places.
[2023-03-19 14:17:27] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-19 14:17:27] [INFO ] Invariant cache hit.
[2023-03-19 14:17:28] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:17:29] [INFO ] Dead Transitions using invariants and state equation in 1784 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7591 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Treatment of property SquareGrid-PT-100510-LTLCardinality-03 finished in 117259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)||G(p2)))))'
Found a Shortening insensitive property : SquareGrid-PT-100510-LTLCardinality-06
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 6 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 63 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:17:29] [INFO ] Invariant cache hit.
[2023-03-19 14:17:30] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:17:31] [INFO ] Implicit Places using invariants in 2087 ms returned []
[2023-03-19 14:17:31] [INFO ] Invariant cache hit.
[2023-03-19 14:17:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:17:35] [INFO ] Implicit Places using invariants and state equation in 3345 ms returned []
Implicit Place search using SMT with State Equation took 5434 ms to find 0 implicit places.
[2023-03-19 14:17:35] [INFO ] Invariant cache hit.
[2023-03-19 14:17:35] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:17:37] [INFO ] Dead Transitions using invariants and state equation in 2239 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7738 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Running random walk in product with property : SquareGrid-PT-100510-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GT s230 s568), p2:(LEQ s24 s263), p1:(LEQ s53 s683)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 27949 reset in 6411 ms.
Product exploration explored 100000 steps with 27533 reset in 6953 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) p2 p1), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 160 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Finished random walk after 994 steps, including 0 resets, run visited all 2 properties in 114 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 255 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 6 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 44 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:17:54] [INFO ] Invariant cache hit.
[2023-03-19 14:17:55] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:17:56] [INFO ] Implicit Places using invariants in 1808 ms returned []
[2023-03-19 14:17:56] [INFO ] Invariant cache hit.
[2023-03-19 14:17:56] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:18:00] [INFO ] Implicit Places using invariants and state equation in 3671 ms returned []
Implicit Place search using SMT with State Equation took 5481 ms to find 0 implicit places.
[2023-03-19 14:18:00] [INFO ] Invariant cache hit.
[2023-03-19 14:18:00] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:18:01] [INFO ] Dead Transitions using invariants and state equation in 1845 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7373 ms. Remains : 1380/1380 places, 1640/1640 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 p1 (NOT p0) p2)]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 1971 steps, including 0 resets, run visited all 2 properties in 374 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p1 (NOT p0) p2)]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 1 factoid took 252 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 27711 reset in 6601 ms.
Product exploration explored 100000 steps with 27262 reset in 6760 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 60 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:18:19] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-19 14:18:19] [INFO ] Invariant cache hit.
[2023-03-19 14:18:20] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:18:21] [INFO ] Dead Transitions using invariants and state equation in 2103 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2224 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Support contains 6 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 29 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:18:22] [INFO ] Invariant cache hit.
[2023-03-19 14:18:22] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:18:24] [INFO ] Implicit Places using invariants in 2291 ms returned []
[2023-03-19 14:18:24] [INFO ] Invariant cache hit.
[2023-03-19 14:18:24] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:18:27] [INFO ] Implicit Places using invariants and state equation in 3649 ms returned []
Implicit Place search using SMT with State Equation took 5942 ms to find 0 implicit places.
[2023-03-19 14:18:27] [INFO ] Invariant cache hit.
[2023-03-19 14:18:28] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:18:29] [INFO ] Dead Transitions using invariants and state equation in 1575 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7548 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Treatment of property SquareGrid-PT-100510-LTLCardinality-06 finished in 60052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1||(F((p2&&X(p3)))&&F(p1)))))'
Found a Shortening insensitive property : SquareGrid-PT-100510-LTLCardinality-08
Stuttering acceptance computed with spot in 455 ms :[(NOT p1), (OR (NOT p2) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 5 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 60 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:18:30] [INFO ] Invariant cache hit.
[2023-03-19 14:18:30] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:18:32] [INFO ] Implicit Places using invariants in 2262 ms returned []
[2023-03-19 14:18:32] [INFO ] Invariant cache hit.
[2023-03-19 14:18:33] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:18:36] [INFO ] Implicit Places using invariants and state equation in 4075 ms returned []
Implicit Place search using SMT with State Equation took 6339 ms to find 0 implicit places.
[2023-03-19 14:18:36] [INFO ] Invariant cache hit.
[2023-03-19 14:18:37] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:18:38] [INFO ] Dead Transitions using invariants and state equation in 1674 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8075 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Running random walk in product with property : SquareGrid-PT-100510-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=0 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p2 p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=4 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p0 (NOT p3)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), acceptance={0} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0) (NOT p3)), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(GT 1 s564), p2:(LEQ s327 s880), p0:(LEQ 1 s777), p3:(LEQ 1 s177)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 92750 steps with 551 reset in 10001 ms.
Product exploration timeout after 89870 steps with 480 reset in 10002 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) p2 p0 p3), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p3)))))]
False Knowledge obtained : [(X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (NOT p1)), (X p1), (X (AND p2 p0 (NOT p3))), (X (NOT (AND p2 p0 (NOT p3)))), (X (AND (NOT p1) p2 p0 (NOT p3))), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p1) p2 p0)), (X (NOT (AND (NOT p1) p2 p0))), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (AND p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 p0 (NOT p3)))), (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (AND (NOT p1) p2 p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))))]
Knowledge based reduction with 23 factoid took 2962 ms. Reduced automaton from 8 states, 32 edges and 4 AP (stutter sensitive) to 8 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 455 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1913 ms. (steps per millisecond=5 ) properties (out of 20) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-19 14:19:08] [INFO ] Invariant cache hit.
[2023-03-19 14:19:08] [INFO ] After 515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 14:19:09] [INFO ] [Nat]Absence check using 540 positive place invariants in 230 ms returned sat
[2023-03-19 14:19:09] [INFO ] [Nat]Absence check using 540 positive and 1 generalized place invariants in 99 ms returned sat
[2023-03-19 14:19:12] [INFO ] After 2003ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 14:19:13] [INFO ] After 3709ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1008 ms.
[2023-03-19 14:19:14] [INFO ] After 6104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 5 different solutions.
Finished Parikh walk after 3212 steps, including 0 resets, run visited all 4 properties in 297 ms. (steps per millisecond=10 )
Parikh walk visited 10 properties in 2014 ms.
Knowledge obtained : [(AND (NOT p1) p2 p0 p3), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p3)))))]
False Knowledge obtained : [(X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (NOT p1)), (X p1), (X (AND p2 p0 (NOT p3))), (X (NOT (AND p2 p0 (NOT p3)))), (X (AND (NOT p1) p2 p0 (NOT p3))), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p1) p2 p0)), (X (NOT (AND (NOT p1) p2 p0))), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (AND p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 p0 (NOT p3)))), (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (AND (NOT p1) p2 p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (F (AND (NOT p0) p2 (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT (AND p0 p2 (NOT p1)))), (F (AND p0 p2 (NOT p3))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) p2 (NOT p3))), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (AND p0 p2))), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND p0 p2 (NOT p3) (NOT p1))), (F (NOT p2)), (F (AND (NOT p0) p2 (NOT p3) (NOT p1))), (F (AND p0 (NOT p2) (NOT p3) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F p1), (F (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))), (F (AND p2 (NOT p3))), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 23 factoid took 3547 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 426 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 464 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
[2023-03-19 14:19:21] [INFO ] Invariant cache hit.
[2023-03-19 14:19:24] [INFO ] [Real]Absence check using 540 positive place invariants in 627 ms returned sat
[2023-03-19 14:19:25] [INFO ] [Real]Absence check using 540 positive and 1 generalized place invariants in 789 ms returned sat
[2023-03-19 14:19:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 14:19:29] [INFO ] [Real]Absence check using state equation in 3965 ms returned sat
[2023-03-19 14:19:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 14:19:32] [INFO ] [Nat]Absence check using 540 positive place invariants in 717 ms returned sat
[2023-03-19 14:19:32] [INFO ] [Nat]Absence check using 540 positive and 1 generalized place invariants in 425 ms returned sat
[2023-03-19 14:19:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 14:19:36] [INFO ] [Nat]Absence check using state equation in 4082 ms returned sat
[2023-03-19 14:19:37] [INFO ] Computed and/alt/rep : 1240/1240/1240 causal constraints (skipped 0 transitions) in 94 ms.
[2023-03-19 14:19:46] [INFO ] Deduced a trap composed of 2 places in 1804 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 14:19:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 5 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 28 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:19:46] [INFO ] Invariant cache hit.
[2023-03-19 14:19:46] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:19:48] [INFO ] Implicit Places using invariants in 2043 ms returned []
[2023-03-19 14:19:48] [INFO ] Invariant cache hit.
[2023-03-19 14:19:48] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:19:52] [INFO ] Implicit Places using invariants and state equation in 4110 ms returned []
Implicit Place search using SMT with State Equation took 6156 ms to find 0 implicit places.
[2023-03-19 14:19:52] [INFO ] Invariant cache hit.
[2023-03-19 14:19:52] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:19:54] [INFO ] Dead Transitions using invariants and state equation in 2047 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8231 ms. Remains : 1380/1380 places, 1640/1640 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 p2 (NOT p1) p0 p3), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT p1)), (X p1), (X (AND p0 p2 (NOT p3) (NOT p1))), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))))]
Knowledge based reduction with 17 factoid took 1971 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 459 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1799 ms. (steps per millisecond=5 ) properties (out of 20) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-19 14:20:03] [INFO ] Invariant cache hit.
[2023-03-19 14:20:03] [INFO ] After 414ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 14:20:04] [INFO ] [Nat]Absence check using 540 positive place invariants in 231 ms returned sat
[2023-03-19 14:20:04] [INFO ] [Nat]Absence check using 540 positive and 1 generalized place invariants in 100 ms returned sat
[2023-03-19 14:20:06] [INFO ] After 1965ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 14:20:08] [INFO ] After 3672ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1024 ms.
[2023-03-19 14:20:09] [INFO ] After 6091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 9 different solutions.
Finished Parikh walk after 3241 steps, including 0 resets, run visited all 4 properties in 314 ms. (steps per millisecond=10 )
Parikh walk visited 10 properties in 2214 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0 p3), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT p1)), (X p1), (X (AND p0 p2 (NOT p3) (NOT p1))), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p1) (NOT p2) p0)), (F (NOT (AND (NOT p1) p2 p0))), (F (AND p2 p0 (NOT p3))), (F (AND p2 (NOT p0))), (F (AND p2 (NOT p0) (NOT p3))), (F (AND (NOT p2) p0)), (F (AND (NOT p2) p0 (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (AND p2 p0))), (F (AND (NOT p2) (NOT p0) (NOT p3))), (F (AND (NOT p1) p2 p0 (NOT p3))), (F (NOT p2)), (F (AND (NOT p1) p2 (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) p0 (NOT p3))), (F (AND (NOT p2) (NOT p0))), (F p1), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (AND p2 (NOT p3))), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 17 factoid took 2757 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 450 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 451 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
[2023-03-19 14:20:15] [INFO ] Invariant cache hit.
[2023-03-19 14:20:18] [INFO ] [Real]Absence check using 540 positive place invariants in 585 ms returned sat
[2023-03-19 14:20:18] [INFO ] [Real]Absence check using 540 positive and 1 generalized place invariants in 593 ms returned sat
[2023-03-19 14:20:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 14:20:22] [INFO ] [Real]Absence check using state equation in 4140 ms returned sat
[2023-03-19 14:20:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 14:20:25] [INFO ] [Nat]Absence check using 540 positive place invariants in 559 ms returned sat
[2023-03-19 14:20:25] [INFO ] [Nat]Absence check using 540 positive and 1 generalized place invariants in 339 ms returned sat
[2023-03-19 14:20:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 14:20:30] [INFO ] [Nat]Absence check using state equation in 4040 ms returned sat
[2023-03-19 14:20:30] [INFO ] Computed and/alt/rep : 1240/1240/1240 causal constraints (skipped 0 transitions) in 150 ms.
[2023-03-19 14:20:40] [INFO ] Deduced a trap composed of 2 places in 2337 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 14:20:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 443 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration timeout after 87370 steps with 446 reset in 10001 ms.
Product exploration timeout after 88920 steps with 430 reset in 10001 ms.
Applying partial POR strategy [false, false, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 405 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 5 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 60 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:21:01] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-19 14:21:01] [INFO ] Invariant cache hit.
[2023-03-19 14:21:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:21:03] [INFO ] Dead Transitions using invariants and state equation in 2123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2246 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Support contains 5 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 1640/1640 transitions.
Applied a total of 0 rules in 26 ms. Remains 1380 /1380 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-19 14:21:03] [INFO ] Invariant cache hit.
[2023-03-19 14:21:04] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:21:05] [INFO ] Implicit Places using invariants in 1913 ms returned []
[2023-03-19 14:21:05] [INFO ] Invariant cache hit.
[2023-03-19 14:21:06] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:21:09] [INFO ] Implicit Places using invariants and state equation in 3760 ms returned []
Implicit Place search using SMT with State Equation took 5675 ms to find 0 implicit places.
[2023-03-19 14:21:09] [INFO ] Invariant cache hit.
[2023-03-19 14:21:09] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 14:21:11] [INFO ] Dead Transitions using invariants and state equation in 2012 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7714 ms. Remains : 1380/1380 places, 1640/1640 transitions.
Treatment of property SquareGrid-PT-100510-LTLCardinality-08 finished in 161802 ms.
[2023-03-19 14:21:11] [INFO ] Flatten gal took : 99 ms
[2023-03-19 14:21:11] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-19 14:21:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1380 places, 1640 transitions and 6560 arcs took 18 ms.
Total runtime 985506 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SquareGrid-PT-100510
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
LTLCardinality

FORMULA SquareGrid-PT-100510-LTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SquareGrid-PT-100510-LTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SquareGrid-PT-100510-LTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SquareGrid-PT-100510-LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679235734533

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 8 (type EXCL) for 3 SquareGrid-PT-100510-LTLCardinality-02
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 8 (type EXCL) for SquareGrid-PT-100510-LTLCardinality-02
lola: result : false
lola: markings : 11578
lola: fired transitions : 11578
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 17 (type EXCL) for 16 SquareGrid-PT-100510-LTLCardinality-08
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: FINISHED task # 17 (type EXCL) for SquareGrid-PT-100510-LTLCardinality-08
lola: result : false
lola: markings : 22959
lola: fired transitions : 22969
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 14 (type EXCL) for 13 SquareGrid-PT-100510-LTLCardinality-06
lola: time limit : 1199 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SquareGrid-PT-100510-LTLCardinality-02: CONJ false LTL model checker
SquareGrid-PT-100510-LTLCardinality-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SquareGrid-PT-100510-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 3/1199 3/32 SquareGrid-PT-100510-LTLCardinality-06 149125 m, 29825 m/sec, 311252 t fired, .

Time elapsed: 6 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SquareGrid-PT-100510-LTLCardinality-02: CONJ false LTL model checker
SquareGrid-PT-100510-LTLCardinality-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SquareGrid-PT-100510-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 8/1199 6/32 SquareGrid-PT-100510-LTLCardinality-06 358035 m, 41782 m/sec, 809174 t fired, .

Time elapsed: 11 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SquareGrid-PT-100510-LTLCardinality-02: CONJ false LTL model checker
SquareGrid-PT-100510-LTLCardinality-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SquareGrid-PT-100510-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 13/1199 9/32 SquareGrid-PT-100510-LTLCardinality-06 544048 m, 37202 m/sec, 1291289 t fired, .

Time elapsed: 16 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SquareGrid-PT-100510-LTLCardinality-02: CONJ false LTL model checker
SquareGrid-PT-100510-LTLCardinality-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SquareGrid-PT-100510-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 18/1199 11/32 SquareGrid-PT-100510-LTLCardinality-06 744023 m, 39995 m/sec, 1772925 t fired, .

Time elapsed: 21 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SquareGrid-PT-100510-LTLCardinality-02: CONJ false LTL model checker
SquareGrid-PT-100510-LTLCardinality-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SquareGrid-PT-100510-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 23/1199 15/32 SquareGrid-PT-100510-LTLCardinality-06 956825 m, 42560 m/sec, 2264769 t fired, .

Time elapsed: 26 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SquareGrid-PT-100510-LTLCardinality-02: CONJ false LTL model checker
SquareGrid-PT-100510-LTLCardinality-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SquareGrid-PT-100510-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 28/1199 18/32 SquareGrid-PT-100510-LTLCardinality-06 1161191 m, 40873 m/sec, 2758203 t fired, .

Time elapsed: 31 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SquareGrid-PT-100510-LTLCardinality-02: CONJ false LTL model checker
SquareGrid-PT-100510-LTLCardinality-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SquareGrid-PT-100510-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 33/1199 21/32 SquareGrid-PT-100510-LTLCardinality-06 1365837 m, 40929 m/sec, 3264473 t fired, .

Time elapsed: 36 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SquareGrid-PT-100510-LTLCardinality-02: CONJ false LTL model checker
SquareGrid-PT-100510-LTLCardinality-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SquareGrid-PT-100510-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 38/1199 24/32 SquareGrid-PT-100510-LTLCardinality-06 1550294 m, 36891 m/sec, 3757469 t fired, .

Time elapsed: 41 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SquareGrid-PT-100510-LTLCardinality-02: CONJ false LTL model checker
SquareGrid-PT-100510-LTLCardinality-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SquareGrid-PT-100510-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 43/1199 25/32 SquareGrid-PT-100510-LTLCardinality-06 1709032 m, 31747 m/sec, 4244384 t fired, .

Time elapsed: 46 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SquareGrid-PT-100510-LTLCardinality-02: CONJ false LTL model checker
SquareGrid-PT-100510-LTLCardinality-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SquareGrid-PT-100510-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 48/1199 28/32 SquareGrid-PT-100510-LTLCardinality-06 1859546 m, 30102 m/sec, 4750126 t fired, .

Time elapsed: 51 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SquareGrid-PT-100510-LTLCardinality-02: CONJ false LTL model checker
SquareGrid-PT-100510-LTLCardinality-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SquareGrid-PT-100510-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 53/1199 30/32 SquareGrid-PT-100510-LTLCardinality-06 2042431 m, 36577 m/sec, 5230018 t fired, .

Time elapsed: 56 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 14 (type EXCL) for SquareGrid-PT-100510-LTLCardinality-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SquareGrid-PT-100510-LTLCardinality-02: CONJ false LTL model checker
SquareGrid-PT-100510-LTLCardinality-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SquareGrid-PT-100510-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
SquareGrid-PT-100510-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 61 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 11 (type EXCL) for 10 SquareGrid-PT-100510-LTLCardinality-03
lola: time limit : 1769 sec
lola: memory limit: 32 pages
lola: FINISHED task # 11 (type EXCL) for SquareGrid-PT-100510-LTLCardinality-03
lola: result : false
lola: markings : 24986
lola: fired transitions : 24996
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 SquareGrid-PT-100510-LTLCardinality-00
lola: time limit : 3538 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for SquareGrid-PT-100510-LTLCardinality-00
lola: result : false
lola: markings : 17247
lola: fired transitions : 17257
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 5

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SquareGrid-PT-100510-LTLCardinality-00: LTL false LTL model checker
SquareGrid-PT-100510-LTLCardinality-02: CONJ false LTL model checker
SquareGrid-PT-100510-LTLCardinality-03: LTL false LTL model checker
SquareGrid-PT-100510-LTLCardinality-06: LTL unknown AGGR
SquareGrid-PT-100510-LTLCardinality-08: LTL false LTL model checker


Time elapsed: 62 secs. Pages in use: 32

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-100510"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is SquareGrid-PT-100510, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r455-smll-167912647300379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SquareGrid-PT-100510.tgz
mv SquareGrid-PT-100510 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;