fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r489-tall-167912707200740
Last Updated
May 14, 2023

About the Execution of LTSMin+red for TriangularGrid-PT-3026

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
424.304 56670.00 73049.00 749.50 F????FF?FTFFFFFF normal

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.r489-tall-167912707200740.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 ltsminxred
Input is TriangularGrid-PT-3026, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707200740
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.7K Feb 26 01:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 01:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 01:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 17:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Feb 26 01:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 01:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 70K 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 TriangularGrid-PT-3026-LTLFireability-00
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-01
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-02
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-03
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-04
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-05
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-06
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-07
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-08
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-09
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-10
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-11
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-12
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-13
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-14
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679310108474

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TriangularGrid-PT-3026
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 11:01:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 11:01:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 11:01:50] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-20 11:01:50] [INFO ] Transformed 108 places.
[2023-03-20 11:01:50] [INFO ] Transformed 90 transitions.
[2023-03-20 11:01:50] [INFO ] Parsed PT model containing 108 places and 90 transitions and 360 arcs in 111 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA TriangularGrid-PT-3026-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-3026-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-3026-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-3026-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 12 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 108 cols
[2023-03-20 11:01:50] [INFO ] Computed 46 place invariants in 15 ms
[2023-03-20 11:01:50] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-20 11:01:50] [INFO ] Invariant cache hit.
[2023-03-20 11:01:50] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2023-03-20 11:01:50] [INFO ] Invariant cache hit.
[2023-03-20 11:01:50] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 462 ms. Remains : 108/108 places, 90/90 transitions.
Support contains 42 out of 108 places after structural reductions.
[2023-03-20 11:01:51] [INFO ] Flatten gal took : 30 ms
[2023-03-20 11:01:51] [INFO ] Flatten gal took : 13 ms
[2023-03-20 11:01:51] [INFO ] Input system was already deterministic with 90 transitions.
Finished random walk after 118 steps, including 0 resets, run visited all 25 properties in 28 ms. (steps per millisecond=4 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(X(p1))) U (!p1&&X(F(p1)))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:01:51] [INFO ] Invariant cache hit.
[2023-03-20 11:01:51] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-20 11:01:51] [INFO ] Invariant cache hit.
[2023-03-20 11:01:51] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-20 11:01:51] [INFO ] Invariant cache hit.
[2023-03-20 11:01:52] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 301 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 304 ms :[true, (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s30 1) (GEQ s44 1)), p0:(AND (GEQ s29 1) (GEQ s74 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1507 reset in 626 ms.
Product exploration explored 100000 steps with 1545 reset in 638 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), true]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 263 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
Finished random walk after 45 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), true]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 4 factoid took 272 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 p1)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
[2023-03-20 11:01:54] [INFO ] Invariant cache hit.
[2023-03-20 11:01:54] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-20 11:01:54] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-20 11:01:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:01:54] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-20 11:01:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:01:54] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-20 11:01:54] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-20 11:01:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:01:54] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-20 11:01:54] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-20 11:01:54] [INFO ] Added : 34 causal constraints over 7 iterations in 81 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 108 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 9 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:01:54] [INFO ] Invariant cache hit.
[2023-03-20 11:01:54] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-20 11:01:54] [INFO ] Invariant cache hit.
[2023-03-20 11:01:54] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-20 11:01:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 11:01:54] [INFO ] Invariant cache hit.
[2023-03-20 11:01:54] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 261 ms. Remains : 108/108 places, 90/90 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 124 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 44 ms :[(NOT p1)]
Finished random walk after 54 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=18 )
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 148 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 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
[2023-03-20 11:01:55] [INFO ] Invariant cache hit.
[2023-03-20 11:01:55] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-20 11:01:55] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-20 11:01:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:01:55] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-20 11:01:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:01:55] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2023-03-20 11:01:55] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-20 11:01:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:01:55] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-20 11:01:55] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-20 11:01:55] [INFO ] Added : 34 causal constraints over 7 iterations in 72 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1480 reset in 527 ms.
Product exploration explored 100000 steps with 1531 reset in 582 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:01:56] [INFO ] Invariant cache hit.
[2023-03-20 11:01:56] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-20 11:01:56] [INFO ] Invariant cache hit.
[2023-03-20 11:01:57] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-20 11:01:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 11:01:57] [INFO ] Invariant cache hit.
[2023-03-20 11:01:57] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 262 ms. Remains : 108/108 places, 90/90 transitions.
Treatment of property TriangularGrid-PT-3026-LTLFireability-01 finished in 5565 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(F((p0||G(p1)))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 11 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:01:57] [INFO ] Invariant cache hit.
[2023-03-20 11:01:57] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-20 11:01:57] [INFO ] Invariant cache hit.
[2023-03-20 11:01:57] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-20 11:01:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 11:01:57] [INFO ] Invariant cache hit.
[2023-03-20 11:01:57] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 275 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s34 1) (GEQ s86 1)), p0:(AND (GEQ s28 1) (GEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2785 reset in 540 ms.
Product exploration explored 100000 steps with 2797 reset in 550 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 258 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 24 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 363 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-20 11:01:59] [INFO ] Invariant cache hit.
[2023-03-20 11:01:59] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-20 11:01:59] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 11:01:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:01:59] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-20 11:01:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:01:59] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2023-03-20 11:01:59] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 11:01:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:01:59] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-20 11:01:59] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-20 11:01:59] [INFO ] Added : 35 causal constraints over 7 iterations in 67 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:01:59] [INFO ] Invariant cache hit.
[2023-03-20 11:01:59] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-20 11:01:59] [INFO ] Invariant cache hit.
[2023-03-20 11:02:00] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-20 11:02:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 11:02:00] [INFO ] Invariant cache hit.
[2023-03-20 11:02:00] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 242 ms. Remains : 108/108 places, 90/90 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 242 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 70 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 272 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-20 11:02:00] [INFO ] Invariant cache hit.
[2023-03-20 11:02:01] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-20 11:02:01] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-20 11:02:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:02:01] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-20 11:02:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:02:01] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-20 11:02:01] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 11:02:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:02:01] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-20 11:02:01] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-20 11:02:01] [INFO ] Added : 35 causal constraints over 7 iterations in 73 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2764 reset in 534 ms.
Product exploration explored 100000 steps with 2838 reset in 590 ms.
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 8 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:02] [INFO ] Invariant cache hit.
[2023-03-20 11:02:02] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-20 11:02:02] [INFO ] Invariant cache hit.
[2023-03-20 11:02:02] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2023-03-20 11:02:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 11:02:02] [INFO ] Invariant cache hit.
[2023-03-20 11:02:02] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 252 ms. Remains : 108/108 places, 90/90 transitions.
Treatment of property TriangularGrid-PT-3026-LTLFireability-02 finished in 5601 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 U G(p1))) U G((F(p2)||G(p0)))))'
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:02] [INFO ] Invariant cache hit.
[2023-03-20 11:02:02] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-20 11:02:02] [INFO ] Invariant cache hit.
[2023-03-20 11:02:02] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-20 11:02:02] [INFO ] Invariant cache hit.
[2023-03-20 11:02:03] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 464 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={1} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={1} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=8 dest: 6}, { cond=(OR p0 p1), acceptance={} source=8 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND p0 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (GEQ s28 1) (GEQ s49 1)), p0:(AND (GEQ s32 1) (GEQ s76 1)), p1:(AND (GEQ s16 1) (GEQ s64 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3768 reset in 591 ms.
Product exploration explored 100000 steps with 3783 reset in 593 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 1116 ms. Reduced automaton from 10 states, 31 edges and 3 AP (stutter sensitive) to 10 states, 31 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 443 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Finished random walk after 124 steps, including 0 resets, run visited all 14 properties in 13 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F p2), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (OR p0 p1))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 2 factoid took 1670 ms. Reduced automaton from 10 states, 31 edges and 3 AP (stutter sensitive) to 10 states, 31 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 438 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Stuttering acceptance computed with spot in 440 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
[2023-03-20 11:02:08] [INFO ] Invariant cache hit.
[2023-03-20 11:02:08] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2023-03-20 11:02:08] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 11:02:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:02:08] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-20 11:02:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:02:09] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-20 11:02:09] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 11:02:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:02:09] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-20 11:02:09] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-20 11:02:09] [INFO ] Added : 32 causal constraints over 7 iterations in 59 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:09] [INFO ] Invariant cache hit.
[2023-03-20 11:02:09] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-20 11:02:09] [INFO ] Invariant cache hit.
[2023-03-20 11:02:09] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-20 11:02:09] [INFO ] Invariant cache hit.
[2023-03-20 11:02:09] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 208 ms. Remains : 108/108 places, 90/90 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 1183 ms. Reduced automaton from 10 states, 31 edges and 3 AP (stutter sensitive) to 10 states, 31 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 475 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Finished random walk after 154 steps, including 0 resets, run visited all 14 properties in 16 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p2), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (OR p0 p1))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 2 factoid took 1642 ms. Reduced automaton from 10 states, 31 edges and 3 AP (stutter sensitive) to 10 states, 31 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 484 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Stuttering acceptance computed with spot in 502 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
[2023-03-20 11:02:13] [INFO ] Invariant cache hit.
[2023-03-20 11:02:13] [INFO ] [Real]Absence check using 45 positive place invariants in 12 ms returned sat
[2023-03-20 11:02:13] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 11:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:02:13] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-20 11:02:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:02:13] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-20 11:02:13] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-20 11:02:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:02:13] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-20 11:02:13] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-20 11:02:13] [INFO ] Added : 32 causal constraints over 7 iterations in 62 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 435 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Product exploration explored 100000 steps with 3689 reset in 516 ms.
Product exploration explored 100000 steps with 3726 reset in 550 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 445 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 9 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 11:02:16] [INFO ] Invariant cache hit.
[2023-03-20 11:02:16] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 108/108 places, 90/90 transitions.
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:16] [INFO ] Invariant cache hit.
[2023-03-20 11:02:16] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-20 11:02:16] [INFO ] Invariant cache hit.
[2023-03-20 11:02:16] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-20 11:02:16] [INFO ] Invariant cache hit.
[2023-03-20 11:02:16] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 108/108 places, 90/90 transitions.
Treatment of property TriangularGrid-PT-3026-LTLFireability-03 finished in 13656 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' '!(F((G(p1)||p0)))'
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:16] [INFO ] Invariant cache hit.
[2023-03-20 11:02:16] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-20 11:02:16] [INFO ] Invariant cache hit.
[2023-03-20 11:02:16] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-03-20 11:02:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 11:02:16] [INFO ] Invariant cache hit.
[2023-03-20 11:02:16] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (OR (LT s32 1) (LT s81 1)) (OR (LT s13 1) (LT s99 1))), p0:(OR (LT s4 1) (LT s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3002 reset in 542 ms.
Product exploration explored 100000 steps with 3043 reset in 573 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 489 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 106 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 275 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-20 11:02:18] [INFO ] Invariant cache hit.
[2023-03-20 11:02:18] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-20 11:02:18] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-20 11:02:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:02:18] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-20 11:02:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:02:18] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-20 11:02:18] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 11:02:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:02:18] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-20 11:02:18] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-20 11:02:19] [INFO ] Added : 34 causal constraints over 7 iterations in 76 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:19] [INFO ] Invariant cache hit.
[2023-03-20 11:02:19] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-20 11:02:19] [INFO ] Invariant cache hit.
[2023-03-20 11:02:19] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-03-20 11:02:19] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 11:02:19] [INFO ] Invariant cache hit.
[2023-03-20 11:02:19] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 216 ms. Remains : 108/108 places, 90/90 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 246 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 225 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-20 11:02:19] [INFO ] Invariant cache hit.
[2023-03-20 11:02:19] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-20 11:02:19] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-20 11:02:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:02:19] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-20 11:02:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:02:20] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-20 11:02:20] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 11:02:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:02:20] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-20 11:02:20] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-20 11:02:20] [INFO ] Added : 34 causal constraints over 7 iterations in 63 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3089 reset in 558 ms.
Product exploration explored 100000 steps with 3021 reset in 599 ms.
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:21] [INFO ] Invariant cache hit.
[2023-03-20 11:02:21] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-20 11:02:21] [INFO ] Invariant cache hit.
[2023-03-20 11:02:21] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-20 11:02:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 11:02:21] [INFO ] Invariant cache hit.
[2023-03-20 11:02:21] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 108/108 places, 90/90 transitions.
Treatment of property TriangularGrid-PT-3026-LTLFireability-04 finished in 5184 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' '!(F(G(p0)))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:21] [INFO ] Invariant cache hit.
[2023-03-20 11:02:21] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-20 11:02:21] [INFO ] Invariant cache hit.
[2023-03-20 11:02:21] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-20 11:02:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 11:02:21] [INFO ] Invariant cache hit.
[2023-03-20 11:02:21] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 255 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 25 reset in 473 ms.
Stack based approach found an accepted trace after 2010 steps with 0 reset with depth 2011 and stack size 2011 in 12 ms.
FORMULA TriangularGrid-PT-3026-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property TriangularGrid-PT-3026-LTLFireability-05 finished in 785 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(!p1))&&p0) U (!p2||X(p3))))'
Support contains 8 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:22] [INFO ] Invariant cache hit.
[2023-03-20 11:02:22] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-20 11:02:22] [INFO ] Invariant cache hit.
[2023-03-20 11:02:22] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-20 11:02:22] [INFO ] Invariant cache hit.
[2023-03-20 11:02:22] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 342 ms :[(AND p2 (NOT p3)), (NOT p3), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), true, p1]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 p0 (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (LT s33 1) (LT s46 1)), p0:(AND (GEQ s28 1) (GEQ s43 1)), p3:(AND (GEQ s32 1) (GEQ s76 1)), p1:(AND (GEQ s55 1) (GEQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 1 steps with 0 reset in 1 ms.
FORMULA TriangularGrid-PT-3026-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-3026-LTLFireability-06 finished in 605 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' '!(F(p0))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:23] [INFO ] Invariant cache hit.
[2023-03-20 11:02:23] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-20 11:02:23] [INFO ] Invariant cache hit.
[2023-03-20 11:02:23] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-20 11:02:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 11:02:23] [INFO ] Invariant cache hit.
[2023-03-20 11:02:23] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 244 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s71 1) (GEQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3058 reset in 505 ms.
Product exploration explored 100000 steps with 3115 reset in 547 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 120 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 45 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
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 139 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2023-03-20 11:02:24] [INFO ] Invariant cache hit.
[2023-03-20 11:02:24] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2023-03-20 11:02:24] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-20 11:02:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:02:24] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-20 11:02:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:02:24] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2023-03-20 11:02:24] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-20 11:02:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:02:24] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-20 11:02:24] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-20 11:02:25] [INFO ] Added : 34 causal constraints over 7 iterations in 60 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:25] [INFO ] Invariant cache hit.
[2023-03-20 11:02:25] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-20 11:02:25] [INFO ] Invariant cache hit.
[2023-03-20 11:02:25] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-20 11:02:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 11:02:25] [INFO ] Invariant cache hit.
[2023-03-20 11:02:25] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 241 ms. Remains : 108/108 places, 90/90 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 133 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 38 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
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 146 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2023-03-20 11:02:25] [INFO ] Invariant cache hit.
[2023-03-20 11:02:25] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2023-03-20 11:02:25] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-20 11:02:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:02:25] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-20 11:02:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:02:25] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2023-03-20 11:02:25] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 11:02:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:02:25] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-20 11:02:25] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-20 11:02:26] [INFO ] Added : 34 causal constraints over 7 iterations in 64 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3055 reset in 501 ms.
Product exploration explored 100000 steps with 3091 reset in 534 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:27] [INFO ] Invariant cache hit.
[2023-03-20 11:02:27] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-20 11:02:27] [INFO ] Invariant cache hit.
[2023-03-20 11:02:27] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-20 11:02:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 11:02:27] [INFO ] Invariant cache hit.
[2023-03-20 11:02:27] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 237 ms. Remains : 108/108 places, 90/90 transitions.
Treatment of property TriangularGrid-PT-3026-LTLFireability-07 finished in 4351 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))||G((F(p1)&&(p2 U p3)))))'
Support contains 8 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:27] [INFO ] Invariant cache hit.
[2023-03-20 11:02:27] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-20 11:02:27] [INFO ] Invariant cache hit.
[2023-03-20 11:02:27] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-20 11:02:27] [INFO ] Invariant cache hit.
[2023-03-20 11:02:27] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 366 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p1), (NOT p3), (OR (NOT p3) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p3 p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(OR (AND p3 p0) (AND p2 p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p1) p3 (NOT p0)) (AND (NOT p1) p2 (NOT p0))), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(OR (AND p3 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 5}, { cond=(OR p3 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (GEQ s31 1) (GEQ s39 1)), p2:(AND (GEQ s32 1) (GEQ s76 1)), p0:(AND (GEQ s9 1) (GEQ s96 1)), p1:(AND (GEQ s29 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-3026-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-3026-LTLFireability-08 finished in 649 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&&(p1 U p2)&&G(p3))))'
Support contains 8 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:28] [INFO ] Invariant cache hit.
[2023-03-20 11:02:28] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-20 11:02:28] [INFO ] Invariant cache hit.
[2023-03-20 11:02:28] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-20 11:02:28] [INFO ] Invariant cache hit.
[2023-03-20 11:02:28] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p3), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2) (NOT p0)), (OR (NOT p3) (NOT p2) (NOT p0)), true]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 4}], [{ cond=(AND p2 p3), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1 p3), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p3)), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p2 p3), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1)) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p3:(OR (LT s23 1) (LT s67 1) (LT s54 1) (LT s72 1)), p2:(AND (GEQ s3 1) (GEQ s92 1)), p1:(AND (GEQ s31 1) (GEQ s51 1)), p0:(OR (LT s23 1) (LT s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 1 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-3026-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-3026-LTLFireability-10 finished in 466 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(G(p1)))) U G(!p0)))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:28] [INFO ] Invariant cache hit.
[2023-03-20 11:02:28] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-20 11:02:28] [INFO ] Invariant cache hit.
[2023-03-20 11:02:28] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-20 11:02:28] [INFO ] Invariant cache hit.
[2023-03-20 11:02:28] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 158 ms :[p0, (AND p0 (NOT p1)), (NOT p1), true]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s13 1) (GEQ s99 1)), p1:(AND (GEQ s35 1) (GEQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-3026-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-3026-LTLFireability-12 finished in 396 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((X((!p1 U (p2||G(!p1))))&&p0))))))'
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:28] [INFO ] Invariant cache hit.
[2023-03-20 11:02:28] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-20 11:02:28] [INFO ] Invariant cache hit.
[2023-03-20 11:02:29] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-20 11:02:29] [INFO ] Invariant cache hit.
[2023-03-20 11:02:29] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 232 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-13 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: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (OR (LT s29 1) (LT s84 1)) (OR (LT s5 1) (LT s58 1))), p2:(AND (NOT (AND (GEQ s30 1) (GEQ s44 1))) (NOT (AND (GEQ s29 1) (GEQ s84 1)))), p1:(AND (...], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-3026-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-3026-LTLFireability-13 finished in 506 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||X(p1))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:29] [INFO ] Invariant cache hit.
[2023-03-20 11:02:29] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-20 11:02:29] [INFO ] Invariant cache hit.
[2023-03-20 11:02:29] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-20 11:02:29] [INFO ] Invariant cache hit.
[2023-03-20 11:02:29] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 224 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s31 1) (GEQ s39 1)), p1:(AND (GEQ s35 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-3026-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-3026-LTLFireability-15 finished in 328 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' '!(((p0||X(X(p1))) U (!p1&&X(F(p1)))))'
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(F((p0||G(p1)))))'
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 U G(p1))) U G((F(p2)||G(p0)))))'
Found a Lengthening insensitive property : TriangularGrid-PT-3026-LTLFireability-03
Stuttering acceptance computed with spot in 450 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:30] [INFO ] Invariant cache hit.
[2023-03-20 11:02:30] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-20 11:02:30] [INFO ] Invariant cache hit.
[2023-03-20 11:02:30] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-20 11:02:30] [INFO ] Invariant cache hit.
[2023-03-20 11:02:30] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 221 ms. Remains : 108/108 places, 90/90 transitions.
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={1} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={1} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=8 dest: 6}, { cond=(OR p0 p1), acceptance={} source=8 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND p0 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (GEQ s28 1) (GEQ s49 1)), p0:(AND (GEQ s32 1) (GEQ s76 1)), p1:(AND (GEQ s16 1) (GEQ s64 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3750 reset in 523 ms.
Product exploration explored 100000 steps with 3690 reset in 556 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 1216 ms. Reduced automaton from 10 states, 31 edges and 3 AP (stutter sensitive) to 10 states, 31 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 486 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Finished random walk after 132 steps, including 0 resets, run visited all 14 properties in 11 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F p2), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (OR p0 p1))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 2 factoid took 1548 ms. Reduced automaton from 10 states, 31 edges and 3 AP (stutter sensitive) to 10 states, 31 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 457 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Stuttering acceptance computed with spot in 450 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
[2023-03-20 11:02:35] [INFO ] Invariant cache hit.
[2023-03-20 11:02:36] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-20 11:02:36] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 11:02:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:02:36] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-20 11:02:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:02:36] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-20 11:02:36] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 11:02:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:02:36] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-20 11:02:36] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-20 11:02:36] [INFO ] Added : 32 causal constraints over 7 iterations in 58 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:36] [INFO ] Invariant cache hit.
[2023-03-20 11:02:36] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-20 11:02:36] [INFO ] Invariant cache hit.
[2023-03-20 11:02:36] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-20 11:02:36] [INFO ] Invariant cache hit.
[2023-03-20 11:02:36] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 291 ms. Remains : 108/108 places, 90/90 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 1214 ms. Reduced automaton from 10 states, 31 edges and 3 AP (stutter sensitive) to 10 states, 31 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 539 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Finished random walk after 214 steps, including 0 resets, run visited all 14 properties in 17 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p2), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (OR p0 p1))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 2 factoid took 1583 ms. Reduced automaton from 10 states, 31 edges and 3 AP (stutter sensitive) to 10 states, 31 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 440 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Stuttering acceptance computed with spot in 430 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
[2023-03-20 11:02:40] [INFO ] Invariant cache hit.
[2023-03-20 11:02:40] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-20 11:02:40] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 11:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:02:40] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-20 11:02:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:02:40] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-20 11:02:40] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 11:02:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:02:41] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-20 11:02:41] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-20 11:02:41] [INFO ] Added : 32 causal constraints over 7 iterations in 57 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 438 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Product exploration explored 100000 steps with 3784 reset in 520 ms.
Product exploration explored 100000 steps with 3849 reset in 551 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 498 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 7 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 11:02:43] [INFO ] Invariant cache hit.
[2023-03-20 11:02:43] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 108/108 places, 90/90 transitions.
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-20 11:02:43] [INFO ] Invariant cache hit.
[2023-03-20 11:02:43] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-20 11:02:43] [INFO ] Invariant cache hit.
[2023-03-20 11:02:43] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-20 11:02:43] [INFO ] Invariant cache hit.
[2023-03-20 11:02:43] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 232 ms. Remains : 108/108 places, 90/90 transitions.
Treatment of property TriangularGrid-PT-3026-LTLFireability-03 finished in 13672 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' '!(F((G(p1)||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' '!(F(p0))'
[2023-03-20 11:02:43] [INFO ] Flatten gal took : 8 ms
[2023-03-20 11:02:43] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-20 11:02:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 108 places, 90 transitions and 360 arcs took 2 ms.
Total runtime 53541 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3024/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3024/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3024/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3024/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3024/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : TriangularGrid-PT-3026-LTLFireability-01
Could not compute solution for formula : TriangularGrid-PT-3026-LTLFireability-02
Could not compute solution for formula : TriangularGrid-PT-3026-LTLFireability-03
Could not compute solution for formula : TriangularGrid-PT-3026-LTLFireability-04
Could not compute solution for formula : TriangularGrid-PT-3026-LTLFireability-07

BK_STOP 1679310165144

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name TriangularGrid-PT-3026-LTLFireability-01
ltl formula formula --ltl=/tmp/3024/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 108 places, 90 transitions and 360 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3024/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3024/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3024/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3024/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name TriangularGrid-PT-3026-LTLFireability-02
ltl formula formula --ltl=/tmp/3024/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 108 places, 90 transitions and 360 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3024/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3024/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3024/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3024/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x557f6a39b3f4]
1: pnml2lts-mc(+0xa2496) [0x557f6a39b496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fe167f3a140]
3: pnml2lts-mc(+0x405be5) [0x557f6a6febe5]
4: pnml2lts-mc(+0x16b3f9) [0x557f6a4643f9]
5: pnml2lts-mc(+0x164ac4) [0x557f6a45dac4]
6: pnml2lts-mc(+0x272e0a) [0x557f6a56be0a]
7: pnml2lts-mc(+0xb61f0) [0x557f6a3af1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fe167d8d4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fe167d8d67a]
10: pnml2lts-mc(+0xa1581) [0x557f6a39a581]
11: pnml2lts-mc(+0xa1910) [0x557f6a39a910]
12: pnml2lts-mc(+0xa32a2) [0x557f6a39c2a2]
13: pnml2lts-mc(+0xa50f4) [0x557f6a39e0f4]
14: pnml2lts-mc(+0xa516b) [0x557f6a39e16b]
15: pnml2lts-mc(+0x3f34b3) [0x557f6a6ec4b3]
16: pnml2lts-mc(+0x7c63d) [0x557f6a37563d]
17: pnml2lts-mc(+0x67d86) [0x557f6a360d86]
18: pnml2lts-mc(+0x60a8a) [0x557f6a359a8a]
19: pnml2lts-mc(+0x5eb15) [0x557f6a357b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fe167d75d0a]
21: pnml2lts-mc(+0x6075e) [0x557f6a35975e]
ltl formula name TriangularGrid-PT-3026-LTLFireability-03
ltl formula formula --ltl=/tmp/3024/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 108 places, 90 transitions and 360 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3024/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3024/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3024/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3024/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name TriangularGrid-PT-3026-LTLFireability-04
ltl formula formula --ltl=/tmp/3024/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 108 places, 90 transitions and 360 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3024/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3024/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3024/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3024/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name TriangularGrid-PT-3026-LTLFireability-07
ltl formula formula --ltl=/tmp/3024/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 108 places, 90 transitions and 360 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3024/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3024/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3024/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3024/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="TriangularGrid-PT-3026"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is TriangularGrid-PT-3026, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r489-tall-167912707200740"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TriangularGrid-PT-3026.tgz
mv TriangularGrid-PT-3026 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;