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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
383.071 112970.00 137432.00 963.70 ?FTF?FF??TT?FT?? 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-167912707200764.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-5046, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707200764
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 6.0K Feb 26 01:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 01:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 01:47 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 4.1K Feb 25 17:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 02:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 02:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 02:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 02:01 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 185K 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-5046-LTLFireability-00
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-01
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-02
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-03
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-04
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-05
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-06
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-07
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-08
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-09
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-10
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-11
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-12
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-13
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-14
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679317042383

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-5046
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 12:57:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 12:57:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 12:57:24] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-20 12:57:24] [INFO ] Transformed 280 places.
[2023-03-20 12:57:24] [INFO ] Transformed 240 transitions.
[2023-03-20 12:57:24] [INFO ] Parsed PT model containing 280 places and 240 transitions and 960 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA TriangularGrid-PT-5046-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-5046-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-5046-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-5046-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-5046-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 24 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
// Phase 1: matrix 240 rows 280 cols
[2023-03-20 12:57:24] [INFO ] Computed 116 place invariants in 27 ms
[2023-03-20 12:57:24] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-20 12:57:24] [INFO ] Invariant cache hit.
[2023-03-20 12:57:25] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2023-03-20 12:57:25] [INFO ] Invariant cache hit.
[2023-03-20 12:57:25] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 853 ms. Remains : 280/280 places, 240/240 transitions.
Support contains 51 out of 280 places after structural reductions.
[2023-03-20 12:57:25] [INFO ] Flatten gal took : 57 ms
[2023-03-20 12:57:25] [INFO ] Flatten gal took : 21 ms
[2023-03-20 12:57:25] [INFO ] Input system was already deterministic with 240 transitions.
Support contains 50 out of 280 places (down from 51) after GAL structural reductions.
Finished random walk after 711 steps, including 0 resets, run visited all 25 properties in 109 ms. (steps per millisecond=6 )
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' '!(G(F(p0)))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 29 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:57:26] [INFO ] Invariant cache hit.
[2023-03-20 12:57:26] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-20 12:57:26] [INFO ] Invariant cache hit.
[2023-03-20 12:57:26] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2023-03-20 12:57:26] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-20 12:57:26] [INFO ] Invariant cache hit.
[2023-03-20 12:57:26] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 598 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s85 1) (GEQ s223 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1074 reset in 1402 ms.
Product exploration explored 100000 steps with 1017 reset in 1482 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 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 145 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=24 )
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 156 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2023-03-20 12:57:30] [INFO ] Invariant cache hit.
[2023-03-20 12:57:30] [INFO ] [Real]Absence check using 115 positive place invariants in 51 ms returned sat
[2023-03-20 12:57:30] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-20 12:57:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:30] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2023-03-20 12:57:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:57:31] [INFO ] [Nat]Absence check using 115 positive place invariants in 35 ms returned sat
[2023-03-20 12:57:31] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 13 ms returned sat
[2023-03-20 12:57:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:31] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2023-03-20 12:57:31] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-20 12:57:31] [INFO ] Added : 89 causal constraints over 18 iterations in 427 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 11 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:57:31] [INFO ] Invariant cache hit.
[2023-03-20 12:57:31] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-20 12:57:31] [INFO ] Invariant cache hit.
[2023-03-20 12:57:32] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2023-03-20 12:57:32] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-20 12:57:32] [INFO ] Invariant cache hit.
[2023-03-20 12:57:32] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 569 ms. Remains : 280/280 places, 240/240 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 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 73 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=24 )
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 161 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
[2023-03-20 12:57:32] [INFO ] Invariant cache hit.
[2023-03-20 12:57:33] [INFO ] [Real]Absence check using 115 positive place invariants in 52 ms returned sat
[2023-03-20 12:57:33] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-20 12:57:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:33] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2023-03-20 12:57:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:57:33] [INFO ] [Nat]Absence check using 115 positive place invariants in 35 ms returned sat
[2023-03-20 12:57:33] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 17 ms returned sat
[2023-03-20 12:57:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:33] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2023-03-20 12:57:33] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-20 12:57:34] [INFO ] Added : 89 causal constraints over 18 iterations in 436 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1086 reset in 1254 ms.
Product exploration explored 100000 steps with 1058 reset in 1342 ms.
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 9 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:57:36] [INFO ] Invariant cache hit.
[2023-03-20 12:57:37] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-20 12:57:37] [INFO ] Invariant cache hit.
[2023-03-20 12:57:37] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2023-03-20 12:57:37] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 12:57:37] [INFO ] Invariant cache hit.
[2023-03-20 12:57:37] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 561 ms. Remains : 280/280 places, 240/240 transitions.
Treatment of property TriangularGrid-PT-5046-LTLFireability-00 finished in 11544 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)||(p1 U X(!p0))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:57:37] [INFO ] Invariant cache hit.
[2023-03-20 12:57:37] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-20 12:57:37] [INFO ] Invariant cache hit.
[2023-03-20 12:57:38] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2023-03-20 12:57:38] [INFO ] Invariant cache hit.
[2023-03-20 12:57:38] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 574 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 290 ms :[true, false, (NOT p0), p0, p0, false, false]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND p0 p1), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}], [{ cond=p0, acceptance={} source=5 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(OR (LT s79 1) (LT s133 1)), p1:(AND (GEQ s85 1) (GEQ s197 1) (GEQ s92 1) (GEQ s215 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 171 steps with 0 reset in 5 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5046-LTLFireability-01 finished in 888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&(p1||X(F(p2))))))'
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 5 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:57:38] [INFO ] Invariant cache hit.
[2023-03-20 12:57:38] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-20 12:57:38] [INFO ] Invariant cache hit.
[2023-03-20 12:57:38] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2023-03-20 12:57:38] [INFO ] Invariant cache hit.
[2023-03-20 12:57:39] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 540 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s62 1) (GEQ s179 1)), p0:(AND (GEQ s71 1) (GEQ s183 1)), p2:(OR (AND (GEQ s98 1) (GEQ s218 1)) (AND (GEQ s94 1) (GEQ s227 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 7933 steps with 0 reset in 94 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5046-LTLFireability-03 finished in 832 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)||G(F(p1))||X(X(p1))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 5 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:57:39] [INFO ] Invariant cache hit.
[2023-03-20 12:57:39] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-20 12:57:39] [INFO ] Invariant cache hit.
[2023-03-20 12:57:39] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2023-03-20 12:57:39] [INFO ] Invariant cache hit.
[2023-03-20 12:57:39] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 541 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s78 1) (GEQ s117 1)), p1:(OR (LT s32 1) (LT s164 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]]
Product exploration explored 100000 steps with 1413 reset in 1294 ms.
Product exploration explored 100000 steps with 1395 reset in 1362 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Finished random walk after 258 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 2 factoid took 191 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
[2023-03-20 12:57:43] [INFO ] Invariant cache hit.
[2023-03-20 12:57:43] [INFO ] [Real]Absence check using 115 positive place invariants in 32 ms returned sat
[2023-03-20 12:57:43] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 15 ms returned sat
[2023-03-20 12:57:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:44] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2023-03-20 12:57:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:57:44] [INFO ] [Nat]Absence check using 115 positive place invariants in 30 ms returned sat
[2023-03-20 12:57:44] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 8 ms returned sat
[2023-03-20 12:57:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:44] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2023-03-20 12:57:44] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-20 12:57:45] [INFO ] Added : 88 causal constraints over 18 iterations in 421 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:57:45] [INFO ] Invariant cache hit.
[2023-03-20 12:57:45] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-20 12:57:45] [INFO ] Invariant cache hit.
[2023-03-20 12:57:45] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2023-03-20 12:57:45] [INFO ] Invariant cache hit.
[2023-03-20 12:57:45] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 529 ms. Remains : 280/280 places, 240/240 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 p1) (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 299 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-20 12:57:46] [INFO ] Invariant cache hit.
[2023-03-20 12:57:46] [INFO ] [Real]Absence check using 115 positive place invariants in 52 ms returned sat
[2023-03-20 12:57:46] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-20 12:57:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:47] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2023-03-20 12:57:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:57:47] [INFO ] [Nat]Absence check using 115 positive place invariants in 64 ms returned sat
[2023-03-20 12:57:47] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 63 ms returned sat
[2023-03-20 12:57:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:47] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2023-03-20 12:57:47] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-20 12:57:48] [INFO ] Added : 88 causal constraints over 18 iterations in 404 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1448 reset in 1238 ms.
Product exploration explored 100000 steps with 1443 reset in 1413 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 18 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:57:51] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 12:57:51] [INFO ] Invariant cache hit.
[2023-03-20 12:57:51] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162 ms. Remains : 280/280 places, 240/240 transitions.
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:57:51] [INFO ] Invariant cache hit.
[2023-03-20 12:57:51] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-20 12:57:51] [INFO ] Invariant cache hit.
[2023-03-20 12:57:51] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2023-03-20 12:57:51] [INFO ] Invariant cache hit.
[2023-03-20 12:57:52] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 536 ms. Remains : 280/280 places, 240/240 transitions.
Treatment of property TriangularGrid-PT-5046-LTLFireability-04 finished in 12726 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)))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 5 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:57:52] [INFO ] Invariant cache hit.
[2023-03-20 12:57:52] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-20 12:57:52] [INFO ] Invariant cache hit.
[2023-03-20 12:57:52] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2023-03-20 12:57:52] [INFO ] Invariant cache hit.
[2023-03-20 12:57:52] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 572 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s36 1) (GEQ s257 1)) (AND (GEQ s98 1) (GEQ s229 1)))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 54 steps with 0 reset in 2 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5046-LTLFireability-05 finished in 679 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 U (p2||G(p1))))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:57:52] [INFO ] Invariant cache hit.
[2023-03-20 12:57:52] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-20 12:57:52] [INFO ] Invariant cache hit.
[2023-03-20 12:57:53] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2023-03-20 12:57:53] [INFO ] Invariant cache hit.
[2023-03-20 12:57:53] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 563 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s188 1) (GEQ s233 1)), p2:(AND (GEQ s83 1) (GEQ s120 1) (GEQ s48 1) (GEQ s173 1)), p1:(AND (GEQ s48 1) (GEQ s173 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 160 steps with 0 reset in 6 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5046-LTLFireability-06 finished in 780 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((F(p0) U p1))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 11 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:57:53] [INFO ] Invariant cache hit.
[2023-03-20 12:57:53] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-20 12:57:53] [INFO ] Invariant cache hit.
[2023-03-20 12:57:53] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2023-03-20 12:57:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:57:53] [INFO ] Invariant cache hit.
[2023-03-20 12:57:54] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 588 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s98 1) (GEQ s204 1)), p0:(AND (GEQ s92 1) (GEQ s201 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1038 reset in 1266 ms.
Product exploration explored 100000 steps with 1051 reset in 1379 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 (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 393 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 155 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 1 factoid took 398 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2023-03-20 12:57:58] [INFO ] Invariant cache hit.
[2023-03-20 12:57:58] [INFO ] [Real]Absence check using 115 positive place invariants in 35 ms returned sat
[2023-03-20 12:57:58] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-20 12:57:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:58] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2023-03-20 12:57:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:57:58] [INFO ] [Nat]Absence check using 115 positive place invariants in 50 ms returned sat
[2023-03-20 12:57:58] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 18 ms returned sat
[2023-03-20 12:57:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:57:59] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2023-03-20 12:57:59] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-20 12:57:59] [INFO ] Added : 88 causal constraints over 18 iterations in 379 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 9 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:57:59] [INFO ] Invariant cache hit.
[2023-03-20 12:57:59] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-20 12:57:59] [INFO ] Invariant cache hit.
[2023-03-20 12:57:59] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2023-03-20 12:57:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:57:59] [INFO ] Invariant cache hit.
[2023-03-20 12:58:00] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 548 ms. Remains : 280/280 places, 240/240 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 (NOT p1)), (X 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))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 326 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1 )
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 (NOT p1)), (X 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))))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 1 factoid took 419 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2023-03-20 12:58:01] [INFO ] Invariant cache hit.
[2023-03-20 12:58:01] [INFO ] [Real]Absence check using 115 positive place invariants in 38 ms returned sat
[2023-03-20 12:58:01] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-20 12:58:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:58:01] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2023-03-20 12:58:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:58:01] [INFO ] [Nat]Absence check using 115 positive place invariants in 49 ms returned sat
[2023-03-20 12:58:01] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 17 ms returned sat
[2023-03-20 12:58:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:58:02] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2023-03-20 12:58:02] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-20 12:58:02] [INFO ] Added : 88 causal constraints over 18 iterations in 380 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1041 reset in 1361 ms.
Product exploration explored 100000 steps with 1080 reset in 1451 ms.
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:58:05] [INFO ] Invariant cache hit.
[2023-03-20 12:58:05] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-20 12:58:05] [INFO ] Invariant cache hit.
[2023-03-20 12:58:06] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2023-03-20 12:58:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:58:06] [INFO ] Invariant cache hit.
[2023-03-20 12:58:06] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 565 ms. Remains : 280/280 places, 240/240 transitions.
Treatment of property TriangularGrid-PT-5046-LTLFireability-07 finished in 12720 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 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:58:06] [INFO ] Invariant cache hit.
[2023-03-20 12:58:06] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-20 12:58:06] [INFO ] Invariant cache hit.
[2023-03-20 12:58:06] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2023-03-20 12:58:06] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:58:06] [INFO ] Invariant cache hit.
[2023-03-20 12:58:06] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 549 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s70 1) (LT s277 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 1063 reset in 1276 ms.
Product exploration explored 100000 steps with 1099 reset in 1382 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 135 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
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 158 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)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-03-20 12:58:09] [INFO ] Invariant cache hit.
[2023-03-20 12:58:10] [INFO ] [Real]Absence check using 115 positive place invariants in 32 ms returned sat
[2023-03-20 12:58:10] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 62 ms returned sat
[2023-03-20 12:58:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:58:10] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2023-03-20 12:58:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:58:10] [INFO ] [Nat]Absence check using 115 positive place invariants in 33 ms returned sat
[2023-03-20 12:58:10] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 19 ms returned sat
[2023-03-20 12:58:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:58:10] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2023-03-20 12:58:10] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-20 12:58:11] [INFO ] Added : 89 causal constraints over 18 iterations in 380 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:58:11] [INFO ] Invariant cache hit.
[2023-03-20 12:58:11] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-20 12:58:11] [INFO ] Invariant cache hit.
[2023-03-20 12:58:11] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2023-03-20 12:58:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:58:11] [INFO ] Invariant cache hit.
[2023-03-20 12:58:11] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 551 ms. Remains : 280/280 places, 240/240 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 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 168 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 p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2023-03-20 12:58:12] [INFO ] Invariant cache hit.
[2023-03-20 12:58:12] [INFO ] [Real]Absence check using 115 positive place invariants in 33 ms returned sat
[2023-03-20 12:58:12] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 62 ms returned sat
[2023-03-20 12:58:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:58:12] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2023-03-20 12:58:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:58:12] [INFO ] [Nat]Absence check using 115 positive place invariants in 32 ms returned sat
[2023-03-20 12:58:12] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 19 ms returned sat
[2023-03-20 12:58:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:58:13] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2023-03-20 12:58:13] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-20 12:58:13] [INFO ] Added : 89 causal constraints over 18 iterations in 370 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1036 reset in 1319 ms.
Product exploration explored 100000 steps with 1026 reset in 1421 ms.
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:58:16] [INFO ] Invariant cache hit.
[2023-03-20 12:58:16] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-20 12:58:16] [INFO ] Invariant cache hit.
[2023-03-20 12:58:16] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2023-03-20 12:58:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:58:16] [INFO ] Invariant cache hit.
[2023-03-20 12:58:16] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 556 ms. Remains : 280/280 places, 240/240 transitions.
Treatment of property TriangularGrid-PT-5046-LTLFireability-08 finished in 10702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((((!p2 U (p3||G(!p2)))||p1)&&p0))))'
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 5 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:58:16] [INFO ] Invariant cache hit.
[2023-03-20 12:58:17] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-20 12:58:17] [INFO ] Invariant cache hit.
[2023-03-20 12:58:17] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2023-03-20 12:58:17] [INFO ] Invariant cache hit.
[2023-03-20 12:58:17] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 563 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p3) p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2))), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s77 1) (LT s192 1)) (OR (LT s63 1) (LT s273 1))), p1:(OR (LT s11 1) (LT s242 1)), p3:(AND (NOT (AND (GEQ s11 1) (GEQ s242 1))) (NOT (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 364 reset in 1380 ms.
Product exploration explored 100000 steps with 339 reset in 1497 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X (OR (NOT p0) (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2))))), (X (X (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2)))))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p3) p2))))), (X (X (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 346 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Finished random walk after 113 steps, including 0 resets, run visited all 4 properties in 10 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X (OR (NOT p0) (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2))))), (X (X (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2)))))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p3) p2))))), (X (X (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (F (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (OR (AND (NOT p1) p2 (NOT p3)) (NOT p0)))), (F (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))))), (F (AND (NOT p1) p0 (NOT p2) (NOT p3)))]
Knowledge based reduction with 3 factoid took 384 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
[2023-03-20 12:58:21] [INFO ] Invariant cache hit.
[2023-03-20 12:58:21] [INFO ] [Real]Absence check using 115 positive place invariants in 39 ms returned sat
[2023-03-20 12:58:21] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 46 ms returned sat
[2023-03-20 12:58:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:58:22] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2023-03-20 12:58:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:58:22] [INFO ] [Nat]Absence check using 115 positive place invariants in 42 ms returned sat
[2023-03-20 12:58:22] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-20 12:58:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:58:22] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2023-03-20 12:58:22] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-20 12:58:23] [INFO ] Added : 89 causal constraints over 18 iterations in 358 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-20 12:58:23] [INFO ] Invariant cache hit.
[2023-03-20 12:58:23] [INFO ] [Real]Absence check using 115 positive place invariants in 44 ms returned sat
[2023-03-20 12:58:23] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-20 12:58:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:58:23] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2023-03-20 12:58:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:58:23] [INFO ] [Nat]Absence check using 115 positive place invariants in 33 ms returned sat
[2023-03-20 12:58:23] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-20 12:58:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:58:23] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2023-03-20 12:58:24] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-20 12:58:24] [INFO ] Added : 88 causal constraints over 18 iterations in 393 ms. Result :sat
Could not prove EG (AND (NOT p1) p2 (NOT p3))
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:58:24] [INFO ] Invariant cache hit.
[2023-03-20 12:58:24] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-20 12:58:24] [INFO ] Invariant cache hit.
[2023-03-20 12:58:24] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2023-03-20 12:58:24] [INFO ] Invariant cache hit.
[2023-03-20 12:58:24] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 523 ms. Remains : 280/280 places, 240/240 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 p1) p2 (NOT p3) (NOT p0)), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (OR (AND (NOT p1) p2 (NOT p3)) (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (OR (AND (NOT p1) p2 (NOT p3)) (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 268 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Finished random walk after 812 steps, including 0 resets, run visited all 4 properties in 29 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p3) (NOT p0)), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (OR (AND (NOT p1) p2 (NOT p3)) (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (OR (AND (NOT p1) p2 (NOT p3)) (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (NOT p0))))), (F (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (OR (AND (NOT p1) p2 (NOT p3)) (NOT p0)))), (F (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))))), (F (AND (NOT p1) p0 (NOT p2) (NOT p3)))]
Knowledge based reduction with 3 factoid took 394 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
[2023-03-20 12:58:26] [INFO ] Invariant cache hit.
[2023-03-20 12:58:26] [INFO ] [Real]Absence check using 115 positive place invariants in 37 ms returned sat
[2023-03-20 12:58:26] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 46 ms returned sat
[2023-03-20 12:58:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:58:26] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2023-03-20 12:58:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:58:26] [INFO ] [Nat]Absence check using 115 positive place invariants in 43 ms returned sat
[2023-03-20 12:58:26] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-20 12:58:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:58:27] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2023-03-20 12:58:27] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-20 12:58:27] [INFO ] Added : 89 causal constraints over 18 iterations in 385 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-20 12:58:27] [INFO ] Invariant cache hit.
[2023-03-20 12:58:27] [INFO ] [Real]Absence check using 115 positive place invariants in 43 ms returned sat
[2023-03-20 12:58:27] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-20 12:58:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:58:27] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2023-03-20 12:58:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:58:28] [INFO ] [Nat]Absence check using 115 positive place invariants in 32 ms returned sat
[2023-03-20 12:58:28] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-20 12:58:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:58:28] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2023-03-20 12:58:28] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-20 12:58:28] [INFO ] Added : 88 causal constraints over 18 iterations in 382 ms. Result :sat
Could not prove EG (AND (NOT p1) p2 (NOT p3))
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Product exploration explored 100000 steps with 359 reset in 1413 ms.
Product exploration explored 100000 steps with 347 reset in 1506 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 8 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:58:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:58:32] [INFO ] Invariant cache hit.
[2023-03-20 12:58:32] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 280/280 places, 240/240 transitions.
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 2 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:58:32] [INFO ] Invariant cache hit.
[2023-03-20 12:58:32] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-20 12:58:32] [INFO ] Invariant cache hit.
[2023-03-20 12:58:32] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2023-03-20 12:58:32] [INFO ] Invariant cache hit.
[2023-03-20 12:58:32] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 525 ms. Remains : 280/280 places, 240/240 transitions.
Treatment of property TriangularGrid-PT-5046-LTLFireability-11 finished in 15859 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)||G(p1)))'
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:58:32] [INFO ] Invariant cache hit.
[2023-03-20 12:58:32] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-20 12:58:32] [INFO ] Invariant cache hit.
[2023-03-20 12:58:33] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2023-03-20 12:58:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:58:33] [INFO ] Invariant cache hit.
[2023-03-20 12:58:33] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 539 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (OR (LT s83 1) (LT s135 1)) (OR (LT s30 1) (LT s163 1)) (OR (LT s82 1) (LT s209 1))), p1:(OR (AND (GEQ s30 1) (GEQ s163 1) (GEQ s82 1) (GEQ s209 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 681 reset in 1351 ms.
Product exploration explored 100000 steps with 681 reset in 1456 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X p0), (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 (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 312 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Finished random walk after 114 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X p0), (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 (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0)]
Knowledge based reduction with 1 factoid took 310 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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-20 12:58:37] [INFO ] Invariant cache hit.
[2023-03-20 12:58:37] [INFO ] [Real]Absence check using 115 positive place invariants in 35 ms returned sat
[2023-03-20 12:58:37] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 10 ms returned sat
[2023-03-20 12:58:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:58:37] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2023-03-20 12:58:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:58:37] [INFO ] [Nat]Absence check using 115 positive place invariants in 35 ms returned sat
[2023-03-20 12:58:37] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 14 ms returned sat
[2023-03-20 12:58:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:58:37] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2023-03-20 12:58:37] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-20 12:58:38] [INFO ] Added : 89 causal constraints over 18 iterations in 372 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 280 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 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:58:38] [INFO ] Invariant cache hit.
[2023-03-20 12:58:38] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-20 12:58:38] [INFO ] Invariant cache hit.
[2023-03-20 12:58:38] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2023-03-20 12:58:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:58:38] [INFO ] Invariant cache hit.
[2023-03-20 12:58:38] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 567 ms. Remains : 280/280 places, 240/240 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 147 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 43 ms :[(NOT p0)]
Finished random walk after 55 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=27 )
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 168 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 p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
[2023-03-20 12:58:39] [INFO ] Invariant cache hit.
[2023-03-20 12:58:39] [INFO ] [Real]Absence check using 115 positive place invariants in 35 ms returned sat
[2023-03-20 12:58:39] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 10 ms returned sat
[2023-03-20 12:58:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:58:39] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2023-03-20 12:58:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:58:39] [INFO ] [Nat]Absence check using 115 positive place invariants in 35 ms returned sat
[2023-03-20 12:58:39] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 14 ms returned sat
[2023-03-20 12:58:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:58:40] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2023-03-20 12:58:40] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-20 12:58:40] [INFO ] Added : 89 causal constraints over 18 iterations in 384 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 675 reset in 1274 ms.
Product exploration explored 100000 steps with 689 reset in 1374 ms.
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 5 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:58:43] [INFO ] Invariant cache hit.
[2023-03-20 12:58:43] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-20 12:58:43] [INFO ] Invariant cache hit.
[2023-03-20 12:58:43] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2023-03-20 12:58:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:58:43] [INFO ] Invariant cache hit.
[2023-03-20 12:58:43] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 566 ms. Remains : 280/280 places, 240/240 transitions.
Treatment of property TriangularGrid-PT-5046-LTLFireability-14 finished in 11079 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((G(p0)||((p2 U p3)&&p1)))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:58:43] [INFO ] Invariant cache hit.
[2023-03-20 12:58:44] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-20 12:58:44] [INFO ] Invariant cache hit.
[2023-03-20 12:58:44] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2023-03-20 12:58:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:58:44] [INFO ] Invariant cache hit.
[2023-03-20 12:58:44] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 543 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s17 1) (LT s156 1) (LT s80 1) (LT s208 1)), p1:(AND (GEQ s63 1) (GEQ s273 1)), p3:(AND (GEQ s17 1) (GEQ s156 1)), p2:(AND (GEQ s80 1) (GEQ s208...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 263 reset in 1337 ms.
Product exploration explored 100000 steps with 216 reset in 1448 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (AND p0 (NOT p3) (NOT p2))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (AND p0 (NOT p3) p2))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (AND p0 p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 (NOT p3) p2))))]
Knowledge based reduction with 10 factoid took 880 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter insensitive) to 3 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 12:58:48] [INFO ] Invariant cache hit.
[2023-03-20 12:58:48] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p0) p2 (NOT p3) p1))), (G (NOT (AND (NOT p0) p2 (NOT p3))))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (AND p0 (NOT p3) (NOT p2))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (AND p0 (NOT p3) p2))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (AND p0 p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (F (AND p0 (NOT p2) (NOT p3))), (F (AND p0 p2 (NOT p3) p1)), (F (AND p0 p2 (NOT p3))), (F (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))), (F (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))))]
Knowledge based reduction with 13 factoid took 1055 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), false]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), false]
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 10 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:58:50] [INFO ] Invariant cache hit.
[2023-03-20 12:58:50] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-20 12:58:50] [INFO ] Invariant cache hit.
[2023-03-20 12:58:50] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2023-03-20 12:58:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:58:50] [INFO ] Invariant cache hit.
[2023-03-20 12:58:50] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 551 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p3 p1 (NOT p2)), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND p2 (NOT p3) p1))), (X (OR p0 p3)), (X (X (OR p0 p3)))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) p3 (NOT p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (AND p2 (NOT p3) p1))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3)))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
Knowledge based reduction with 5 factoid took 730 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 12:58:51] [INFO ] Invariant cache hit.
[2023-03-20 12:58:51] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 p1 (NOT p2)), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND p2 (NOT p3) p1))), (X (OR p0 p3)), (X (X (OR p0 p3))), (G (OR p0 p3))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) p3 (NOT p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (AND p2 (NOT p3) p1))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3)))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (F (AND (NOT p2) (NOT p3))), (F (AND p1 p2 (NOT p3))), (F (AND p2 (NOT p3))), (F (OR (AND (NOT p1) p0) (AND (NOT p2) (NOT p3)))), (F (AND (NOT p1) (NOT p0) p3))]
Knowledge based reduction with 6 factoid took 709 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 275 reset in 1359 ms.
Product exploration explored 100000 steps with 237 reset in 1467 ms.
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 2 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:58:55] [INFO ] Invariant cache hit.
[2023-03-20 12:58:56] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-20 12:58:56] [INFO ] Invariant cache hit.
[2023-03-20 12:58:56] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2023-03-20 12:58:56] [INFO ] Invariant cache hit.
[2023-03-20 12:58:56] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 561 ms. Remains : 280/280 places, 240/240 transitions.
Treatment of property TriangularGrid-PT-5046-LTLFireability-15 finished in 12701 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)))'
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)||G(F(p1))||X(X(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' '!(F(G((F(p0) U 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' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((((!p2 U (p3||G(!p2)))||p1)&&p0))))'
Found a Shortening insensitive property : TriangularGrid-PT-5046-LTLFireability-11
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 10 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:58:57] [INFO ] Invariant cache hit.
[2023-03-20 12:58:57] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-20 12:58:57] [INFO ] Invariant cache hit.
[2023-03-20 12:58:57] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2023-03-20 12:58:57] [INFO ] Invariant cache hit.
[2023-03-20 12:58:57] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 549 ms. Remains : 280/280 places, 240/240 transitions.
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p3) p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2))), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s77 1) (LT s192 1)) (OR (LT s63 1) (LT s273 1))), p1:(OR (LT s11 1) (LT s242 1)), p3:(AND (NOT (AND (GEQ s11 1) (GEQ s242 1))) (NOT (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 357 reset in 1383 ms.
Product exploration explored 100000 steps with 365 reset in 1492 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X (OR (NOT p0) (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2))))), (X (X (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2)))))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p3) p2))))), (X (X (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 275 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Finished random walk after 247 steps, including 0 resets, run visited all 4 properties in 14 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X (OR (NOT p0) (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2))))), (X (X (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2)))))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p3) p2))))), (X (X (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (F (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (OR (AND (NOT p1) p2 (NOT p3)) (NOT p0)))), (F (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))))), (F (AND (NOT p1) p0 (NOT p2) (NOT p3)))]
Knowledge based reduction with 3 factoid took 487 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
[2023-03-20 12:59:01] [INFO ] Invariant cache hit.
[2023-03-20 12:59:01] [INFO ] [Real]Absence check using 115 positive place invariants in 39 ms returned sat
[2023-03-20 12:59:02] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 57 ms returned sat
[2023-03-20 12:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:59:02] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2023-03-20 12:59:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:59:02] [INFO ] [Nat]Absence check using 115 positive place invariants in 41 ms returned sat
[2023-03-20 12:59:02] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-20 12:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:59:02] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2023-03-20 12:59:02] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-20 12:59:03] [INFO ] Added : 89 causal constraints over 18 iterations in 365 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-20 12:59:03] [INFO ] Invariant cache hit.
[2023-03-20 12:59:03] [INFO ] [Real]Absence check using 115 positive place invariants in 41 ms returned sat
[2023-03-20 12:59:03] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-20 12:59:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:59:03] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2023-03-20 12:59:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:59:03] [INFO ] [Nat]Absence check using 115 positive place invariants in 31 ms returned sat
[2023-03-20 12:59:03] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-20 12:59:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:59:04] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2023-03-20 12:59:04] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-20 12:59:04] [INFO ] Added : 88 causal constraints over 18 iterations in 360 ms. Result :sat
Could not prove EG (AND (NOT p1) p2 (NOT p3))
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 1 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:59:04] [INFO ] Invariant cache hit.
[2023-03-20 12:59:04] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-20 12:59:04] [INFO ] Invariant cache hit.
[2023-03-20 12:59:04] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2023-03-20 12:59:04] [INFO ] Invariant cache hit.
[2023-03-20 12:59:05] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 575 ms. Remains : 280/280 places, 240/240 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 p1) p2 (NOT p3) (NOT p0)), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (OR (AND (NOT p1) p2 (NOT p3)) (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (OR (AND (NOT p1) p2 (NOT p3)) (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 305 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Finished random walk after 143 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p3) (NOT p0)), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (OR (AND (NOT p1) p2 (NOT p3)) (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (OR (AND (NOT p1) p2 (NOT p3)) (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (NOT p0))))), (F (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (OR (AND (NOT p1) p2 (NOT p3)) (NOT p0)))), (F (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))))), (F (AND (NOT p1) p0 (NOT p2) (NOT p3)))]
Knowledge based reduction with 3 factoid took 405 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
[2023-03-20 12:59:06] [INFO ] Invariant cache hit.
[2023-03-20 12:59:06] [INFO ] [Real]Absence check using 115 positive place invariants in 35 ms returned sat
[2023-03-20 12:59:06] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 47 ms returned sat
[2023-03-20 12:59:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:59:06] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2023-03-20 12:59:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:59:07] [INFO ] [Nat]Absence check using 115 positive place invariants in 43 ms returned sat
[2023-03-20 12:59:07] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-20 12:59:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:59:07] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2023-03-20 12:59:07] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-20 12:59:07] [INFO ] Added : 89 causal constraints over 18 iterations in 366 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-20 12:59:07] [INFO ] Invariant cache hit.
[2023-03-20 12:59:07] [INFO ] [Real]Absence check using 115 positive place invariants in 42 ms returned sat
[2023-03-20 12:59:07] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-20 12:59:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:59:08] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2023-03-20 12:59:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:59:08] [INFO ] [Nat]Absence check using 115 positive place invariants in 33 ms returned sat
[2023-03-20 12:59:08] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-20 12:59:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:59:08] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2023-03-20 12:59:08] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-20 12:59:08] [INFO ] Added : 88 causal constraints over 18 iterations in 371 ms. Result :sat
Could not prove EG (AND (NOT p1) p2 (NOT p3))
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Product exploration explored 100000 steps with 379 reset in 1389 ms.
Product exploration explored 100000 steps with 362 reset in 1535 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 10 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:59:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:59:12] [INFO ] Invariant cache hit.
[2023-03-20 12:59:12] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 179 ms. Remains : 280/280 places, 240/240 transitions.
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 1 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-20 12:59:12] [INFO ] Invariant cache hit.
[2023-03-20 12:59:12] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-20 12:59:12] [INFO ] Invariant cache hit.
[2023-03-20 12:59:12] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2023-03-20 12:59:12] [INFO ] Invariant cache hit.
[2023-03-20 12:59:12] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 577 ms. Remains : 280/280 places, 240/240 transitions.
Treatment of property TriangularGrid-PT-5046-LTLFireability-11 finished in 16127 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)||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' '!(G(F((G(p0)||((p2 U p3)&&p1)))))'
[2023-03-20 12:59:13] [INFO ] Flatten gal took : 17 ms
[2023-03-20 12:59:13] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-20 12:59:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 280 places, 240 transitions and 960 arcs took 4 ms.
Total runtime 109117 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2662/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2662/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2662/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2662/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2662/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2662/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2662/ltl_6_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : TriangularGrid-PT-5046-LTLFireability-00
Could not compute solution for formula : TriangularGrid-PT-5046-LTLFireability-04
Could not compute solution for formula : TriangularGrid-PT-5046-LTLFireability-07
Could not compute solution for formula : TriangularGrid-PT-5046-LTLFireability-08
Could not compute solution for formula : TriangularGrid-PT-5046-LTLFireability-11
Could not compute solution for formula : TriangularGrid-PT-5046-LTLFireability-14
Could not compute solution for formula : TriangularGrid-PT-5046-LTLFireability-15

