Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151600333.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DoubleExponent-PT-002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151600333
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 03:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K Apr 12 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 33K May 18 16:42 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 DoubleExponent-PT-002-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716421862972

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 23:51:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:51:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:51:04] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2024-05-22 23:51:04] [INFO ] Transformed 110 places.
[2024-05-22 23:51:04] [INFO ] Transformed 98 transitions.
[2024-05-22 23:51:04] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DoubleExponent-PT-002-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 18 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2024-05-22 23:51:05] [INFO ] Computed 11 invariants in 13 ms
[2024-05-22 23:51:05] [INFO ] Implicit Places using invariants in 170 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 431 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/110 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 454 ms. Remains : 105/110 places, 98/98 transitions.
Support contains 35 out of 105 places after structural reductions.
[2024-05-22 23:51:05] [INFO ] Flatten gal took : 28 ms
[2024-05-22 23:51:05] [INFO ] Flatten gal took : 11 ms
[2024-05-22 23:51:05] [INFO ] Input system was already deterministic with 98 transitions.
Incomplete random walk after 10000 steps, including 326 resets, run finished after 533 ms. (steps per millisecond=18 ) properties (out of 26) seen :14
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 276 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 98 rows 105 cols
[2024-05-22 23:51:07] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 23:51:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:51:07] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-22 23:51:07] [INFO ] After 62ms SMT Verify possible using state equation in real domain returned unsat :2 sat :3 real:1
[2024-05-22 23:51:07] [INFO ] After 102ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :3 real:1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-22 23:51:07] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :3 real:1
[2024-05-22 23:51:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:51:07] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-22 23:51:07] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-05-22 23:51:07] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-22 23:51:07] [INFO ] After 239ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 8 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 98/98 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 105 transition count 80
Reduce places removed 18 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 22 rules applied. Total rules applied 40 place count 87 transition count 76
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 44 place count 83 transition count 76
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 44 place count 83 transition count 71
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 54 place count 78 transition count 71
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 88 place count 61 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 59 transition count 54
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 59 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 58 transition count 53
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 100 place count 58 transition count 47
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 106 place count 52 transition count 47
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 112 place count 52 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 113 place count 51 transition count 46
Applied a total of 113 rules in 29 ms. Remains 51 /105 variables (removed 54) and now considering 46/98 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 51/105 places, 46/98 transitions.
Incomplete random walk after 10000 steps, including 1112 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 773 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 777 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 46 rows 51 cols
[2024-05-22 23:51:08] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 23:51:08] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 23:51:08] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-22 23:51:08] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-22 23:51:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 23:51:08] [INFO ] After 9ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 23:51:08] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 23:51:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:51:08] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-22 23:51:08] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 23:51:08] [INFO ] After 7ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 23:51:08] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-22 23:51:08] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 46/46 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 51 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 50 transition count 45
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 2 with 2 rules applied. Total rules applied 4 place count 49 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 48 transition count 44
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 48 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 47 transition count 43
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 47 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10 place count 46 transition count 42
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 11 place count 46 transition count 42
Applied a total of 11 rules in 11 ms. Remains 46 /51 variables (removed 5) and now considering 42/46 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 46/51 places, 42/46 transitions.
Incomplete random walk after 10000 steps, including 1397 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 894 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 879 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Finished probabilistic random walk after 844 steps, run visited all 2 properties in 21 ms. (steps per millisecond=40 )
Probabilistic random walk after 844 steps, saw 456 distinct states, run finished after 21 ms. (steps per millisecond=40 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DoubleExponent-PT-002-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA DoubleExponent-PT-002-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 170 edges and 105 vertex of which 103 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)&&p0))))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 105 cols
[2024-05-22 23:51:08] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 23:51:08] [INFO ] Implicit Places using invariants in 69 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 8 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2024-05-22 23:51:08] [INFO ] Computed 9 invariants in 2 ms
[2024-05-22 23:51:09] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 23:51:09] [INFO ] Invariant cache hit.
[2024-05-22 23:51:09] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/105 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 229 ms. Remains : 103/105 places, 97/98 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s58 1) (GEQ s65 1)), p1:(AND (GEQ s59 1) (GEQ s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 5 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-00 finished in 540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 105 transition count 78
Reduce places removed 20 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 24 rules applied. Total rules applied 44 place count 85 transition count 74
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 48 place count 81 transition count 74
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 48 place count 81 transition count 69
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 58 place count 76 transition count 69
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 94 place count 58 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 98 place count 56 transition count 51
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 100 place count 56 transition count 51
Applied a total of 100 rules in 24 ms. Remains 56 /105 variables (removed 49) and now considering 51/98 (removed 47) transitions.
// Phase 1: matrix 51 rows 56 cols
[2024-05-22 23:51:09] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 23:51:09] [INFO ] Implicit Places using invariants in 100 ms returned [39]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 100 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/105 places, 51/98 transitions.
Graph (complete) has 152 edges and 55 vertex of which 54 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 53 transition count 49
Applied a total of 3 rules in 25 ms. Remains 53 /55 variables (removed 2) and now considering 49/51 (removed 2) transitions.
// Phase 1: matrix 49 rows 53 cols
[2024-05-22 23:51:09] [INFO ] Computed 9 invariants in 0 ms
[2024-05-22 23:51:09] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 23:51:09] [INFO ] Invariant cache hit.
[2024-05-22 23:51:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 23:51:09] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/105 places, 49/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 300 ms. Remains : 53/105 places, 49/98 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s19 1)), p1:(OR (LT s41 1) (LT s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 10851 reset in 208 ms.
Product exploration explored 100000 steps with 10778 reset in 142 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 149 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 1075 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 715 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 707 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Finished probabilistic random walk after 228 steps, run visited all 2 properties in 4 ms. (steps per millisecond=57 )
Probabilistic random walk after 228 steps, saw 121 distinct states, run finished after 4 ms. (steps per millisecond=57 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 130 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 49/49 transitions.
Applied a total of 0 rules in 4 ms. Remains 53 /53 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2024-05-22 23:51:10] [INFO ] Invariant cache hit.
[2024-05-22 23:51:10] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 23:51:10] [INFO ] Invariant cache hit.
[2024-05-22 23:51:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 23:51:11] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-22 23:51:11] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 23:51:11] [INFO ] Invariant cache hit.
[2024-05-22 23:51:11] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 174 ms. Remains : 53/53 places, 49/49 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 149 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 1103 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 695 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 713 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Finished probabilistic random walk after 228 steps, run visited all 2 properties in 6 ms. (steps per millisecond=38 )
Probabilistic random walk after 228 steps, saw 121 distinct states, run finished after 6 ms. (steps per millisecond=38 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 226 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 10830 reset in 149 ms.
Product exploration explored 100000 steps with 10791 reset in 136 ms.
Built C files in :
/tmp/ltsmin4257605615385766848
[2024-05-22 23:51:12] [INFO ] Computing symmetric may disable matrix : 49 transitions.
[2024-05-22 23:51:12] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:51:12] [INFO ] Computing symmetric may enable matrix : 49 transitions.
[2024-05-22 23:51:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:51:12] [INFO ] Computing Do-Not-Accords matrix : 49 transitions.
[2024-05-22 23:51:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:51:12] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4257605615385766848
Running compilation step : cd /tmp/ltsmin4257605615385766848;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 224 ms.
Running link step : cd /tmp/ltsmin4257605615385766848;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin4257605615385766848;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7768242870816379245.hoa' '--buchi-type=spotba'
LTSmin run took 124 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-002-LTLFireability-01 finished in 3515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((((p1||X(!p2)) U p2)||p0)))'
Support contains 3 out of 105 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 : 105/105 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 104 transition count 77
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 84 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 83 transition count 76
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 42 place count 83 transition count 72
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 50 place count 79 transition count 72
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 84 place count 62 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 86 place count 61 transition count 55
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 61 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 60 transition count 54
Applied a total of 88 rules in 15 ms. Remains 60 /105 variables (removed 45) and now considering 54/98 (removed 44) transitions.
// Phase 1: matrix 54 rows 60 cols
[2024-05-22 23:51:12] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 23:51:12] [INFO ] Implicit Places using invariants in 40 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/105 places, 54/98 transitions.
Graph (complete) has 146 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 57 transition count 52
Applied a total of 3 rules in 4 ms. Remains 57 /59 variables (removed 2) and now considering 52/54 (removed 2) transitions.
// Phase 1: matrix 52 rows 57 cols
[2024-05-22 23:51:12] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 23:51:13] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 23:51:13] [INFO ] Invariant cache hit.
[2024-05-22 23:51:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:51:13] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/105 places, 52/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 175 ms. Remains : 57/105 places, 52/98 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s27 1) (AND (GEQ s8 1) (GEQ s20 1))), p2:(AND (GEQ s8 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 74 steps with 7 reset in 1 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-02 finished in 225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G(p1)||G(F(p2))))))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 105 cols
[2024-05-22 23:51:13] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 23:51:13] [INFO ] Implicit Places using invariants in 59 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 3 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2024-05-22 23:51:13] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 23:51:13] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 23:51:13] [INFO ] Invariant cache hit.
[2024-05-22 23:51:13] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/105 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 199 ms. Remains : 103/105 places, 97/98 transitions.
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s2 1), p1:(AND (GEQ s1 1) (GEQ s15 1)), p2:(LT s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3532 reset in 118 ms.
Product exploration explored 100000 steps with 3525 reset in 127 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p2), (NOT p2)]
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p2), (NOT p2)]
Support contains 1 out of 103 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 : 103/103 places, 97/97 transitions.
Graph (complete) has 167 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 101 transition count 74
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 80 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 79 transition count 73
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 45 place count 79 transition count 68
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 55 place count 74 transition count 68
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 93 place count 55 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 53 transition count 49
Applied a total of 97 rules in 14 ms. Remains 53 /103 variables (removed 50) and now considering 49/97 (removed 48) transitions.
// Phase 1: matrix 49 rows 53 cols
[2024-05-22 23:51:14] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 23:51:14] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 23:51:14] [INFO ] Invariant cache hit.
[2024-05-22 23:51:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:51:14] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-22 23:51:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:51:14] [INFO ] Invariant cache hit.
[2024-05-22 23:51:14] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/103 places, 49/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166 ms. Remains : 53/103 places, 49/97 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 150 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p2), (NOT p2)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 9294 reset in 84 ms.
Product exploration explored 100000 steps with 9250 reset in 85 ms.
Built C files in :
/tmp/ltsmin5498199014338231150
[2024-05-22 23:51:15] [INFO ] Computing symmetric may disable matrix : 49 transitions.
[2024-05-22 23:51:15] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:51:15] [INFO ] Computing symmetric may enable matrix : 49 transitions.
[2024-05-22 23:51:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:51:15] [INFO ] Computing Do-Not-Accords matrix : 49 transitions.
[2024-05-22 23:51:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:51:15] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5498199014338231150
Running compilation step : cd /tmp/ltsmin5498199014338231150;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 134 ms.
Running link step : cd /tmp/ltsmin5498199014338231150;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin5498199014338231150;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6698044892580844305.hoa' '--buchi-type=spotba'
LTSmin run took 173 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-002-LTLFireability-04 finished in 2332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(G(p0)) U p1)))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 104 transition count 80
Reduce places removed 17 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 20 rules applied. Total rules applied 37 place count 87 transition count 77
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 40 place count 84 transition count 77
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 40 place count 84 transition count 71
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 52 place count 78 transition count 71
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 90 place count 59 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 57 transition count 52
Applied a total of 94 rules in 9 ms. Remains 57 /105 variables (removed 48) and now considering 52/98 (removed 46) transitions.
// Phase 1: matrix 52 rows 57 cols
[2024-05-22 23:51:15] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 23:51:15] [INFO ] Implicit Places using invariants in 57 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/105 places, 52/98 transitions.
Graph (complete) has 149 edges and 56 vertex of which 55 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 54 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 54 transition count 50
Applied a total of 3 rules in 2 ms. Remains 54 /56 variables (removed 2) and now considering 50/52 (removed 2) transitions.
// Phase 1: matrix 50 rows 54 cols
[2024-05-22 23:51:15] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 23:51:15] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-22 23:51:15] [INFO ] Invariant cache hit.
[2024-05-22 23:51:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:51:15] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/105 places, 50/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 192 ms. Remains : 54/105 places, 50/98 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s33 1) (GEQ s39 1)), p1:(OR (AND (NOT (AND (GEQ s0 1) (GEQ s10 1))) (GEQ s33 1) (GEQ s39 1)) (AND (GEQ s0 1) (GEQ s10 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-05 finished in 317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(!p0))'
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 104 transition count 72
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 79 transition count 72
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 50 place count 79 transition count 68
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 58 place count 75 transition count 68
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 100 place count 54 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 52 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 51 transition count 46
Applied a total of 105 rules in 13 ms. Remains 51 /105 variables (removed 54) and now considering 46/98 (removed 52) transitions.
// Phase 1: matrix 46 rows 51 cols
[2024-05-22 23:51:15] [INFO ] Computed 10 invariants in 0 ms
[2024-05-22 23:51:15] [INFO ] Implicit Places using invariants in 40 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/105 places, 46/98 transitions.
Graph (complete) has 143 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 48 transition count 44
Applied a total of 3 rules in 3 ms. Remains 48 /50 variables (removed 2) and now considering 44/46 (removed 2) transitions.
// Phase 1: matrix 44 rows 48 cols
[2024-05-22 23:51:15] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 23:51:15] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 23:51:15] [INFO ] Invariant cache hit.
[2024-05-22 23:51:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:51:15] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/105 places, 44/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 174 ms. Remains : 48/105 places, 44/98 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 41 ms :[true, p0]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LT s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-07 finished in 232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(p1)))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 105 cols
[2024-05-22 23:51:16] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 23:51:16] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 23:51:16] [INFO ] Invariant cache hit.
[2024-05-22 23:51:16] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-22 23:51:16] [INFO ] Invariant cache hit.
[2024-05-22 23:51:16] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 105/105 places, 98/98 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s41 1), p1:(OR (LT s75 1) (LT s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3298 reset in 81 ms.
Product exploration explored 100000 steps with 3270 reset in 82 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 170 edges and 105 vertex of which 103 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Detected a total of 7/105 stabilizing places and 7/98 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 213 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 332 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 286 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-22 23:51:17] [INFO ] Invariant cache hit.
[2024-05-22 23:51:17] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 23:51:17] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-22 23:51:17] [INFO ] After 35ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2024-05-22 23:51:17] [INFO ] After 48ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-22 23:51:17] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 98/98 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 105 transition count 73
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 80 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 50 place count 80 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 58 place count 76 transition count 69
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 102 place count 54 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 106 place count 52 transition count 47
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 52 transition count 43
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 114 place count 48 transition count 43
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 122 place count 48 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 47 transition count 42
Applied a total of 123 rules in 20 ms. Remains 47 /105 variables (removed 58) and now considering 42/98 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 47/105 places, 42/98 transitions.
Incomplete random walk after 10000 steps, including 1289 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1710 steps, run visited all 1 properties in 7 ms. (steps per millisecond=244 )
Probabilistic random walk after 1710 steps, saw 886 distinct states, run finished after 7 ms. (steps per millisecond=244 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 189 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 104 transition count 72
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 79 transition count 72
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 50 place count 79 transition count 68
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 58 place count 75 transition count 68
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 96 place count 56 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 54 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 53 transition count 48
Applied a total of 101 rules in 18 ms. Remains 53 /105 variables (removed 52) and now considering 48/98 (removed 50) transitions.
// Phase 1: matrix 48 rows 53 cols
[2024-05-22 23:51:17] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 23:51:17] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 23:51:17] [INFO ] Invariant cache hit.
[2024-05-22 23:51:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:51:17] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-22 23:51:17] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:51:17] [INFO ] Invariant cache hit.
[2024-05-22 23:51:17] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/105 places, 48/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 178 ms. Remains : 53/105 places, 48/98 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 152 edges and 53 vertex of which 51 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/53 stabilizing places and 2/48 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 123 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1080 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 702 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 711 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-22 23:51:18] [INFO ] Invariant cache hit.
[2024-05-22 23:51:18] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 23:51:18] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 1 ms returned sat
[2024-05-22 23:51:18] [INFO ] After 16ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2024-05-22 23:51:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:51:18] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-22 23:51:18] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-22 23:51:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 23:51:18] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 1 ms returned sat
[2024-05-22 23:51:18] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-22 23:51:18] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-22 23:51:18] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-22 23:51:18] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 48/48 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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 47
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 52 transition count 43
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 48 transition count 43
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 48 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 47 transition count 42
Applied a total of 19 rules in 13 ms. Remains 47 /53 variables (removed 6) and now considering 42/48 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 47/53 places, 42/48 transitions.
Incomplete random walk after 10000 steps, including 1298 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1960 steps, run visited all 1 properties in 6 ms. (steps per millisecond=326 )
Probabilistic random walk after 1960 steps, saw 1010 distinct states, run finished after 7 ms. (steps per millisecond=280 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 211 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 10912 reset in 83 ms.
Product exploration explored 100000 steps with 10831 reset in 86 ms.
Built C files in :
/tmp/ltsmin14852590128058973536
[2024-05-22 23:51:19] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2024-05-22 23:51:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:51:19] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2024-05-22 23:51:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:51:19] [INFO ] Computing Do-Not-Accords matrix : 48 transitions.
[2024-05-22 23:51:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:51:19] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14852590128058973536
Running compilation step : cd /tmp/ltsmin14852590128058973536;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 121 ms.
Running link step : cd /tmp/ltsmin14852590128058973536;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin14852590128058973536;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14955842884499656276.hoa' '--buchi-type=spotba'
LTSmin run took 125 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-002-LTLFireability-09 finished in 3543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G((!p0||X((p1||G(p2)))))))))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 105 cols
[2024-05-22 23:51:19] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 23:51:19] [INFO ] Implicit Places using invariants in 43 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 1 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2024-05-22 23:51:19] [INFO ] Computed 9 invariants in 0 ms
[2024-05-22 23:51:19] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 23:51:19] [INFO ] Invariant cache hit.
[2024-05-22 23:51:19] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/105 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 166 ms. Remains : 103/105 places, 97/98 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, false, (AND (NOT p1) (NOT p2)), false, (AND p0 (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=p0, acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(GEQ s4 1), p1:(AND (GEQ s45 1) (GEQ s92 1)), p2:(GEQ s73 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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]]
Product exploration explored 100000 steps with 3285 reset in 70 ms.
Product exploration explored 100000 steps with 3323 reset in 75 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Detected a total of 7/103 stabilizing places and 7/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 330 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 278 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-22 23:51:20] [INFO ] Invariant cache hit.
[2024-05-22 23:51:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:51:20] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-22 23:51:20] [INFO ] After 30ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2024-05-22 23:51:20] [INFO ] After 59ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-22 23:51:20] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 97/97 transitions.
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 101 transition count 70
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 76 transition count 70
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 52 place count 76 transition count 65
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 71 transition count 65
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 104 place count 50 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 48 transition count 44
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 113 place count 48 transition count 39
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 118 place count 43 transition count 39
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 126 place count 43 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 42 transition count 38
Applied a total of 127 rules in 8 ms. Remains 42 /103 variables (removed 61) and now considering 38/97 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 42/103 places, 38/97 transitions.
Finished random walk after 677 steps, including 79 resets, run visited all 1 properties in 1 ms. (steps per millisecond=677 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p0), (F p2), (F (AND p2 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 5 factoid took 257 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 257 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-22 23:51:21] [INFO ] Invariant cache hit.
[2024-05-22 23:51:21] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 23:51:21] [INFO ] Invariant cache hit.
[2024-05-22 23:51:21] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-22 23:51:21] [INFO ] Invariant cache hit.
[2024-05-22 23:51:21] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 213 ms. Remains : 103/103 places, 97/97 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Detected a total of 7/103 stabilizing places and 7/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 335 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:51:22] [INFO ] Invariant cache hit.
[2024-05-22 23:51:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:51:22] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-22 23:51:22] [INFO ] After 31ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 23:51:22] [INFO ] After 39ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-22 23:51:22] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 97/97 transitions.
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 101 transition count 70
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 76 transition count 70
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 52 place count 76 transition count 65
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 71 transition count 65
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 104 place count 50 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 48 transition count 44
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 113 place count 48 transition count 39
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 118 place count 43 transition count 39
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 126 place count 43 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 42 transition count 38
Applied a total of 127 rules in 11 ms. Remains 42 /103 variables (removed 61) and now considering 38/97 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 42/103 places, 38/97 transitions.
Finished random walk after 7952 steps, including 1039 resets, run visited all 1 properties in 7 ms. (steps per millisecond=1136 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F p1), (F p2), (F (AND p2 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 3 factoid took 209 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
Product exploration explored 100000 steps with 3303 reset in 65 ms.
Entered a terminal (fully accepting) state of product in 21016 steps with 702 reset in 17 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-10 finished in 3489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(G(p1))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 105 cols
[2024-05-22 23:51:23] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 23:51:23] [INFO ] Implicit Places using invariants in 51 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 1 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2024-05-22 23:51:23] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 23:51:23] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 23:51:23] [INFO ] Invariant cache hit.
[2024-05-22 23:51:23] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/105 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 170 ms. Remains : 103/105 places, 97/98 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LT s27 1), p0:(AND (GEQ s61 1) (GEQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3307 reset in 81 ms.
Product exploration explored 100000 steps with 3298 reset in 161 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 96 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 327 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:51:23] [INFO ] Invariant cache hit.
[2024-05-22 23:51:23] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 23:51:23] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-22 23:51:23] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 23:51:23] [INFO ] After 47ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:51:23] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:51:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:51:23] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-22 23:51:23] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:51:23] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-22 23:51:23] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 97/97 transitions.
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 101 transition count 71
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 77 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 76 transition count 70
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 52 place count 76 transition count 65
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 62 place count 71 transition count 65
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 102 place count 51 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 49 transition count 45
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 112 place count 49 transition count 39
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 118 place count 43 transition count 39
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 126 place count 43 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 42 transition count 38
Applied a total of 127 rules in 9 ms. Remains 42 /103 variables (removed 61) and now considering 38/97 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 42/103 places, 38/97 transitions.
Incomplete random walk after 10000 steps, including 1304 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 460 steps, run visited all 1 properties in 4 ms. (steps per millisecond=115 )
Probabilistic random walk after 460 steps, saw 240 distinct states, run finished after 4 ms. (steps per millisecond=115 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 10 factoid took 212 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1), true]
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-22 23:51:24] [INFO ] Invariant cache hit.
[2024-05-22 23:51:24] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 23:51:24] [INFO ] Invariant cache hit.
[2024-05-22 23:51:24] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-22 23:51:24] [INFO ] Invariant cache hit.
[2024-05-22 23:51:24] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 103/103 places, 97/97 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 101 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 332 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:51:24] [INFO ] Invariant cache hit.
[2024-05-22 23:51:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:51:24] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-22 23:51:24] [INFO ] After 51ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 23:51:24] [INFO ] After 63ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:51:24] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:51:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 23:51:24] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-22 23:51:25] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:51:25] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-22 23:51:25] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 97/97 transitions.
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 101 transition count 71
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 77 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 76 transition count 70
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 52 place count 76 transition count 65
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 62 place count 71 transition count 65
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 102 place count 51 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 49 transition count 45
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 112 place count 49 transition count 39
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 118 place count 43 transition count 39
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 126 place count 43 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 42 transition count 38
Applied a total of 127 rules in 6 ms. Remains 42 /103 variables (removed 61) and now considering 38/97 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 42/103 places, 38/97 transitions.
Incomplete random walk after 10000 steps, including 1283 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 831 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 460 steps, run visited all 1 properties in 3 ms. (steps per millisecond=153 )
Probabilistic random walk after 460 steps, saw 240 distinct states, run finished after 4 ms. (steps per millisecond=115 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 10 factoid took 226 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 3313 reset in 82 ms.
Product exploration explored 100000 steps with 3281 reset in 91 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1), true]
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Graph (complete) has 167 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 102 transition count 96
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 23 place count 102 transition count 98
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 102 transition count 98
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 98 transition count 94
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 98 transition count 94
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 56 place count 98 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 97 transition count 96
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 97 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 97 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 95 transition count 99
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 95 transition count 99
Deduced a syphon composed of 42 places in 1 ms
Applied a total of 64 rules in 23 ms. Remains 95 /103 variables (removed 8) and now considering 99/97 (removed -2) transitions.
[2024-05-22 23:51:25] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 99 rows 95 cols
[2024-05-22 23:51:25] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 23:51:26] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/103 places, 99/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 95/103 places, 99/97 transitions.
Built C files in :
/tmp/ltsmin4363897635045267446
[2024-05-22 23:51:26] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4363897635045267446
Running compilation step : cd /tmp/ltsmin4363897635045267446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 173 ms.
Running link step : cd /tmp/ltsmin4363897635045267446;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4363897635045267446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6396820391607810141.hoa' '--buchi-type=spotba'
LTSmin run took 253 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-002-LTLFireability-12 finished in 3484 ms.
All properties solved by simple procedures.
Total runtime 22073 ms.

BK_STOP 1716421887433

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-002"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is DoubleExponent-PT-002, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r153-tall-171631151600333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-002.tgz
mv DoubleExponent-PT-002 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;