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.r201-smll-167840347700388.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 HexagonalGrid-PT-226, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347700388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.0K Feb 26 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 17:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 17:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 17:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rwxr-xr-x 1 mcc users 112K Mar 5 18:22 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 HexagonalGrid-PT-226-LTLFireability-00
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-01
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-02
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-03
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-04
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-05
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-06
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-07
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-08
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-09
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-10
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-11
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-12
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-13
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-14
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678652297569

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=HexagonalGrid-PT-226
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 20:18:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 20:18:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 20:18:20] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2023-03-12 20:18:20] [INFO ] Transformed 169 places.
[2023-03-12 20:18:20] [INFO ] Transformed 270 transitions.
[2023-03-12 20:18:20] [INFO ] Parsed PT model containing 169 places and 270 transitions and 1080 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA HexagonalGrid-PT-226-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-226-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-226-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-226-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-226-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 30 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
// Phase 1: matrix 270 rows 169 cols
[2023-03-12 20:18:20] [INFO ] Computed 68 place invariants in 26 ms
[2023-03-12 20:18:20] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-12 20:18:20] [INFO ] Invariant cache hit.
[2023-03-12 20:18:21] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
[2023-03-12 20:18:21] [INFO ] Invariant cache hit.
[2023-03-12 20:18:21] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1085 ms. Remains : 169/169 places, 270/270 transitions.
Support contains 37 out of 169 places after structural reductions.
[2023-03-12 20:18:21] [INFO ] Flatten gal took : 75 ms
[2023-03-12 20:18:21] [INFO ] Flatten gal took : 37 ms
[2023-03-12 20:18:21] [INFO ] Input system was already deterministic with 270 transitions.
Support contains 35 out of 169 places (down from 37) after GAL structural reductions.
Finished random walk after 544 steps, including 0 resets, run visited all 24 properties in 77 ms. (steps per millisecond=7 )
FORMULA HexagonalGrid-PT-226-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (X(F(!p2))&&p1))))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 14 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:18:22] [INFO ] Invariant cache hit.
[2023-03-12 20:18:22] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-12 20:18:22] [INFO ] Invariant cache hit.
[2023-03-12 20:18:22] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2023-03-12 20:18:22] [INFO ] Invariant cache hit.
[2023-03-12 20:18:23] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 705 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), p2, true]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 2}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s48 1) (GEQ s55 1)), p0:(AND (GEQ s48 1) (GEQ s55 1)), p2:(AND (GEQ s34 1) (GEQ s91 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-226-LTLFireability-03 finished in 1112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||(F(p1)&&G(p2))))))'
Support contains 8 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 14 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:18:23] [INFO ] Invariant cache hit.
[2023-03-12 20:18:23] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-12 20:18:23] [INFO ] Invariant cache hit.
[2023-03-12 20:18:23] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2023-03-12 20:18:23] [INFO ] Invariant cache hit.
[2023-03-12 20:18:24] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 798 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p2:(OR (LT s38 1) (LT s93 1)), p1:(AND (GEQ s45 1) (GEQ s123 1) (GEQ s46 1) (GEQ s115 1)), p0:(AND (GEQ s42 1) (GEQ s63 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-226-LTLFireability-04 finished in 1064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U p2)&&p0))))'
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 21 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:18:24] [INFO ] Invariant cache hit.
[2023-03-12 20:18:24] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-12 20:18:24] [INFO ] Invariant cache hit.
[2023-03-12 20:18:24] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2023-03-12 20:18:25] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-12 20:18:25] [INFO ] Invariant cache hit.
[2023-03-12 20:18:25] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 735 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s46 1) (GEQ s124 1)), p0:(AND (GEQ s42 1) (GEQ s111 1)), p1:(AND (GEQ s43 1) (GEQ s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3344 steps with 0 reset in 58 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-226-LTLFireability-06 finished in 910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1||F(p2))))'
Support contains 5 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 12 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:18:25] [INFO ] Invariant cache hit.
[2023-03-12 20:18:25] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-12 20:18:25] [INFO ] Invariant cache hit.
[2023-03-12 20:18:25] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2023-03-12 20:18:25] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-12 20:18:25] [INFO ] Invariant cache hit.
[2023-03-12 20:18:26] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 727 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s43 1) (GEQ s64 1)), p2:(AND (GEQ s43 1) (GEQ s57 1)), p0:(AND (GEQ s45 1) (GEQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 905 reset in 1269 ms.
Product exploration explored 100000 steps with 881 reset in 1284 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 550 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p2), (NOT p2)]
Finished random walk after 130 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 544 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 36 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
[2023-03-12 20:18:30] [INFO ] Invariant cache hit.
[2023-03-12 20:18:30] [INFO ] [Real]Absence check using 67 positive place invariants in 29 ms returned sat
[2023-03-12 20:18:30] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 20:18:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:18:30] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2023-03-12 20:18:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:18:30] [INFO ] [Nat]Absence check using 67 positive place invariants in 27 ms returned sat
[2023-03-12 20:18:30] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-12 20:18:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:18:31] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2023-03-12 20:18:31] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-12 20:18:31] [INFO ] Added : 58 causal constraints over 12 iterations in 344 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 169 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 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 10 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:18:31] [INFO ] Invariant cache hit.
[2023-03-12 20:18:31] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-12 20:18:31] [INFO ] Invariant cache hit.
[2023-03-12 20:18:31] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2023-03-12 20:18:31] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-12 20:18:31] [INFO ] Invariant cache hit.
[2023-03-12 20:18:32] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 715 ms. Remains : 169/169 places, 270/270 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 p2), (X (NOT p2))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 127 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 p2)]
Finished random walk after 214 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=35 )
Knowledge obtained : [(NOT p2), (X (NOT p2))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 160 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 p2)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p2)]
[2023-03-12 20:18:32] [INFO ] Invariant cache hit.
[2023-03-12 20:18:32] [INFO ] [Real]Absence check using 67 positive place invariants in 28 ms returned sat
[2023-03-12 20:18:32] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 20:18:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:18:32] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-12 20:18:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:18:33] [INFO ] [Nat]Absence check using 67 positive place invariants in 27 ms returned sat
[2023-03-12 20:18:33] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-12 20:18:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:18:33] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2023-03-12 20:18:33] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-12 20:18:33] [INFO ] Added : 58 causal constraints over 12 iterations in 275 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 53 ms :[(NOT p2)]
Product exploration explored 100000 steps with 883 reset in 1081 ms.
Product exploration explored 100000 steps with 856 reset in 1137 ms.
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 10 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:18:35] [INFO ] Invariant cache hit.
[2023-03-12 20:18:36] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-12 20:18:36] [INFO ] Invariant cache hit.
[2023-03-12 20:18:36] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2023-03-12 20:18:36] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 20:18:36] [INFO ] Invariant cache hit.
[2023-03-12 20:18:36] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 771 ms. Remains : 169/169 places, 270/270 transitions.
Treatment of property HexagonalGrid-PT-226-LTLFireability-07 finished in 11270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U !p1)))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 3 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:18:36] [INFO ] Invariant cache hit.
[2023-03-12 20:18:36] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-12 20:18:36] [INFO ] Invariant cache hit.
[2023-03-12 20:18:37] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2023-03-12 20:18:37] [INFO ] Invariant cache hit.
[2023-03-12 20:18:37] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 665 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 118 ms :[p1, p1, (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s44 1) (GEQ s74 1)), p0:(AND (GEQ s45 1) (GEQ s52 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 682 ms.
Product exploration explored 100000 steps with 50000 reset in 745 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 3 factoid took 249 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HexagonalGrid-PT-226-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HexagonalGrid-PT-226-LTLFireability-09 finished in 2486 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((X(X(F(p0)))||(G(p2)&&p1))))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 4 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:18:39] [INFO ] Invariant cache hit.
[2023-03-12 20:18:39] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-12 20:18:39] [INFO ] Invariant cache hit.
[2023-03-12 20:18:39] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2023-03-12 20:18:39] [INFO ] Invariant cache hit.
[2023-03-12 20:18:39] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 731 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s43 1) (GEQ s64 1)), p2:(AND (GEQ s43 1) (GEQ s64 1)), p0:(AND (GEQ s47 1) (GEQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1780 reset in 1106 ms.
Product exploration explored 100000 steps with 1661 reset in 1174 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (NOT p2)), (X p2), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 385 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 109 steps, including 0 resets, run visited all 6 properties in 15 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (NOT p2)), (X p2), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (AND p1 p2))]
Knowledge based reduction with 1 factoid took 543 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2023-03-12 20:18:43] [INFO ] Invariant cache hit.
[2023-03-12 20:18:44] [INFO ] [Real]Absence check using 67 positive place invariants in 30 ms returned sat
[2023-03-12 20:18:44] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-12 20:18:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:18:44] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2023-03-12 20:18:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:18:44] [INFO ] [Nat]Absence check using 67 positive place invariants in 31 ms returned sat
[2023-03-12 20:18:44] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 20:18:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:18:44] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2023-03-12 20:18:44] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 19 ms.
[2023-03-12 20:18:45] [INFO ] Added : 59 causal constraints over 12 iterations in 266 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-12 20:18:45] [INFO ] Invariant cache hit.
[2023-03-12 20:18:45] [INFO ] [Real]Absence check using 67 positive place invariants in 28 ms returned sat
[2023-03-12 20:18:45] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-12 20:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:18:45] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2023-03-12 20:18:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:18:45] [INFO ] [Nat]Absence check using 67 positive place invariants in 31 ms returned sat
[2023-03-12 20:18:45] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 20:18:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:18:45] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2023-03-12 20:18:45] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-12 20:18:46] [INFO ] Added : 59 causal constraints over 12 iterations in 274 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 3 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:18:46] [INFO ] Invariant cache hit.
[2023-03-12 20:18:46] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-12 20:18:46] [INFO ] Invariant cache hit.
[2023-03-12 20:18:46] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2023-03-12 20:18:46] [INFO ] Invariant cache hit.
[2023-03-12 20:18:46] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 637 ms. Remains : 169/169 places, 270/270 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 p2) (NOT p0))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 329 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 54 steps, including 0 resets, run visited all 6 properties in 7 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (AND p1 p2))]
Knowledge based reduction with 1 factoid took 471 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2023-03-12 20:18:48] [INFO ] Invariant cache hit.
[2023-03-12 20:18:48] [INFO ] [Real]Absence check using 67 positive place invariants in 29 ms returned sat
[2023-03-12 20:18:48] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-12 20:18:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:18:48] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2023-03-12 20:18:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:18:48] [INFO ] [Nat]Absence check using 67 positive place invariants in 33 ms returned sat
[2023-03-12 20:18:48] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 20:18:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:18:49] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2023-03-12 20:18:49] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-12 20:18:49] [INFO ] Added : 59 causal constraints over 12 iterations in 277 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-12 20:18:49] [INFO ] Invariant cache hit.
[2023-03-12 20:18:49] [INFO ] [Real]Absence check using 67 positive place invariants in 27 ms returned sat
[2023-03-12 20:18:49] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-12 20:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:18:49] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2023-03-12 20:18:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:18:50] [INFO ] [Nat]Absence check using 67 positive place invariants in 31 ms returned sat
[2023-03-12 20:18:50] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-12 20:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:18:50] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2023-03-12 20:18:50] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-12 20:18:50] [INFO ] Added : 59 causal constraints over 12 iterations in 260 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1685 reset in 1101 ms.
Product exploration explored 100000 steps with 1756 reset in 1195 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 19 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:18:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 20:18:53] [INFO ] Invariant cache hit.
[2023-03-12 20:18:53] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 238 ms. Remains : 169/169 places, 270/270 transitions.
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 4 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:18:53] [INFO ] Invariant cache hit.
[2023-03-12 20:18:53] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-12 20:18:53] [INFO ] Invariant cache hit.
[2023-03-12 20:18:54] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2023-03-12 20:18:54] [INFO ] Invariant cache hit.
[2023-03-12 20:18:54] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 703 ms. Remains : 169/169 places, 270/270 transitions.
Treatment of property HexagonalGrid-PT-226-LTLFireability-10 finished in 15140 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)||(X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))))'
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 3 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:18:54] [INFO ] Invariant cache hit.
[2023-03-12 20:18:54] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-12 20:18:54] [INFO ] Invariant cache hit.
[2023-03-12 20:18:54] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2023-03-12 20:18:54] [INFO ] Invariant cache hit.
[2023-03-12 20:18:54] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 603 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={1} source=2 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s45 1) (GEQ s59 1)), p2:(AND (GEQ s44 1) (GEQ s58 1)), p1:(AND (GEQ s24 1) (GEQ s84 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1516 reset in 1168 ms.
Product exploration explored 100000 steps with 1610 reset in 1241 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 p2) p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 875 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Finished random walk after 197 steps, including 0 resets, run visited all 10 properties in 13 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 p2)), (F (OR (AND p0 p2) (AND p1 p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 1105 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 123 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 3 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:18:59] [INFO ] Invariant cache hit.
[2023-03-12 20:19:00] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-12 20:19:00] [INFO ] Invariant cache hit.
[2023-03-12 20:19:00] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2023-03-12 20:19:00] [INFO ] Invariant cache hit.
[2023-03-12 20:19:00] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 613 ms. Remains : 169/169 places, 270/270 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2))))]
Knowledge based reduction with 6 factoid took 880 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Finished random walk after 322 steps, including 0 resets, run visited all 10 properties in 12 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 p2)), (F (OR (AND p0 p2) (AND p1 p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 1174 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 130 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 121 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 1523 reset in 1193 ms.
Product exploration explored 100000 steps with 1600 reset in 1263 ms.
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 7 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:19:05] [INFO ] Invariant cache hit.
[2023-03-12 20:19:05] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-12 20:19:05] [INFO ] Invariant cache hit.
[2023-03-12 20:19:06] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
[2023-03-12 20:19:06] [INFO ] Invariant cache hit.
[2023-03-12 20:19:06] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 674 ms. Remains : 169/169 places, 270/270 transitions.
Treatment of property HexagonalGrid-PT-226-LTLFireability-11 finished in 12093 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 3 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:19:06] [INFO ] Invariant cache hit.
[2023-03-12 20:19:06] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-12 20:19:06] [INFO ] Invariant cache hit.
[2023-03-12 20:19:06] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2023-03-12 20:19:06] [INFO ] Invariant cache hit.
[2023-03-12 20:19:07] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 721 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s87 1) (GEQ s117 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][false, false]]
Product exploration explored 100000 steps with 1632 reset in 1074 ms.
Product exploration explored 100000 steps with 1798 reset in 1145 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 126 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 34 ms :[(NOT p0)]
Finished random walk after 68 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
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 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-12 20:19:09] [INFO ] Invariant cache hit.
[2023-03-12 20:19:10] [INFO ] [Real]Absence check using 67 positive place invariants in 28 ms returned sat
[2023-03-12 20:19:10] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-12 20:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:19:10] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2023-03-12 20:19:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:19:10] [INFO ] [Nat]Absence check using 67 positive place invariants in 31 ms returned sat
[2023-03-12 20:19:10] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 20:19:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:19:10] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2023-03-12 20:19:10] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 19 ms.
[2023-03-12 20:19:10] [INFO ] Added : 56 causal constraints over 12 iterations in 250 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 9 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:19:10] [INFO ] Invariant cache hit.
[2023-03-12 20:19:11] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-12 20:19:11] [INFO ] Invariant cache hit.
[2023-03-12 20:19:11] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2023-03-12 20:19:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 20:19:11] [INFO ] Invariant cache hit.
[2023-03-12 20:19:11] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 704 ms. Remains : 169/169 places, 270/270 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 94 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=31 )
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 152 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 35 ms :[(NOT p0)]
[2023-03-12 20:19:12] [INFO ] Invariant cache hit.
[2023-03-12 20:19:12] [INFO ] [Real]Absence check using 67 positive place invariants in 28 ms returned sat
[2023-03-12 20:19:12] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-12 20:19:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:19:12] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2023-03-12 20:19:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:19:12] [INFO ] [Nat]Absence check using 67 positive place invariants in 30 ms returned sat
[2023-03-12 20:19:12] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 20:19:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:19:12] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2023-03-12 20:19:12] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 19 ms.
[2023-03-12 20:19:13] [INFO ] Added : 56 causal constraints over 12 iterations in 261 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1829 reset in 1070 ms.
Product exploration explored 100000 steps with 1745 reset in 1144 ms.
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 16 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:19:15] [INFO ] Invariant cache hit.
[2023-03-12 20:19:15] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-12 20:19:15] [INFO ] Invariant cache hit.
[2023-03-12 20:19:15] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2023-03-12 20:19:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 20:19:15] [INFO ] Invariant cache hit.
[2023-03-12 20:19:16] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 674 ms. Remains : 169/169 places, 270/270 transitions.
Treatment of property HexagonalGrid-PT-226-LTLFireability-13 finished in 9679 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) U X(p1))&&X(G(p2))))'
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:19:16] [INFO ] Invariant cache hit.
[2023-03-12 20:19:16] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-12 20:19:16] [INFO ] Invariant cache hit.
[2023-03-12 20:19:16] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2023-03-12 20:19:16] [INFO ] Invariant cache hit.
[2023-03-12 20:19:16] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 654 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s43 1) (GEQ s64 1)), p2:(AND (GEQ s18 1) (GEQ s157 1)), p1:(AND (GEQ s47 1) (GEQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 299 steps with 3 reset in 4 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-226-LTLFireability-14 finished in 882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:19:16] [INFO ] Invariant cache hit.
[2023-03-12 20:19:17] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-12 20:19:17] [INFO ] Invariant cache hit.
[2023-03-12 20:19:17] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2023-03-12 20:19:17] [INFO ] Invariant cache hit.
[2023-03-12 20:19:17] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 659 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s43 1) (GEQ s116 1)), p1:(AND (GEQ s43 1) (GEQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-226-LTLFireability-15 finished in 779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1||F(p2))))'
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((X(X(F(p0)))||(G(p2)&&p1))))'
Found a Shortening insensitive property : HexagonalGrid-PT-226-LTLFireability-10
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 5 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:19:18] [INFO ] Invariant cache hit.
[2023-03-12 20:19:18] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-12 20:19:18] [INFO ] Invariant cache hit.
[2023-03-12 20:19:18] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2023-03-12 20:19:18] [INFO ] Invariant cache hit.
[2023-03-12 20:19:18] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 624 ms. Remains : 169/169 places, 270/270 transitions.
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s43 1) (GEQ s64 1)), p2:(AND (GEQ s43 1) (GEQ s64 1)), p0:(AND (GEQ s47 1) (GEQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1694 reset in 1104 ms.
Product exploration explored 100000 steps with 1757 reset in 1185 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (NOT p2)), (X p2), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 347 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 21 steps, including 0 resets, run visited all 6 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (NOT p2)), (X p2), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (AND p1 p2))]
Knowledge based reduction with 1 factoid took 490 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2023-03-12 20:19:22] [INFO ] Invariant cache hit.
[2023-03-12 20:19:22] [INFO ] [Real]Absence check using 67 positive place invariants in 30 ms returned sat
[2023-03-12 20:19:22] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-12 20:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:19:22] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2023-03-12 20:19:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:19:23] [INFO ] [Nat]Absence check using 67 positive place invariants in 32 ms returned sat
[2023-03-12 20:19:23] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 20:19:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:19:23] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2023-03-12 20:19:23] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 19 ms.
[2023-03-12 20:19:23] [INFO ] Added : 59 causal constraints over 12 iterations in 249 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-12 20:19:23] [INFO ] Invariant cache hit.
[2023-03-12 20:19:23] [INFO ] [Real]Absence check using 67 positive place invariants in 28 ms returned sat
[2023-03-12 20:19:23] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-12 20:19:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:19:23] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2023-03-12 20:19:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:19:24] [INFO ] [Nat]Absence check using 67 positive place invariants in 29 ms returned sat
[2023-03-12 20:19:24] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 20:19:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:19:24] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2023-03-12 20:19:24] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-12 20:19:24] [INFO ] Added : 59 causal constraints over 12 iterations in 263 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:19:24] [INFO ] Invariant cache hit.
[2023-03-12 20:19:24] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-12 20:19:24] [INFO ] Invariant cache hit.
[2023-03-12 20:19:25] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2023-03-12 20:19:25] [INFO ] Invariant cache hit.
[2023-03-12 20:19:25] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 701 ms. Remains : 169/169 places, 270/270 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 p2) (NOT p0))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 327 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 56 steps, including 0 resets, run visited all 6 properties in 6 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (AND p1 p2))]
Knowledge based reduction with 1 factoid took 464 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2023-03-12 20:19:26] [INFO ] Invariant cache hit.
[2023-03-12 20:19:26] [INFO ] [Real]Absence check using 67 positive place invariants in 28 ms returned sat
[2023-03-12 20:19:26] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-12 20:19:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:19:27] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2023-03-12 20:19:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:19:27] [INFO ] [Nat]Absence check using 67 positive place invariants in 29 ms returned sat
[2023-03-12 20:19:27] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 20:19:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:19:27] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2023-03-12 20:19:27] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-12 20:19:27] [INFO ] Added : 59 causal constraints over 12 iterations in 264 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-12 20:19:27] [INFO ] Invariant cache hit.
[2023-03-12 20:19:27] [INFO ] [Real]Absence check using 67 positive place invariants in 29 ms returned sat
[2023-03-12 20:19:27] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-12 20:19:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:19:28] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2023-03-12 20:19:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:19:28] [INFO ] [Nat]Absence check using 67 positive place invariants in 30 ms returned sat
[2023-03-12 20:19:28] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 20:19:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:19:28] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2023-03-12 20:19:28] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-12 20:19:28] [INFO ] Added : 59 causal constraints over 12 iterations in 263 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1780 reset in 1108 ms.
Product exploration explored 100000 steps with 1778 reset in 1183 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 6 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:19:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 20:19:31] [INFO ] Invariant cache hit.
[2023-03-12 20:19:31] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 215 ms. Remains : 169/169 places, 270/270 transitions.
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 13 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:19:31] [INFO ] Invariant cache hit.
[2023-03-12 20:19:31] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-12 20:19:31] [INFO ] Invariant cache hit.
[2023-03-12 20:19:32] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-12 20:19:32] [INFO ] Invariant cache hit.
[2023-03-12 20:19:32] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 684 ms. Remains : 169/169 places, 270/270 transitions.
Treatment of property HexagonalGrid-PT-226-LTLFireability-10 finished in 14614 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)||(X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))))'
Found a Shortening insensitive property : HexagonalGrid-PT-226-LTLFireability-11
Stuttering acceptance computed with spot in 125 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 4 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:19:32] [INFO ] Invariant cache hit.
[2023-03-12 20:19:32] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-12 20:19:32] [INFO ] Invariant cache hit.
[2023-03-12 20:19:33] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2023-03-12 20:19:33] [INFO ] Invariant cache hit.
[2023-03-12 20:19:33] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 689 ms. Remains : 169/169 places, 270/270 transitions.
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={1} source=2 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s45 1) (GEQ s59 1)), p2:(AND (GEQ s44 1) (GEQ s58 1)), p1:(AND (GEQ s24 1) (GEQ s84 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1632 reset in 1170 ms.
Product exploration explored 100000 steps with 1550 reset in 1246 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 p2) p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 877 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Finished random walk after 2103 steps, including 0 resets, run visited all 10 properties in 40 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 p2)), (F (OR (AND p0 p2) (AND p1 p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 1081 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 177 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 1 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:19:38] [INFO ] Invariant cache hit.
[2023-03-12 20:19:38] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-12 20:19:38] [INFO ] Invariant cache hit.
[2023-03-12 20:19:38] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2023-03-12 20:19:38] [INFO ] Invariant cache hit.
[2023-03-12 20:19:38] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 655 ms. Remains : 169/169 places, 270/270 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2))))]
Knowledge based reduction with 6 factoid took 982 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Finished random walk after 716 steps, including 0 resets, run visited all 10 properties in 24 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 p2)), (F (OR (AND p0 p2) (AND p1 p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 1091 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 126 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 124 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 1541 reset in 1196 ms.
Product exploration explored 100000 steps with 1607 reset in 1260 ms.
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:19:44] [INFO ] Invariant cache hit.
[2023-03-12 20:19:44] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-12 20:19:44] [INFO ] Invariant cache hit.
[2023-03-12 20:19:44] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2023-03-12 20:19:44] [INFO ] Invariant cache hit.
[2023-03-12 20:19:44] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 685 ms. Remains : 169/169 places, 270/270 transitions.
Treatment of property HexagonalGrid-PT-226-LTLFireability-11 finished in 12391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : HexagonalGrid-PT-226-LTLFireability-13
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 7 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:19:45] [INFO ] Invariant cache hit.
[2023-03-12 20:19:45] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-12 20:19:45] [INFO ] Invariant cache hit.
[2023-03-12 20:19:45] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-03-12 20:19:45] [INFO ] Invariant cache hit.
[2023-03-12 20:19:45] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 666 ms. Remains : 169/169 places, 270/270 transitions.
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s87 1) (GEQ s117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1714 reset in 1079 ms.
Product exploration explored 100000 steps with 1719 reset in 1150 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 141 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 36 ms :[(NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 155 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2023-03-12 20:19:48] [INFO ] Invariant cache hit.
[2023-03-12 20:19:48] [INFO ] [Real]Absence check using 67 positive place invariants in 25 ms returned sat
[2023-03-12 20:19:48] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-12 20:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:19:48] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2023-03-12 20:19:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:19:48] [INFO ] [Nat]Absence check using 67 positive place invariants in 28 ms returned sat
[2023-03-12 20:19:48] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 20:19:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:19:49] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-12 20:19:49] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 22 ms.
[2023-03-12 20:19:49] [INFO ] Added : 56 causal constraints over 12 iterations in 248 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 6 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:19:49] [INFO ] Invariant cache hit.
[2023-03-12 20:19:49] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-12 20:19:49] [INFO ] Invariant cache hit.
[2023-03-12 20:19:49] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2023-03-12 20:19:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 20:19:49] [INFO ] Invariant cache hit.
[2023-03-12 20:19:50] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 727 ms. Remains : 169/169 places, 270/270 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 217 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 98 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=49 )
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 143 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2023-03-12 20:19:50] [INFO ] Invariant cache hit.
[2023-03-12 20:19:50] [INFO ] [Real]Absence check using 67 positive place invariants in 26 ms returned sat
[2023-03-12 20:19:50] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-12 20:19:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:19:50] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2023-03-12 20:19:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:19:51] [INFO ] [Nat]Absence check using 67 positive place invariants in 29 ms returned sat
[2023-03-12 20:19:51] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 20:19:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:19:51] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2023-03-12 20:19:51] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 28 ms.
[2023-03-12 20:19:51] [INFO ] Added : 56 causal constraints over 12 iterations in 266 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1698 reset in 1063 ms.
Product exploration explored 100000 steps with 1723 reset in 1145 ms.
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 11 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-12 20:19:53] [INFO ] Invariant cache hit.
[2023-03-12 20:19:53] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-12 20:19:53] [INFO ] Invariant cache hit.
[2023-03-12 20:19:54] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2023-03-12 20:19:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 20:19:54] [INFO ] Invariant cache hit.
[2023-03-12 20:19:54] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 727 ms. Remains : 169/169 places, 270/270 transitions.
Treatment of property HexagonalGrid-PT-226-LTLFireability-13 finished in 9697 ms.
[2023-03-12 20:19:54] [INFO ] Flatten gal took : 24 ms
[2023-03-12 20:19:54] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 20:19:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 169 places, 270 transitions and 1080 arcs took 4 ms.
Total runtime 94678 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2785/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2785/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2785/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2785/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : HexagonalGrid-PT-226-LTLFireability-07
Could not compute solution for formula : HexagonalGrid-PT-226-LTLFireability-10
Could not compute solution for formula : HexagonalGrid-PT-226-LTLFireability-11
Could not compute solution for formula : HexagonalGrid-PT-226-LTLFireability-13

