Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r197-tall-171640625500373.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is GPUForwardProgress-PT-36a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625500373
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 23:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 11 23:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 23:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 23:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 56K May 18 16:42 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 GPUForwardProgress-PT-36a-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716555238019

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-36a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 12:53:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 12:53:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:53:59] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2024-05-24 12:53:59] [INFO ] Transformed 152 places.
[2024-05-24 12:53:59] [INFO ] Transformed 189 transitions.
[2024-05-24 12:53:59] [INFO ] Found NUPN structural information;
[2024-05-24 12:53:59] [INFO ] Parsed PT model containing 152 places and 189 transitions and 741 arcs in 117 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 38 transitions
Reduce redundant transitions removed 38 transitions.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36a-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 72 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Applied a total of 0 rules in 12 ms. Remains 152 /152 variables (removed 0) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 152 cols
[2024-05-24 12:53:59] [INFO ] Computed 38 invariants in 8 ms
[2024-05-24 12:54:00] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-05-24 12:54:00] [INFO ] Invariant cache hit.
[2024-05-24 12:54:00] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 12:54:00] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
[2024-05-24 12:54:00] [INFO ] Invariant cache hit.
[2024-05-24 12:54:00] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 729 ms. Remains : 152/152 places, 151/151 transitions.
Support contains 72 out of 152 places after structural reductions.
[2024-05-24 12:54:00] [INFO ] Flatten gal took : 39 ms
[2024-05-24 12:54:00] [INFO ] Flatten gal took : 15 ms
[2024-05-24 12:54:00] [INFO ] Input system was already deterministic with 151 transitions.
Support contains 71 out of 152 places (down from 72) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 36) seen :34
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 59 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 12:54:01] [INFO ] Invariant cache hit.
[2024-05-24 12:54:01] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 6 ms returned sat
[2024-05-24 12:54:01] [INFO ] After 94ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-24 12:54:01] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 12:54:01] [INFO ] After 38ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :2
[2024-05-24 12:54:01] [INFO ] After 86ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-24 12:54:01] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 38 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 151/151 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 150
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 1 place count 152 transition count 114
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 73 place count 116 transition count 114
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 114 transition count 112
Partial Free-agglomeration rule applied 36 times.
Drop transitions removed 36 transitions
Iterating global reduction 1 with 36 rules applied. Total rules applied 113 place count 114 transition count 112
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 149 place count 114 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 113 transition count 75
Applied a total of 150 rules in 44 ms. Remains 113 /152 variables (removed 39) and now considering 75/151 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 113/152 places, 75/151 transitions.
Incomplete random walk after 10000 steps, including 640 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Finished probabilistic random walk after 2175 steps, run visited all 2 properties in 31 ms. (steps per millisecond=70 )
Probabilistic random walk after 2175 steps, saw 2035 distinct states, run finished after 31 ms. (steps per millisecond=70 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 486 edges and 152 vertex of which 114 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0 U p1)||G((p0||F(p2)))))))'
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Graph (complete) has 486 edges and 152 vertex of which 114 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 35 Pre rules applied. Total rules applied 1 place count 114 transition count 115
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 71 place count 79 transition count 115
Applied a total of 71 rules in 13 ms. Remains 79 /152 variables (removed 73) and now considering 115/151 (removed 36) transitions.
// Phase 1: matrix 115 rows 79 cols
[2024-05-24 12:54:02] [INFO ] Computed 1 invariants in 2 ms
[2024-05-24 12:54:02] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-24 12:54:02] [INFO ] Invariant cache hit.
[2024-05-24 12:54:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 12:54:02] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-05-24 12:54:02] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-24 12:54:02] [INFO ] Invariant cache hit.
[2024-05-24 12:54:02] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/152 places, 115/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 236 ms. Remains : 79/152 places, 115/151 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s69 1) (EQ s75 1) (EQ s78 1)), p0:(AND (EQ s33 1) (EQ s75 1) (EQ s78 1)), p2:(AND (EQ s1 1) (EQ s75 1) (EQ s78 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 4 steps with 1 reset in 2 ms.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-00 finished in 479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U (p1||G(p0)))&&(F(p3)||p2)))))'
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 151 transition count 151
Applied a total of 1 rules in 6 ms. Remains 151 /152 variables (removed 1) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 151 cols
[2024-05-24 12:54:02] [INFO ] Computed 37 invariants in 7 ms
[2024-05-24 12:54:02] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-24 12:54:02] [INFO ] Invariant cache hit.
[2024-05-24 12:54:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 12:54:02] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-05-24 12:54:02] [INFO ] Invariant cache hit.
[2024-05-24 12:54:03] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/152 places, 151/151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. Remains : 151/152 places, 151/151 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), true, (NOT p3)]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NEQ s54 1) (EQ s18 1)), p0:(EQ s18 1), p2:(OR (EQ s7 1) (EQ s67 1)), p3:(EQ s54 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-01 finished in 562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U (p0||G(!p1))))))'
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Graph (complete) has 486 edges and 152 vertex of which 114 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.3 ms
Discarding 38 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 34 Pre rules applied. Total rules applied 1 place count 114 transition count 116
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 0 with 68 rules applied. Total rules applied 69 place count 80 transition count 116
Applied a total of 69 rules in 16 ms. Remains 80 /152 variables (removed 72) and now considering 116/151 (removed 35) transitions.
// Phase 1: matrix 116 rows 80 cols
[2024-05-24 12:54:03] [INFO ] Computed 1 invariants in 1 ms
[2024-05-24 12:54:03] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 12:54:03] [INFO ] Invariant cache hit.
[2024-05-24 12:54:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 12:54:03] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-24 12:54:03] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-24 12:54:03] [INFO ] Invariant cache hit.
[2024-05-24 12:54:03] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/152 places, 116/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 80/152 places, 116/151 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s70 1), p1:(AND (EQ s35 1) (EQ s76 1) (EQ s79 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 663 reset in 552 ms.
Stack based approach found an accepted trace after 552 steps with 7 reset with depth 65 and stack size 39 in 3 ms.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-02 finished in 894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(!p1 U (p2||G(!p1)))))'
Support contains 42 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 35 Pre rules applied. Total rules applied 0 place count 152 transition count 116
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 70 place count 117 transition count 116
Applied a total of 70 rules in 12 ms. Remains 117 /152 variables (removed 35) and now considering 116/151 (removed 35) transitions.
// Phase 1: matrix 116 rows 117 cols
[2024-05-24 12:54:04] [INFO ] Computed 38 invariants in 1 ms
[2024-05-24 12:54:04] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-24 12:54:04] [INFO ] Invariant cache hit.
[2024-05-24 12:54:04] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 12:54:04] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-24 12:54:04] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-24 12:54:04] [INFO ] Invariant cache hit.
[2024-05-24 12:54:04] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/152 places, 116/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 277 ms. Remains : 117/152 places, 116/151 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p2) p1), true, (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p2:(AND (NEQ s80 1) (NOT (AND (EQ s1 1) (EQ s4 1) (EQ s7 1) (EQ s10 1) (EQ s13 1) (EQ s16 1) (EQ s19 1) (EQ s22 1) (EQ s25 1) (EQ s28 1) (EQ s31 1) (EQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 399 ms.
Product exploration explored 100000 steps with 50000 reset in 387 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 451 edges and 117 vertex of which 79 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.3 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) p2))), (X p0), true, (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 23 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-36a-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-04 finished in 1247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X((p1||F(G(p2))))))'
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 151 transition count 151
Applied a total of 1 rules in 5 ms. Remains 151 /152 variables (removed 1) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 151 cols
[2024-05-24 12:54:05] [INFO ] Computed 37 invariants in 2 ms
[2024-05-24 12:54:05] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-24 12:54:05] [INFO ] Invariant cache hit.
[2024-05-24 12:54:05] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 12:54:05] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2024-05-24 12:54:05] [INFO ] Invariant cache hit.
[2024-05-24 12:54:05] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/152 places, 151/151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 367 ms. Remains : 151/152 places, 151/151 transitions.
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s56 1) (EQ s146 1) (EQ s150 1)), p1:(EQ s119 1), p2:(EQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-05 finished in 605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G(p1)) U (p2||X((G(p3) U (p2&&G(p3)))))))'
Support contains 6 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 151 transition count 151
Applied a total of 1 rules in 6 ms. Remains 151 /152 variables (removed 1) and now considering 151/151 (removed 0) transitions.
[2024-05-24 12:54:05] [INFO ] Invariant cache hit.
[2024-05-24 12:54:06] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-24 12:54:06] [INFO ] Invariant cache hit.
[2024-05-24 12:54:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 12:54:06] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2024-05-24 12:54:06] [INFO ] Invariant cache hit.
[2024-05-24 12:54:06] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/152 places, 151/151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 355 ms. Remains : 151/152 places, 151/151 transitions.
Stuttering acceptance computed with spot in 345 ms :[(NOT p2), (OR (NOT p3) (NOT p2)), (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p3), (NOT p1), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p3), acceptance={0} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=(AND p2 p3), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p0 (NOT p1) p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0 p1 p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND p2 p1 p3), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p1 p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s71 1), p0:(EQ s148 1), p1:(EQ s91 1), p3:(AND (EQ s12 1) (EQ s146 1) (EQ s150 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-06 finished in 723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(p0&&(!p1 U (p2||G(!p1)))))))'
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Graph (complete) has 486 edges and 152 vertex of which 114 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.2 ms
Discarding 38 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 33 Pre rules applied. Total rules applied 1 place count 114 transition count 117
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 0 with 66 rules applied. Total rules applied 67 place count 81 transition count 117
Applied a total of 67 rules in 13 ms. Remains 81 /152 variables (removed 71) and now considering 117/151 (removed 34) transitions.
// Phase 1: matrix 117 rows 81 cols
[2024-05-24 12:54:06] [INFO ] Computed 1 invariants in 1 ms
[2024-05-24 12:54:06] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-24 12:54:06] [INFO ] Invariant cache hit.
[2024-05-24 12:54:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 12:54:06] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-24 12:54:06] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-24 12:54:06] [INFO ] Invariant cache hit.
[2024-05-24 12:54:06] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/152 places, 117/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 207 ms. Remains : 81/152 places, 117/151 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1)]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(NEQ s58 1), p2:(AND (EQ s41 1) (EQ s77 1) (EQ s80 1) (NOT (AND (EQ s69 1) (EQ s77 1) (EQ s80 1)))), p1:(AND (EQ s69 1) (EQ s77 1) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1544 steps with 6 reset in 11 ms.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-08 finished in 370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X((p0 U (!p1||G(p0))))) U (G((p0&&X((p0 U (!p1||G(p0))))))||(p0&&X((p0 U (!p1||G(p0))))&&G(p2)))))'
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 151 transition count 151
Applied a total of 1 rules in 3 ms. Remains 151 /152 variables (removed 1) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 151 cols
[2024-05-24 12:54:07] [INFO ] Computed 37 invariants in 1 ms
[2024-05-24 12:54:07] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-24 12:54:07] [INFO ] Invariant cache hit.
[2024-05-24 12:54:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 12:54:07] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-05-24 12:54:07] [INFO ] Invariant cache hit.
[2024-05-24 12:54:07] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/152 places, 151/151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 365 ms. Remains : 151/152 places, 151/151 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 4}]], initial=3, aps=[p2:(NEQ s0 1), p0:(NEQ s63 1), p1:(AND (EQ s146 1) (EQ s148 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 136 reset in 352 ms.
Product exploration explored 100000 steps with 138 reset in 392 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 484 edges and 151 vertex of which 114 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.2 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/151 stabilizing places and 1/151 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND p0 p2)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (NOT (AND p0 p2 p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 15 factoid took 634 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 12:54:09] [INFO ] Invariant cache hit.
[2024-05-24 12:54:09] [INFO ] [Real]Absence check using 0 positive and 37 generalized place invariants in 7 ms returned sat
[2024-05-24 12:54:09] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND p0 p2)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (NOT (AND p0 p2 p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND p0 (NOT p2)))), (F (AND p0 p2)), (F (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))), (F (NOT p0)), (F p2), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p1 p2))]
Knowledge based reduction with 16 factoid took 1355 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 220 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 151/151 transitions.
Applied a total of 0 rules in 3 ms. Remains 151 /151 variables (removed 0) and now considering 151/151 (removed 0) transitions.
[2024-05-24 12:54:11] [INFO ] Invariant cache hit.
[2024-05-24 12:54:11] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-24 12:54:11] [INFO ] Invariant cache hit.
[2024-05-24 12:54:11] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 12:54:11] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-05-24 12:54:11] [INFO ] Invariant cache hit.
[2024-05-24 12:54:11] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 396 ms. Remains : 151/151 places, 151/151 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 484 edges and 151 vertex of which 114 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/151 stabilizing places and 1/151 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (AND p0 (NOT p1) p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 p1 p2))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 16 factoid took 682 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Finished random walk after 4227 steps, including 5 resets, run visited all 9 properties in 25 ms. (steps per millisecond=169 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (AND p0 (NOT p1) p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 p1 p2))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p2 (NOT p1))), (F (AND p0 p2)), (F p2), (F (NOT p0)), (F (AND p0 p2 p1)), (F (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 16 factoid took 1047 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 179 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 197 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Product exploration explored 100000 steps with 164 reset in 320 ms.
Product exploration explored 100000 steps with 149 reset in 350 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 177 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 151/151 transitions.
Graph (complete) has 484 edges and 151 vertex of which 114 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.3 ms
Discarding 37 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 35 Pre rules applied. Total rules applied 1 place count 114 transition count 185
Deduced a syphon composed of 35 places in 1 ms
Iterating global reduction 0 with 35 rules applied. Total rules applied 36 place count 114 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 114 transition count 185
Deduced a syphon composed of 36 places in 1 ms
Applied a total of 37 rules in 23 ms. Remains 114 /151 variables (removed 37) and now considering 185/151 (removed -34) transitions.
[2024-05-24 12:54:15] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 185 rows 114 cols
[2024-05-24 12:54:15] [INFO ] Computed 1 invariants in 2 ms
[2024-05-24 12:54:15] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/151 places, 185/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 114/151 places, 185/151 transitions.
Built C files in :
/tmp/ltsmin14872438236649325034
[2024-05-24 12:54:15] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14872438236649325034
Running compilation step : cd /tmp/ltsmin14872438236649325034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 363 ms.
Running link step : cd /tmp/ltsmin14872438236649325034;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin14872438236649325034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15570806685362604113.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 151/151 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 151 cols
[2024-05-24 12:54:30] [INFO ] Computed 37 invariants in 1 ms
[2024-05-24 12:54:30] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-24 12:54:30] [INFO ] Invariant cache hit.
[2024-05-24 12:54:30] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 12:54:30] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2024-05-24 12:54:30] [INFO ] Invariant cache hit.
[2024-05-24 12:54:30] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 370 ms. Remains : 151/151 places, 151/151 transitions.
Built C files in :
/tmp/ltsmin13392537889028692423
[2024-05-24 12:54:30] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13392537889028692423
Running compilation step : cd /tmp/ltsmin13392537889028692423;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 261 ms.
Running link step : cd /tmp/ltsmin13392537889028692423;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13392537889028692423;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8434835213169587279.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 12:54:45] [INFO ] Flatten gal took : 12 ms
[2024-05-24 12:54:45] [INFO ] Flatten gal took : 11 ms
[2024-05-24 12:54:45] [INFO ] Time to serialize gal into /tmp/LTL5312993450041793922.gal : 3 ms
[2024-05-24 12:54:46] [INFO ] Time to serialize properties into /tmp/LTL17335564940644918551.prop : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5312993450041793922.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16285522591615411223.hoa' '-atoms' '/tmp/LTL17335564940644918551.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17335564940644918551.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16285522591615411223.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t77, Intersection with reachable at each step enabled. (destroyed/reverse/inters...178
Computing Next relation with stutter on 6.87195e+10 deadlock states
Detected timeout of ITS tools.
[2024-05-24 12:55:01] [INFO ] Flatten gal took : 10 ms
[2024-05-24 12:55:01] [INFO ] Flatten gal took : 10 ms
[2024-05-24 12:55:01] [INFO ] Time to serialize gal into /tmp/LTL14737846154800458897.gal : 2 ms
[2024-05-24 12:55:01] [INFO ] Time to serialize properties into /tmp/LTL3241376364569449580.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14737846154800458897.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3241376364569449580.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((("(p63==0)")&&(X(("(p63==0)")U((!("((p147==1)&&(p149==1))"))||(G("(p63==0)"))))))U((G(("(p63==0)")&&(X(("(p63==0)")U((!("((p147==1...298
Formula 0 simplified : (!"(p63==0)" | X(!"(p63==0)" M "((p147==1)&&(p149==1))")) M (!"(p63==0)" | F!"(p0==0)" | X(!"(p63==0)" M "((p147==1)&&(p149==1))"))
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t77, Intersection with reachable at each step enabled. (destroyed/reverse/inters...178
Computing Next relation with stutter on 6.87195e+10 deadlock states
Detected timeout of ITS tools.
[2024-05-24 12:55:16] [INFO ] Flatten gal took : 14 ms
[2024-05-24 12:55:16] [INFO ] Applying decomposition
[2024-05-24 12:55:16] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12653174380884225069.txt' '-o' '/tmp/graph12653174380884225069.bin' '-w' '/tmp/graph12653174380884225069.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12653174380884225069.bin' '-l' '-1' '-v' '-w' '/tmp/graph12653174380884225069.weights' '-q' '0' '-e' '0.001'
[2024-05-24 12:55:16] [INFO ] Decomposing Gal with order
[2024-05-24 12:55:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 12:55:16] [INFO ] Removed a total of 57 redundant transitions.
[2024-05-24 12:55:16] [INFO ] Flatten gal took : 43 ms
[2024-05-24 12:55:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-24 12:55:16] [INFO ] Time to serialize gal into /tmp/LTL3156578155967369806.gal : 3 ms
[2024-05-24 12:55:16] [INFO ] Time to serialize properties into /tmp/LTL7178916534523527503.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3156578155967369806.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7178916534523527503.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((("(u15.p63==0)")&&(X(("(u15.p63==0)")U((!("((u36.p147==1)&&(u36.p149==1))"))||(G("(u15.p63==0)"))))))U((G(("(u15.p63==0)")&&(X(("(...361
Formula 0 simplified : (!"(u15.p63==0)" | X(!"(u15.p63==0)" M "((u36.p147==1)&&(u36.p149==1))")) M (!"(u15.p63==0)" | F!"(u7.p0==0)" | X(!"(u15.p63==0)" M ...189
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10300392409307570789
[2024-05-24 12:55:31] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10300392409307570789
Running compilation step : cd /tmp/ltsmin10300392409307570789;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 257 ms.
Running link step : cd /tmp/ltsmin10300392409307570789;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10300392409307570789;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true)&&X(((LTLAPp0==true) U (!(LTLAPp1==true)||[]((LTLAPp0==true)))))) U ([](((LTLAPp0==true)&&X(((LTLAPp0==true) U (!(LTLAPp1==true)||[]((LTLAPp0==true)))))))||((LTLAPp0==true)&&X(((LTLAPp0==true) U (!(LTLAPp1==true)||[]((LTLAPp0==true)))))&&[]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-09 finished in 99412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p1)&&p0))||X(p1)))'
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 151 transition count 151
Applied a total of 1 rules in 2 ms. Remains 151 /152 variables (removed 1) and now considering 151/151 (removed 0) transitions.
[2024-05-24 12:55:46] [INFO ] Invariant cache hit.
[2024-05-24 12:55:46] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-24 12:55:46] [INFO ] Invariant cache hit.
[2024-05-24 12:55:46] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 12:55:46] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2024-05-24 12:55:46] [INFO ] Invariant cache hit.
[2024-05-24 12:55:46] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/152 places, 151/151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 362 ms. Remains : 151/152 places, 151/151 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s27 1), p0:(AND (EQ s27 1) (EQ s126 1) (EQ s146 1) (EQ s150 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-10 finished in 662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G((p0||G(p1)))))))'
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Graph (complete) has 486 edges and 152 vertex of which 114 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.2 ms
Discarding 38 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 35 Pre rules applied. Total rules applied 1 place count 114 transition count 115
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 71 place count 79 transition count 115
Applied a total of 71 rules in 13 ms. Remains 79 /152 variables (removed 73) and now considering 115/151 (removed 36) transitions.
// Phase 1: matrix 115 rows 79 cols
[2024-05-24 12:55:47] [INFO ] Computed 1 invariants in 1 ms
[2024-05-24 12:55:47] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 12:55:47] [INFO ] Invariant cache hit.
[2024-05-24 12:55:47] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 12:55:47] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-24 12:55:47] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 12:55:47] [INFO ] Invariant cache hit.
[2024-05-24 12:55:47] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/152 places, 115/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 212 ms. Remains : 79/152 places, 115/151 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(OR p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s59 1), p1:(OR (NEQ s52 1) (NEQ s75 1) (NEQ s78 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1230 steps with 1 reset in 5 ms.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-11 finished in 391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 38 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 36 Pre rules applied. Total rules applied 0 place count 151 transition count 114
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 72 place count 115 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 114 transition count 113
Applied a total of 74 rules in 9 ms. Remains 114 /152 variables (removed 38) and now considering 113/151 (removed 38) transitions.
// Phase 1: matrix 113 rows 114 cols
[2024-05-24 12:55:47] [INFO ] Computed 38 invariants in 1 ms
[2024-05-24 12:55:47] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-24 12:55:47] [INFO ] Invariant cache hit.
[2024-05-24 12:55:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:55:47] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-05-24 12:55:47] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 12:55:47] [INFO ] Invariant cache hit.
[2024-05-24 12:55:47] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/152 places, 113/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 386 ms. Remains : 114/152 places, 113/151 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s3 0) (EQ s6 0) (EQ s9 0) (EQ s12 0) (EQ s15 0) (EQ s18 0) (EQ s21 0) (EQ s24 0) (EQ s27 0) (EQ s30 0) (EQ s33 0) (EQ s36 0) (EQ s39 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 304 reset in 341 ms.
Product exploration explored 100000 steps with 318 reset in 380 ms.
Computed a total of 0 stabilizing places and 1 stable transitions
Graph (complete) has 411 edges and 114 vertex of which 76 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 81 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1525048 steps, run timeout after 3001 ms. (steps per millisecond=508 ) properties seen :{}
Probabilistic random walk after 1525048 steps, saw 842863 distinct states, run finished after 3001 ms. (steps per millisecond=508 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 12:55:51] [INFO ] Invariant cache hit.
[2024-05-24 12:55:52] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 7 ms returned sat
[2024-05-24 12:55:52] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 12:55:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:55:52] [INFO ] After 34ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-24 12:55:52] [INFO ] After 62ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-24 12:55:52] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 249 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=124 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 38 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 113/113 transitions.
Applied a total of 0 rules in 4 ms. Remains 114 /114 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-05-24 12:55:52] [INFO ] Invariant cache hit.
[2024-05-24 12:55:52] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-24 12:55:52] [INFO ] Invariant cache hit.
[2024-05-24 12:55:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:55:52] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-05-24 12:55:52] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 12:55:52] [INFO ] Invariant cache hit.
[2024-05-24 12:55:53] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 538 ms. Remains : 114/114 places, 113/113 transitions.
Computed a total of 0 stabilizing places and 1 stable transitions
Graph (complete) has 411 edges and 114 vertex of which 76 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1613102 steps, run timeout after 3003 ms. (steps per millisecond=537 ) properties seen :{}
Probabilistic random walk after 1613102 steps, saw 890853 distinct states, run finished after 3003 ms. (steps per millisecond=537 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 12:55:56] [INFO ] Invariant cache hit.
[2024-05-24 12:55:56] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 31 ms returned sat
[2024-05-24 12:55:56] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 12:55:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:55:56] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-24 12:55:56] [INFO ] After 36ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-24 12:55:56] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 38 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 113/113 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 114 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 113 transition count 111
Applied a total of 3 rules in 17 ms. Remains 113 /114 variables (removed 1) and now considering 111/113 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 113/114 places, 111/113 transitions.
Incomplete random walk after 10000 steps, including 365 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 44445 steps, run visited all 1 properties in 112 ms. (steps per millisecond=396 )
Probabilistic random walk after 44445 steps, saw 41081 distinct states, run finished after 112 ms. (steps per millisecond=396 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 204 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 319 reset in 379 ms.
Product exploration explored 100000 steps with 340 reset in 335 ms.
Built C files in :
/tmp/ltsmin17077253901120759383
[2024-05-24 12:55:58] [INFO ] Computing symmetric may disable matrix : 113 transitions.
[2024-05-24 12:55:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:55:58] [INFO ] Computing symmetric may enable matrix : 113 transitions.
[2024-05-24 12:55:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:55:58] [INFO ] Computing Do-Not-Accords matrix : 113 transitions.
[2024-05-24 12:55:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:55:58] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17077253901120759383
Running compilation step : cd /tmp/ltsmin17077253901120759383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 248 ms.
Running link step : cd /tmp/ltsmin17077253901120759383;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin17077253901120759383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11077203151527481516.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 38 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 113/113 transitions.
Applied a total of 0 rules in 9 ms. Remains 114 /114 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-05-24 12:56:13] [INFO ] Invariant cache hit.
[2024-05-24 12:56:13] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-24 12:56:13] [INFO ] Invariant cache hit.
[2024-05-24 12:56:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:56:13] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2024-05-24 12:56:13] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 12:56:13] [INFO ] Invariant cache hit.
[2024-05-24 12:56:13] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 355 ms. Remains : 114/114 places, 113/113 transitions.
Built C files in :
/tmp/ltsmin18195379842048317980
[2024-05-24 12:56:13] [INFO ] Computing symmetric may disable matrix : 113 transitions.
[2024-05-24 12:56:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:56:13] [INFO ] Computing symmetric may enable matrix : 113 transitions.
[2024-05-24 12:56:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:56:13] [INFO ] Computing Do-Not-Accords matrix : 113 transitions.
[2024-05-24 12:56:13] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:56:13] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18195379842048317980
Running compilation step : cd /tmp/ltsmin18195379842048317980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 272 ms.
Running link step : cd /tmp/ltsmin18195379842048317980;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin18195379842048317980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15035795229578251897.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 12:56:28] [INFO ] Flatten gal took : 12 ms
[2024-05-24 12:56:28] [INFO ] Flatten gal took : 7 ms
[2024-05-24 12:56:28] [INFO ] Time to serialize gal into /tmp/LTL15975448357574218493.gal : 1 ms
[2024-05-24 12:56:28] [INFO ] Time to serialize properties into /tmp/LTL3581727635259766906.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15975448357574218493.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10774025659459307732.hoa' '-atoms' '/tmp/LTL3581727635259766906.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3581727635259766906.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10774025659459307732.hoa
Detected timeout of ITS tools.
[2024-05-24 12:56:43] [INFO ] Flatten gal took : 9 ms
[2024-05-24 12:56:43] [INFO ] Flatten gal took : 7 ms
[2024-05-24 12:56:43] [INFO ] Time to serialize gal into /tmp/LTL5416950170076964010.gal : 1 ms
[2024-05-24 12:56:43] [INFO ] Time to serialize properties into /tmp/LTL3038786041826567671.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5416950170076964010.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3038786041826567671.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((p1==0)||(p5==0))||((p9==0)||(p13==0)))||(((p17==0)||(p21==0))||((p25==0)||(p29==0))))||((((p33==0)||(p37==0))||((p41==0...496
Formula 0 simplified : FG!"(((((((p1==0)||(p5==0))||((p9==0)||(p13==0)))||(((p17==0)||(p21==0))||((p25==0)||(p29==0))))||((((p33==0)||(p37==0))||((p41==0)|...490
Detected timeout of ITS tools.
[2024-05-24 12:56:58] [INFO ] Flatten gal took : 7 ms
[2024-05-24 12:56:58] [INFO ] Applying decomposition
[2024-05-24 12:56:58] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph555108717934038670.txt' '-o' '/tmp/graph555108717934038670.bin' '-w' '/tmp/graph555108717934038670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph555108717934038670.bin' '-l' '-1' '-v' '-w' '/tmp/graph555108717934038670.weights' '-q' '0' '-e' '0.001'
[2024-05-24 12:56:58] [INFO ] Decomposing Gal with order
[2024-05-24 12:56:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 12:56:58] [INFO ] Removed a total of 140 redundant transitions.
[2024-05-24 12:56:58] [INFO ] Flatten gal took : 15 ms
[2024-05-24 12:56:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-24 12:56:58] [INFO ] Time to serialize gal into /tmp/LTL1451094618522723945.gal : 2 ms
[2024-05-24 12:56:58] [INFO ] Time to serialize properties into /tmp/LTL16215741121801081705.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1451094618522723945.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16215741121801081705.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((u0.p1==0)||(u1.p5==0))||((u2.p9==0)||(u3.p13==0)))||(((u4.p17==0)||(u5.p21==0))||((u6.p25==0)||(u7.p29==0))))||((((u8.p...646
Formula 0 simplified : FG!"(((((((u0.p1==0)||(u1.p5==0))||((u2.p9==0)||(u3.p13==0)))||(((u4.p17==0)||(u5.p21==0))||((u6.p25==0)||(u7.p29==0))))||((((u8.p33...640
Reverse transition relation is NOT exact ! Due to transitions t77, i36.u36.t4, i36.u37.t2, Intersection with reachable at each step enabled. (destroyed/re...190
Computing Next relation with stutter on 6.87195e+10 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
12 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.154029,21096,1,0,11853,130,1538,11966,79,148,26485
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-13 finished in 71481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 151 transition count 151
Applied a total of 1 rules in 3 ms. Remains 151 /152 variables (removed 1) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 151 cols
[2024-05-24 12:56:59] [INFO ] Computed 37 invariants in 2 ms
[2024-05-24 12:56:59] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-24 12:56:59] [INFO ] Invariant cache hit.
[2024-05-24 12:56:59] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 12:56:59] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-05-24 12:56:59] [INFO ] Invariant cache hit.
[2024-05-24 12:56:59] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/152 places, 151/151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 395 ms. Remains : 151/152 places, 151/151 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s35 1), p1:(EQ s46 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]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-14 finished in 536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U (F(!p2)&&p1)) U (p3||G(!p3))))'
Support contains 6 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Graph (complete) has 486 edges and 152 vertex of which 114 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.2 ms
Discarding 38 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 33 Pre rules applied. Total rules applied 1 place count 114 transition count 117
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 0 with 66 rules applied. Total rules applied 67 place count 81 transition count 117
Applied a total of 67 rules in 18 ms. Remains 81 /152 variables (removed 71) and now considering 117/151 (removed 34) transitions.
// Phase 1: matrix 117 rows 81 cols
[2024-05-24 12:56:59] [INFO ] Computed 1 invariants in 2 ms
[2024-05-24 12:56:59] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-24 12:56:59] [INFO ] Invariant cache hit.
[2024-05-24 12:56:59] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 12:56:59] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-24 12:56:59] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 12:56:59] [INFO ] Invariant cache hit.
[2024-05-24 12:56:59] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/152 places, 117/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 212 ms. Remains : 81/152 places, 117/151 transitions.
Stuttering acceptance computed with spot in 308 ms :[false, (AND (NOT p0) p3), (OR (AND (NOT p1) p3) (AND p2 p3)), (AND p2 p3), (NOT p0), (OR (NOT p1) p2), p2]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p1 p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p3 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p3 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p3 p1 p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p3 p2), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p2), acceptance={} source=5 dest: 6}], [{ cond=p2, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(EQ s69 1), p1:(AND (EQ s22 1) (EQ s77 1) (EQ s80 1)), p0:(AND (EQ s32 1) (EQ s77 1) (EQ s80 1)), p2:(AND (EQ s17 1) (EQ s77 1) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1060 steps with 398 reset in 10 ms.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-15 finished in 557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X((p0 U (!p1||G(p0))))) U (G((p0&&X((p0 U (!p1||G(p0))))))||(p0&&X((p0 U (!p1||G(p0))))&&G(p2)))))'
Found a Shortening insensitive property : GPUForwardProgress-PT-36a-LTLFireability-09
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Graph (complete) has 486 edges and 152 vertex of which 114 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.2 ms
Discarding 38 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 35 Pre rules applied. Total rules applied 1 place count 114 transition count 115
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 71 place count 79 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 73 place count 78 transition count 114
Applied a total of 73 rules in 13 ms. Remains 78 /152 variables (removed 74) and now considering 114/151 (removed 37) transitions.
// Phase 1: matrix 114 rows 78 cols
[2024-05-24 12:57:00] [INFO ] Computed 1 invariants in 2 ms
[2024-05-24 12:57:00] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-24 12:57:00] [INFO ] Invariant cache hit.
[2024-05-24 12:57:00] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-24 12:57:00] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-05-24 12:57:00] [INFO ] Invariant cache hit.
[2024-05-24 12:57:00] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 78/152 places, 114/151 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 235 ms. Remains : 78/152 places, 114/151 transitions.
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 4}]], initial=3, aps=[p2:(NEQ s0 1), p0:(NEQ s32 1), p1:(AND (EQ s75 1) (EQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 320 reset in 317 ms.
Product exploration explored 100000 steps with 323 reset in 338 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/78 stabilizing places and 1/114 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND p0 p2)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (NOT (AND p0 p2 p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 15 factoid took 646 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Incomplete random walk after 10000 steps, including 54 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 12:57:02] [INFO ] Invariant cache hit.
[2024-05-24 12:57:02] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 12:57:02] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND p0 p2)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (NOT (AND p0 p2 p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND p0 (NOT p2)))), (F (AND p0 p2)), (F (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))), (F (NOT p0)), (F p2), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p1 p2))]
Knowledge based reduction with 16 factoid took 1242 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 161 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-24 12:57:03] [INFO ] Invariant cache hit.
[2024-05-24 12:57:03] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-24 12:57:03] [INFO ] Invariant cache hit.
[2024-05-24 12:57:03] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-24 12:57:04] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-05-24 12:57:04] [INFO ] Invariant cache hit.
[2024-05-24 12:57:04] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214 ms. Remains : 78/78 places, 114/114 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/78 stabilizing places and 1/114 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (AND p0 (NOT p1) p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 p1 p2))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 16 factoid took 528 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Finished random walk after 1707 steps, including 1 resets, run visited all 9 properties in 15 ms. (steps per millisecond=113 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (AND p0 (NOT p1) p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 p1 p2))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p2 (NOT p1))), (F (AND p0 p2)), (F p2), (F (NOT p0)), (F (AND p0 p2 p1)), (F (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 16 factoid took 1016 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 159 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 153 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Product exploration explored 100000 steps with 301 reset in 316 ms.
Product exploration explored 100000 steps with 314 reset in 335 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 172 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 114/114 transitions.
Applied a total of 0 rules in 7 ms. Remains 78 /78 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-24 12:57:07] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 12:57:07] [INFO ] Invariant cache hit.
[2024-05-24 12:57:07] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 78/78 places, 114/114 transitions.
Built C files in :
/tmp/ltsmin15514607425358132495
[2024-05-24 12:57:07] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15514607425358132495
Running compilation step : cd /tmp/ltsmin15514607425358132495;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 208 ms.
Running link step : cd /tmp/ltsmin15514607425358132495;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15514607425358132495;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6699492741786006801.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-24 12:57:22] [INFO ] Invariant cache hit.
[2024-05-24 12:57:22] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-24 12:57:22] [INFO ] Invariant cache hit.
[2024-05-24 12:57:22] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-24 12:57:22] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-24 12:57:22] [INFO ] Invariant cache hit.
[2024-05-24 12:57:22] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 208 ms. Remains : 78/78 places, 114/114 transitions.
Built C files in :
/tmp/ltsmin18047629203930009743
[2024-05-24 12:57:22] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18047629203930009743
Running compilation step : cd /tmp/ltsmin18047629203930009743;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 196 ms.
Running link step : cd /tmp/ltsmin18047629203930009743;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin18047629203930009743;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3693181886250487891.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 12:57:37] [INFO ] Flatten gal took : 6 ms
[2024-05-24 12:57:37] [INFO ] Flatten gal took : 6 ms
[2024-05-24 12:57:37] [INFO ] Time to serialize gal into /tmp/LTL9830517707599945835.gal : 1 ms
[2024-05-24 12:57:37] [INFO ] Time to serialize properties into /tmp/LTL5145194704061158703.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9830517707599945835.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15850985098753826086.hoa' '-atoms' '/tmp/LTL5145194704061158703.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5145194704061158703.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15850985098753826086.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t78, t104, t76.t96, t74.t97, t72.t95, t70.t98, t68.t94, t66.t99, t64.t93, t62.t100, t...507
Computing Next relation with stutter on 6.87195e+10 deadlock states
5 unique states visited
0 strongly connected components in search stack
8 transitions explored
5 items max in DFS search stack
666 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.69129,155728,1,0,815,1.12579e+06,289,984,3298,531416,1738
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-09 finished in 45286 ms.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-09 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2024-05-24 12:57:45] [INFO ] Flatten gal took : 14 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 225994 ms.

BK_STOP 1716555466652

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="GPUForwardProgress-PT-36a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is GPUForwardProgress-PT-36a, 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 r197-tall-171640625500373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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