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-167889199900651.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-100101, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889199900651
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.4K Feb 26 15:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 15:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 15:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 15:54 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.7K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 15:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 15:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:56 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-100101-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679054152791

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-100101
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 11:55:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 11:55:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 11:55:54] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-17 11:55:54] [INFO ] Transformed 504 places.
[2023-03-17 11:55:54] [INFO ] Transformed 403 transitions.
[2023-03-17 11:55:54] [INFO ] Parsed PT model containing 504 places and 403 transitions and 1208 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA RefineWMG-PT-100101-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 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 45 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:55:54] [INFO ] Computed 202 place invariants in 21 ms
[2023-03-17 11:55:54] [INFO ] Dead Transitions using invariants and state equation in 408 ms found 0 transitions.
[2023-03-17 11:55:54] [INFO ] Invariant cache hit.
[2023-03-17 11:55:55] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-17 11:55:55] [INFO ] Invariant cache hit.
[2023-03-17 11:55:55] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2023-03-17 11:55:55] [INFO ] Invariant cache hit.
[2023-03-17 11:55:55] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1239 ms. Remains : 504/504 places, 403/403 transitions.
Support contains 44 out of 504 places after structural reductions.
[2023-03-17 11:55:55] [INFO ] Flatten gal took : 60 ms
[2023-03-17 11:55:55] [INFO ] Flatten gal took : 25 ms
[2023-03-17 11:55:55] [INFO ] Input system was already deterministic with 403 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 32) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) 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 25) 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 25) 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 25) 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 25) 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 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) 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 24) 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 24) 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 24) seen :0
Running SMT prover for 24 properties.
[2023-03-17 11:55:56] [INFO ] Invariant cache hit.
[2023-03-17 11:55:56] [INFO ] [Real]Absence check using 202 positive place invariants in 26 ms returned sat
[2023-03-17 11:55:56] [INFO ] After 346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-17 11:55:56] [INFO ] [Nat]Absence check using 202 positive place invariants in 40 ms returned sat
[2023-03-17 11:55:57] [INFO ] After 802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-03-17 11:55:58] [INFO ] After 1733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 511 ms.
[2023-03-17 11:55:59] [INFO ] After 2841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Finished Parikh walk after 6186 steps, including 0 resets, run visited all 1 properties in 50 ms. (steps per millisecond=123 )
Parikh walk visited 24 properties in 1673 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA RefineWMG-PT-100101-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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) U 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 295 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 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 395 place count 110 transition count 109
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 488 place count 110 transition count 16
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 2 with 93 rules applied. Total rules applied 581 place count 17 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 581 place count 17 transition count 13
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 587 place count 14 transition count 13
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 589 place count 13 transition count 12
Applied a total of 589 rules in 31 ms. Remains 13 /504 variables (removed 491) and now considering 12/403 (removed 391) transitions.
// Phase 1: matrix 12 rows 13 cols
[2023-03-17 11:56:01] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-17 11:56:01] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-03-17 11:56:01] [INFO ] Invariant cache hit.
[2023-03-17 11:56:01] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 11:56:01] [INFO ] Invariant cache hit.
[2023-03-17 11:56:01] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-17 11:56:01] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-17 11:56:01] [INFO ] Invariant cache hit.
[2023-03-17 11:56:01] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/504 places, 12/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 174 ms. Remains : 13/504 places, 12/403 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s11 s6), p0:(LEQ 2 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-00 finished in 468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1)||(p2&&X(p3)))))'
Support contains 5 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.
// Phase 1: matrix 403 rows 504 cols
[2023-03-17 11:56:01] [INFO ] Computed 202 place invariants in 5 ms
[2023-03-17 11:56:02] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
[2023-03-17 11:56:02] [INFO ] Invariant cache hit.
[2023-03-17 11:56:02] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-17 11:56:02] [INFO ] Invariant cache hit.
[2023-03-17 11:56:02] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2023-03-17 11:56:02] [INFO ] Invariant cache hit.
[2023-03-17 11:56:02] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 908 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p1:(OR (LEQ 3 s224) (LEQ 2 s395)), p0:(LEQ 1 s415), p2:(LEQ 3 s224), p3:(LEQ s154 s102)], 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 2 reset in 1636 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-01 finished in 2750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U p1))&&F(p2))))'
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 297 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 2 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 396 place count 108 transition count 107
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 488 place count 108 transition count 15
Reduce places removed 92 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 93 rules applied. Total rules applied 581 place count 16 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 582 place count 15 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 582 place count 15 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 588 place count 12 transition count 11
Applied a total of 588 rules in 32 ms. Remains 12 /504 variables (removed 492) and now considering 11/403 (removed 392) transitions.
// Phase 1: matrix 11 rows 12 cols
[2023-03-17 11:56:04] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-17 11:56:04] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-17 11:56:04] [INFO ] Invariant cache hit.
[2023-03-17 11:56:04] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-17 11:56:04] [INFO ] Invariant cache hit.
[2023-03-17 11:56:04] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-17 11:56:04] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-17 11:56:04] [INFO ] Invariant cache hit.
[2023-03-17 11:56:04] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/504 places, 11/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 155 ms. Remains : 12/504 places, 11/403 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(OR p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 3 s5), p0:(LEQ 3 s10), p2:(LEQ 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-02 finished in 352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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 300 edges and 504 vertex of which 200 / 504 are part of one of the 100 SCC in 2 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 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 400 place count 104 transition count 104
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 96 rules applied. Total rules applied 496 place count 104 transition count 8
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 97 rules applied. Total rules applied 593 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 594 place count 7 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 594 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 596 place count 6 transition count 6
Applied a total of 596 rules in 27 ms. Remains 6 /504 variables (removed 498) and now considering 6/403 (removed 397) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-17 11:56:05] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-17 11:56:05] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-17 11:56:05] [INFO ] Invariant cache hit.
[2023-03-17 11:56:05] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 11:56:05] [INFO ] Invariant cache hit.
[2023-03-17 11:56:05] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-17 11:56:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 11:56:05] [INFO ] Invariant cache hit.
[2023-03-17 11:56:05] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/504 places, 6/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 6/504 places, 6/403 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-03 finished in 220 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((G(p0)||X(p1)))||X(G(p0)))))'
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 12 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:56:05] [INFO ] Computed 202 place invariants in 2 ms
[2023-03-17 11:56:05] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
[2023-03-17 11:56:05] [INFO ] Invariant cache hit.
[2023-03-17 11:56:05] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-17 11:56:05] [INFO ] Invariant cache hit.
[2023-03-17 11:56:05] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2023-03-17 11:56:05] [INFO ] Invariant cache hit.
[2023-03-17 11:56:06] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 864 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(GT 3 s361), p0:(GT 1 s183)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 95 steps with 0 reset in 2 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-05 finished in 1058 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)))&&F(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 12 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-17 11:56:06] [INFO ] Invariant cache hit.
[2023-03-17 11:56:06] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
[2023-03-17 11:56:06] [INFO ] Invariant cache hit.
[2023-03-17 11:56:06] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-17 11:56:06] [INFO ] Invariant cache hit.
[2023-03-17 11:56:06] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2023-03-17 11:56:06] [INFO ] Invariant cache hit.
[2023-03-17 11:56:07] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 858 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT s153 s263), p0:(LEQ 3 s81)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 422 reset in 1491 ms.
Stack based approach found an accepted trace after 387 steps with 7 reset with depth 55 and stack size 55 in 6 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-06 finished in 2532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (p1||G(p0)))))'
Support contains 2 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 0 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 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 1 with 94 rules applied. Total rules applied 491 place count 106 transition count 11
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 95 rules applied. Total rules applied 586 place count 12 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 587 place count 11 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 587 place count 11 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 589 place count 10 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 591 place count 9 transition count 8
Applied a total of 591 rules in 18 ms. Remains 9 /504 variables (removed 495) and now considering 8/403 (removed 395) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-17 11:56:08] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-17 11:56:08] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-03-17 11:56:08] [INFO ] Invariant cache hit.
[2023-03-17 11:56:08] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-17 11:56:08] [INFO ] Invariant cache hit.
[2023-03-17 11:56:08] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-17 11:56:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 11:56:08] [INFO ] Invariant cache hit.
[2023-03-17 11:56:08] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/504 places, 8/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 9/504 places, 8/403 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GT 3 s6) (GT 1 s8)), p0:(GT 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-07 finished in 176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((X(p1) U (X(G(p1))||(p2&&X((p1&&X(F(p2))))))))))'
Support contains 5 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 11:56:09] [INFO ] Computed 202 place invariants in 6 ms
[2023-03-17 11:56:09] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
[2023-03-17 11:56:09] [INFO ] Invariant cache hit.
[2023-03-17 11:56:09] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-17 11:56:09] [INFO ] Invariant cache hit.
[2023-03-17 11:56:09] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2023-03-17 11:56:09] [INFO ] Invariant cache hit.
[2023-03-17 11:56:09] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 854 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=2, aps=[p0:(GT s402 s487), p2:(GT s110 s108), p1:(LEQ 1 s221)], 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 282 reset in 1290 ms.
Product exploration explored 100000 steps with 275 reset in 1420 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 (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 281 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-17 11:56:13] [INFO ] Invariant cache hit.
[2023-03-17 11:56:13] [INFO ] [Real]Absence check using 202 positive place invariants in 28 ms returned sat
[2023-03-17 11:56:13] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 11:56:13] [INFO ] [Nat]Absence check using 202 positive place invariants in 24 ms returned sat
[2023-03-17 11:56:14] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 11:56:14] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-17 11:56:14] [INFO ] After 553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 18907 steps, including 0 resets, run visited all 3 properties in 284 ms. (steps per millisecond=66 )
Parikh walk visited 3 properties in 283 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0) p1))), (F (NOT (AND (NOT p0) p1))), (F (AND p2 (NOT p0) p1)), (F p0), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 4 factoid took 388 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 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.
[2023-03-17 11:56:15] [INFO ] Invariant cache hit.
[2023-03-17 11:56:15] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
[2023-03-17 11:56:15] [INFO ] Invariant cache hit.
[2023-03-17 11:56:15] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-17 11:56:15] [INFO ] Invariant cache hit.
[2023-03-17 11:56:16] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2023-03-17 11:56:16] [INFO ] Invariant cache hit.
[2023-03-17 11:56:16] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 845 ms. Remains : 504/504 places, 403/403 transitions.
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 (NOT p0) (NOT p2) p1), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-17 11:56:17] [INFO ] Invariant cache hit.
[2023-03-17 11:56:17] [INFO ] [Real]Absence check using 202 positive place invariants in 26 ms returned sat
[2023-03-17 11:56:17] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 11:56:17] [INFO ] [Nat]Absence check using 202 positive place invariants in 37 ms returned sat
[2023-03-17 11:56:17] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 11:56:17] [INFO ] After 326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-17 11:56:17] [INFO ] After 546ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 18824 steps, including 0 resets, run visited all 3 properties in 279 ms. (steps per millisecond=67 )
Parikh walk visited 3 properties in 280 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0) p1))), (F (NOT (AND (NOT p0) p1))), (F (AND p2 (NOT p0) p1)), (F p0), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 3 factoid took 343 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 233 reset in 1326 ms.
Product exploration explored 100000 steps with 301 reset in 1373 ms.
Applying partial POR strategy [true, true, false, false, true, false, false]
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
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 292 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 98 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 195 place count 310 transition count 210
Deduced a syphon composed of 98 places in 0 ms
Applied a total of 195 rules in 28 ms. Remains 310 /504 variables (removed 194) and now considering 210/403 (removed 193) transitions.
// Phase 1: matrix 210 rows 310 cols
[2023-03-17 11:56:22] [INFO ] Computed 105 place invariants in 3 ms
[2023-03-17 11:56:22] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
[2023-03-17 11:56:22] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-17 11:56:22] [INFO ] Invariant cache hit.
[2023-03-17 11:56:22] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 310/504 places, 210/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 292 ms. Remains : 310/504 places, 210/403 transitions.
Support contains 5 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 14 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:56:22] [INFO ] Computed 202 place invariants in 4 ms
[2023-03-17 11:56:22] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
[2023-03-17 11:56:22] [INFO ] Invariant cache hit.
[2023-03-17 11:56:23] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-17 11:56:23] [INFO ] Invariant cache hit.
[2023-03-17 11:56:23] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2023-03-17 11:56:23] [INFO ] Invariant cache hit.
[2023-03-17 11:56:23] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 852 ms. Remains : 504/504 places, 403/403 transitions.
Treatment of property RefineWMG-PT-100101-LTLCardinality-08 finished in 14629 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((p1||(p2 U p0)))))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 293 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 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 394 place count 112 transition count 111
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 1 with 91 rules applied. Total rules applied 485 place count 112 transition count 20
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 2 with 91 rules applied. Total rules applied 576 place count 21 transition count 20
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 576 place count 21 transition count 16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 584 place count 17 transition count 16
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 586 place count 16 transition count 15
Applied a total of 586 rules in 20 ms. Remains 16 /504 variables (removed 488) and now considering 15/403 (removed 388) transitions.
// Phase 1: matrix 15 rows 16 cols
[2023-03-17 11:56:23] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-17 11:56:23] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-17 11:56:23] [INFO ] Invariant cache hit.
[2023-03-17 11:56:23] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 11:56:23] [INFO ] Invariant cache hit.
[2023-03-17 11:56:23] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-17 11:56:23] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-17 11:56:23] [INFO ] Invariant cache hit.
[2023-03-17 11:56:23] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/504 places, 15/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 16/504 places, 15/403 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s9), p1:(LEQ s6 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 99 ms.
Product exploration explored 100000 steps with 0 reset in 160 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 311 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=155 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-17 11:56:24] [INFO ] Invariant cache hit.
[2023-03-17 11:56:24] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-17 11:56:24] [INFO ] Invariant cache hit.
[2023-03-17 11:56:24] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 11:56:24] [INFO ] Invariant cache hit.
[2023-03-17 11:56:24] [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:56:24] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-17 11:56:24] [INFO ] Invariant cache hit.
[2023-03-17 11:56:24] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 16/16 places, 15/15 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 315 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=157 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 94 ms.
Product exploration explored 100000 steps with 0 reset in 108 ms.
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 15/15 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 14 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 3 place count 14 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 13 transition count 13
Applied a total of 5 rules in 2 ms. Remains 13 /16 variables (removed 3) and now considering 13/15 (removed 2) transitions.
// Phase 1: matrix 13 rows 13 cols
[2023-03-17 11:56:25] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-17 11:56:25] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-17 11:56:25] [INFO ] Invariant cache hit.
[2023-03-17 11:56:25] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-17 11:56:25] [INFO ] Invariant cache hit.
[2023-03-17 11:56:25] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-17 11:56:25] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-17 11:56:25] [INFO ] Invariant cache hit.
[2023-03-17 11:56:25] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/16 places, 13/15 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 13/16 places, 13/15 transitions.
Treatment of property RefineWMG-PT-100101-LTLCardinality-10 finished in 2196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 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 11:56:25] [INFO ] Computed 202 place invariants in 2 ms
[2023-03-17 11:56:26] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
[2023-03-17 11:56:26] [INFO ] Invariant cache hit.
[2023-03-17 11:56:26] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-17 11:56:26] [INFO ] Invariant cache hit.
[2023-03-17 11:56:26] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2023-03-17 11:56:26] [INFO ] Invariant cache hit.
[2023-03-17 11:56:26] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 821 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GT s337 s389) (GT s196 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 802 ms.
Product exploration explored 100000 steps with 50000 reset in 818 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 p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-100101-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-100101-LTLCardinality-11 finished in 2626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G((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 4 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-17 11:56:28] [INFO ] Invariant cache hit.
[2023-03-17 11:56:28] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
[2023-03-17 11:56:28] [INFO ] Invariant cache hit.
[2023-03-17 11:56:28] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-17 11:56:28] [INFO ] Invariant cache hit.
[2023-03-17 11:56:29] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2023-03-17 11:56:29] [INFO ] Invariant cache hit.
[2023-03-17 11:56:29] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 859 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}]], initial=0, aps=[p1:(GT 3 s289), p0:(GT 2 s269)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 24950 reset in 805 ms.
Product exploration explored 100000 steps with 25099 reset in 859 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 p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 384 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10100 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=265 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 153572 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153572 steps, saw 149497 distinct states, run finished after 3005 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 11:56:34] [INFO ] Invariant cache hit.
[2023-03-17 11:56:35] [INFO ] [Real]Absence check using 202 positive place invariants in 25 ms returned sat
[2023-03-17 11:56:35] [INFO ] After 330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 11:56:35] [INFO ] [Nat]Absence check using 202 positive place invariants in 23 ms returned sat
[2023-03-17 11:56:35] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 11:56:35] [INFO ] After 348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-17 11:56:35] [INFO ] After 588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 4363 steps, including 0 resets, run visited all 2 properties in 56 ms. (steps per millisecond=77 )
Parikh walk visited 5 properties in 273 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 379 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT 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 11:56:36] [INFO ] Invariant cache hit.
[2023-03-17 11:56:37] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
[2023-03-17 11:56:37] [INFO ] Invariant cache hit.
[2023-03-17 11:56:37] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-17 11:56:37] [INFO ] Invariant cache hit.
[2023-03-17 11:56:37] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2023-03-17 11:56:37] [INFO ] Invariant cache hit.
[2023-03-17 11:56:37] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 827 ms. Remains : 504/504 places, 403/403 transitions.
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 p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 431 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10100 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=288 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 167713 steps, run timeout after 3002 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167713 steps, saw 163231 distinct states, run finished after 3003 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 11:56:41] [INFO ] Invariant cache hit.
[2023-03-17 11:56:41] [INFO ] [Real]Absence check using 202 positive place invariants in 25 ms returned sat
[2023-03-17 11:56:41] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 11:56:41] [INFO ] [Nat]Absence check using 202 positive place invariants in 23 ms returned sat
[2023-03-17 11:56:42] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 11:56:42] [INFO ] After 340ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-17 11:56:42] [INFO ] After 563ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 4693 steps, including 0 resets, run visited all 2 properties in 69 ms. (steps per millisecond=68 )
Parikh walk visited 5 properties in 227 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 548 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 24977 reset in 789 ms.
Product exploration explored 100000 steps with 25045 reset in 860 ms.
Applying partial POR strategy [false, true, false, true, false]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 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 300 edges and 504 vertex of which 200 / 504 are part of one of the 100 SCC in 1 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 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 200 place count 304 transition count 204
Deduced a syphon composed of 100 places in 0 ms
Applied a total of 200 rules in 20 ms. Remains 304 /504 variables (removed 200) and now considering 204/403 (removed 199) transitions.
// Phase 1: matrix 204 rows 304 cols
[2023-03-17 11:56:45] [INFO ] Computed 102 place invariants in 3 ms
[2023-03-17 11:56:45] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
[2023-03-17 11:56:45] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-17 11:56:45] [INFO ] Invariant cache hit.
[2023-03-17 11:56:45] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 304/504 places, 204/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 264 ms. Remains : 304/504 places, 204/403 transitions.
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 4 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:56:45] [INFO ] Computed 202 place invariants in 2 ms
[2023-03-17 11:56:46] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
[2023-03-17 11:56:46] [INFO ] Invariant cache hit.
[2023-03-17 11:56:46] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-17 11:56:46] [INFO ] Invariant cache hit.
[2023-03-17 11:56:46] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2023-03-17 11:56:46] [INFO ] Invariant cache hit.
[2023-03-17 11:56:46] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 834 ms. Remains : 504/504 places, 403/403 transitions.
Treatment of property RefineWMG-PT-100101-LTLCardinality-13 finished in 18250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (p1&&X(p2))))'
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 9 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-17 11:56:46] [INFO ] Invariant cache hit.
[2023-03-17 11:56:46] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
[2023-03-17 11:56:46] [INFO ] Invariant cache hit.
[2023-03-17 11:56:47] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-17 11:56:47] [INFO ] Invariant cache hit.
[2023-03-17 11:56:47] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2023-03-17 11:56:47] [INFO ] Invariant cache hit.
[2023-03-17 11:56:47] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 866 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}, { cond=p1, acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s480 s65), p0:(LEQ 3 s304), p2:(LEQ 3 s335)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1254 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-14 finished in 2283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((X(p1) U (X(G(p1))||(p2&&X((p1&&X(F(p2))))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((p1||(p2 U p0)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G((p1&&X(p1)))))))'
Found a Lengthening insensitive property : RefineWMG-PT-100101-LTLCardinality-13
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 300 edges and 504 vertex of which 200 / 504 are part of one of the 100 SCC in 1 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 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 400 place count 104 transition count 104
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 493 place count 104 transition count 11
Reduce places removed 93 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 95 rules applied. Total rules applied 588 place count 11 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 590 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 590 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 592 place count 8 transition count 8
Applied a total of 592 rules in 23 ms. Remains 8 /504 variables (removed 496) and now considering 8/403 (removed 395) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-17 11:56:49] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-17 11:56:49] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
[2023-03-17 11:56:49] [INFO ] Invariant cache hit.
[2023-03-17 11:56:49] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-17 11:56:49] [INFO ] Invariant cache hit.
[2023-03-17 11:56:49] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-17 11:56:49] [INFO ] Invariant cache hit.
[2023-03-17 11:56:49] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 8/504 places, 8/403 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 108 ms. Remains : 8/504 places, 8/403 transitions.
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}]], initial=0, aps=[p1:(GT 3 s7), p0:(GT 2 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2135 steps with 539 reset in 2 ms.
Treatment of property RefineWMG-PT-100101-LTLCardinality-13 finished in 313 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-13 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-17 11:56:49] [INFO ] Flatten gal took : 22 ms
[2023-03-17 11:56:49] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-17 11:56:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 504 places, 403 transitions and 1208 arcs took 4 ms.
Total runtime 55362 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT RefineWMG-PT-100101
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality

FORMULA RefineWMG-PT-100101-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679054240711

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 RefineWMG-PT-100101-LTLCardinality-10
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for RefineWMG-PT-100101-LTLCardinality-10
lola: result : false
lola: markings : 106
lola: fired transitions : 309
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 RefineWMG-PT-100101-LTLCardinality-08
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
RefineWMG-PT-100101-LTLCardinality-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RefineWMG-PT-100101-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
RefineWMG-PT-100101-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 12/32 RefineWMG-PT-100101-LTLCardinality-08 1238872 m, 247774 m/sec, 1657198 t fired, .

Time elapsed: 5 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
RefineWMG-PT-100101-LTLCardinality-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RefineWMG-PT-100101-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
RefineWMG-PT-100101-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1800 25/32 RefineWMG-PT-100101-LTLCardinality-08 2583916 m, 269008 m/sec, 3456420 t fired, .

Time elapsed: 10 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for RefineWMG-PT-100101-LTLCardinality-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
RefineWMG-PT-100101-LTLCardinality-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RefineWMG-PT-100101-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
RefineWMG-PT-100101-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 7 (type EXCL) for 6 RefineWMG-PT-100101-LTLCardinality-13
lola: time limit : 3585 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
RefineWMG-PT-100101-LTLCardinality-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RefineWMG-PT-100101-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
RefineWMG-PT-100101-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/3585 14/32 RefineWMG-PT-100101-LTLCardinality-13 1218326 m, 243665 m/sec, 1833385 t fired, .

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
RefineWMG-PT-100101-LTLCardinality-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RefineWMG-PT-100101-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
RefineWMG-PT-100101-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/3585 28/32 RefineWMG-PT-100101-LTLCardinality-13 2484592 m, 253253 m/sec, 3738978 t fired, .

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 7 (type EXCL) for RefineWMG-PT-100101-LTLCardinality-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
RefineWMG-PT-100101-LTLCardinality-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RefineWMG-PT-100101-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
RefineWMG-PT-100101-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
RefineWMG-PT-100101-LTLCardinality-08: LTL unknown AGGR
RefineWMG-PT-100101-LTLCardinality-10: LTL false LTL model checker
RefineWMG-PT-100101-LTLCardinality-13: LTL unknown AGGR


Time elapsed: 30 secs. Pages in use: 32

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-100101"
export BK_EXAMINATION="LTLCardinality"
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-100101, examination is LTLCardinality"
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-167889199900651"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-100101.tgz
mv RefineWMG-PT-100101 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;