About the Execution of LoLa+red for GPUForwardProgress-PT-40a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 357.880 | 48888.00 | 73888.00 | 899.10 | FFFTFFFTTFTFFFTF | 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-167840345600148.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-40a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840345600148
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.8K Feb 25 14:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 14:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 14:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 14:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 14:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 14:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 62K 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-40a-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-40a-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-40a-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-40a-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-40a-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-40a-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-40a-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-40a-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-40a-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-40a-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-40a-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-40a-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-40a-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-40a-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-40a-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-40a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678484688224
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-40a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 21:44:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 21:44:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 21:44:52] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2023-03-10 21:44:52] [INFO ] Transformed 168 places.
[2023-03-10 21:44:52] [INFO ] Transformed 209 transitions.
[2023-03-10 21:44:52] [INFO ] Found NUPN structural information;
[2023-03-10 21:44:52] [INFO ] Parsed PT model containing 168 places and 209 transitions and 821 arcs in 307 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 4 formulas.
Ensure Unique test removed 42 transitions
Reduce redundant transitions removed 42 transitions.
FORMULA GPUForwardProgress-PT-40a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40a-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 167/167 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 167 transition count 167
Applied a total of 1 rules in 41 ms. Remains 167 /168 variables (removed 1) and now considering 167/167 (removed 0) transitions.
// Phase 1: matrix 167 rows 167 cols
[2023-03-10 21:44:52] [INFO ] Computed 41 place invariants in 17 ms
[2023-03-10 21:44:53] [INFO ] Implicit Places using invariants in 601 ms returned []
[2023-03-10 21:44:53] [INFO ] Invariant cache hit.
[2023-03-10 21:44:53] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 21:44:54] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 1213 ms to find 0 implicit places.
[2023-03-10 21:44:54] [INFO ] Invariant cache hit.
[2023-03-10 21:44:54] [INFO ] Dead Transitions using invariants and state equation in 310 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 167/168 places, 167/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1567 ms. Remains : 167/168 places, 167/167 transitions.
Support contains 28 out of 167 places after structural reductions.
[2023-03-10 21:44:54] [INFO ] Flatten gal took : 100 ms
[2023-03-10 21:44:54] [INFO ] Flatten gal took : 46 ms
[2023-03-10 21:44:54] [INFO ] Input system was already deterministic with 167 transitions.
Support contains 27 out of 167 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 24) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 21:44:55] [INFO ] Invariant cache hit.
[2023-03-10 21:44:55] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-10 21:44:55] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 21:44:55] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 12 ms returned sat
[2023-03-10 21:44:56] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 21:44:56] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 21:44:56] [INFO ] After 89ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 21:44:56] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-10 21:44:56] [INFO ] After 470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 54 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 7 ms.
FORMULA GPUForwardProgress-PT-40a-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 536 edges and 167 vertex of which 126 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.10 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||G(p1)||G(p2)))))'
Support contains 5 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Graph (complete) has 536 edges and 167 vertex of which 126 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.3 ms
Discarding 41 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 1 place count 126 transition count 128
Deduced a syphon composed of 38 places in 11 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 77 place count 88 transition count 128
Applied a total of 77 rules in 64 ms. Remains 88 /167 variables (removed 79) and now considering 128/167 (removed 39) transitions.
// Phase 1: matrix 128 rows 88 cols
[2023-03-10 21:44:56] [INFO ] Computed 1 place invariants in 5 ms
[2023-03-10 21:44:56] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-10 21:44:57] [INFO ] Invariant cache hit.
[2023-03-10 21:44:57] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 21:44:57] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2023-03-10 21:44:57] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-10 21:44:57] [INFO ] Invariant cache hit.
[2023-03-10 21:44:57] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/167 places, 128/167 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 652 ms. Remains : 88/167 places, 128/167 transitions.
Stuttering acceptance computed with spot in 323 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-40a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s21 0) (EQ s84 0) (EQ s87 0)), p0:(EQ s71 0), p2:(OR (EQ s67 0) (EQ s84 0) (EQ s87 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 217 reset in 1075 ms.
Product exploration explored 100000 steps with 201 reset in 1285 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2))))]
Knowledge based reduction with 8 factoid took 504 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 16 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 21:45:01] [INFO ] Invariant cache hit.
[2023-03-10 21:45:01] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-10 21:45:01] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:45:01] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 21:45:01] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 21:45:01] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 21:45:01] [INFO ] After 51ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 21:45:01] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-10 21:45:01] [INFO ] After 356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 50 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=16 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 8 factoid took 802 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 128/128 transitions.
Applied a total of 0 rules in 19 ms. Remains 88 /88 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-10 21:45:02] [INFO ] Invariant cache hit.
[2023-03-10 21:45:02] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-10 21:45:02] [INFO ] Invariant cache hit.
[2023-03-10 21:45:03] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 21:45:03] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2023-03-10 21:45:03] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-10 21:45:03] [INFO ] Invariant cache hit.
[2023-03-10 21:45:03] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 540 ms. Remains : 88/88 places, 128/128 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2))))]
Knowledge based reduction with 8 factoid took 570 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 21:45:04] [INFO ] Invariant cache hit.
[2023-03-10 21:45:04] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 21:45:04] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:45:04] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 21:45:04] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 21:45:04] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 21:45:04] [INFO ] After 35ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 21:45:04] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-10 21:45:04] [INFO ] After 279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 93 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=23 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 8 factoid took 764 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 217 reset in 1037 ms.
Stack based approach found an accepted trace after 48699 steps with 108 reset with depth 465 and stack size 175 in 323 ms.
FORMULA GPUForwardProgress-PT-40a-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property GPUForwardProgress-PT-40a-LTLFireability-00 finished in 10582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Applied a total of 0 rules in 12 ms. Remains 167 /167 variables (removed 0) and now considering 167/167 (removed 0) transitions.
// Phase 1: matrix 167 rows 167 cols
[2023-03-10 21:45:07] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-10 21:45:07] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-10 21:45:07] [INFO ] Invariant cache hit.
[2023-03-10 21:45:07] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 21:45:07] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2023-03-10 21:45:07] [INFO ] Invariant cache hit.
[2023-03-10 21:45:07] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 765 ms. Remains : 167/167 places, 167/167 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s112 1) (EQ s162 1) (EQ s166 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1012 ms.
Product exploration explored 100000 steps with 50000 reset in 688 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 536 edges and 167 vertex of which 126 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-40a-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-40a-LTLFireability-03 finished in 2652 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 G(p1))&&X(G(p1))))'
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Applied a total of 0 rules in 12 ms. Remains 167 /167 variables (removed 0) and now considering 167/167 (removed 0) transitions.
[2023-03-10 21:45:09] [INFO ] Invariant cache hit.
[2023-03-10 21:45:10] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-10 21:45:10] [INFO ] Invariant cache hit.
[2023-03-10 21:45:10] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 21:45:10] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2023-03-10 21:45:10] [INFO ] Invariant cache hit.
[2023-03-10 21:45:10] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 727 ms. Remains : 167/167 places, 167/167 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-40a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s150 1) (EQ s162 1) (EQ s166 1)), p0:(EQ s70 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40a-LTLFireability-04 finished in 958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Graph (complete) has 536 edges and 167 vertex of which 126 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Discarding 41 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 1 place count 125 transition count 127
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 77 place count 87 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 79 place count 86 transition count 126
Applied a total of 79 rules in 32 ms. Remains 86 /167 variables (removed 81) and now considering 126/167 (removed 41) transitions.
// Phase 1: matrix 126 rows 86 cols
[2023-03-10 21:45:10] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-10 21:45:10] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-10 21:45:10] [INFO ] Invariant cache hit.
[2023-03-10 21:45:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 21:45:11] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-10 21:45:11] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-10 21:45:11] [INFO ] Invariant cache hit.
[2023-03-10 21:45:11] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/167 places, 126/167 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 545 ms. Remains : 86/167 places, 126/167 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s24 1) (NEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-40a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40a-LTLFireability-05 finished in 616 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))))'
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Applied a total of 0 rules in 5 ms. Remains 167 /167 variables (removed 0) and now considering 167/167 (removed 0) transitions.
// Phase 1: matrix 167 rows 167 cols
[2023-03-10 21:45:11] [INFO ] Computed 41 place invariants in 5 ms
[2023-03-10 21:45:11] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-10 21:45:11] [INFO ] Invariant cache hit.
[2023-03-10 21:45:11] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 21:45:12] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
[2023-03-10 21:45:12] [INFO ] Invariant cache hit.
[2023-03-10 21:45:12] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 973 ms. Remains : 167/167 places, 167/167 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40a-LTLFireability-06 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s108 1) (EQ s162 1) (EQ s166 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40a-LTLFireability-06 finished in 1154 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)||F(p1)))'
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Applied a total of 0 rules in 3 ms. Remains 167 /167 variables (removed 0) and now considering 167/167 (removed 0) transitions.
[2023-03-10 21:45:12] [INFO ] Invariant cache hit.
[2023-03-10 21:45:12] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-10 21:45:12] [INFO ] Invariant cache hit.
[2023-03-10 21:45:13] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 21:45:13] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
[2023-03-10 21:45:13] [INFO ] Invariant cache hit.
[2023-03-10 21:45:13] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 986 ms. Remains : 167/167 places, 167/167 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-40a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s43 1), p0:(EQ s15 0)], 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]]
Product exploration explored 100000 steps with 50000 reset in 985 ms.
Product exploration explored 100000 steps with 50000 reset in 733 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 536 edges and 167 vertex of which 126 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-40a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-40a-LTLFireability-08 finished in 2987 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)&&(X(F((p2&&F(!p2))))||p1))))'
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Graph (complete) has 536 edges and 167 vertex of which 126 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Discarding 41 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 1 place count 126 transition count 126
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 81 place count 86 transition count 126
Applied a total of 81 rules in 14 ms. Remains 86 /167 variables (removed 81) and now considering 126/167 (removed 41) transitions.
// Phase 1: matrix 126 rows 86 cols
[2023-03-10 21:45:15] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-10 21:45:15] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-10 21:45:15] [INFO ] Invariant cache hit.
[2023-03-10 21:45:15] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 21:45:15] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-10 21:45:15] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-10 21:45:15] [INFO ] Invariant cache hit.
[2023-03-10 21:45:16] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/167 places, 126/167 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 400 ms. Remains : 86/167 places, 126/167 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), true, p2]
Running random walk in product with property : GPUForwardProgress-PT-40a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 3}], [{ cond=p2, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s56 1) (EQ s82 1) (EQ s85 1)), p1:(OR (NEQ s66 1) (NEQ s82 1) (NEQ s85 1)), p2:(OR (NEQ s66 1) (NEQ s82 1) (NEQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40a-LTLFireability-09 finished in 651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||(p2 U (p3||G(p2))))))'
Support contains 6 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Graph (complete) has 536 edges and 167 vertex of which 126 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.3 ms
Discarding 41 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 1 place count 126 transition count 129
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 0 with 74 rules applied. Total rules applied 75 place count 89 transition count 129
Applied a total of 75 rules in 20 ms. Remains 89 /167 variables (removed 78) and now considering 129/167 (removed 38) transitions.
// Phase 1: matrix 129 rows 89 cols
[2023-03-10 21:45:16] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-10 21:45:16] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-10 21:45:16] [INFO ] Invariant cache hit.
[2023-03-10 21:45:16] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 21:45:16] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-10 21:45:16] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 21:45:16] [INFO ] Invariant cache hit.
[2023-03-10 21:45:16] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/167 places, 129/167 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 520 ms. Remains : 89/167 places, 129/167 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-40a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p3) p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3) p2 p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={2} source=0 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s66 0) (EQ s85 0) (EQ s88 0)), p3:(AND (EQ s10 1) (NEQ s30 1)), p2:(NEQ s30 1), p1:(EQ s79 0)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 635 reset in 1015 ms.
Stack based approach found an accepted trace after 458 steps with 4 reset with depth 157 and stack size 65 in 4 ms.
FORMULA GPUForwardProgress-PT-40a-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property GPUForwardProgress-PT-40a-LTLFireability-11 finished in 1645 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 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Applied a total of 0 rules in 3 ms. Remains 167 /167 variables (removed 0) and now considering 167/167 (removed 0) transitions.
// Phase 1: matrix 167 rows 167 cols
[2023-03-10 21:45:17] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-10 21:45:18] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-10 21:45:18] [INFO ] Invariant cache hit.
[2023-03-10 21:45:18] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 21:45:18] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2023-03-10 21:45:18] [INFO ] Invariant cache hit.
[2023-03-10 21:45:18] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 940 ms. Remains : 167/167 places, 167/167 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40a-LTLFireability-13 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:(OR (EQ s31 0) (EQ s50 0) (EQ s162 0) (EQ s166 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 7927 steps with 12 reset in 82 ms.
FORMULA GPUForwardProgress-PT-40a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40a-LTLFireability-13 finished in 1193 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)||X(F((p0&&F(p2)))))))'
Support contains 2 out of 167 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 : 167/167 places, 167/167 transitions.
Graph (complete) has 536 edges and 167 vertex of which 126 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.3 ms
Discarding 41 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 1 place count 126 transition count 128
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 77 place count 88 transition count 128
Applied a total of 77 rules in 23 ms. Remains 88 /167 variables (removed 79) and now considering 128/167 (removed 39) transitions.
// Phase 1: matrix 128 rows 88 cols
[2023-03-10 21:45:19] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-10 21:45:19] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-10 21:45:19] [INFO ] Invariant cache hit.
[2023-03-10 21:45:19] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 21:45:19] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-10 21:45:19] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 21:45:19] [INFO ] Invariant cache hit.
[2023-03-10 21:45:19] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/167 places, 128/167 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 509 ms. Remains : 88/167 places, 128/167 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-40a-LTLFireability-14 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}]], initial=0, aps=[p1:(EQ s68 1), p0:(EQ s83 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33333 reset in 1427 ms.
Product exploration explored 100000 steps with 33333 reset in 832 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 135 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 366 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-10 21:45:22] [INFO ] Invariant cache hit.
[2023-03-10 21:45:22] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 21:45:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:45:22] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-10 21:45:22] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 21:45:22] [INFO ] [Real]Added 41 Read/Feed constraints in 7 ms returned sat
[2023-03-10 21:45:22] [INFO ] Computed and/alt/rep : 122/562/122 causal constraints (skipped 5 transitions) in 21 ms.
[2023-03-10 21:45:23] [INFO ] Added : 0 causal constraints over 0 iterations in 47 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 88 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 : 88/88 places, 128/128 transitions.
Applied a total of 0 rules in 11 ms. Remains 88 /88 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-10 21:45:23] [INFO ] Invariant cache hit.
[2023-03-10 21:45:23] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-10 21:45:23] [INFO ] Invariant cache hit.
[2023-03-10 21:45:23] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 21:45:23] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-10 21:45:23] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 21:45:23] [INFO ] Invariant cache hit.
[2023-03-10 21:45:23] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 525 ms. Remains : 88/88 places, 128/128 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 217 steps, including 1 resets, run visited all 2 properties in 4 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 334 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-10 21:45:24] [INFO ] Invariant cache hit.
[2023-03-10 21:45:24] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 21:45:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:45:24] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-10 21:45:24] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 21:45:24] [INFO ] [Real]Added 41 Read/Feed constraints in 10 ms returned sat
[2023-03-10 21:45:24] [INFO ] Computed and/alt/rep : 122/562/122 causal constraints (skipped 5 transitions) in 20 ms.
[2023-03-10 21:45:24] [INFO ] Added : 0 causal constraints over 0 iterations in 44 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33333 reset in 1096 ms.
Product exploration explored 100000 steps with 33333 reset in 833 ms.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 128/128 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 87 transition count 126
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 86 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 85 transition count 125
Applied a total of 4 rules in 10 ms. Remains 85 /88 variables (removed 3) and now considering 125/128 (removed 3) transitions.
// Phase 1: matrix 125 rows 85 cols
[2023-03-10 21:45:26] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-10 21:45:26] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-10 21:45:26] [INFO ] Invariant cache hit.
[2023-03-10 21:45:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 21:45:26] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-10 21:45:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 21:45:26] [INFO ] Invariant cache hit.
[2023-03-10 21:45:27] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/88 places, 125/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 386 ms. Remains : 85/88 places, 125/128 transitions.
Treatment of property GPUForwardProgress-PT-40a-LTLFireability-14 finished in 8054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0||F(p1)))||G(p2))))'
Support contains 5 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Graph (complete) has 536 edges and 167 vertex of which 126 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.3 ms
Discarding 41 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 1 place count 126 transition count 128
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 77 place count 88 transition count 128
Applied a total of 77 rules in 16 ms. Remains 88 /167 variables (removed 79) and now considering 128/167 (removed 39) transitions.
// Phase 1: matrix 128 rows 88 cols
[2023-03-10 21:45:27] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-10 21:45:27] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-10 21:45:27] [INFO ] Invariant cache hit.
[2023-03-10 21:45:27] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 21:45:27] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-10 21:45:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 21:45:27] [INFO ] Invariant cache hit.
[2023-03-10 21:45:27] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/167 places, 128/167 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 497 ms. Remains : 88/167 places, 128/167 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-40a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s62 0), p1:(EQ s75 0), p2:(OR (EQ s60 0) (EQ s84 0) (EQ s87 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 125 reset in 993 ms.
Product exploration explored 100000 steps with 113 reset in 661 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
Knowledge based reduction with 8 factoid took 346 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 5) seen :4
Finished Best-First random walk after 99 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=49 )
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 8 factoid took 712 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 128/128 transitions.
Applied a total of 0 rules in 8 ms. Remains 88 /88 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-10 21:45:31] [INFO ] Invariant cache hit.
[2023-03-10 21:45:31] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-10 21:45:31] [INFO ] Invariant cache hit.
[2023-03-10 21:45:31] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 21:45:31] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2023-03-10 21:45:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 21:45:31] [INFO ] Invariant cache hit.
[2023-03-10 21:45:31] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 417 ms. Remains : 88/88 places, 128/128 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
Knowledge based reduction with 8 factoid took 364 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 5) seen :4
Finished Best-First random walk after 99 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=49 )
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 8 factoid took 645 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 134 reset in 788 ms.
Product exploration explored 100000 steps with 121 reset in 714 ms.
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 128/128 transitions.
Applied a total of 0 rules in 27 ms. Remains 88 /88 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-10 21:45:34] [INFO ] Invariant cache hit.
[2023-03-10 21:45:34] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-10 21:45:34] [INFO ] Invariant cache hit.
[2023-03-10 21:45:34] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 21:45:34] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-10 21:45:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 21:45:35] [INFO ] Invariant cache hit.
[2023-03-10 21:45:35] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 501 ms. Remains : 88/88 places, 128/128 transitions.
Treatment of property GPUForwardProgress-PT-40a-LTLFireability-15 finished in 8079 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)||X(F((p0&&F(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0||F(p1)))||G(p2))))'
[2023-03-10 21:45:35] [INFO ] Flatten gal took : 24 ms
[2023-03-10 21:45:35] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-10 21:45:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 167 places, 167 transitions and 735 arcs took 4 ms.
Total runtime 43626 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT GPUForwardProgress-PT-40a
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability
FORMULA GPUForwardProgress-PT-40a-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPUForwardProgress-PT-40a-LTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678484737112
--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 4 (type EXCL) for 3 GPUForwardProgress-PT-40a-LTLFireability-15
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for GPUForwardProgress-PT-40a-LTLFireability-15
lola: result : false
lola: markings : 586
lola: fired transitions : 941
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 GPUForwardProgress-PT-40a-LTLFireability-14
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for GPUForwardProgress-PT-40a-LTLFireability-14
lola: result : true
lola: markings : 122
lola: fired transitions : 121
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
GPUForwardProgress-PT-40a-LTLFireability-14: LTL true LTL model checker
GPUForwardProgress-PT-40a-LTLFireability-15: LTL false LTL model checker
Time elapsed: 0 secs. Pages in use: 1
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-40a"
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-40a, 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-167840345600148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-40a.tgz
mv GPUForwardProgress-PT-40a 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 '
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 ;