About the Execution of LoLa+red for RefineWMG-PT-100100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
474.659 | 25065.00 | 36172.00 | 359.40 | FFFFTFFFFTTFFTFF | 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.r327-tall-167889199900644.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 RefineWMG-PT-100100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889199900644
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 7.8K Feb 26 16:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 16:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 16:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 16:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 16:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K Feb 26 16:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 16:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 16:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 218K Mar 5 18:23 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 RefineWMG-PT-100100-LTLFireability-00
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-01
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-02
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-03
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-04
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-05
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-06
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-07
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-08
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-09
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-10
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-11
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-12
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-13
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-14
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679053979042
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=RefineWMG-PT-100100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 11:53:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 11:53:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 11:53:00] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-17 11:53:00] [INFO ] Transformed 504 places.
[2023-03-17 11:53:00] [INFO ] Transformed 403 transitions.
[2023-03-17 11:53:00] [INFO ] Parsed PT model containing 504 places and 403 transitions and 1208 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA RefineWMG-PT-100100-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 47 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2023-03-17 11:53:00] [INFO ] Computed 202 place invariants in 12 ms
[2023-03-17 11:53:01] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
[2023-03-17 11:53:01] [INFO ] Invariant cache hit.
[2023-03-17 11:53:01] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-17 11:53:01] [INFO ] Invariant cache hit.
[2023-03-17 11:53:01] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2023-03-17 11:53:01] [INFO ] Invariant cache hit.
[2023-03-17 11:53:01] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1245 ms. Remains : 504/504 places, 403/403 transitions.
Support contains 35 out of 504 places after structural reductions.
[2023-03-17 11:53:02] [INFO ] Flatten gal took : 54 ms
[2023-03-17 11:53:02] [INFO ] Flatten gal took : 25 ms
[2023-03-17 11:53:02] [INFO ] Input system was already deterministic with 403 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 23) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-17 11:53:02] [INFO ] Invariant cache hit.
[2023-03-17 11:53:02] [INFO ] [Real]Absence check using 202 positive place invariants in 24 ms returned sat
[2023-03-17 11:53:03] [INFO ] After 677ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-17 11:53:03] [INFO ] [Nat]Absence check using 202 positive place invariants in 26 ms returned sat
[2023-03-17 11:53:03] [INFO ] After 410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-17 11:53:04] [INFO ] After 936ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 298 ms.
[2023-03-17 11:53:04] [INFO ] After 1558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 13 different solutions.
Finished Parikh walk after 18825 steps, including 0 resets, run visited all 14 properties in 318 ms. (steps per millisecond=59 )
Parikh walk visited 14 properties in 319 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||G((p1||X(!p1)))) U (p1||X(p1))))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 17 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-17 11:53:05] [INFO ] Invariant cache hit.
[2023-03-17 11:53:05] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
[2023-03-17 11:53:05] [INFO ] Invariant cache hit.
[2023-03-17 11:53:05] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-17 11:53:05] [INFO ] Invariant cache hit.
[2023-03-17 11:53:06] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2023-03-17 11:53:06] [INFO ] Invariant cache hit.
[2023-03-17 11:53:06] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 827 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(GEQ s225 1), p0:(LT s468 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 138 steps with 0 reset in 7 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-00 finished in 1211 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||(F(!p0)&&p1))))))'
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 20 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-17 11:53:06] [INFO ] Invariant cache hit.
[2023-03-17 11:53:06] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
[2023-03-17 11:53:06] [INFO ] Invariant cache hit.
[2023-03-17 11:53:06] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-17 11:53:06] [INFO ] Invariant cache hit.
[2023-03-17 11:53:07] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2023-03-17 11:53:07] [INFO ] Invariant cache hit.
[2023-03-17 11:53:07] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 856 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(OR p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s57 1), p1:(AND (GEQ s366 1) (GEQ s367 1) (GEQ s369 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 2 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-01 finished in 1010 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)||F(p1)))))'
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 19 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-17 11:53:07] [INFO ] Invariant cache hit.
[2023-03-17 11:53:07] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
[2023-03-17 11:53:07] [INFO ] Invariant cache hit.
[2023-03-17 11:53:07] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-17 11:53:07] [INFO ] Invariant cache hit.
[2023-03-17 11:53:08] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2023-03-17 11:53:08] [INFO ] Invariant cache hit.
[2023-03-17 11:53:08] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 834 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (OR (AND (GEQ s371 1) (GEQ s372 1) (GEQ s374 1)) (GEQ s240 1)) (GEQ s240 1)), p0:(GEQ s240 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 10 reset in 1550 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 1 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-02 finished in 2567 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 1 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 299 edges and 504 vertex of which 200 / 504 are part of one of the 100 SCC in 3 ms
Free SCC test removed 100 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 304 transition count 204
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 397 place count 106 transition count 105
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 1 with 97 rules applied. Total rules applied 494 place count 106 transition count 8
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 2 with 97 rules applied. Total rules applied 591 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 591 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 593 place count 8 transition count 7
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 3 with 2 rules applied. Total rules applied 595 place count 7 transition count 6
Applied a total of 595 rules in 32 ms. Remains 7 /504 variables (removed 497) and now considering 6/403 (removed 397) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-17 11:53:10] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-17 11:53:10] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
[2023-03-17 11:53:10] [INFO ] Invariant cache hit.
[2023-03-17 11:53:10] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 11:53:10] [INFO ] Invariant cache hit.
[2023-03-17 11:53:10] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-17 11:53:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 11:53:10] [INFO ] Invariant cache hit.
[2023-03-17 11:53:10] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/504 places, 6/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 7/504 places, 6/403 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s5 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 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-03 finished in 178 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||X(F(p1))))))'
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 11 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2023-03-17 11:53:10] [INFO ] Computed 202 place invariants in 7 ms
[2023-03-17 11:53:10] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
[2023-03-17 11:53:10] [INFO ] Invariant cache hit.
[2023-03-17 11:53:10] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-17 11:53:10] [INFO ] Invariant cache hit.
[2023-03-17 11:53:10] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2023-03-17 11:53:10] [INFO ] Invariant cache hit.
[2023-03-17 11:53:11] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 847 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s167 1), p1:(OR (LT s0 1) (LT s501 1) (LT s502 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]]
Product exploration explored 100000 steps with 50000 reset in 854 ms.
Product exploration explored 100000 steps with 50000 reset in 862 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-100100-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-100100-LTLFireability-04 finished in 2807 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 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 8 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-17 11:53:13] [INFO ] Invariant cache hit.
[2023-03-17 11:53:13] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
[2023-03-17 11:53:13] [INFO ] Invariant cache hit.
[2023-03-17 11:53:13] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-17 11:53:13] [INFO ] Invariant cache hit.
[2023-03-17 11:53:13] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2023-03-17 11:53:13] [INFO ] Invariant cache hit.
[2023-03-17 11:53:13] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 844 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-06 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:(GEQ s450 1), p0:(GEQ s173 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 710 reset in 1116 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 1 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-06 finished in 2041 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)&&((F(p1) U p2) U G(p1))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 294 edges and 504 vertex of which 194 / 504 are part of one of the 97 SCC in 1 ms
Free SCC test removed 97 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 310 transition count 210
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 397 place count 110 transition count 110
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 1 with 93 rules applied. Total rules applied 490 place count 110 transition count 17
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 2 with 93 rules applied. Total rules applied 583 place count 17 transition count 17
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 583 place count 17 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 589 place count 14 transition count 14
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 3 with 2 rules applied. Total rules applied 591 place count 13 transition count 13
Applied a total of 591 rules in 19 ms. Remains 13 /504 variables (removed 491) and now considering 13/403 (removed 390) transitions.
// Phase 1: matrix 13 rows 13 cols
[2023-03-17 11:53:15] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-17 11:53:15] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-03-17 11:53:15] [INFO ] Invariant cache hit.
[2023-03-17 11:53:15] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-17 11:53:15] [INFO ] Invariant cache hit.
[2023-03-17 11:53:15] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-17 11:53:15] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-17 11:53:15] [INFO ] Invariant cache hit.
[2023-03-17 11:53:15] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/504 places, 13/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 13/504 places, 13/403 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s11 1), p1:(GEQ s6 1), p2:(AND (GEQ s9 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-07 finished in 375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 10 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2023-03-17 11:53:15] [INFO ] Computed 202 place invariants in 3 ms
[2023-03-17 11:53:15] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
[2023-03-17 11:53:15] [INFO ] Invariant cache hit.
[2023-03-17 11:53:15] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-17 11:53:15] [INFO ] Invariant cache hit.
[2023-03-17 11:53:16] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2023-03-17 11:53:16] [INFO ] Invariant cache hit.
[2023-03-17 11:53:16] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 851 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s451 1) (LT s452 1) (LT s454 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]]
Product exploration explored 100000 steps with 33333 reset in 845 ms.
Product exploration explored 100000 steps with 33333 reset in 865 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 56 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-100100-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-100100-LTLFireability-09 finished in 2790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p1)||p0))))'
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 294 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 2 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 1 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 1 with 294 rules applied. Total rules applied 392 place count 112 transition count 110
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 1 with 92 rules applied. Total rules applied 484 place count 112 transition count 18
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 576 place count 20 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 576 place count 20 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 582 place count 17 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 3 with 2 rules applied. Total rules applied 584 place count 16 transition count 14
Applied a total of 584 rules in 27 ms. Remains 16 /504 variables (removed 488) and now considering 14/403 (removed 389) transitions.
// Phase 1: matrix 14 rows 16 cols
[2023-03-17 11:53:18] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-17 11:53:18] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-03-17 11:53:18] [INFO ] Invariant cache hit.
[2023-03-17 11:53:18] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 11:53:18] [INFO ] Invariant cache hit.
[2023-03-17 11:53:18] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-17 11:53:18] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-17 11:53:18] [INFO ] Invariant cache hit.
[2023-03-17 11:53:18] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/504 places, 14/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 16/504 places, 14/403 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s14 1), p0:(OR (LT s6 1) (LT s7 1) (LT s9 1) (LT s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-11 finished in 213 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)||X(G(p1)))))'
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 6 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2023-03-17 11:53:18] [INFO ] Computed 202 place invariants in 2 ms
[2023-03-17 11:53:18] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
[2023-03-17 11:53:18] [INFO ] Invariant cache hit.
[2023-03-17 11:53:18] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-17 11:53:18] [INFO ] Invariant cache hit.
[2023-03-17 11:53:19] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2023-03-17 11:53:19] [INFO ] Invariant cache hit.
[2023-03-17 11:53:19] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 817 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-12 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 p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(OR (LT s61 1) (LT s62 1) (LT s64 1)), p0:(LT s222 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13986 steps with 0 reset in 242 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-12 finished in 1266 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((p0 U ((p1 U (p2||G(p1))) U ((!p0&&(p1 U (p2||G(p1))))||G((p1 U (p2||G(p1))))))))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 8 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-17 11:53:19] [INFO ] Invariant cache hit.
[2023-03-17 11:53:20] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
[2023-03-17 11:53:20] [INFO ] Invariant cache hit.
[2023-03-17 11:53:20] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-17 11:53:20] [INFO ] Invariant cache hit.
[2023-03-17 11:53:20] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2023-03-17 11:53:20] [INFO ] Invariant cache hit.
[2023-03-17 11:53:20] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 837 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(OR p1 p0 p2), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p1 (NOT p0)) (AND (NOT p0) p2)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(OR (AND p1 p0) (AND p0 p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(OR p1 p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LT s483 1), p0:(GEQ s90 1), p2:(AND (LT s243 1) (LT s483 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-14 finished in 1103 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((X(p0)&&F(p1))))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 6 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-17 11:53:20] [INFO ] Invariant cache hit.
[2023-03-17 11:53:21] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
[2023-03-17 11:53:21] [INFO ] Invariant cache hit.
[2023-03-17 11:53:21] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-17 11:53:21] [INFO ] Invariant cache hit.
[2023-03-17 11:53:21] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2023-03-17 11:53:21] [INFO ] Invariant cache hit.
[2023-03-17 11:53:21] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 843 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s20 1), p0:(LT s350 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 11 reset in 1291 ms.
Stack based approach found an accepted trace after 874 steps with 0 reset with depth 875 and stack size 875 in 13 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-15 finished in 2293 ms.
All properties solved by simple procedures.
Total runtime 22762 ms.
ITS solved all properties within timeout
BK_STOP 1679054004107
--------------------
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="RefineWMG-PT-100100"
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 RefineWMG-PT-100100, 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 r327-tall-167889199900644"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-100100.tgz
mv RefineWMG-PT-100100 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 ;