Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.6K Feb 25 14:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 14:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 14:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 14:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 14:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 14:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 160K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678573202254

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-32b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 22:20:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 22:20:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 22:20:05] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2023-03-11 22:20:05] [INFO ] Transformed 644 places.
[2023-03-11 22:20:05] [INFO ] Transformed 677 transitions.
[2023-03-11 22:20:05] [INFO ] Found NUPN structural information;
[2023-03-11 22:20:05] [INFO ] Parsed PT model containing 644 places and 677 transitions and 1677 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 75 out of 644 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 644/644 places, 677/677 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 579 transition count 612
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 579 transition count 612
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 157 place count 552 transition count 585
Iterating global reduction 0 with 27 rules applied. Total rules applied 184 place count 552 transition count 585
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 209 place count 552 transition count 560
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 210 place count 551 transition count 559
Iterating global reduction 1 with 1 rules applied. Total rules applied 211 place count 551 transition count 559
Applied a total of 211 rules in 222 ms. Remains 551 /644 variables (removed 93) and now considering 559/677 (removed 118) transitions.
// Phase 1: matrix 559 rows 551 cols
[2023-03-11 22:20:06] [INFO ] Computed 34 place invariants in 27 ms
[2023-03-11 22:20:06] [INFO ] Implicit Places using invariants in 611 ms returned []
[2023-03-11 22:20:06] [INFO ] Invariant cache hit.
[2023-03-11 22:20:07] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 1334 ms to find 0 implicit places.
[2023-03-11 22:20:07] [INFO ] Invariant cache hit.
[2023-03-11 22:20:07] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 551/644 places, 559/677 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2038 ms. Remains : 551/644 places, 559/677 transitions.
Support contains 75 out of 551 places after structural reductions.
[2023-03-11 22:20:08] [INFO ] Flatten gal took : 111 ms
[2023-03-11 22:20:08] [INFO ] Flatten gal took : 49 ms
[2023-03-11 22:20:08] [INFO ] Input system was already deterministic with 559 transitions.
Support contains 74 out of 551 places (down from 75) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 879 ms. (steps per millisecond=11 ) properties (out of 35) seen :23
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :2
Running SMT prover for 9 properties.
[2023-03-11 22:20:09] [INFO ] Invariant cache hit.
[2023-03-11 22:20:10] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 47 ms returned sat
[2023-03-11 22:20:10] [INFO ] After 476ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 22:20:10] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 73 ms returned sat
[2023-03-11 22:20:11] [INFO ] After 569ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-11 22:20:11] [INFO ] After 1068ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 307 ms.
[2023-03-11 22:20:12] [INFO ] After 1872ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 5 properties in 238 ms.
Support contains 38 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 559/559 transitions.
Graph (trivial) has 454 edges and 551 vertex of which 6 / 551 are part of one of the 1 SCC in 10 ms
Free SCC test removed 5 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 268 transitions
Trivial Post-agglo rules discarded 268 transitions
Performed 268 trivial Post agglomeration. Transition count delta: 268
Iterating post reduction 0 with 268 rules applied. Total rules applied 269 place count 546 transition count 284
Reduce places removed 268 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 277 rules applied. Total rules applied 546 place count 278 transition count 275
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 549 place count 275 transition count 275
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 549 place count 275 transition count 211
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 677 place count 211 transition count 211
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 679 place count 209 transition count 209
Iterating global reduction 3 with 2 rules applied. Total rules applied 681 place count 209 transition count 209
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 681 place count 209 transition count 207
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 685 place count 207 transition count 207
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 871 place count 114 transition count 114
Drop transitions removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 900 place count 114 transition count 85
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 904 place count 112 transition count 85
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 905 place count 112 transition count 84
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 907 place count 112 transition count 82
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 909 place count 112 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 911 place count 110 transition count 80
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 912 place count 110 transition count 80
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 913 place count 110 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 914 place count 109 transition count 78
Applied a total of 914 rules in 147 ms. Remains 109 /551 variables (removed 442) and now considering 78/559 (removed 481) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 109/551 places, 78/559 transitions.
Incomplete random walk after 10000 steps, including 677 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 362 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 78 rows 109 cols
[2023-03-11 22:20:12] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-11 22:20:12] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 12 ms returned sat
[2023-03-11 22:20:12] [INFO ] After 61ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 22:20:12] [INFO ] After 88ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-11 22:20:12] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 34 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 78/78 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 109 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 108 transition count 77
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 108 transition count 74
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 105 transition count 74
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 102 transition count 71
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 102 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 101 transition count 67
Applied a total of 18 rules in 22 ms. Remains 101 /109 variables (removed 8) and now considering 67/78 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 101/109 places, 67/78 transitions.
Incomplete random walk after 10000 steps, including 684 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 142 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1741 steps, run visited all 1 properties in 18 ms. (steps per millisecond=96 )
Probabilistic random walk after 1741 steps, saw 1617 distinct states, run finished after 18 ms. (steps per millisecond=96 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 101 stabilizing places and 101 stable transitions
Graph (complete) has 858 edges and 551 vertex of which 514 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.21 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U G((p2&&X(p3)))))'
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 559/559 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 550 transition count 559
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 541 transition count 550
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 541 transition count 550
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 541 transition count 547
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 536 transition count 542
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 536 transition count 542
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 536 transition count 538
Applied a total of 36 rules in 91 ms. Remains 536 /551 variables (removed 15) and now considering 538/559 (removed 21) transitions.
// Phase 1: matrix 538 rows 536 cols
[2023-03-11 22:20:13] [INFO ] Computed 33 place invariants in 5 ms
[2023-03-11 22:20:13] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-11 22:20:13] [INFO ] Invariant cache hit.
[2023-03-11 22:20:14] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
[2023-03-11 22:20:14] [INFO ] Invariant cache hit.
[2023-03-11 22:20:14] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 536/551 places, 538/559 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1355 ms. Remains : 536/551 places, 538/559 transitions.
Stuttering acceptance computed with spot in 524 ms :[(OR (NOT p3) (NOT p2)), true, (NOT p1), (OR (NOT p3) (NOT p2)), (AND (NOT p1) p2 (NOT p3)), (NOT p3)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 4}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={0} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p2 p3), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={} source=4 dest: 2}], [{ cond=(OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={} source=5 dest: 0}, { cond=(OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) p0 (NOT p3))), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(NEQ s369 1), p1:(EQ s41 1), p0:(EQ s463 1), p3:(NEQ s446 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10302 steps with 38 reset in 165 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-00 finished in 2138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F((p1||X(X(p2)))))))'
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 551/551 places, 559/559 transitions.
Graph (trivial) has 453 edges and 551 vertex of which 6 / 551 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 852 edges and 546 vertex of which 509 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.3 ms
Discarding 37 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 266 rules applied. Total rules applied 268 place count 508 transition count 283
Reduce places removed 266 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 278 rules applied. Total rules applied 546 place count 242 transition count 271
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 551 place count 238 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 552 place count 237 transition count 270
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 65 Pre rules applied. Total rules applied 552 place count 237 transition count 205
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 682 place count 172 transition count 205
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 714 place count 140 transition count 173
Iterating global reduction 4 with 32 rules applied. Total rules applied 746 place count 140 transition count 173
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 746 place count 140 transition count 172
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 748 place count 139 transition count 172
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 940 place count 43 transition count 76
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 968 place count 15 transition count 20
Iterating global reduction 4 with 28 rules applied. Total rules applied 996 place count 15 transition count 20
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 997 place count 15 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 998 place count 14 transition count 19
Applied a total of 998 rules in 55 ms. Remains 14 /551 variables (removed 537) and now considering 19/559 (removed 540) transitions.
[2023-03-11 22:20:15] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
// Phase 1: matrix 18 rows 14 cols
[2023-03-11 22:20:15] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 22:20:15] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-11 22:20:15] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2023-03-11 22:20:15] [INFO ] Invariant cache hit.
[2023-03-11 22:20:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 22:20:15] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-11 22:20:15] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-11 22:20:15] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2023-03-11 22:20:15] [INFO ] Invariant cache hit.
[2023-03-11 22:20:15] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/551 places, 19/559 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 14/551 places, 19/559 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s4 0), p1:(EQ s6 1), p2:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-02 finished in 357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 551/551 places, 559/559 transitions.
Graph (trivial) has 453 edges and 551 vertex of which 6 / 551 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 852 edges and 546 vertex of which 509 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.3 ms
Discarding 37 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 268 transitions
Trivial Post-agglo rules discarded 268 transitions
Performed 268 trivial Post agglomeration. Transition count delta: 268
Iterating post reduction 0 with 268 rules applied. Total rules applied 270 place count 508 transition count 281
Reduce places removed 268 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 279 rules applied. Total rules applied 549 place count 240 transition count 270
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 553 place count 236 transition count 270
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 553 place count 236 transition count 207
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 679 place count 173 transition count 207
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 711 place count 141 transition count 175
Iterating global reduction 3 with 32 rules applied. Total rules applied 743 place count 141 transition count 175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 743 place count 141 transition count 174
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 745 place count 140 transition count 174
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 937 place count 44 transition count 78
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 967 place count 14 transition count 18
Iterating global reduction 3 with 30 rules applied. Total rules applied 997 place count 14 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 999 place count 13 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1000 place count 12 transition count 17
Applied a total of 1000 rules in 45 ms. Remains 12 /551 variables (removed 539) and now considering 17/559 (removed 542) transitions.
[2023-03-11 22:20:15] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 12 cols
[2023-03-11 22:20:15] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 22:20:15] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 22:20:15] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2023-03-11 22:20:15] [INFO ] Invariant cache hit.
[2023-03-11 22:20:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 22:20:16] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-11 22:20:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 22:20:16] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2023-03-11 22:20:16] [INFO ] Invariant cache hit.
[2023-03-11 22:20:16] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/551 places, 17/559 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 12/551 places, 17/559 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s10 0) (EQ s2 0)), p1:(EQ s6 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 18 steps with 1 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-03 finished in 238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(X(p1))) U G((p2 U !p0))))'
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 559/559 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 550 transition count 559
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 542 transition count 551
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 542 transition count 551
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 542 transition count 548
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 24 place count 538 transition count 544
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 538 transition count 544
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 31 place count 538 transition count 541
Applied a total of 31 rules in 77 ms. Remains 538 /551 variables (removed 13) and now considering 541/559 (removed 18) transitions.
// Phase 1: matrix 541 rows 538 cols
[2023-03-11 22:20:16] [INFO ] Computed 33 place invariants in 5 ms
[2023-03-11 22:20:16] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-11 22:20:16] [INFO ] Invariant cache hit.
[2023-03-11 22:20:16] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2023-03-11 22:20:16] [INFO ] Invariant cache hit.
[2023-03-11 22:20:17] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/551 places, 541/559 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1234 ms. Remains : 538/551 places, 541/559 transitions.
Stuttering acceptance computed with spot in 521 ms :[p0, (NOT p1), p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (NOT p1), true, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=0 dest: 4}, { cond=(AND p0 p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(OR (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 7}, { cond=(AND p0 p2), acceptance={} source=2 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p0 p2), acceptance={} source=3 dest: 9}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(OR (NOT p0) p2), acceptance={} source=5 dest: 10}], [{ cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p0 p2), acceptance={0} source=8 dest: 8}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=9 dest: 8}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=10 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=10 dest: 7}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=10 dest: 8}]], initial=0, aps=[p0:(NEQ s150 1), p2:(EQ s334 1), p1:(EQ s403 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-04 finished in 1781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U p1))||G(p2))))'
Support contains 5 out of 551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 551/551 places, 559/559 transitions.
Graph (trivial) has 450 edges and 551 vertex of which 6 / 551 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 852 edges and 546 vertex of which 509 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.4 ms
Discarding 37 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 265 transitions
Trivial Post-agglo rules discarded 265 transitions
Performed 265 trivial Post agglomeration. Transition count delta: 265
Iterating post reduction 0 with 265 rules applied. Total rules applied 267 place count 508 transition count 284
Reduce places removed 265 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 275 rules applied. Total rules applied 542 place count 243 transition count 274
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 545 place count 240 transition count 274
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 545 place count 240 transition count 207
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 679 place count 173 transition count 207
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 711 place count 141 transition count 175
Iterating global reduction 3 with 32 rules applied. Total rules applied 743 place count 141 transition count 175
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 931 place count 47 transition count 81
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 960 place count 18 transition count 23
Iterating global reduction 3 with 29 rules applied. Total rules applied 989 place count 18 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 993 place count 16 transition count 23
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 995 place count 16 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 996 place count 15 transition count 22
Applied a total of 996 rules in 62 ms. Remains 15 /551 variables (removed 536) and now considering 22/559 (removed 537) transitions.
[2023-03-11 22:20:17] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 15 cols
[2023-03-11 22:20:17] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 22:20:18] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 22:20:18] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
[2023-03-11 22:20:18] [INFO ] Invariant cache hit.
[2023-03-11 22:20:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 22:20:18] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-11 22:20:18] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-11 22:20:18] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
[2023-03-11 22:20:18] [INFO ] Invariant cache hit.
[2023-03-11 22:20:18] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/551 places, 22/559 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 15/551 places, 22/559 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(OR (NEQ s6 1) (NEQ s12 1) (NEQ s14 1)), p1:(EQ s3 1), p0:(AND (EQ s9 1) (EQ s3 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6911 reset in 370 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-05 finished in 652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1))) U p2))'
Support contains 36 out of 551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 551/551 places, 559/559 transitions.
Graph (trivial) has 456 edges and 551 vertex of which 6 / 551 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 269 transitions
Trivial Post-agglo rules discarded 269 transitions
Performed 269 trivial Post agglomeration. Transition count delta: 269
Iterating post reduction 0 with 269 rules applied. Total rules applied 270 place count 545 transition count 283
Reduce places removed 269 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 281 rules applied. Total rules applied 551 place count 276 transition count 271
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 555 place count 272 transition count 271
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 555 place count 272 transition count 205
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 687 place count 206 transition count 205
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 881 place count 109 transition count 108
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 882 place count 109 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 883 place count 108 transition count 107
Applied a total of 883 rules in 38 ms. Remains 108 /551 variables (removed 443) and now considering 107/559 (removed 452) transitions.
[2023-03-11 22:20:18] [INFO ] Flow matrix only has 76 transitions (discarded 31 similar events)
// Phase 1: matrix 76 rows 108 cols
[2023-03-11 22:20:18] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-11 22:20:18] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-11 22:20:18] [INFO ] Flow matrix only has 76 transitions (discarded 31 similar events)
[2023-03-11 22:20:18] [INFO ] Invariant cache hit.
[2023-03-11 22:20:18] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-11 22:20:18] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2023-03-11 22:20:18] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 22:20:18] [INFO ] Flow matrix only has 76 transitions (discarded 31 similar events)
[2023-03-11 22:20:18] [INFO ] Invariant cache hit.
[2023-03-11 22:20:18] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/551 places, 107/559 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 417 ms. Remains : 108/551 places, 107/559 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-32b-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={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s39 1), p0:(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 s34 1) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-06 finished in 576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((G(p1)||p0)))&&F(p2))))'
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 559/559 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 550 transition count 559
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 542 transition count 551
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 542 transition count 551
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 542 transition count 548
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 24 place count 538 transition count 544
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 538 transition count 544
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 31 place count 538 transition count 541
Applied a total of 31 rules in 45 ms. Remains 538 /551 variables (removed 13) and now considering 541/559 (removed 18) transitions.
// Phase 1: matrix 541 rows 538 cols
[2023-03-11 22:20:19] [INFO ] Computed 33 place invariants in 5 ms
[2023-03-11 22:20:19] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-11 22:20:19] [INFO ] Invariant cache hit.
[2023-03-11 22:20:19] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
[2023-03-11 22:20:19] [INFO ] Invariant cache hit.
[2023-03-11 22:20:20] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/551 places, 541/559 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1245 ms. Remains : 538/551 places, 541/559 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s256 1), p0:(OR (EQ s184 0) (EQ s491 0)), p1:(EQ s377 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1183 reset in 333 ms.
Product exploration explored 100000 steps with 1154 reset in 312 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 838 edges and 538 vertex of which 502 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.7 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), true, (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 212 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 37 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 22:20:22] [INFO ] Invariant cache hit.
[2023-03-11 22:20:22] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 22:20:22] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 30 ms returned sat
[2023-03-11 22:20:22] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 22:20:22] [INFO ] After 396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-11 22:20:22] [INFO ] After 610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 541/541 transitions.
Graph (trivial) has 436 edges and 538 vertex of which 6 / 538 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 831 edges and 533 vertex of which 497 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 255 transitions
Trivial Post-agglo rules discarded 255 transitions
Performed 255 trivial Post agglomeration. Transition count delta: 255
Iterating post reduction 0 with 257 rules applied. Total rules applied 259 place count 497 transition count 274
Reduce places removed 255 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 256 rules applied. Total rules applied 515 place count 242 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 516 place count 241 transition count 273
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 516 place count 241 transition count 207
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 648 place count 175 transition count 207
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 681 place count 142 transition count 174
Iterating global reduction 3 with 33 rules applied. Total rules applied 714 place count 142 transition count 174
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 714 place count 142 transition count 173
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 716 place count 141 transition count 173
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 910 place count 44 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 122 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 912 place count 43 transition count 75
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 914 place count 43 transition count 73
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 942 place count 15 transition count 17
Iterating global reduction 5 with 28 rules applied. Total rules applied 970 place count 15 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 975 place count 12 transition count 15
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 17 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 3 rules applied. Total rules applied 978 place count 11 transition count 13
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 979 place count 11 transition count 12
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 980 place count 11 transition count 12
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 981 place count 11 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 982 place count 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 985 place count 9 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 986 place count 8 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 986 place count 8 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 990 place count 6 transition count 6
Applied a total of 990 rules in 35 ms. Remains 6 /538 variables (removed 532) and now considering 6/541 (removed 535) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 6/538 places, 6/541 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), true, (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 293 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
[2023-03-11 22:20:23] [INFO ] Invariant cache hit.
[2023-03-11 22:20:23] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 18 ms returned sat
[2023-03-11 22:20:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:20:24] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2023-03-11 22:20:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:20:24] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 25 ms returned sat
[2023-03-11 22:20:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:20:25] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2023-03-11 22:20:25] [INFO ] Computed and/alt/rep : 535/703/535 causal constraints (skipped 5 transitions) in 44 ms.
[2023-03-11 22:20:29] [INFO ] Added : 521 causal constraints over 105 iterations in 4746 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 541/541 transitions.
Applied a total of 0 rules in 13 ms. Remains 538 /538 variables (removed 0) and now considering 541/541 (removed 0) transitions.
[2023-03-11 22:20:29] [INFO ] Invariant cache hit.
[2023-03-11 22:20:30] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-11 22:20:30] [INFO ] Invariant cache hit.
[2023-03-11 22:20:30] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
[2023-03-11 22:20:30] [INFO ] Invariant cache hit.
[2023-03-11 22:20:31] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1257 ms. Remains : 538/538 places, 541/541 transitions.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 838 edges and 538 vertex of which 502 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.5 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), true, (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 227 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 36 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 22:20:31] [INFO ] Invariant cache hit.
[2023-03-11 22:20:31] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 22:20:31] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 25 ms returned sat
[2023-03-11 22:20:32] [INFO ] After 310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 22:20:32] [INFO ] After 394ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-11 22:20:32] [INFO ] After 595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 541/541 transitions.
Graph (trivial) has 436 edges and 538 vertex of which 6 / 538 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 831 edges and 533 vertex of which 497 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.4 ms
Discarding 36 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 255 transitions
Trivial Post-agglo rules discarded 255 transitions
Performed 255 trivial Post agglomeration. Transition count delta: 255
Iterating post reduction 0 with 257 rules applied. Total rules applied 259 place count 497 transition count 274
Reduce places removed 255 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 256 rules applied. Total rules applied 515 place count 242 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 516 place count 241 transition count 273
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 516 place count 241 transition count 207
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 648 place count 175 transition count 207
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 681 place count 142 transition count 174
Iterating global reduction 3 with 33 rules applied. Total rules applied 714 place count 142 transition count 174
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 714 place count 142 transition count 173
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 716 place count 141 transition count 173
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 910 place count 44 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 122 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 912 place count 43 transition count 75
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 914 place count 43 transition count 73
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 942 place count 15 transition count 17
Iterating global reduction 5 with 28 rules applied. Total rules applied 970 place count 15 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 975 place count 12 transition count 15
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 17 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 3 rules applied. Total rules applied 978 place count 11 transition count 13
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 979 place count 11 transition count 12
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 980 place count 11 transition count 12
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 981 place count 11 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 982 place count 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 985 place count 9 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 986 place count 8 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 986 place count 8 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 990 place count 6 transition count 6
Applied a total of 990 rules in 41 ms. Remains 6 /538 variables (removed 532) and now considering 6/541 (removed 535) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 6/538 places, 6/541 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Finished Best-First random walk after 48 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p2) p0 p1), true, (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 270 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
[2023-03-11 22:20:33] [INFO ] Invariant cache hit.
[2023-03-11 22:20:33] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 21 ms returned sat
[2023-03-11 22:20:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:20:34] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2023-03-11 22:20:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:20:34] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 20 ms returned sat
[2023-03-11 22:20:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:20:34] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2023-03-11 22:20:34] [INFO ] Computed and/alt/rep : 535/703/535 causal constraints (skipped 5 transitions) in 43 ms.
[2023-03-11 22:20:39] [INFO ] Added : 521 causal constraints over 105 iterations in 4538 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Product exploration explored 100000 steps with 1171 reset in 164 ms.
Product exploration explored 100000 steps with 1160 reset in 200 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 541/541 transitions.
Graph (trivial) has 434 edges and 538 vertex of which 6 / 538 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 832 edges and 533 vertex of which 497 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.8 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 253 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 253 rules applied. Total rules applied 255 place count 497 transition count 532
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 34 Pre rules applied. Total rules applied 255 place count 497 transition count 534
Deduced a syphon composed of 287 places in 1 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 289 place count 497 transition count 534
Discarding 185 places :
Symmetric choice reduction at 1 with 185 rule applications. Total rules 474 place count 312 transition count 349
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 1 with 185 rules applied. Total rules applied 659 place count 312 transition count 349
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 689 place count 282 transition count 319
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 719 place count 282 transition count 319
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 204 places in 0 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 820 place count 282 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 822 place count 282 transition count 318
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 892 place count 212 transition count 247
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 962 place count 212 transition count 247
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 963 place count 212 transition count 247
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 964 place count 211 transition count 246
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 965 place count 211 transition count 246
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 166 places in 1 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 997 place count 211 transition count 341
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 1055 place count 153 transition count 225
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 1113 place count 153 transition count 225
Discarding 81 places :
Symmetric choice reduction at 2 with 81 rule applications. Total rules 1194 place count 72 transition count 90
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 2 with 81 rules applied. Total rules applied 1275 place count 72 transition count 90
Deduced a syphon composed of 54 places in 0 ms
Applied a total of 1275 rules in 149 ms. Remains 72 /538 variables (removed 466) and now considering 90/541 (removed 451) transitions.
[2023-03-11 22:20:40] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-11 22:20:40] [INFO ] Flow matrix only has 89 transitions (discarded 1 similar events)
// Phase 1: matrix 89 rows 72 cols
[2023-03-11 22:20:40] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 22:20:40] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/538 places, 90/541 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 283 ms. Remains : 72/538 places, 90/541 transitions.
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 541/541 transitions.
Applied a total of 0 rules in 27 ms. Remains 538 /538 variables (removed 0) and now considering 541/541 (removed 0) transitions.
// Phase 1: matrix 541 rows 538 cols
[2023-03-11 22:20:40] [INFO ] Computed 33 place invariants in 3 ms
[2023-03-11 22:20:41] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-11 22:20:41] [INFO ] Invariant cache hit.
[2023-03-11 22:20:41] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2023-03-11 22:20:41] [INFO ] Invariant cache hit.
[2023-03-11 22:20:42] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1205 ms. Remains : 538/538 places, 541/541 transitions.
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-07 finished in 22993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(X(F(p0))&&(p1 U (G(p1)||(p1&&G(p0))))))))'
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 559/559 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 550 transition count 559
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 541 transition count 550
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 541 transition count 550
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 541 transition count 547
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 536 transition count 542
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 536 transition count 542
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 536 transition count 538
Applied a total of 36 rules in 50 ms. Remains 536 /551 variables (removed 15) and now considering 538/559 (removed 21) transitions.
// Phase 1: matrix 538 rows 536 cols
[2023-03-11 22:20:42] [INFO ] Computed 33 place invariants in 4 ms
[2023-03-11 22:20:42] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-11 22:20:42] [INFO ] Invariant cache hit.
[2023-03-11 22:20:42] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
[2023-03-11 22:20:42] [INFO ] Invariant cache hit.
[2023-03-11 22:20:43] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 536/551 places, 538/559 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1198 ms. Remains : 536/551 places, 538/559 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), true, (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}, { cond=(NOT p1), acceptance={0} source=1 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 0}]], initial=6, aps=[p0:(EQ s483 1), p1:(NEQ s373 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 131 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-08 finished in 1461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 551/551 places, 559/559 transitions.
Graph (trivial) has 458 edges and 551 vertex of which 6 / 551 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 852 edges and 546 vertex of which 509 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.2 ms
Discarding 37 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 270 rules applied. Total rules applied 272 place count 508 transition count 279
Reduce places removed 270 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 280 rules applied. Total rules applied 552 place count 238 transition count 269
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 555 place count 235 transition count 269
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 555 place count 235 transition count 204
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 685 place count 170 transition count 204
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 717 place count 138 transition count 172
Iterating global reduction 3 with 32 rules applied. Total rules applied 749 place count 138 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 749 place count 138 transition count 171
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 751 place count 137 transition count 171
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 941 place count 42 transition count 76
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 971 place count 12 transition count 16
Iterating global reduction 3 with 30 rules applied. Total rules applied 1001 place count 12 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1003 place count 11 transition count 16
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 1005 place count 11 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1006 place count 10 transition count 15
Applied a total of 1006 rules in 24 ms. Remains 10 /551 variables (removed 541) and now considering 15/559 (removed 544) transitions.
[2023-03-11 22:20:43] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 10 cols
[2023-03-11 22:20:43] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 22:20:43] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 22:20:43] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2023-03-11 22:20:43] [INFO ] Invariant cache hit.
[2023-03-11 22:20:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 22:20:43] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-11 22:20:43] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-11 22:20:43] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2023-03-11 22:20:43] [INFO ] Invariant cache hit.
[2023-03-11 22:20:43] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/551 places, 15/559 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 10/551 places, 15/559 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-10 finished in 195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0))||(F(!p0)&&X(F(!p1)))))'
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 559/559 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 550 transition count 559
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 542 transition count 551
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 542 transition count 551
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 542 transition count 548
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 24 place count 538 transition count 544
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 538 transition count 544
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 31 place count 538 transition count 541
Applied a total of 31 rules in 48 ms. Remains 538 /551 variables (removed 13) and now considering 541/559 (removed 18) transitions.
// Phase 1: matrix 541 rows 538 cols
[2023-03-11 22:20:43] [INFO ] Computed 33 place invariants in 3 ms
[2023-03-11 22:20:44] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-11 22:20:44] [INFO ] Invariant cache hit.
[2023-03-11 22:20:44] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2023-03-11 22:20:44] [INFO ] Invariant cache hit.
[2023-03-11 22:20:45] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/551 places, 541/559 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1218 ms. Remains : 538/551 places, 541/559 transitions.
Stuttering acceptance computed with spot in 202 ms :[p0, p0, (AND p1 p0), (AND p0 p1)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s252 1) (EQ s525 1) (EQ s536 1)), p1:(OR (AND (EQ s252 1) (EQ s525 1) (EQ s536 1)) (NEQ s326 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 372 reset in 268 ms.
Product exploration explored 100000 steps with 372 reset in 209 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 838 edges and 538 vertex of which 502 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.4 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 279 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 36 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 22:20:46] [INFO ] Invariant cache hit.
[2023-03-11 22:20:46] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 25 ms returned sat
[2023-03-11 22:20:46] [INFO ] After 300ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 22:20:46] [INFO ] After 366ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 22:20:46] [INFO ] After 521ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 22:20:46] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 25 ms returned sat
[2023-03-11 22:20:47] [INFO ] After 291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 22:20:47] [INFO ] After 342ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-11 22:20:47] [INFO ] After 502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 p1))]
Knowledge based reduction with 7 factoid took 397 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 117 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 541/541 transitions.
Applied a total of 0 rules in 11 ms. Remains 538 /538 variables (removed 0) and now considering 541/541 (removed 0) transitions.
[2023-03-11 22:20:47] [INFO ] Invariant cache hit.
[2023-03-11 22:20:48] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-11 22:20:48] [INFO ] Invariant cache hit.
[2023-03-11 22:20:48] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
[2023-03-11 22:20:48] [INFO ] Invariant cache hit.
[2023-03-11 22:20:49] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1248 ms. Remains : 538/538 places, 541/541 transitions.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 838 edges and 538 vertex of which 502 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.5 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 286 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 36 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 22:20:49] [INFO ] Invariant cache hit.
[2023-03-11 22:20:49] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 24 ms returned sat
[2023-03-11 22:20:50] [INFO ] After 291ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 22:20:50] [INFO ] After 356ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 22:20:50] [INFO ] After 486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 22:20:50] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 27 ms returned sat
[2023-03-11 22:20:50] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 22:20:50] [INFO ] After 337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-11 22:20:50] [INFO ] After 531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 92 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=46 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 261 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 118 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 116 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 374 reset in 187 ms.
Product exploration explored 100000 steps with 372 reset in 221 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 117 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 541/541 transitions.
Graph (trivial) has 436 edges and 538 vertex of which 6 / 538 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 832 edges and 533 vertex of which 497 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 257 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 257 rules applied. Total rules applied 259 place count 497 transition count 532
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 34 Pre rules applied. Total rules applied 259 place count 497 transition count 534
Deduced a syphon composed of 291 places in 1 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 293 place count 497 transition count 534
Discarding 190 places :
Symmetric choice reduction at 1 with 190 rule applications. Total rules 483 place count 307 transition count 344
Deduced a syphon composed of 132 places in 1 ms
Iterating global reduction 1 with 190 rules applied. Total rules applied 673 place count 307 transition count 344
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 704 place count 276 transition count 313
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 735 place count 276 transition count 313
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 200 places in 0 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 834 place count 276 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 836 place count 276 transition count 312
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 904 place count 208 transition count 243
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 2 with 68 rules applied. Total rules applied 972 place count 208 transition count 243
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 973 place count 208 transition count 243
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 974 place count 207 transition count 242
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 975 place count 207 transition count 242
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 1008 place count 207 transition count 341
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 1069 place count 146 transition count 219
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 1130 place count 146 transition count 219
Discarding 87 places :
Symmetric choice reduction at 2 with 87 rule applications. Total rules 1217 place count 59 transition count 74
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 2 with 87 rules applied. Total rules applied 1304 place count 59 transition count 74
Deduced a syphon composed of 46 places in 0 ms
Applied a total of 1304 rules in 67 ms. Remains 59 /538 variables (removed 479) and now considering 74/541 (removed 467) transitions.
[2023-03-11 22:20:52] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-11 22:20:52] [INFO ] Flow matrix only has 73 transitions (discarded 1 similar events)
// Phase 1: matrix 73 rows 59 cols
[2023-03-11 22:20:52] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 22:20:52] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/538 places, 74/541 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 269 ms. Remains : 59/538 places, 74/541 transitions.
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 541/541 transitions.
Applied a total of 0 rules in 13 ms. Remains 538 /538 variables (removed 0) and now considering 541/541 (removed 0) transitions.
// Phase 1: matrix 541 rows 538 cols
[2023-03-11 22:20:52] [INFO ] Computed 33 place invariants in 3 ms
[2023-03-11 22:20:52] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-11 22:20:52] [INFO ] Invariant cache hit.
[2023-03-11 22:20:52] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2023-03-11 22:20:52] [INFO ] Invariant cache hit.
[2023-03-11 22:20:53] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1108 ms. Remains : 538/538 places, 541/541 transitions.
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-11 finished in 9615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(F(p1)))))'
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 559/559 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 550 transition count 559
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 542 transition count 551
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 542 transition count 551
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 542 transition count 548
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 537 transition count 543
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 537 transition count 543
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 34 place count 537 transition count 539
Applied a total of 34 rules in 36 ms. Remains 537 /551 variables (removed 14) and now considering 539/559 (removed 20) transitions.
// Phase 1: matrix 539 rows 537 cols
[2023-03-11 22:20:53] [INFO ] Computed 33 place invariants in 3 ms
[2023-03-11 22:20:53] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-11 22:20:53] [INFO ] Invariant cache hit.
[2023-03-11 22:20:54] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
[2023-03-11 22:20:54] [INFO ] Invariant cache hit.
[2023-03-11 22:20:54] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 537/551 places, 539/559 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1281 ms. Remains : 537/551 places, 539/559 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-12 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=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s517 1), p1:(OR (EQ s183 0) (EQ s509 0))], nbAcceptance=0, 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]]
Stuttering criterion allowed to conclude after 271 steps with 2 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-12 finished in 1466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||p0)))))'
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 559/559 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 550 transition count 559
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 541 transition count 550
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 541 transition count 550
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 541 transition count 547
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 536 transition count 542
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 536 transition count 542
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 536 transition count 538
Applied a total of 36 rules in 39 ms. Remains 536 /551 variables (removed 15) and now considering 538/559 (removed 21) transitions.
// Phase 1: matrix 538 rows 536 cols
[2023-03-11 22:20:54] [INFO ] Computed 33 place invariants in 2 ms
[2023-03-11 22:20:55] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-11 22:20:55] [INFO ] Invariant cache hit.
[2023-03-11 22:20:55] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
[2023-03-11 22:20:55] [INFO ] Invariant cache hit.
[2023-03-11 22:20:56] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 536/551 places, 538/559 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1196 ms. Remains : 536/551 places, 538/559 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(EQ s504 0), p0:(OR (EQ s87 0) (EQ s523 0) (EQ s534 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 264 ms.
Product exploration explored 100000 steps with 33333 reset in 270 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 835 edges and 536 vertex of which 500 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-32b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-13 finished in 1969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p0)||(p1&&X(X(X(p2)))))))'
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 559/559 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 550 transition count 559
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 541 transition count 550
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 541 transition count 550
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 541 transition count 547
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 536 transition count 542
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 536 transition count 542
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 536 transition count 538
Applied a total of 36 rules in 37 ms. Remains 536 /551 variables (removed 15) and now considering 538/559 (removed 21) transitions.
[2023-03-11 22:20:56] [INFO ] Invariant cache hit.
[2023-03-11 22:20:57] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-11 22:20:57] [INFO ] Invariant cache hit.
[2023-03-11 22:20:57] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
[2023-03-11 22:20:57] [INFO ] Invariant cache hit.
[2023-03-11 22:20:58] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 536/551 places, 538/559 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1246 ms. Remains : 536/551 places, 538/559 transitions.
Stuttering acceptance computed with spot in 425 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=4, aps=[p0:(EQ s146 1), p1:(EQ s268 1), p2:(OR (EQ s146 0) (EQ s89 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 589 reset in 178 ms.
Product exploration explored 100000 steps with 582 reset in 196 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 835 edges and 536 vertex of which 500 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 36 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 22:20:59] [INFO ] Invariant cache hit.
[2023-03-11 22:20:59] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 22:20:59] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 25 ms returned sat
[2023-03-11 22:21:00] [INFO ] After 411ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 324 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-11 22:21:00] [INFO ] Invariant cache hit.
[2023-03-11 22:21:00] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 20 ms returned sat
[2023-03-11 22:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:21:01] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2023-03-11 22:21:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:21:01] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 19 ms returned sat
[2023-03-11 22:21:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:21:01] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2023-03-11 22:21:01] [INFO ] Computed and/alt/rep : 532/698/532 causal constraints (skipped 5 transitions) in 42 ms.
[2023-03-11 22:21:06] [INFO ] Added : 520 causal constraints over 104 iterations in 4428 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 536 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 536/536 places, 538/538 transitions.
Graph (trivial) has 434 edges and 536 vertex of which 6 / 536 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 829 edges and 531 vertex of which 495 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 254 place count 494 transition count 276
Reduce places removed 252 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 254 rules applied. Total rules applied 508 place count 242 transition count 274
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 510 place count 240 transition count 274
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 510 place count 240 transition count 207
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 644 place count 173 transition count 207
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 675 place count 142 transition count 176
Iterating global reduction 3 with 31 rules applied. Total rules applied 706 place count 142 transition count 176
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 902 place count 44 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 903 place count 44 transition count 77
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 932 place count 15 transition count 20
Iterating global reduction 4 with 29 rules applied. Total rules applied 961 place count 15 transition count 20
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 4 with 2 rules applied. Total rules applied 963 place count 14 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 964 place count 13 transition count 18
Applied a total of 964 rules in 19 ms. Remains 13 /536 variables (removed 523) and now considering 18/538 (removed 520) transitions.
// Phase 1: matrix 18 rows 13 cols
[2023-03-11 22:21:06] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 22:21:06] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 22:21:06] [INFO ] Invariant cache hit.
[2023-03-11 22:21:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 22:21:06] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-11 22:21:06] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-11 22:21:06] [INFO ] Invariant cache hit.
[2023-03-11 22:21:06] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/536 places, 18/538 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176 ms. Remains : 13/536 places, 18/538 transitions.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-11 22:21:06] [INFO ] Invariant cache hit.
[2023-03-11 22:21:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:21:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-11 22:21:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 22:21:06] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-11 22:21:06] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-11 22:21:06] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-14 finished in 10204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G(!p1)))'
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 559/559 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 550 transition count 559
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 542 transition count 551
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 542 transition count 551
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 542 transition count 548
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 537 transition count 543
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 537 transition count 543
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 34 place count 537 transition count 539
Applied a total of 34 rules in 40 ms. Remains 537 /551 variables (removed 14) and now considering 539/559 (removed 20) transitions.
// Phase 1: matrix 539 rows 537 cols
[2023-03-11 22:21:07] [INFO ] Computed 33 place invariants in 2 ms
[2023-03-11 22:21:07] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-11 22:21:07] [INFO ] Invariant cache hit.
[2023-03-11 22:21:07] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2023-03-11 22:21:07] [INFO ] Invariant cache hit.
[2023-03-11 22:21:08] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 537/551 places, 539/559 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1258 ms. Remains : 537/551 places, 539/559 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (AND p1 (NOT p0)), (NOT p0), (AND (NOT p0) p1), p1]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(NEQ s150 1), p0:(EQ s517 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-15 finished in 1432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((G(p1)||p0)))&&F(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0))||(F(!p0)&&X(F(!p1)))))'
Found a Shortening insensitive property : GPUForwardProgress-PT-32b-LTLFireability-11
Stuttering acceptance computed with spot in 199 ms :[p0, p0, (AND p1 p0), (AND p0 p1)]
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 551/551 places, 559/559 transitions.
Graph (trivial) has 452 edges and 551 vertex of which 6 / 551 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 852 edges and 546 vertex of which 509 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.2 ms
Discarding 37 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 265 transitions
Trivial Post-agglo rules discarded 265 transitions
Performed 265 trivial Post agglomeration. Transition count delta: 265
Iterating post reduction 0 with 265 rules applied. Total rules applied 267 place count 508 transition count 284
Reduce places removed 265 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 276 rules applied. Total rules applied 543 place count 243 transition count 273
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 547 place count 239 transition count 273
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 547 place count 239 transition count 207
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 679 place count 173 transition count 207
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 712 place count 140 transition count 174
Iterating global reduction 3 with 33 rules applied. Total rules applied 745 place count 140 transition count 174
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 939 place count 43 transition count 77
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 968 place count 14 transition count 19
Iterating global reduction 3 with 29 rules applied. Total rules applied 997 place count 14 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 999 place count 13 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1000 place count 12 transition count 18
Applied a total of 1000 rules in 29 ms. Remains 12 /551 variables (removed 539) and now considering 18/559 (removed 541) transitions.
[2023-03-11 22:21:08] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 12 cols
[2023-03-11 22:21:08] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 22:21:09] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 22:21:09] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-11 22:21:09] [INFO ] Invariant cache hit.
[2023-03-11 22:21:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 22:21:09] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-11 22:21:09] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-11 22:21:09] [INFO ] Invariant cache hit.
[2023-03-11 22:21:09] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 12/551 places, 18/559 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 108 ms. Remains : 12/551 places, 18/559 transitions.
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s9 1) (EQ s11 1)), p1:(OR (AND (EQ s3 1) (EQ s9 1) (EQ s11 1)) (NEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 12555 reset in 206 ms.
Product exploration explored 100000 steps with 12593 reset in 241 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 285 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Finished random walk after 37 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 p1))]
Knowledge based reduction with 7 factoid took 323 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 108 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-11 22:21:10] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-11 22:21:10] [INFO ] Invariant cache hit.
[2023-03-11 22:21:10] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 22:21:10] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-11 22:21:10] [INFO ] Invariant cache hit.
[2023-03-11 22:21:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 22:21:10] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-11 22:21:10] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-11 22:21:10] [INFO ] Invariant cache hit.
[2023-03-11 22:21:10] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 12/12 places, 18/18 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Finished random walk after 65 steps, including 5 resets, run visited all 2 properties in 2 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 238 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 114 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 109 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 12541 reset in 131 ms.
Product exploration explored 100000 steps with 12461 reset in 142 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 115 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-11 22:21:11] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-11 22:21:11] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-11 22:21:11] [INFO ] Invariant cache hit.
[2023-03-11 22:21:11] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56 ms. Remains : 12/12 places, 18/18 transitions.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-11 22:21:12] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-11 22:21:12] [INFO ] Invariant cache hit.
[2023-03-11 22:21:12] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 22:21:12] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-11 22:21:12] [INFO ] Invariant cache hit.
[2023-03-11 22:21:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 22:21:12] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-11 22:21:12] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-11 22:21:12] [INFO ] Invariant cache hit.
[2023-03-11 22:21:12] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 12/12 places, 18/18 transitions.
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-11 finished in 3505 ms.
[2023-03-11 22:21:12] [INFO ] Flatten gal took : 37 ms
[2023-03-11 22:21:12] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-11 22:21:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 551 places, 559 transitions and 1441 arcs took 6 ms.
Total runtime 67037 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1942/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1942/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : GPUForwardProgress-PT-32b-LTLFireability-07
Could not compute solution for formula : GPUForwardProgress-PT-32b-LTLFireability-11

BK_STOP 1678573274040

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-32b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is GPUForwardProgress-PT-32b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r201-smll-167840347300124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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