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

About the Execution of LoLa+red for GPUForwardProgress-PT-08b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
437.831 31562.00 58738.00 687.20 FFFTFFFTFFTFFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r199-smll-167840345400028.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 lolaxred
Input is GPUForwardProgress-PT-08b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840345400028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 14:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 14:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 14:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 14:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 25 14:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 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 46K 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-08b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678464742103

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-08b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 16:12:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 16:12:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:12:26] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2023-03-10 16:12:26] [INFO ] Transformed 188 places.
[2023-03-10 16:12:26] [INFO ] Transformed 197 transitions.
[2023-03-10 16:12:26] [INFO ] Found NUPN structural information;
[2023-03-10 16:12:26] [INFO ] Parsed PT model containing 188 places and 197 transitions and 477 arcs in 273 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 197/197 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 197
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 169 transition count 179
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 169 transition count 179
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 164 transition count 174
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 164 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 51 place count 164 transition count 170
Applied a total of 51 rules in 100 ms. Remains 164 /188 variables (removed 24) and now considering 170/197 (removed 27) transitions.
// Phase 1: matrix 170 rows 164 cols
[2023-03-10 16:12:26] [INFO ] Computed 9 place invariants in 16 ms
[2023-03-10 16:12:26] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-10 16:12:26] [INFO ] Invariant cache hit.
[2023-03-10 16:12:27] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2023-03-10 16:12:27] [INFO ] Invariant cache hit.
[2023-03-10 16:12:27] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 164/188 places, 170/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1157 ms. Remains : 164/188 places, 170/197 transitions.
Support contains 31 out of 164 places after structural reductions.
[2023-03-10 16:12:27] [INFO ] Flatten gal took : 81 ms
[2023-03-10 16:12:28] [INFO ] Flatten gal took : 30 ms
[2023-03-10 16:12:28] [INFO ] Input system was already deterministic with 170 transitions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 725 ms. (steps per millisecond=13 ) properties (out of 27) seen :24
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 16:12:29] [INFO ] Invariant cache hit.
[2023-03-10 16:12:29] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-10 16:12:29] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 8 ms returned sat
[2023-03-10 16:12:29] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-10 16:12:29] [INFO ] After 241ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-10 16:12:29] [INFO ] After 415ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 95 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=23 )
Parikh walk visited 2 properties in 6 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 31 stabilizing places and 31 stable transitions
Graph (complete) has 251 edges and 164 vertex of which 152 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 157 transition count 163
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 157 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 157 transition count 161
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 154 transition count 158
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 154 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 154 transition count 157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 153 transition count 156
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 153 transition count 156
Applied a total of 25 rules in 32 ms. Remains 153 /164 variables (removed 11) and now considering 156/170 (removed 14) transitions.
// Phase 1: matrix 156 rows 153 cols
[2023-03-10 16:12:30] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-10 16:12:30] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-10 16:12:30] [INFO ] Invariant cache hit.
[2023-03-10 16:12:30] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2023-03-10 16:12:30] [INFO ] Invariant cache hit.
[2023-03-10 16:12:30] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/164 places, 156/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 624 ms. Remains : 153/164 places, 156/170 transitions.
Stuttering acceptance computed with spot in 432 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-00 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}]], initial=1, aps=[p1:(EQ s138 0), p0:(EQ s116 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1298 reset in 679 ms.
Stack based approach found an accepted trace after 1818 steps with 23 reset with depth 99 and stack size 99 in 5 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-00 finished in 1850 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&&F(!p0)) U G(p1)))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Graph (trivial) has 138 edges and 164 vertex of which 6 / 164 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 245 edges and 159 vertex of which 147 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 146 transition count 92
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 75 rules applied. Total rules applied 145 place count 78 transition count 85
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 150 place count 75 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 152 place count 73 transition count 83
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 152 place count 73 transition count 65
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 188 place count 55 transition count 65
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 197 place count 46 transition count 56
Iterating global reduction 4 with 9 rules applied. Total rules applied 206 place count 46 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 206 place count 46 transition count 55
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 208 place count 45 transition count 55
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 260 place count 19 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 19 transition count 28
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 267 place count 13 transition count 17
Iterating global reduction 5 with 6 rules applied. Total rules applied 273 place count 13 transition count 17
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 5 with 2 rules applied. Total rules applied 275 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 276 place count 11 transition count 15
Applied a total of 276 rules in 41 ms. Remains 11 /164 variables (removed 153) and now considering 15/170 (removed 155) transitions.
// Phase 1: matrix 15 rows 11 cols
[2023-03-10 16:12:31] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 16:12:31] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-10 16:12:31] [INFO ] Invariant cache hit.
[2023-03-10 16:12:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:12:32] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-10 16:12:32] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-10 16:12:32] [INFO ] Invariant cache hit.
[2023-03-10 16:12:32] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/164 places, 15/170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163 ms. Remains : 11/164 places, 15/170 transitions.
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p1), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(AND (EQ s4 1) (EQ s7 1)), p0:(NEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], 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-08b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-01 finished in 450 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 U G((p1&&X(p1))))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 157 transition count 163
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 157 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 157 transition count 161
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 154 transition count 158
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 154 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 154 transition count 157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 153 transition count 156
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 153 transition count 156
Applied a total of 25 rules in 40 ms. Remains 153 /164 variables (removed 11) and now considering 156/170 (removed 14) transitions.
// Phase 1: matrix 156 rows 153 cols
[2023-03-10 16:12:32] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-10 16:12:32] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-10 16:12:32] [INFO ] Invariant cache hit.
[2023-03-10 16:12:33] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2023-03-10 16:12:33] [INFO ] Invariant cache hit.
[2023-03-10 16:12:33] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/164 places, 156/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 930 ms. Remains : 153/164 places, 156/170 transitions.
Stuttering acceptance computed with spot in 353 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p1:(NEQ s33 1), p0:(NEQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25103 reset in 367 ms.
Product exploration explored 100000 steps with 25004 reset in 673 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 237 edges and 153 vertex of which 141 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 531 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 125 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 16:12:35] [INFO ] Invariant cache hit.
[2023-03-10 16:12:35] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 14 ms returned sat
[2023-03-10 16:12:35] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 1030 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 272 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2023-03-10 16:12:37] [INFO ] Invariant cache hit.
[2023-03-10 16:12:37] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-10 16:12:37] [INFO ] Invariant cache hit.
[2023-03-10 16:12:37] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-10 16:12:37] [INFO ] Invariant cache hit.
[2023-03-10 16:12:37] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 552 ms. Remains : 153/153 places, 156/156 transitions.
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 237 edges and 153 vertex of which 141 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X p1), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 456 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Finished random walk after 3500 steps, including 42 resets, run visited all 3 properties in 85 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X p1), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 541 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 273 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 24938 reset in 238 ms.
Product exploration explored 100000 steps with 25050 reset in 320 ms.
Applying partial POR strategy [false, false, true, true, false]
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 156/156 transitions.
Graph (trivial) has 126 edges and 153 vertex of which 6 / 153 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 231 edges and 148 vertex of which 136 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 136 transition count 147
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 67 place count 136 transition count 150
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 78 place count 136 transition count 150
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 124 place count 90 transition count 104
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 170 place count 90 transition count 104
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 177 place count 83 transition count 97
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 184 place count 83 transition count 97
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 59 places in 1 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 213 place count 83 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 215 place count 83 transition count 96
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 237 place count 61 transition count 73
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 259 place count 61 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 260 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 60 transition count 72
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 60 transition count 72
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 270 place count 60 transition count 96
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 285 place count 45 transition count 66
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 300 place count 45 transition count 66
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 318 place count 27 transition count 36
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 336 place count 27 transition count 36
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 336 rules in 64 ms. Remains 27 /153 variables (removed 126) and now considering 36/156 (removed 120) transitions.
[2023-03-10 16:12:41] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 36 rows 27 cols
[2023-03-10 16:12:41] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-10 16:12:41] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/153 places, 36/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 27/153 places, 36/156 transitions.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 156/156 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 153 cols
[2023-03-10 16:12:41] [INFO ] Computed 9 place invariants in 7 ms
[2023-03-10 16:12:41] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-10 16:12:41] [INFO ] Invariant cache hit.
[2023-03-10 16:12:41] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-10 16:12:41] [INFO ] Invariant cache hit.
[2023-03-10 16:12:42] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 539 ms. Remains : 153/153 places, 156/156 transitions.
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-02 finished in 9819 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(G((p0||X(p0)))))&&F(p1)))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 157 transition count 163
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 157 transition count 163
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 157 transition count 160
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 154 transition count 157
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 154 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 154 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 153 transition count 155
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 153 transition count 155
Applied a total of 26 rules in 20 ms. Remains 153 /164 variables (removed 11) and now considering 155/170 (removed 15) transitions.
// Phase 1: matrix 155 rows 153 cols
[2023-03-10 16:12:42] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-10 16:12:42] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-10 16:12:42] [INFO ] Invariant cache hit.
[2023-03-10 16:12:42] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2023-03-10 16:12:42] [INFO ] Invariant cache hit.
[2023-03-10 16:12:42] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/164 places, 155/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 467 ms. Remains : 153/164 places, 155/170 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s128 1), p0:(EQ s94 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-04 finished in 772 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))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Graph (trivial) has 138 edges and 164 vertex of which 6 / 164 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 245 edges and 159 vertex of which 147 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 146 transition count 92
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 75 rules applied. Total rules applied 145 place count 78 transition count 85
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 150 place count 75 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 152 place count 73 transition count 83
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 152 place count 73 transition count 64
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 190 place count 54 transition count 64
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 198 place count 46 transition count 56
Iterating global reduction 4 with 8 rules applied. Total rules applied 206 place count 46 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 206 place count 46 transition count 55
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 208 place count 45 transition count 55
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 260 place count 19 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 19 transition count 28
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 267 place count 13 transition count 17
Iterating global reduction 5 with 6 rules applied. Total rules applied 273 place count 13 transition count 17
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 5 with 2 rules applied. Total rules applied 275 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 276 place count 11 transition count 15
Applied a total of 276 rules in 33 ms. Remains 11 /164 variables (removed 153) and now considering 15/170 (removed 155) transitions.
// Phase 1: matrix 15 rows 11 cols
[2023-03-10 16:12:42] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 16:12:42] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-10 16:12:43] [INFO ] Invariant cache hit.
[2023-03-10 16:12:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:12:43] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-10 16:12:43] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-10 16:12:43] [INFO ] Invariant cache hit.
[2023-03-10 16:12:43] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/164 places, 15/170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163 ms. Remains : 11/164 places, 15/170 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s6 0) (EQ s4 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 66 steps with 3 reset in 1 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-05 finished in 250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(p1))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 157 transition count 163
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 157 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 157 transition count 161
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 154 transition count 158
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 154 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 154 transition count 157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 153 transition count 156
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 153 transition count 156
Applied a total of 25 rules in 24 ms. Remains 153 /164 variables (removed 11) and now considering 156/170 (removed 14) transitions.
// Phase 1: matrix 156 rows 153 cols
[2023-03-10 16:12:43] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-10 16:12:43] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-10 16:12:43] [INFO ] Invariant cache hit.
[2023-03-10 16:12:43] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-10 16:12:43] [INFO ] Invariant cache hit.
[2023-03-10 16:12:43] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/164 places, 156/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 561 ms. Remains : 153/164 places, 156/170 transitions.
Stuttering acceptance computed with spot in 376 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-06 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: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s34 1), p1:(AND (EQ s81 1) (EQ s116 1))], nbAcceptance=0, 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 1465 reset in 259 ms.
Product exploration explored 100000 steps with 1471 reset in 318 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 237 edges and 153 vertex of which 141 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 128 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :2
Finished Best-First random walk after 7765 steps, including 16 resets, run visited all 1 properties in 5 ms. (steps per millisecond=1553 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 4 factoid took 318 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 428 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2023-03-10 16:12:46] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 4 factoid took 213 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-08b-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-06 finished in 3423 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||G(F(p1)))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 158 transition count 164
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 158 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 158 transition count 162
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 155 transition count 159
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 155 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 155 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 154 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 154 transition count 157
Applied a total of 23 rules in 19 ms. Remains 154 /164 variables (removed 10) and now considering 157/170 (removed 13) transitions.
// Phase 1: matrix 157 rows 154 cols
[2023-03-10 16:12:46] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-10 16:12:46] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-10 16:12:46] [INFO ] Invariant cache hit.
[2023-03-10 16:12:46] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2023-03-10 16:12:46] [INFO ] Invariant cache hit.
[2023-03-10 16:12:47] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/164 places, 157/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 522 ms. Remains : 154/164 places, 157/170 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s92 0), p1:(EQ s87 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 293 ms.
Product exploration explored 100000 steps with 50000 reset in 315 ms.
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 238 edges and 154 vertex of which 142 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Computed a total of 28 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 140 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-08b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-07 finished in 1504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 158 transition count 164
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 158 transition count 164
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 158 transition count 161
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 157 transition count 160
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 157 transition count 160
Applied a total of 17 rules in 13 ms. Remains 157 /164 variables (removed 7) and now considering 160/170 (removed 10) transitions.
// Phase 1: matrix 160 rows 157 cols
[2023-03-10 16:12:48] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-10 16:12:48] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-10 16:12:48] [INFO ] Invariant cache hit.
[2023-03-10 16:12:48] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2023-03-10 16:12:48] [INFO ] Invariant cache hit.
[2023-03-10 16:12:48] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 157/164 places, 160/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 518 ms. Remains : 157/164 places, 160/170 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s16 1), p1:(AND (OR (AND (EQ s133 0) (EQ s62 0)) (EQ s16 1)) (EQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-08 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' '!(F((p0||(G(p1) U X(p0)))))'
Support contains 3 out of 164 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 : 164/164 places, 170/170 transitions.
Graph (trivial) has 136 edges and 164 vertex of which 6 / 164 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 245 edges and 159 vertex of which 147 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 146 transition count 92
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 75 rules applied. Total rules applied 145 place count 78 transition count 85
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 149 place count 75 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 150 place count 74 transition count 84
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 150 place count 74 transition count 65
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 188 place count 55 transition count 65
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 195 place count 48 transition count 58
Iterating global reduction 4 with 7 rules applied. Total rules applied 202 place count 48 transition count 58
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 254 place count 22 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 255 place count 22 transition count 31
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 261 place count 16 transition count 20
Iterating global reduction 5 with 6 rules applied. Total rules applied 267 place count 16 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 271 place count 14 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 272 place count 13 transition count 18
Applied a total of 272 rules in 30 ms. Remains 13 /164 variables (removed 151) and now considering 18/170 (removed 152) transitions.
[2023-03-10 16:12:48] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 13 cols
[2023-03-10 16:12:48] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 16:12:48] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-10 16:12:48] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-10 16:12:48] [INFO ] Invariant cache hit.
[2023-03-10 16:12:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:12:48] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-10 16:12:48] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-10 16:12:48] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-10 16:12:48] [INFO ] Invariant cache hit.
[2023-03-10 16:12:48] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/164 places, 18/170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 13/164 places, 18/170 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s10 1) (EQ s12 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 4 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-09 finished in 241 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) U (p1&&G(p2)))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Graph (trivial) has 139 edges and 164 vertex of which 6 / 164 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 245 edges and 159 vertex of which 147 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 146 transition count 90
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 77 rules applied. Total rules applied 149 place count 76 transition count 83
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 153 place count 73 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 72 transition count 82
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 154 place count 72 transition count 63
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 192 place count 53 transition count 63
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 200 place count 45 transition count 55
Iterating global reduction 4 with 8 rules applied. Total rules applied 208 place count 45 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 208 place count 45 transition count 54
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 210 place count 44 transition count 54
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 256 place count 21 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 257 place count 21 transition count 30
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 265 place count 13 transition count 15
Iterating global reduction 5 with 8 rules applied. Total rules applied 273 place count 13 transition count 15
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 5 with 2 rules applied. Total rules applied 275 place count 12 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 276 place count 11 transition count 13
Applied a total of 276 rules in 29 ms. Remains 11 /164 variables (removed 153) and now considering 13/170 (removed 157) transitions.
// Phase 1: matrix 13 rows 11 cols
[2023-03-10 16:12:49] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 16:12:49] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-10 16:12:49] [INFO ] Invariant cache hit.
[2023-03-10 16:12:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:12:49] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-10 16:12:49] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-10 16:12:49] [INFO ] Invariant cache hit.
[2023-03-10 16:12:49] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/164 places, 13/170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 155 ms. Remains : 11/164 places, 13/170 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s8 1), p0:(NEQ s1 1), p2:(EQ s5 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 3 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-11 finished in 419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 156 transition count 162
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 156 transition count 162
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 156 transition count 159
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 153 transition count 156
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 153 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 153 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 152 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 152 transition count 154
Applied a total of 28 rules in 13 ms. Remains 152 /164 variables (removed 12) and now considering 154/170 (removed 16) transitions.
// Phase 1: matrix 154 rows 152 cols
[2023-03-10 16:12:49] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-10 16:12:49] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-10 16:12:49] [INFO ] Invariant cache hit.
[2023-03-10 16:12:49] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-03-10 16:12:49] [INFO ] Invariant cache hit.
[2023-03-10 16:12:50] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 152/164 places, 154/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 532 ms. Remains : 152/164 places, 154/170 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s76 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3130 steps with 41 reset in 13 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-14 finished in 683 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(F((p0||G(p1))))||(F((p0||G(p1)))&&F(p2)))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 156 transition count 162
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 156 transition count 162
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 156 transition count 159
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 153 transition count 156
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 153 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 153 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 152 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 152 transition count 154
Applied a total of 28 rules in 12 ms. Remains 152 /164 variables (removed 12) and now considering 154/170 (removed 16) transitions.
[2023-03-10 16:12:50] [INFO ] Invariant cache hit.
[2023-03-10 16:12:50] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-10 16:12:50] [INFO ] Invariant cache hit.
[2023-03-10 16:12:50] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2023-03-10 16:12:50] [INFO ] Invariant cache hit.
[2023-03-10 16:12:50] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 152/164 places, 154/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 532 ms. Remains : 152/164 places, 154/170 transitions.
Stuttering acceptance computed with spot in 427 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(NEQ s95 1), p1:(NEQ s30 1), p2:(NEQ s138 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]]
Product exploration explored 100000 steps with 50000 reset in 302 ms.
Product exploration explored 100000 steps with 50000 reset in 306 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 235 edges and 152 vertex of which 140 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Computed a total of 27 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 8 factoid took 229 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-08b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-15 finished in 1839 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 U G((p1&&X(p1))))))'
Found a Lengthening insensitive property : GPUForwardProgress-PT-08b-LTLFireability-02
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Graph (trivial) has 140 edges and 164 vertex of which 6 / 164 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 245 edges and 159 vertex of which 147 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 146 transition count 89
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 76 rules applied. Total rules applied 149 place count 75 transition count 84
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 152 place count 73 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 153 place count 72 transition count 83
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 153 place count 72 transition count 64
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 191 place count 53 transition count 64
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 199 place count 45 transition count 56
Iterating global reduction 4 with 8 rules applied. Total rules applied 207 place count 45 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 207 place count 45 transition count 55
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 209 place count 44 transition count 55
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 261 place count 18 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 262 place count 18 transition count 28
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 269 place count 11 transition count 15
Iterating global reduction 5 with 7 rules applied. Total rules applied 276 place count 11 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 280 place count 9 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 281 place count 8 transition count 13
Applied a total of 281 rules in 17 ms. Remains 8 /164 variables (removed 156) and now considering 13/170 (removed 157) transitions.
// Phase 1: matrix 13 rows 8 cols
[2023-03-10 16:12:52] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-10 16:12:52] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-10 16:12:52] [INFO ] Invariant cache hit.
[2023-03-10 16:12:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:12:52] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-10 16:12:52] [INFO ] Invariant cache hit.
[2023-03-10 16:12:52] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 8/164 places, 13/170 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 123 ms. Remains : 8/164 places, 13/170 transitions.
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p1:(NEQ s4 1), p0:(NEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 1 reset in 0 ms.
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-02 finished in 514 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-02 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-10 16:12:52] [INFO ] Flatten gal took : 21 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 26688 ms.
ITS solved all properties within timeout

BK_STOP 1678464773665

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-08b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is GPUForwardProgress-PT-08b, 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 r199-smll-167840345400028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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