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

About the Execution of ITS-Tools for RefineWMG-PT-100100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
514.735 28567.00 43720.00 272.10 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.r325-tall-167889197500644.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is RefineWMG-PT-100100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r325-tall-167889197500644
=====================================================================

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-100100
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-17 04:21:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-17 04:21:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 04:21:18] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-17 04:21:18] [INFO ] Transformed 504 places.
[2023-03-17 04:21:18] [INFO ] Transformed 403 transitions.
[2023-03-17 04:21:18] [INFO ] Parsed PT model containing 504 places and 403 transitions and 1208 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 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 50 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 04:21:18] [INFO ] Computed 202 place invariants in 23 ms
[2023-03-17 04:21:19] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
[2023-03-17 04:21:19] [INFO ] Invariant cache hit.
[2023-03-17 04:21:19] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-17 04:21:19] [INFO ] Invariant cache hit.
[2023-03-17 04:21:20] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
[2023-03-17 04:21:20] [INFO ] Invariant cache hit.
[2023-03-17 04:21:20] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1675 ms. Remains : 504/504 places, 403/403 transitions.
Support contains 35 out of 504 places after structural reductions.
[2023-03-17 04:21:20] [INFO ] Flatten gal took : 170 ms
[2023-03-17 04:21:20] [INFO ] Flatten gal took : 41 ms
[2023-03-17 04:21:20] [INFO ] Input system was already deterministic with 403 transitions.
Incomplete random walk after 10015 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 23) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) 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 :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) 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 7 ms. (steps per millisecond=143 ) properties (out of 14) 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 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-17 04:21:21] [INFO ] Invariant cache hit.
[2023-03-17 04:21:21] [INFO ] [Real]Absence check using 202 positive place invariants in 59 ms returned sat
[2023-03-17 04:21:22] [INFO ] After 1212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-17 04:21:22] [INFO ] [Nat]Absence check using 202 positive place invariants in 72 ms returned sat
[2023-03-17 04:21:23] [INFO ] After 474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-17 04:21:23] [INFO ] After 961ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 342 ms.
[2023-03-17 04:21:24] [INFO ] After 1766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 12 different solutions.
Finished Parikh walk after 3118 steps, including 0 resets, run visited all 4 properties in 56 ms. (steps per millisecond=55 )
Parikh walk visited 13 properties in 497 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 9 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-17 04:21:25] [INFO ] Invariant cache hit.
[2023-03-17 04:21:25] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
[2023-03-17 04:21:25] [INFO ] Invariant cache hit.
[2023-03-17 04:21:25] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-17 04:21:25] [INFO ] Invariant cache hit.
[2023-03-17 04:21:26] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
[2023-03-17 04:21:26] [INFO ] Invariant cache hit.
[2023-03-17 04:21:26] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1379 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 291 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 154 steps with 0 reset in 8 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-00 finished in 1740 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 35 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-17 04:21:26] [INFO ] Invariant cache hit.
[2023-03-17 04:21:27] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
[2023-03-17 04:21:27] [INFO ] Invariant cache hit.
[2023-03-17 04:21:27] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-17 04:21:27] [INFO ] Invariant cache hit.
[2023-03-17 04:21:27] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2023-03-17 04:21:27] [INFO ] Invariant cache hit.
[2023-03-17 04:21:27] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1064 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 111 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 1 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-01 finished in 1209 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 23 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-17 04:21:27] [INFO ] Invariant cache hit.
[2023-03-17 04:21:28] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
[2023-03-17 04:21:28] [INFO ] Invariant cache hit.
[2023-03-17 04:21:28] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-17 04:21:28] [INFO ] Invariant cache hit.
[2023-03-17 04:21:28] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2023-03-17 04:21:28] [INFO ] Invariant cache hit.
[2023-03-17 04:21:28] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1043 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 133 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 8 reset in 1449 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 1 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-02 finished in 2645 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 4 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 35 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 04:21:30] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 04:21:30] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-17 04:21:30] [INFO ] Invariant cache hit.
[2023-03-17 04:21:30] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-17 04:21:30] [INFO ] Invariant cache hit.
[2023-03-17 04:21:30] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-17 04:21:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 04:21:30] [INFO ] Invariant cache hit.
[2023-03-17 04:21:30] [INFO ] Dead Transitions using invariants and state equation in 23 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 161 ms. Remains : 7/504 places, 6/403 transitions.
Stuttering acceptance computed with spot in 32 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 0 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-03 finished in 210 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 5 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 04:21:30] [INFO ] Computed 202 place invariants in 2 ms
[2023-03-17 04:21:31] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
[2023-03-17 04:21:31] [INFO ] Invariant cache hit.
[2023-03-17 04:21:31] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-17 04:21:31] [INFO ] Invariant cache hit.
[2023-03-17 04:21:31] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2023-03-17 04:21:31] [INFO ] Invariant cache hit.
[2023-03-17 04:21:31] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1107 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 110 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 940 ms.
Product exploration explored 100000 steps with 50000 reset in 851 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 70 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 3135 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 7 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-17 04:21:33] [INFO ] Invariant cache hit.
[2023-03-17 04:21:34] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
[2023-03-17 04:21:34] [INFO ] Invariant cache hit.
[2023-03-17 04:21:34] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-17 04:21:34] [INFO ] Invariant cache hit.
[2023-03-17 04:21:34] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2023-03-17 04:21:34] [INFO ] Invariant cache hit.
[2023-03-17 04:21:34] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 936 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 57 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 679 reset in 1083 ms.
Stack based approach found an accepted trace after 136 steps with 0 reset with depth 137 and stack size 137 in 2 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-06 finished in 2094 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 22 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 04:21:36] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-17 04:21:36] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2023-03-17 04:21:36] [INFO ] Invariant cache hit.
[2023-03-17 04:21:36] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 04:21:36] [INFO ] Invariant cache hit.
[2023-03-17 04:21:36] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-17 04:21:36] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-17 04:21:36] [INFO ] Invariant cache hit.
[2023-03-17 04:21:36] [INFO ] Dead Transitions using invariants and state equation in 21 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 128 ms. Remains : 13/504 places, 13/403 transitions.
Stuttering acceptance computed with spot in 167 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 312 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 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 04:21:36] [INFO ] Computed 202 place invariants in 1 ms
[2023-03-17 04:21:36] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
[2023-03-17 04:21:36] [INFO ] Invariant cache hit.
[2023-03-17 04:21:36] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-17 04:21:36] [INFO ] Invariant cache hit.
[2023-03-17 04:21:37] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2023-03-17 04:21:37] [INFO ] Invariant cache hit.
[2023-03-17 04:21:37] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 960 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 82 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 814 ms.
Product exploration explored 100000 steps with 33333 reset in 836 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 47 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 2810 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 0 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 19 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 04:21:39] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-17 04:21:39] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2023-03-17 04:21:39] [INFO ] Invariant cache hit.
[2023-03-17 04:21:39] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-17 04:21:39] [INFO ] Invariant cache hit.
[2023-03-17 04:21:39] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-17 04:21:39] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-17 04:21:39] [INFO ] Invariant cache hit.
[2023-03-17 04:21:39] [INFO ] Dead Transitions using invariants and state equation in 24 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 154 ms. Remains : 16/504 places, 14/403 transitions.
Stuttering acceptance computed with spot in 83 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 47 steps with 0 reset in 4 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-11 finished in 257 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 8 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 04:21:39] [INFO ] Computed 202 place invariants in 2 ms
[2023-03-17 04:21:39] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
[2023-03-17 04:21:39] [INFO ] Invariant cache hit.
[2023-03-17 04:21:39] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-17 04:21:39] [INFO ] Invariant cache hit.
[2023-03-17 04:21:40] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2023-03-17 04:21:40] [INFO ] Invariant cache hit.
[2023-03-17 04:21:40] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 928 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 185 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 19217 steps with 0 reset in 348 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-12 finished in 1480 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 7 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-17 04:21:40] [INFO ] Invariant cache hit.
[2023-03-17 04:21:41] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
[2023-03-17 04:21:41] [INFO ] Invariant cache hit.
[2023-03-17 04:21:41] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-17 04:21:41] [INFO ] Invariant cache hit.
[2023-03-17 04:21:41] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2023-03-17 04:21:41] [INFO ] Invariant cache hit.
[2023-03-17 04:21:41] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 956 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 188 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 1 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-14 finished in 1172 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 11 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-17 04:21:42] [INFO ] Invariant cache hit.
[2023-03-17 04:21:42] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
[2023-03-17 04:21:42] [INFO ] Invariant cache hit.
[2023-03-17 04:21:42] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-17 04:21:42] [INFO ] Invariant cache hit.
[2023-03-17 04:21:42] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2023-03-17 04:21:42] [INFO ] Invariant cache hit.
[2023-03-17 04:21:42] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 947 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 93 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 7 reset in 1598 ms.
Stack based approach found an accepted trace after 597 steps with 0 reset with depth 598 and stack size 598 in 9 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-15 finished in 2662 ms.
All properties solved by simple procedures.
Total runtime 26345 ms.

BK_STOP 1679026905567

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is 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 r325-tall-167889197500644"
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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;