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.r197-smll-167840343800124.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 itstools
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 r197-smll-167840343800124
=====================================================================

--------------------
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 1678485433908

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-32b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-10 21:57:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 21:57:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 21:57:17] [INFO ] Load time of PNML (sax parser for PT used): 273 ms
[2023-03-10 21:57:17] [INFO ] Transformed 644 places.
[2023-03-10 21:57:17] [INFO ] Transformed 677 transitions.
[2023-03-10 21:57:17] [INFO ] Found NUPN structural information;
[2023-03-10 21:57:17] [INFO ] Parsed PT model containing 644 places and 677 transitions and 1677 arcs in 399 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 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 294 ms. Remains 551 /644 variables (removed 93) and now considering 559/677 (removed 118) transitions.
// Phase 1: matrix 559 rows 551 cols
[2023-03-10 21:57:17] [INFO ] Computed 34 place invariants in 48 ms
[2023-03-10 21:57:18] [INFO ] Implicit Places using invariants in 615 ms returned []
[2023-03-10 21:57:18] [INFO ] Invariant cache hit.
[2023-03-10 21:57:19] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 1404 ms to find 0 implicit places.
[2023-03-10 21:57:19] [INFO ] Invariant cache hit.
[2023-03-10 21:57:19] [INFO ] Dead Transitions using invariants and state equation in 528 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 2264 ms. Remains : 551/644 places, 559/677 transitions.
Support contains 75 out of 551 places after structural reductions.
[2023-03-10 21:57:20] [INFO ] Flatten gal took : 147 ms
[2023-03-10 21:57:20] [INFO ] Flatten gal took : 68 ms
[2023-03-10 21:57:20] [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 842 ms. (steps per millisecond=11 ) properties (out of 35) seen :23
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-10 21:57:22] [INFO ] Invariant cache hit.
[2023-03-10 21:57:22] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 31 ms returned sat
[2023-03-10 21:57:22] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-10 21:57:22] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 37 ms returned sat
[2023-03-10 21:57:23] [INFO ] After 822ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-10 21:57:24] [INFO ] After 1638ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 472 ms.
[2023-03-10 21:57:25] [INFO ] After 2678ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 6 properties in 434 ms.
Support contains 39 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 8 ms
Free SCC test removed 5 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 267 transitions
Trivial Post-agglo rules discarded 267 transitions
Performed 267 trivial Post agglomeration. Transition count delta: 267
Iterating post reduction 0 with 267 rules applied. Total rules applied 268 place count 546 transition count 285
Reduce places removed 267 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 276 rules applied. Total rules applied 544 place count 279 transition count 276
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 547 place count 276 transition count 276
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 547 place count 276 transition count 212
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 675 place count 212 transition count 212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 677 place count 210 transition count 210
Iterating global reduction 3 with 2 rules applied. Total rules applied 679 place count 210 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 679 place count 210 transition count 208
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 683 place count 208 transition count 208
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 867 place count 116 transition count 116
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 895 place count 116 transition count 88
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 899 place count 114 transition count 88
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 900 place count 114 transition count 87
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 902 place count 114 transition count 85
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 904 place count 114 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 906 place count 112 transition count 83
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 908 place count 112 transition count 83
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 910 place count 112 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 911 place count 111 transition count 80
Applied a total of 911 rules in 160 ms. Remains 111 /551 variables (removed 440) and now considering 80/559 (removed 479) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 111/551 places, 80/559 transitions.
Incomplete random walk after 10000 steps, including 649 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 354 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 80 rows 111 cols
[2023-03-10 21:57:25] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-10 21:57:26] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 13 ms returned sat
[2023-03-10 21:57:26] [INFO ] After 68ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 21:57:26] [INFO ] After 93ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-10 21:57:26] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 34 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 80/80 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 78
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 109 transition count 78
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 109 transition count 74
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 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 18 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 21 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 22 place count 101 transition count 67
Applied a total of 22 rules in 36 ms. Remains 101 /111 variables (removed 10) and now considering 67/80 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 101/111 places, 67/80 transitions.
Incomplete random walk after 10000 steps, including 697 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 142 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1740 steps, run visited all 1 properties in 20 ms. (steps per millisecond=87 )
Probabilistic random walk after 1740 steps, saw 1616 distinct states, run finished after 20 ms. (steps per millisecond=87 ) 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.30 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 98 ms. Remains 536 /551 variables (removed 15) and now considering 538/559 (removed 21) transitions.
// Phase 1: matrix 538 rows 536 cols
[2023-03-10 21:57:27] [INFO ] Computed 33 place invariants in 7 ms
[2023-03-10 21:57:27] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-10 21:57:27] [INFO ] Invariant cache hit.
[2023-03-10 21:57:27] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 895 ms to find 0 implicit places.
[2023-03-10 21:57:27] [INFO ] Invariant cache hit.
[2023-03-10 21:57:28] [INFO ] Dead Transitions using invariants and state equation in 392 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 1388 ms. Remains : 536/551 places, 538/559 transitions.
Stuttering acceptance computed with spot in 527 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 13441 steps with 49 reset in 119 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-00 finished in 2128 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 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.6 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 1 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 0 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 69 ms. Remains 14 /551 variables (removed 537) and now considering 19/559 (removed 540) transitions.
[2023-03-10 21:57:29] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
// Phase 1: matrix 18 rows 14 cols
[2023-03-10 21:57:29] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 21:57:29] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-10 21:57:29] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2023-03-10 21:57:29] [INFO ] Invariant cache hit.
[2023-03-10 21:57:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 21:57:29] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-10 21:57:29] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-10 21:57:29] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2023-03-10 21:57:29] [INFO ] Invariant cache hit.
[2023-03-10 21:57:29] [INFO ] Dead Transitions using invariants and state equation in 33 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 211 ms. Remains : 14/551 places, 19/559 transitions.
Stuttering acceptance computed with spot in 208 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 2 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 452 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.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 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 1 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 52 ms. Remains 12 /551 variables (removed 539) and now considering 17/559 (removed 542) transitions.
[2023-03-10 21:57:29] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 12 cols
[2023-03-10 21:57:29] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 21:57:29] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-10 21:57:29] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2023-03-10 21:57:29] [INFO ] Invariant cache hit.
[2023-03-10 21:57:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 21:57:29] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-10 21:57:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 21:57:29] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2023-03-10 21:57:29] [INFO ] Invariant cache hit.
[2023-03-10 21:57:29] [INFO ] Dead Transitions using invariants and state equation in 34 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 154 ms. Remains : 12/551 places, 17/559 transitions.
Stuttering acceptance computed with spot in 100 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 6 steps with 0 reset in 3 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-03 finished in 281 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 76 ms. Remains 538 /551 variables (removed 13) and now considering 541/559 (removed 18) transitions.
// Phase 1: matrix 541 rows 538 cols
[2023-03-10 21:57:29] [INFO ] Computed 33 place invariants in 5 ms
[2023-03-10 21:57:30] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-10 21:57:30] [INFO ] Invariant cache hit.
[2023-03-10 21:57:30] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
[2023-03-10 21:57:30] [INFO ] Invariant cache hit.
[2023-03-10 21:57:31] [INFO ] Dead Transitions using invariants and state equation in 556 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 1472 ms. Remains : 538/551 places, 541/559 transitions.
Stuttering acceptance computed with spot in 514 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 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-04 finished in 2020 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 56 ms. Remains 15 /551 variables (removed 536) and now considering 22/559 (removed 537) transitions.
[2023-03-10 21:57:31] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 15 cols
[2023-03-10 21:57:31] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 21:57:31] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-10 21:57:31] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
[2023-03-10 21:57:31] [INFO ] Invariant cache hit.
[2023-03-10 21:57:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 21:57:31] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-10 21:57:31] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-10 21:57:31] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
[2023-03-10 21:57:31] [INFO ] Invariant cache hit.
[2023-03-10 21:57:31] [INFO ] Dead Transitions using invariants and state equation in 31 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 186 ms. Remains : 15/551 places, 22/559 transitions.
Stuttering acceptance computed with spot in 101 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 6857 reset in 375 ms.
Stack based approach found an accepted trace after 723 steps with 49 reset with depth 22 and stack size 18 in 4 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-05 finished in 693 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 0 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 40 ms. Remains 108 /551 variables (removed 443) and now considering 107/559 (removed 452) transitions.
[2023-03-10 21:57:32] [INFO ] Flow matrix only has 76 transitions (discarded 31 similar events)
// Phase 1: matrix 76 rows 108 cols
[2023-03-10 21:57:32] [INFO ] Computed 34 place invariants in 5 ms
[2023-03-10 21:57:32] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-10 21:57:32] [INFO ] Flow matrix only has 76 transitions (discarded 31 similar events)
[2023-03-10 21:57:32] [INFO ] Invariant cache hit.
[2023-03-10 21:57:32] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-10 21:57:32] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-10 21:57:32] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-10 21:57:32] [INFO ] Flow matrix only has 76 transitions (discarded 31 similar events)
[2023-03-10 21:57:32] [INFO ] Invariant cache hit.
[2023-03-10 21:57:33] [INFO ] Dead Transitions using invariants and state equation in 127 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 514 ms. Remains : 108/551 places, 107/559 transitions.
Stuttering acceptance computed with spot in 166 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 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-06 finished in 704 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 136 ms. Remains 538 /551 variables (removed 13) and now considering 541/559 (removed 18) transitions.
// Phase 1: matrix 541 rows 538 cols
[2023-03-10 21:57:33] [INFO ] Computed 33 place invariants in 5 ms
[2023-03-10 21:57:33] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-10 21:57:33] [INFO ] Invariant cache hit.
[2023-03-10 21:57:34] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
[2023-03-10 21:57:34] [INFO ] Invariant cache hit.
[2023-03-10 21:57:34] [INFO ] Dead Transitions using invariants and state equation in 430 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 1419 ms. Remains : 538/551 places, 541/559 transitions.
Stuttering acceptance computed with spot in 304 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 1193 reset in 339 ms.
Product exploration explored 100000 steps with 1183 reset in 326 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.6 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 237 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 37 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 21:57:36] [INFO ] Invariant cache hit.
[2023-03-10 21:57:36] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:57:36] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 26 ms returned sat
[2023-03-10 21:57:36] [INFO ] After 347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 21:57:37] [INFO ] After 454ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-10 21:57:37] [INFO ] After 701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 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 2 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 54 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 54 ms. Remains : 6/538 places, 6/541 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Finished Best-First random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
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 291 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 281 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 363 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-10 21:57:38] [INFO ] Invariant cache hit.
[2023-03-10 21:57:38] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 28 ms returned sat
[2023-03-10 21:57:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:57:39] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2023-03-10 21:57:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:57:39] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 25 ms returned sat
[2023-03-10 21:57:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:57:40] [INFO ] [Nat]Absence check using state equation in 493 ms returned sat
[2023-03-10 21:57:40] [INFO ] Computed and/alt/rep : 535/703/535 causal constraints (skipped 5 transitions) in 55 ms.
[2023-03-10 21:57:47] [INFO ] Added : 521 causal constraints over 105 iterations in 6887 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 23 ms. Remains 538 /538 variables (removed 0) and now considering 541/541 (removed 0) transitions.
[2023-03-10 21:57:47] [INFO ] Invariant cache hit.
[2023-03-10 21:57:47] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-10 21:57:47] [INFO ] Invariant cache hit.
[2023-03-10 21:57:48] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
[2023-03-10 21:57:48] [INFO ] Invariant cache hit.
[2023-03-10 21:57:48] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1309 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.4 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 198 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 415 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 137 ms. (steps per millisecond=72 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 21:57:49] [INFO ] Invariant cache hit.
[2023-03-10 21:57:49] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:57:49] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 25 ms returned sat
[2023-03-10 21:57:49] [INFO ] After 288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 21:57:49] [INFO ] After 381ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-10 21:57:49] [INFO ] After 590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 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 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 36 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 36 ms. Remains : 6/538 places, 6/541 transitions.
Finished random walk after 3338 steps, including 1 resets, run visited all 2 properties in 5 ms. (steps per millisecond=667 )
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 248 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 258 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 256 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-10 21:57:50] [INFO ] Invariant cache hit.
[2023-03-10 21:57:51] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 20 ms returned sat
[2023-03-10 21:57:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:57:51] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2023-03-10 21:57:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:57:52] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 23 ms returned sat
[2023-03-10 21:57:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:57:52] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2023-03-10 21:57:52] [INFO ] Computed and/alt/rep : 535/703/535 causal constraints (skipped 5 transitions) in 60 ms.
[2023-03-10 21:57:58] [INFO ] Added : 521 causal constraints over 105 iterations in 5422 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 279 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 1170 reset in 174 ms.
Product exploration explored 100000 steps with 1127 reset in 303 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 249 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.2 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 1 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 1 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 0 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 117 ms. Remains 72 /538 variables (removed 466) and now considering 90/541 (removed 451) transitions.
[2023-03-10 21:57:59] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-10 21:57:59] [INFO ] Flow matrix only has 89 transitions (discarded 1 similar events)
// Phase 1: matrix 89 rows 72 cols
[2023-03-10 21:57:59] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-10 21:57:59] [INFO ] Dead Transitions using invariants and state equation in 81 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 229 ms. Remains : 72/538 places, 90/541 transitions.
Built C files in :
/tmp/ltsmin12290261115527587085
[2023-03-10 21:57:59] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12290261115527587085
Running compilation step : cd /tmp/ltsmin12290261115527587085;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1551 ms.
Running link step : cd /tmp/ltsmin12290261115527587085;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin12290261115527587085;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5807466615859415773.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 19 ms. Remains 538 /538 variables (removed 0) and now considering 541/541 (removed 0) transitions.
// Phase 1: matrix 541 rows 538 cols
[2023-03-10 21:58:14] [INFO ] Computed 33 place invariants in 4 ms
[2023-03-10 21:58:14] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-10 21:58:14] [INFO ] Invariant cache hit.
[2023-03-10 21:58:15] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
[2023-03-10 21:58:15] [INFO ] Invariant cache hit.
[2023-03-10 21:58:15] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1138 ms. Remains : 538/538 places, 541/541 transitions.
Built C files in :
/tmp/ltsmin718420388703593674
[2023-03-10 21:58:15] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin718420388703593674
Running compilation step : cd /tmp/ltsmin718420388703593674;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1249 ms.
Running link step : cd /tmp/ltsmin718420388703593674;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin718420388703593674;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11929061557989599382.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 21:58:31] [INFO ] Flatten gal took : 34 ms
[2023-03-10 21:58:31] [INFO ] Flatten gal took : 33 ms
[2023-03-10 21:58:31] [INFO ] Time to serialize gal into /tmp/LTL14425568370728055274.gal : 9 ms
[2023-03-10 21:58:31] [INFO ] Time to serialize properties into /tmp/LTL12486431817001976876.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14425568370728055274.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13219478794312114140.hoa' '-atoms' '/tmp/LTL12486431817001976876.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12486431817001976876.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13219478794312114140.hoa
Detected timeout of ITS tools.
[2023-03-10 21:58:46] [INFO ] Flatten gal took : 29 ms
[2023-03-10 21:58:46] [INFO ] Flatten gal took : 27 ms
[2023-03-10 21:58:46] [INFO ] Time to serialize gal into /tmp/LTL14470421287159523508.gal : 4 ms
[2023-03-10 21:58:46] [INFO ] Time to serialize properties into /tmp/LTL18051804903278283033.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14470421287159523508.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18051804903278283033.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((X(X(("((p214==0)||(p579==0))")||(G("(p443==0)")))))&&(F("(p298==1)")))))
Formula 0 simplified : X(XX(!"((p214==0)||(p579==0))" & F!"(p443==0)") | G!"(p298==1)")
Detected timeout of ITS tools.
[2023-03-10 21:59:01] [INFO ] Flatten gal took : 28 ms
[2023-03-10 21:59:01] [INFO ] Applying decomposition
[2023-03-10 21:59:01] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13388985887278054820.txt' '-o' '/tmp/graph13388985887278054820.bin' '-w' '/tmp/graph13388985887278054820.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13388985887278054820.bin' '-l' '-1' '-v' '-w' '/tmp/graph13388985887278054820.weights' '-q' '0' '-e' '0.001'
[2023-03-10 21:59:01] [INFO ] Decomposing Gal with order
[2023-03-10 21:59:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 21:59:01] [INFO ] Removed a total of 73 redundant transitions.
[2023-03-10 21:59:01] [INFO ] Flatten gal took : 120 ms
[2023-03-10 21:59:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2023-03-10 21:59:01] [INFO ] Time to serialize gal into /tmp/LTL5984206107356273947.gal : 14 ms
[2023-03-10 21:59:01] [INFO ] Time to serialize properties into /tmp/LTL3156110317986255019.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5984206107356273947.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3156110317986255019.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((X(X(("((i11.i0.u75.p214==0)||(i32.i0.u209.p579==0))")||(G("(i23.i1.u158.p443==0)")))))&&(F("(i15.i1.u104.p298==1)")))))
Formula 0 simplified : X(XX(!"((i11.i0.u75.p214==0)||(i32.i0.u209.p579==0))" & F!"(i23.i1.u158.p443==0)") | G!"(i15.i1.u104.p298==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13305738518338401657
[2023-03-10 21:59:16] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13305738518338401657
Running compilation step : cd /tmp/ltsmin13305738518338401657;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1329 ms.
Running link step : cd /tmp/ltsmin13305738518338401657;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13305738518338401657;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X(([]((LTLAPp1==true))||(LTLAPp0==true))))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-07 finished in 118728 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 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-10 21:59:31] [INFO ] Computed 33 place invariants in 3 ms
[2023-03-10 21:59:32] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-10 21:59:32] [INFO ] Invariant cache hit.
[2023-03-10 21:59:32] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
[2023-03-10 21:59:32] [INFO ] Invariant cache hit.
[2023-03-10 21:59:33] [INFO ] Dead Transitions using invariants and state equation in 366 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 1259 ms. Remains : 536/551 places, 538/559 transitions.
Stuttering acceptance computed with spot in 240 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 81 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-08 finished in 1529 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 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 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 28 ms. Remains 10 /551 variables (removed 541) and now considering 15/559 (removed 544) transitions.
[2023-03-10 21:59:33] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 10 cols
[2023-03-10 21:59:33] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-10 21:59:33] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-10 21:59:33] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2023-03-10 21:59:33] [INFO ] Invariant cache hit.
[2023-03-10 21:59:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 21:59:33] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-10 21:59:33] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-10 21:59:33] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2023-03-10 21:59:33] [INFO ] Invariant cache hit.
[2023-03-10 21:59:33] [INFO ] Dead Transitions using invariants and state equation in 23 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 122 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 3 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 173 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 46 ms. Remains 538 /551 variables (removed 13) and now considering 541/559 (removed 18) transitions.
// Phase 1: matrix 541 rows 538 cols
[2023-03-10 21:59:33] [INFO ] Computed 33 place invariants in 2 ms
[2023-03-10 21:59:33] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-10 21:59:33] [INFO ] Invariant cache hit.
[2023-03-10 21:59:34] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 929 ms to find 0 implicit places.
[2023-03-10 21:59:34] [INFO ] Invariant cache hit.
[2023-03-10 21:59:35] [INFO ] Dead Transitions using invariants and state equation in 563 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 1539 ms. Remains : 538/551 places, 541/559 transitions.
Stuttering acceptance computed with spot in 164 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 373 reset in 209 ms.
Product exploration explored 100000 steps with 372 reset in 246 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 348 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 143 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 36 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 21:59:36] [INFO ] Invariant cache hit.
[2023-03-10 21:59:36] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 29 ms returned sat
[2023-03-10 21:59:37] [INFO ] After 318ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 21:59:37] [INFO ] After 396ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 21:59:37] [INFO ] After 571ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 21:59:37] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 32 ms returned sat
[2023-03-10 21:59:37] [INFO ] After 383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 21:59:37] [INFO ] After 464ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-10 21:59:37] [INFO ] After 682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 79 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
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 330 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 137 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 127 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 14 ms. Remains 538 /538 variables (removed 0) and now considering 541/541 (removed 0) transitions.
[2023-03-10 21:59:38] [INFO ] Invariant cache hit.
[2023-03-10 21:59:38] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-10 21:59:38] [INFO ] Invariant cache hit.
[2023-03-10 21:59:39] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
[2023-03-10 21:59:39] [INFO ] Invariant cache hit.
[2023-03-10 21:59:39] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1255 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.9 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 194 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 122 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 36 resets, run finished after 35 ms. (steps per millisecond=285 ) 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-10 21:59:40] [INFO ] Invariant cache hit.
[2023-03-10 21:59:40] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 35 ms returned sat
[2023-03-10 21:59:40] [INFO ] After 374ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 21:59:40] [INFO ] After 465ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 21:59:40] [INFO ] After 638ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 21:59:40] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 23 ms returned sat
[2023-03-10 21:59:41] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 21:59:41] [INFO ] After 324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-10 21:59:41] [INFO ] After 497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 87 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
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 308 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 144 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 132 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 126 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 371 reset in 296 ms.
Product exploration explored 100000 steps with 373 reset in 334 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 134 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 0 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 1 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 66 ms. Remains 59 /538 variables (removed 479) and now considering 74/541 (removed 467) transitions.
[2023-03-10 21:59:42] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-10 21:59:42] [INFO ] Flow matrix only has 73 transitions (discarded 1 similar events)
// Phase 1: matrix 73 rows 59 cols
[2023-03-10 21:59:42] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 21:59:43] [INFO ] Dead Transitions using invariants and state equation in 50 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 137 ms. Remains : 59/538 places, 74/541 transitions.
Built C files in :
/tmp/ltsmin29366794533038534
[2023-03-10 21:59:43] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin29366794533038534
Running compilation step : cd /tmp/ltsmin29366794533038534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1242 ms.
Running link step : cd /tmp/ltsmin29366794533038534;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin29366794533038534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11401537266594138308.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 15 ms. Remains 538 /538 variables (removed 0) and now considering 541/541 (removed 0) transitions.
// Phase 1: matrix 541 rows 538 cols
[2023-03-10 21:59:58] [INFO ] Computed 33 place invariants in 4 ms
[2023-03-10 21:59:58] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-10 21:59:58] [INFO ] Invariant cache hit.
[2023-03-10 21:59:59] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 988 ms to find 0 implicit places.
[2023-03-10 21:59:59] [INFO ] Invariant cache hit.
[2023-03-10 21:59:59] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1718 ms. Remains : 538/538 places, 541/541 transitions.
Built C files in :
/tmp/ltsmin14219298064388811746
[2023-03-10 21:59:59] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14219298064388811746
Running compilation step : cd /tmp/ltsmin14219298064388811746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1180 ms.
Running link step : cd /tmp/ltsmin14219298064388811746;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14219298064388811746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14173645189720997692.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 22:00:15] [INFO ] Flatten gal took : 21 ms
[2023-03-10 22:00:15] [INFO ] Flatten gal took : 19 ms
[2023-03-10 22:00:15] [INFO ] Time to serialize gal into /tmp/LTL17129133009531943681.gal : 4 ms
[2023-03-10 22:00:15] [INFO ] Time to serialize properties into /tmp/LTL17345902444739354405.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17129133009531943681.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4985798989411143729.hoa' '-atoms' '/tmp/LTL17345902444739354405.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17345902444739354405.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4985798989411143729.hoa
Detected timeout of ITS tools.
[2023-03-10 22:00:30] [INFO ] Flatten gal took : 32 ms
[2023-03-10 22:00:30] [INFO ] Flatten gal took : 29 ms
[2023-03-10 22:00:30] [INFO ] Time to serialize gal into /tmp/LTL15871322402470760662.gal : 7 ms
[2023-03-10 22:00:30] [INFO ] Time to serialize properties into /tmp/LTL17977535978837202342.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15871322402470760662.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17977535978837202342.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G(F("(((p296!=1)||(p625!=1))||(p640!=1))")))||((F("(((p296!=1)||(p625!=1))||(p640!=1))"))&&(X(F("((((p296!=1)||(p625!=1))||(p640!=...177
Formula 0 simplified : FG!"(((p296!=1)||(p625!=1))||(p640!=1))" & (G!"(((p296!=1)||(p625!=1))||(p640!=1))" | XG!"((((p296!=1)||(p625!=1))||(p640!=1))&&(p38...163
Detected timeout of ITS tools.
[2023-03-10 22:00:45] [INFO ] Flatten gal took : 29 ms
[2023-03-10 22:00:45] [INFO ] Applying decomposition
[2023-03-10 22:00:45] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16659835661604233052.txt' '-o' '/tmp/graph16659835661604233052.bin' '-w' '/tmp/graph16659835661604233052.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16659835661604233052.bin' '-l' '-1' '-v' '-w' '/tmp/graph16659835661604233052.weights' '-q' '0' '-e' '0.001'
[2023-03-10 22:00:45] [INFO ] Decomposing Gal with order
[2023-03-10 22:00:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 22:00:45] [INFO ] Removed a total of 167 redundant transitions.
[2023-03-10 22:00:45] [INFO ] Flatten gal took : 69 ms
[2023-03-10 22:00:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2023-03-10 22:00:45] [INFO ] Time to serialize gal into /tmp/LTL1483565739872643233.gal : 10 ms
[2023-03-10 22:00:45] [INFO ] Time to serialize properties into /tmp/LTL7657495387087768100.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1483565739872643233.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7657495387087768100.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G(F("(((i15.u106.p296!=1)||(i33.u222.p625!=1))||(i33.u225.p640!=1))")))||((F("(((i15.u106.p296!=1)||(i33.u222.p625!=1))||(i33.u225...267
Formula 0 simplified : FG!"(((i15.u106.p296!=1)||(i33.u222.p625!=1))||(i33.u225.p640!=1))" & (G!"(((i15.u106.p296!=1)||(i33.u222.p625!=1))||(i33.u225.p640!...253
Reverse transition relation is NOT exact ! Due to transitions t493, i1.i1.t358, i1.i1.i1.u79.t351, i2.t488, i2.u14.t478, i3.t472, i3.t465, i4.t458, i4.t451...940
Computing Next relation with stutter on 3.70604e+15 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1260167052114398829
[2023-03-10 22:01:00] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1260167052114398829
Running compilation step : cd /tmp/ltsmin1260167052114398829;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1261 ms.
Running link step : cd /tmp/ltsmin1260167052114398829;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1260167052114398829;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&X(<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-11 finished in 102079 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 44 ms. Remains 537 /551 variables (removed 14) and now considering 539/559 (removed 20) transitions.
// Phase 1: matrix 539 rows 537 cols
[2023-03-10 22:01:15] [INFO ] Computed 33 place invariants in 2 ms
[2023-03-10 22:01:15] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-10 22:01:15] [INFO ] Invariant cache hit.
[2023-03-10 22:01:16] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
[2023-03-10 22:01:16] [INFO ] Invariant cache hit.
[2023-03-10 22:01:17] [INFO ] Dead Transitions using invariants and state equation in 519 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 1380 ms. Remains : 537/551 places, 539/559 transitions.
Stuttering acceptance computed with spot in 189 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 265 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-12 finished in 1594 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 35 ms. Remains 536 /551 variables (removed 15) and now considering 538/559 (removed 21) transitions.
// Phase 1: matrix 538 rows 536 cols
[2023-03-10 22:01:17] [INFO ] Computed 33 place invariants in 3 ms
[2023-03-10 22:01:17] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-10 22:01:17] [INFO ] Invariant cache hit.
[2023-03-10 22:01:18] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
[2023-03-10 22:01:18] [INFO ] Invariant cache hit.
[2023-03-10 22:01:18] [INFO ] Dead Transitions using invariants and state equation in 398 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 1346 ms. Remains : 536/551 places, 538/559 transitions.
Stuttering acceptance computed with spot in 113 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 485 ms.
Product exploration explored 100000 steps with 33333 reset in 427 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.4 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 102 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 2496 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 36 ms. Remains 536 /551 variables (removed 15) and now considering 538/559 (removed 21) transitions.
[2023-03-10 22:01:19] [INFO ] Invariant cache hit.
[2023-03-10 22:01:20] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-10 22:01:20] [INFO ] Invariant cache hit.
[2023-03-10 22:01:20] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
[2023-03-10 22:01:20] [INFO ] Invariant cache hit.
[2023-03-10 22:01:21] [INFO ] Dead Transitions using invariants and state equation in 573 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 1411 ms. Remains : 536/551 places, 538/559 transitions.
Stuttering acceptance computed with spot in 392 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 584 reset in 183 ms.
Product exploration explored 100000 steps with 586 reset in 204 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 321 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 431 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 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 22:01:22] [INFO ] Invariant cache hit.
[2023-03-10 22:01:23] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 22:01:23] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 36 ms returned sat
[2023-03-10 22:01:23] [INFO ] After 618ms 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 441 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 45 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-10 22:01:24] [INFO ] Invariant cache hit.
[2023-03-10 22:01:24] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 18 ms returned sat
[2023-03-10 22:01:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:01:24] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2023-03-10 22:01:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:01:25] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 19 ms returned sat
[2023-03-10 22:01:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:01:25] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2023-03-10 22:01:25] [INFO ] Computed and/alt/rep : 532/698/532 causal constraints (skipped 5 transitions) in 36 ms.
[2023-03-10 22:01:32] [INFO ] Added : 520 causal constraints over 104 iterations in 6671 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.1 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 1 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 27 ms. Remains 13 /536 variables (removed 523) and now considering 18/538 (removed 520) transitions.
// Phase 1: matrix 18 rows 13 cols
[2023-03-10 22:01:32] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 22:01:32] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-10 22:01:32] [INFO ] Invariant cache hit.
[2023-03-10 22:01:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 22:01:32] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-10 22:01:32] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-10 22:01:32] [INFO ] Invariant cache hit.
[2023-03-10 22:01:32] [INFO ] Dead Transitions using invariants and state equation in 28 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 135 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 130 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 38 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
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 153 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 184 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-10 22:01:33] [INFO ] Invariant cache hit.
[2023-03-10 22:01:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:01:33] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-10 22:01:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 22:01:33] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-10 22:01:33] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 22:01:33] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 4 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-14 finished in 13443 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 56 ms. Remains 537 /551 variables (removed 14) and now considering 539/559 (removed 20) transitions.
// Phase 1: matrix 539 rows 537 cols
[2023-03-10 22:01:33] [INFO ] Computed 33 place invariants in 2 ms
[2023-03-10 22:01:33] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-10 22:01:33] [INFO ] Invariant cache hit.
[2023-03-10 22:01:34] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1104 ms to find 0 implicit places.
[2023-03-10 22:01:34] [INFO ] Invariant cache hit.
[2023-03-10 22:01:35] [INFO ] Dead Transitions using invariants and state equation in 705 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 1869 ms. Remains : 537/551 places, 539/559 transitions.
Stuttering acceptance computed with spot in 222 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 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-15 finished in 2118 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 205 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 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.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 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 0 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-10 22:01:35] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 12 cols
[2023-03-10 22:01:35] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 22:01:35] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 22:01:35] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-10 22:01:35] [INFO ] Invariant cache hit.
[2023-03-10 22:01:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 22:01:35] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-10 22:01:35] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-10 22:01:35] [INFO ] Invariant cache hit.
[2023-03-10 22:01:35] [INFO ] Dead Transitions using invariants and state equation in 34 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 135 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 12681 reset in 252 ms.
Product exploration explored 100000 steps with 12651 reset in 232 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 282 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 142 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Finished random walk after 128 steps, including 12 resets, run visited all 2 properties in 2 ms. (steps per millisecond=64 )
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 318 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 112 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 160 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-10 22:01:37] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-10 22:01:37] [INFO ] Invariant cache hit.
[2023-03-10 22:01:37] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 22:01:37] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-10 22:01:37] [INFO ] Invariant cache hit.
[2023-03-10 22:01:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 22:01:37] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-10 22:01:37] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-10 22:01:37] [INFO ] Invariant cache hit.
[2023-03-10 22:01:37] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 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 257 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 218 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Finished random walk after 18 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=9 )
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 340 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 152 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 131 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 126 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 12621 reset in 202 ms.
Product exploration explored 100000 steps with 12578 reset in 132 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 129 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 1 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-10 22:01:39] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-10 22:01:39] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-10 22:01:39] [INFO ] Invariant cache hit.
[2023-03-10 22:01:39] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58 ms. Remains : 12/12 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin11122737159102674635
[2023-03-10 22:01:39] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11122737159102674635
Running compilation step : cd /tmp/ltsmin11122737159102674635;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 160 ms.
Running link step : cd /tmp/ltsmin11122737159102674635;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11122737159102674635;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9197215901846507290.hoa' '--buchi-type=spotba'
LTSmin run took 962 ms.
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-11 finished in 5172 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-11 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2023-03-10 22:01:40] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6297853366000605970
[2023-03-10 22:01:40] [INFO ] Computing symmetric may disable matrix : 559 transitions.
[2023-03-10 22:01:40] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:01:40] [INFO ] Applying decomposition
[2023-03-10 22:01:40] [INFO ] Computing symmetric may enable matrix : 559 transitions.
[2023-03-10 22:01:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:01:40] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9358025852155830785.txt' '-o' '/tmp/graph9358025852155830785.bin' '-w' '/tmp/graph9358025852155830785.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9358025852155830785.bin' '-l' '-1' '-v' '-w' '/tmp/graph9358025852155830785.weights' '-q' '0' '-e' '0.001'
[2023-03-10 22:01:40] [INFO ] Decomposing Gal with order
[2023-03-10 22:01:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 22:01:40] [INFO ] Computing Do-Not-Accords matrix : 559 transitions.
[2023-03-10 22:01:40] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:01:40] [INFO ] Built C files in 140ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6297853366000605970
Running compilation step : cd /tmp/ltsmin6297853366000605970;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-10 22:01:40] [INFO ] Removed a total of 164 redundant transitions.
[2023-03-10 22:01:40] [INFO ] Flatten gal took : 58 ms
[2023-03-10 22:01:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2023-03-10 22:01:40] [INFO ] Time to serialize gal into /tmp/LTLFireability9068708557556597068.gal : 9 ms
[2023-03-10 22:01:40] [INFO ] Time to serialize properties into /tmp/LTLFireability973236796514767964.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9068708557556597068.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability973236796514767964.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((X(X(("((i11.u78.p214==0)||(i31.u209.p579==0))")||(G("(i23.u163.p443==0)")))))&&(F("(i15.u110.p298==1)")))))
Formula 0 simplified : X(XX(!"((i11.u78.p214==0)||(i31.u209.p579==0))" & F!"(i23.u163.p443==0)") | G!"(i15.u110.p298==1)")
Compilation finished in 2082 ms.
Running link step : cd /tmp/ltsmin6297853366000605970;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin6297853366000605970;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X(([]((LTLAPp1==true))||(LTLAPp0==true))))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t4, t493, i1.t386, i1.t379, i2.t488, i2.u20.t478, i3.t472, i3.t465, i4.i1.t458, i4.i1.i1.u33....941
Computing Next relation with stutter on 3.70604e+15 deadlock states
6 unique states visited
4 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
620 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.31341,152136,1,0,297704,366,5516,262671,197,996,989155
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 277352 ms.

BK_STOP 1678485715271

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-32b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
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 r197-smll-167840343800124"
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 ;