BK_STOP 1678652396479

--------------------
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 HexagonalGrid-PT-226-LTLFireability-07
ltl formula formula --ltl=/tmp/2785/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 169 places, 270 transitions and 1080 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2785/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2785/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2785/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2785/ltl_0_
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 HexagonalGrid-PT-226-LTLFireability-10
ltl formula formula --ltl=/tmp/2785/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 169 places, 270 transitions and 1080 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2785/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2785/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2785/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2785/ltl_1_
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:
0: pnml2lts-mc(+0xa23f4) [0x5618300c43f4]
1: pnml2lts-mc(+0xa2496) [0x5618300c4496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f3abcff9140]
3: pnml2lts-mc(+0x405be5) [0x561830427be5]
4: pnml2lts-mc(+0x16b3f9) [0x56183018d3f9]
5: pnml2lts-mc(+0x164ac4) [0x561830186ac4]
6: pnml2lts-mc(+0x272e0a) [0x561830294e0a]
7: pnml2lts-mc(+0xb61f0) [0x5618300d81f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f3abce4c4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f3abce4c67a]
10: pnml2lts-mc(+0xa1581) [0x5618300c3581]
11: pnml2lts-mc(+0xa1910) [0x5618300c3910]
12: pnml2lts-mc(+0xa32a2) [0x5618300c52a2]
13: pnml2lts-mc(+0xa50f4) [0x5618300c70f4]
14: pnml2lts-mc(+0xa516b) [0x5618300c716b]
15: pnml2lts-mc(+0x3f34b3) [0x5618304154b3]
16: pnml2lts-mc(+0x7c63d) [0x56183009e63d]
17: pnml2lts-mc(+0x67d86) [0x561830089d86]
18: pnml2lts-mc(+0x60a8a) [0x561830082a8a]
19: pnml2lts-mc(+0x5eb15) [0x561830080b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f3abce34d0a]
21: pnml2lts-mc(+0x6075e) [0x56183008275e]
ltl formula name HexagonalGrid-PT-226-LTLFireability-11
ltl formula formula --ltl=/tmp/2785/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 169 places, 270 transitions and 1080 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2785/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2785/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2785/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2785/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 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 HexagonalGrid-PT-226-LTLFireability-13
ltl formula formula --ltl=/tmp/2785/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 169 places, 270 transitions and 1080 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2785/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2785/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2785/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2785/ltl_3_
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

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="HexagonalGrid-PT-226"
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 HexagonalGrid-PT-226, 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 r201-smll-167840347700388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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