BK_STOP 1679317155353

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name TriangularGrid-PT-5046-LTLFireability-00
ltl formula formula --ltl=/tmp/2662/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 280 places, 240 transitions and 960 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2662/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2662/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.020 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2662/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2662/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name TriangularGrid-PT-5046-LTLFireability-04
ltl formula formula --ltl=/tmp/2662/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
pnml2lts-mc( 0/ 4): Petri net has 280 places, 240 transitions and 960 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2662/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2662/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2662/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2662/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
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) [0x55dbdf02c3f4]
1: pnml2lts-mc(+0xa2496) [0x55dbdf02c496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f02e9a9c140]
3: pnml2lts-mc(+0x405be5) [0x55dbdf38fbe5]
4: pnml2lts-mc(+0x16b3f9) [0x55dbdf0f53f9]
5: pnml2lts-mc(+0x164ac4) [0x55dbdf0eeac4]
6: pnml2lts-mc(+0x272e0a) [0x55dbdf1fce0a]
7: pnml2lts-mc(+0xb61f0) [0x55dbdf0401f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f02e98ef4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f02e98ef67a]
10: pnml2lts-mc(+0xa1581) [0x55dbdf02b581]
11: pnml2lts-mc(+0xa1910) [0x55dbdf02b910]
12: pnml2lts-mc(+0xa32a2) [0x55dbdf02d2a2]
13: pnml2lts-mc(+0xa50f4) [0x55dbdf02f0f4]
14: pnml2lts-mc(+0xa516b) [0x55dbdf02f16b]
15: pnml2lts-mc(+0x3f34b3) [0x55dbdf37d4b3]
16: pnml2lts-mc(+0x7c63d) [0x55dbdf00663d]
17: pnml2lts-mc(+0x67d86) [0x55dbdeff1d86]
18: pnml2lts-mc(+0x60a8a) [0x55dbdefeaa8a]
19: pnml2lts-mc(+0x5eb15) [0x55dbdefe8b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f02e98d7d0a]
21: pnml2lts-mc(+0x6075e) [0x55dbdefea75e]
ltl formula name TriangularGrid-PT-5046-LTLFireability-07
ltl formula formula --ltl=/tmp/2662/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
pnml2lts-mc( 0/ 4): Petri net has 280 places, 240 transitions and 960 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2662/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2662/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.000 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2662/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2662/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 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-5046-LTLFireability-08
ltl formula formula --ltl=/tmp/2662/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
pnml2lts-mc( 0/ 4): Petri net has 280 places, 240 transitions and 960 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2662/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2662/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2662/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2662/ltl_3_
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
ltl formula name TriangularGrid-PT-5046-LTLFireability-11
ltl formula formula --ltl=/tmp/2662/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
pnml2lts-mc( 0/ 4): Petri net has 280 places, 240 transitions and 960 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2662/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2662/ltl_4_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2662/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2662/ltl_4_
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:
ltl formula name TriangularGrid-PT-5046-LTLFireability-14
ltl formula formula --ltl=/tmp/2662/ltl_5_
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
pnml2lts-mc( 0/ 4): Petri net has 280 places, 240 transitions and 960 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2662/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2662/ltl_5_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2662/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2662/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
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) [0x560a6631b3f4]
1: pnml2lts-mc(+0xa2496) [0x560a6631b496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f84b102d140]
3: pnml2lts-mc(+0x405be5) [0x560a6667ebe5]
4: pnml2lts-mc(+0x16b3f9) [0x560a663e43f9]
5: pnml2lts-mc(+0x164ac4) [0x560a663ddac4]
6: pnml2lts-mc(+0x272e0a) [0x560a664ebe0a]
7: pnml2lts-mc(+0xb61f0) [0x560a6632f1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f84b0e804d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f84b0e8067a]
10: pnml2lts-mc(+0xa1581) [0x560a6631a581]
11: pnml2lts-mc(+0xa1910) [0x560a6631a910]
12: pnml2lts-mc(+0xa32a2) [0x560a6631c2a2]
13: pnml2lts-mc(+0xa50f4) [0x560a6631e0f4]
14: pnml2lts-mc(+0x3f34b3) [0x560a6666c4b3]
15: pnml2lts-mc(+0x7c63d) [0x560a662f563d]
16: pnml2lts-mc(+0x67d86) [0x560a662e0d86]
17: pnml2lts-mc(+0x60a8a) [0x560a662d9a8a]
18: pnml2lts-mc(+0x5eb15) [0x560a662d7b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f84b0e68d0a]
20: pnml2lts-mc(+0x6075e) [0x560a662d975e]
ltl formula name TriangularGrid-PT-5046-LTLFireability-15
ltl formula formula --ltl=/tmp/2662/ltl_6_
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
pnml2lts-mc( 0/ 4): Petri net has 280 places, 240 transitions and 960 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2662/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2662/ltl_6_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2662/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2662/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 5 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) [0x56350b2983f4]
1: pnml2lts-mc(+0xa2496) [0x56350b298496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f163ae66140]
3: pnml2lts-mc(+0x405be5) [0x56350b5fbbe5]
4: pnml2lts-mc(+0x16b3f9) [0x56350b3613f9]
5: pnml2lts-mc(+0x164ac4) [0x56350b35aac4]
6: pnml2lts-mc(+0x272e0a) [0x56350b468e0a]
7: pnml2lts-mc(+0xb61f0) [0x56350b2ac1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f163acb94d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f163acb967a]
10: pnml2lts-mc(+0xa1581) [0x56350b297581]
11: pnml2lts-mc(+0xa1910) [0x56350b297910]
12: pnml2lts-mc(+0xa32a2) [0x56350b2992a2]
13: pnml2lts-mc(+0xa50f4) [0x56350b29b0f4]
14: pnml2lts-mc(+0x3f34b3) [0x56350b5e94b3]
15: pnml2lts-mc(+0x7c63d) [0x56350b27263d]
16: pnml2lts-mc(+0x67d86) [0x56350b25dd86]
17: pnml2lts-mc(+0x60a8a) [0x56350b256a8a]
18: pnml2lts-mc(+0x5eb15) [0x56350b254b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f163aca1d0a]
20: pnml2lts-mc(+0x6075e) [0x56350b25675e]

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-5046"
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-5046, 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-167912707200764"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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