Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r105-tall-167814481200412.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DES-PT-10a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481200412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 43K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-10a-LTLFireability-00
FORMULA_NAME DES-PT-10a-LTLFireability-01
FORMULA_NAME DES-PT-10a-LTLFireability-02
FORMULA_NAME DES-PT-10a-LTLFireability-03
FORMULA_NAME DES-PT-10a-LTLFireability-04
FORMULA_NAME DES-PT-10a-LTLFireability-05
FORMULA_NAME DES-PT-10a-LTLFireability-06
FORMULA_NAME DES-PT-10a-LTLFireability-07
FORMULA_NAME DES-PT-10a-LTLFireability-08
FORMULA_NAME DES-PT-10a-LTLFireability-09
FORMULA_NAME DES-PT-10a-LTLFireability-10
FORMULA_NAME DES-PT-10a-LTLFireability-11
FORMULA_NAME DES-PT-10a-LTLFireability-12
FORMULA_NAME DES-PT-10a-LTLFireability-13
FORMULA_NAME DES-PT-10a-LTLFireability-14
FORMULA_NAME DES-PT-10a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678293601777

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 16:40:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 16:40:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 16:40:03] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-08 16:40:03] [INFO ] Transformed 155 places.
[2023-03-08 16:40:03] [INFO ] Transformed 112 transitions.
[2023-03-08 16:40:03] [INFO ] Found NUPN structural information;
[2023-03-08 16:40:03] [INFO ] Parsed PT model containing 155 places and 112 transitions and 552 arcs in 117 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-10a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 97
Applied a total of 2 rules in 22 ms. Remains 154 /155 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 154 cols
[2023-03-08 16:40:03] [INFO ] Computed 59 place invariants in 20 ms
[2023-03-08 16:40:03] [INFO ] Implicit Places using invariants in 336 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 361 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/155 places, 97/98 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 389 ms. Remains : 153/155 places, 97/98 transitions.
Support contains 54 out of 153 places after structural reductions.
[2023-03-08 16:40:04] [INFO ] Flatten gal took : 35 ms
[2023-03-08 16:40:04] [INFO ] Flatten gal took : 15 ms
[2023-03-08 16:40:04] [INFO ] Input system was already deterministic with 97 transitions.
Support contains 52 out of 153 places (down from 54) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 219 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 28) seen :19
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 16:40:05] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 16:40:05] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 16:40:05] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 7 ms returned sat
[2023-03-08 16:40:05] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 16:40:05] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 16:40:05] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 42 ms returned sat
[2023-03-08 16:40:05] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-08 16:40:05] [INFO ] After 313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 168 ms.
[2023-03-08 16:40:05] [INFO ] After 689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 6 properties in 162 ms.
Support contains 8 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 97/97 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 95
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 153 transition count 95
Applied a total of 7 rules in 33 ms. Remains 153 /153 variables (removed 0) and now considering 95/97 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 153/153 places, 95/97 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1033713 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :{}
Probabilistic random walk after 1033713 steps, saw 145925 distinct states, run finished after 3002 ms. (steps per millisecond=344 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-08 16:40:09] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 16:40:09] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 16:40:09] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2023-03-08 16:40:09] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:40:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2023-03-08 16:40:09] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 16:40:09] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:40:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 16:40:09] [INFO ] After 32ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 16:40:09] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-08 16:40:09] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 28 ms.
Support contains 8 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 153/153 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-08 16:40:09] [INFO ] Invariant cache hit.
[2023-03-08 16:40:09] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-08 16:40:09] [INFO ] Invariant cache hit.
[2023-03-08 16:40:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 16:40:10] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-03-08 16:40:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 16:40:10] [INFO ] Invariant cache hit.
[2023-03-08 16:40:10] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-08 16:40:10] [INFO ] Invariant cache hit.
[2023-03-08 16:40:10] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:40:10] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2023-03-08 16:40:10] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:40:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:40:10] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 32 ms returned sat
[2023-03-08 16:40:10] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:40:10] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-08 16:40:10] [INFO ] After 279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Computed a total of 56 stabilizing places and 51 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (!p1&&X(F(p0)))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 16:40:10] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 16:40:10] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-08 16:40:10] [INFO ] Invariant cache hit.
[2023-03-08 16:40:11] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-08 16:40:11] [INFO ] Invariant cache hit.
[2023-03-08 16:40:11] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) p1), true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 2}, { cond=(NOT p1), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s42 1) (EQ s54 1)), p0:(AND (EQ s56 1) (EQ s57 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]]
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 3 ms.
FORMULA DES-PT-10a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-00 finished in 591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:40:11] [INFO ] Invariant cache hit.
[2023-03-08 16:40:11] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-08 16:40:11] [INFO ] Invariant cache hit.
[2023-03-08 16:40:11] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-08 16:40:11] [INFO ] Invariant cache hit.
[2023-03-08 16:40:11] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 294 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s71 1) (EQ s134 1) (OR (EQ s107 0) (EQ s123 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 1 ms.
FORMULA DES-PT-10a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-01 finished in 370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(!p1&&F(!p0)))))'
Support contains 8 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 11 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:40:11] [INFO ] Invariant cache hit.
[2023-03-08 16:40:11] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-08 16:40:11] [INFO ] Invariant cache hit.
[2023-03-08 16:40:12] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-08 16:40:12] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 16:40:12] [INFO ] Invariant cache hit.
[2023-03-08 16:40:12] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 302 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 77 ms :[p0, p0]
Running random walk in product with property : DES-PT-10a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s38 1) (EQ s45 1)), p0:(AND (NOT (AND (EQ s3 1) (EQ s72 1) (EQ s74 1) (EQ s71 1) (EQ s134 1))) (NOT (AND (EQ s2 1) (EQ s72 1) (EQ s74 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 5 ms.
FORMULA DES-PT-10a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-03 finished in 405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:40:12] [INFO ] Invariant cache hit.
[2023-03-08 16:40:12] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-08 16:40:12] [INFO ] Invariant cache hit.
[2023-03-08 16:40:12] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-08 16:40:12] [INFO ] Invariant cache hit.
[2023-03-08 16:40:12] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 296 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s46 0) (OR (EQ s27 0) (EQ s69 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA DES-PT-10a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-04 finished in 403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 8 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:40:12] [INFO ] Invariant cache hit.
[2023-03-08 16:40:12] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-08 16:40:12] [INFO ] Invariant cache hit.
[2023-03-08 16:40:12] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-08 16:40:12] [INFO ] Invariant cache hit.
[2023-03-08 16:40:12] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 282 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s112 1) (EQ s114 1) (EQ s116 1) (EQ s118 1) (EQ s120 1) (EQ s122 1) (EQ s124 1) (EQ s126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA DES-PT-10a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-05 finished in 463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:40:13] [INFO ] Invariant cache hit.
[2023-03-08 16:40:13] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-08 16:40:13] [INFO ] Invariant cache hit.
[2023-03-08 16:40:13] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-08 16:40:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 16:40:13] [INFO ] Invariant cache hit.
[2023-03-08 16:40:13] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 298 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-10a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s109 0) (EQ s125 0)), p1:(OR (NEQ s109 1) (NEQ s125 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 2351 reset in 274 ms.
Product exploration explored 100000 steps with 2322 reset in 269 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 240 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 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 225 steps, including 5 resets, run visited all 2 properties in 4 ms. (steps per millisecond=56 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 262 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 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:40:14] [INFO ] Invariant cache hit.
[2023-03-08 16:40:14] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 16:40:14] [INFO ] Invariant cache hit.
[2023-03-08 16:40:15] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-08 16:40:15] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 16:40:15] [INFO ] Invariant cache hit.
[2023-03-08 16:40:15] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 296 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 222 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 :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 35 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 327 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 109 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 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2344 reset in 203 ms.
Product exploration explored 100000 steps with 2327 reset in 282 ms.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:40:16] [INFO ] Invariant cache hit.
[2023-03-08 16:40:16] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-08 16:40:16] [INFO ] Invariant cache hit.
[2023-03-08 16:40:16] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-08 16:40:16] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 16:40:16] [INFO ] Invariant cache hit.
[2023-03-08 16:40:17] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 293 ms. Remains : 153/153 places, 97/97 transitions.
Treatment of property DES-PT-10a-LTLFireability-06 finished in 3975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(p1))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:40:17] [INFO ] Invariant cache hit.
[2023-03-08 16:40:17] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-08 16:40:17] [INFO ] Invariant cache hit.
[2023-03-08 16:40:17] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-08 16:40:17] [INFO ] Invariant cache hit.
[2023-03-08 16:40:17] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 281 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-10a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s18 0) (EQ s148 0)), p1:(AND (EQ s53 1) (EQ s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 248 ms.
Product exploration explored 100000 steps with 33333 reset in 262 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 6 factoid took 175 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-10a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10a-LTLFireability-08 finished in 1127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(F(p1)&&G(p2))))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:40:18] [INFO ] Invariant cache hit.
[2023-03-08 16:40:18] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-08 16:40:18] [INFO ] Invariant cache hit.
[2023-03-08 16:40:18] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-08 16:40:18] [INFO ] Invariant cache hit.
[2023-03-08 16:40:18] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DES-PT-10a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 2}, { cond=(AND p1 p2), acceptance={} source=5 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p0:(OR (EQ s24 0) (EQ s69 0)), p2:(AND (EQ s13 1) (EQ s148 1)), p1:(AND (EQ s11 1) (EQ s148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 298 ms.
Product exploration explored 100000 steps with 50000 reset in 301 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 13 factoid took 189 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-10a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10a-LTLFireability-10 finished in 1337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((X(p1) U (F(p3)&&p2))))))'
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:40:19] [INFO ] Invariant cache hit.
[2023-03-08 16:40:19] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-08 16:40:19] [INFO ] Invariant cache hit.
[2023-03-08 16:40:19] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-08 16:40:19] [INFO ] Invariant cache hit.
[2023-03-08 16:40:19] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 281 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : DES-PT-10a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s61 1) (EQ s66 1) (EQ s68 1)), p2:(AND (EQ s135 1) (EQ s149 1)), p3:(AND (EQ s135 1) (EQ s149 1)), p1:(AND (EQ s37 1) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 104 steps with 3 reset in 1 ms.
FORMULA DES-PT-10a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-11 finished in 453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)||p0))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:40:19] [INFO ] Invariant cache hit.
[2023-03-08 16:40:20] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-08 16:40:20] [INFO ] Invariant cache hit.
[2023-03-08 16:40:20] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-08 16:40:20] [INFO ] Invariant cache hit.
[2023-03-08 16:40:20] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-10a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (EQ s17 0) (EQ s148 0)), p0:(OR (EQ s95 0) (EQ s111 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 247 ms.
Product exploration explored 100000 steps with 33333 reset in 271 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) p1))))
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-10a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10a-LTLFireability-12 finished in 1065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F(p1)))))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:40:21] [INFO ] Invariant cache hit.
[2023-03-08 16:40:21] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-08 16:40:21] [INFO ] Invariant cache hit.
[2023-03-08 16:40:21] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-08 16:40:21] [INFO ] Invariant cache hit.
[2023-03-08 16:40:21] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-10a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s36 1) (EQ s45 1)), p1:(AND (EQ s61 1) (EQ s66 1) (EQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA DES-PT-10a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-13 finished in 354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((!p1||F(((!p2&&F((!p2&&X(G(!p3)))))||G((F(!p2)&&F(G(!p3)))))))))))'
Support contains 8 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:40:21] [INFO ] Invariant cache hit.
[2023-03-08 16:40:21] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-08 16:40:21] [INFO ] Invariant cache hit.
[2023-03-08 16:40:21] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-08 16:40:21] [INFO ] Invariant cache hit.
[2023-03-08 16:40:21] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 651 ms :[(OR (AND p1 p2) (AND p1 p3)), (OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND (NOT p1) p2 p3), (AND p1 p3), false, p2, (AND p1 p2), false, (AND p3 p1), false, (AND p2 p1), false]
Running random walk in product with property : DES-PT-10a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p1 p0), acceptance={} source=1 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 8}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 9}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 10}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 p2), acceptance={} source=3 dest: 8}], [{ cond=(NOT p3), acceptance={1} source=4 dest: 4}, { cond=p3, acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p1) p2 p3), acceptance={} source=5 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND p2 (NOT p3))), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=5 dest: 8}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p3 p0), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p3) p0), acceptance={1} source=6 dest: 6}, { cond=(AND p1 p3 p0), acceptance={0, 1} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 11}], [{ cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p2) p0) (AND p2 (NOT p3) p0)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={} source=7 dest: 10}, { cond=(OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))), acceptance={} source=7 dest: 12}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=7 dest: 14}], [{ cond=p2, acceptance={0, 1} source=8 dest: 8}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=9 dest: 9}, { cond=(AND p1 p2 p0), acceptance={0, 1} source=9 dest: 9}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=9 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=10 dest: 12}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=10 dest: 14}], [{ cond=p1, acceptance={} source=11 dest: 4}, { cond=(NOT p1), acceptance={} source=11 dest: 11}], [{ cond=(AND p1 p2 (NOT p3)), acceptance={} source=12 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=12 dest: 12}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=12 dest: 14}], [{ cond=(AND p1 p2), acceptance={} source=13 dest: 8}, { cond=(AND (NOT p1) p2), acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=14 dest: 12}, { cond=(AND (NOT p1) p2), acceptance={} source=14 dest: 14}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s72 1) (EQ s74 1)), p1:(AND (EQ s4 1) (EQ s72 1) (EQ s74 1)), p2:(AND (EQ s142 1) (EQ s147 1)), p3:(AND (EQ s105 1) (EQ s121 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2228 reset in 211 ms.
Product exploration explored 100000 steps with 2231 reset in 277 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p1 p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), true, (X (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND p2 (NOT p3) p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND p2 (NOT p3))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2 p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p3 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 41 factoid took 2235 ms. Reduced automaton from 15 states, 53 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Incomplete random walk after 10000 steps, including 231 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 16:40:25] [INFO ] Invariant cache hit.
[2023-03-08 16:40:25] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 16:40:25] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 16:40:25] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:40:25] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2023-03-08 16:40:25] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 135 ms returned sat
[2023-03-08 16:40:25] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:40:25] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-08 16:40:25] [INFO ] After 357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 58 ms.
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 97/97 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 95
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 153 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 152 transition count 94
Applied a total of 9 rules in 14 ms. Remains 152 /153 variables (removed 1) and now considering 94/97 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 152/153 places, 94/97 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1263190 steps, run timeout after 3001 ms. (steps per millisecond=420 ) properties seen :{}
Probabilistic random walk after 1263190 steps, saw 176434 distinct states, run finished after 3001 ms. (steps per millisecond=420 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 16:40:29] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 16:40:29] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:40:29] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 16:40:29] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:40:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:40:29] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 131 ms returned sat
[2023-03-08 16:40:29] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:40:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 16:40:29] [INFO ] After 25ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 16:40:29] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2023-03-08 16:40:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-08 16:40:29] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-08 16:40:29] [INFO ] After 433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 30 ms.
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 152/152 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-08 16:40:29] [INFO ] Invariant cache hit.
[2023-03-08 16:40:29] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 16:40:29] [INFO ] Invariant cache hit.
[2023-03-08 16:40:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 16:40:29] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-08 16:40:29] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 16:40:29] [INFO ] Invariant cache hit.
[2023-03-08 16:40:30] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 295 ms. Remains : 152/152 places, 94/94 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 94
Applied a total of 1 rules in 7 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 16:40:30] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 16:40:30] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:40:30] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 16:40:30] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:40:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-08 16:40:30] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 133 ms returned sat
[2023-03-08 16:40:30] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:40:30] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2023-03-08 16:40:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-08 16:40:30] [INFO ] After 173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-08 16:40:30] [INFO ] After 397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p1 p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), true, (X (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND p2 (NOT p3) p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND p2 (NOT p3))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2 p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p3 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p2 (NOT p1) p3)), (F p3), (F (AND p2 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (AND (NOT p2) (NOT p1)) (AND p2 (NOT p3)))))]
Knowledge based reduction with 41 factoid took 2062 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Stuttering acceptance computed with spot in 233 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Support contains 7 out of 153 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 16:40:33] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 16:40:33] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-08 16:40:33] [INFO ] Invariant cache hit.
[2023-03-08 16:40:33] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-08 16:40:33] [INFO ] Invariant cache hit.
[2023-03-08 16:40:33] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 268 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/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 p3)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (OR (AND (NOT p2) (NOT p1)) (AND p2 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 609 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Incomplete random walk after 10000 steps, including 228 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 16:40:34] [INFO ] Invariant cache hit.
[2023-03-08 16:40:34] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 16:40:34] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 16:40:34] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:40:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 16:40:34] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 124 ms returned sat
[2023-03-08 16:40:34] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:40:34] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-08 16:40:34] [INFO ] After 343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 48 ms.
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 97/97 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 95
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 153 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 152 transition count 94
Applied a total of 9 rules in 11 ms. Remains 152 /153 variables (removed 1) and now considering 94/97 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 152/153 places, 94/97 transitions.
Incomplete random walk after 10000 steps, including 127 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1272749 steps, run timeout after 3001 ms. (steps per millisecond=424 ) properties seen :{}
Probabilistic random walk after 1272749 steps, saw 177615 distinct states, run finished after 3001 ms. (steps per millisecond=424 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 16:40:38] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 16:40:38] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:40:38] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 16:40:38] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:40:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:40:38] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 138 ms returned sat
[2023-03-08 16:40:38] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:40:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 16:40:38] [INFO ] After 30ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 16:40:38] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2023-03-08 16:40:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-08 16:40:38] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 16:40:38] [INFO ] After 437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 29 ms.
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 152/152 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-08 16:40:38] [INFO ] Invariant cache hit.
[2023-03-08 16:40:38] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-08 16:40:38] [INFO ] Invariant cache hit.
[2023-03-08 16:40:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 16:40:38] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-08 16:40:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 16:40:38] [INFO ] Invariant cache hit.
[2023-03-08 16:40:38] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 152/152 places, 94/94 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 94
Applied a total of 1 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 16:40:38] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 16:40:38] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:40:38] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 16:40:38] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:40:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:40:39] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 133 ms returned sat
[2023-03-08 16:40:39] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:40:39] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2023-03-08 16:40:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-08 16:40:39] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-08 16:40:39] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (OR (AND (NOT p2) (NOT p1)) (AND p2 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p2 (NOT p1) p3)), (F p3), (F (AND p2 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (AND (NOT p2) (NOT p1)) (AND p2 (NOT p3)))))]
Knowledge based reduction with 15 factoid took 807 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Stuttering acceptance computed with spot in 267 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Stuttering acceptance computed with spot in 246 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Product exploration explored 100000 steps with 2211 reset in 222 ms.
Product exploration explored 100000 steps with 2216 reset in 260 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 227 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 10 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:40:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 16:40:41] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 16:40:41] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 153/153 places, 97/97 transitions.
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:40:41] [INFO ] Invariant cache hit.
[2023-03-08 16:40:41] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-08 16:40:41] [INFO ] Invariant cache hit.
[2023-03-08 16:40:42] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-08 16:40:42] [INFO ] Invariant cache hit.
[2023-03-08 16:40:42] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 153/153 places, 97/97 transitions.
Treatment of property DES-PT-10a-LTLFireability-14 finished in 20729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(F((p1||G(p2))))))))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:40:42] [INFO ] Invariant cache hit.
[2023-03-08 16:40:42] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-08 16:40:42] [INFO ] Invariant cache hit.
[2023-03-08 16:40:42] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-08 16:40:42] [INFO ] Invariant cache hit.
[2023-03-08 16:40:42] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-10a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s22 1) (EQ s69 1)), p1:(AND (EQ s26 1) (EQ s69 1)), p2:(OR (EQ s46 0) (EQ s67 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2213 reset in 220 ms.
Product exploration explored 100000 steps with 2198 reset in 253 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 230 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:40:44] [INFO ] Invariant cache hit.
[2023-03-08 16:40:44] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 16:40:44] [INFO ] Invariant cache hit.
[2023-03-08 16:40:44] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-08 16:40:44] [INFO ] Invariant cache hit.
[2023-03-08 16:40:44] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 184 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2225 reset in 218 ms.
Product exploration explored 100000 steps with 2219 reset in 238 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:40:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 16:40:46] [INFO ] Invariant cache hit.
[2023-03-08 16:40:46] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 153/153 places, 97/97 transitions.
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:40:46] [INFO ] Invariant cache hit.
[2023-03-08 16:40:46] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-08 16:40:46] [INFO ] Invariant cache hit.
[2023-03-08 16:40:46] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-08 16:40:46] [INFO ] Invariant cache hit.
[2023-03-08 16:40:46] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 153/153 places, 97/97 transitions.
Treatment of property DES-PT-10a-LTLFireability-15 finished in 4296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((!p1||F(((!p2&&F((!p2&&X(G(!p3)))))||G((F(!p2)&&F(G(!p3)))))))))))'
Found a Lengthening insensitive property : DES-PT-10a-LTLFireability-14
Stuttering acceptance computed with spot in 673 ms :[(OR (AND p1 p2) (AND p1 p3)), (OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND (NOT p1) p2 p3), (AND p1 p3), false, p2, (AND p1 p2), false, (AND p3 p1), false, (AND p2 p1), false]
Support contains 8 out of 153 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:40:47] [INFO ] Invariant cache hit.
[2023-03-08 16:40:47] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 16:40:47] [INFO ] Invariant cache hit.
[2023-03-08 16:40:47] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-08 16:40:47] [INFO ] Invariant cache hit.
[2023-03-08 16:40:47] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 277 ms. Remains : 153/153 places, 97/97 transitions.
Running random walk in product with property : DES-PT-10a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p1 p0), acceptance={} source=1 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 8}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 9}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 10}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 p2), acceptance={} source=3 dest: 8}], [{ cond=(NOT p3), acceptance={1} source=4 dest: 4}, { cond=p3, acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p1) p2 p3), acceptance={} source=5 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND p2 (NOT p3))), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=5 dest: 8}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p3 p0), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p3) p0), acceptance={1} source=6 dest: 6}, { cond=(AND p1 p3 p0), acceptance={0, 1} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 11}], [{ cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p2) p0) (AND p2 (NOT p3) p0)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={} source=7 dest: 10}, { cond=(OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))), acceptance={} source=7 dest: 12}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=7 dest: 14}], [{ cond=p2, acceptance={0, 1} source=8 dest: 8}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=9 dest: 9}, { cond=(AND p1 p2 p0), acceptance={0, 1} source=9 dest: 9}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=9 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=10 dest: 12}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=10 dest: 14}], [{ cond=p1, acceptance={} source=11 dest: 4}, { cond=(NOT p1), acceptance={} source=11 dest: 11}], [{ cond=(AND p1 p2 (NOT p3)), acceptance={} source=12 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=12 dest: 12}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=12 dest: 14}], [{ cond=(AND p1 p2), acceptance={} source=13 dest: 8}, { cond=(AND (NOT p1) p2), acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=14 dest: 12}, { cond=(AND (NOT p1) p2), acceptance={} source=14 dest: 14}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s72 1) (EQ s74 1)), p1:(AND (EQ s4 1) (EQ s72 1) (EQ s74 1)), p2:(AND (EQ s142 1) (EQ s147 1)), p3:(AND (EQ s105 1) (EQ s121 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2243 reset in 208 ms.
Product exploration explored 100000 steps with 2219 reset in 225 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p1 p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), true, (X (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND p2 (NOT p3) p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND p2 (NOT p3))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2 p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p3 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 41 factoid took 2017 ms. Reduced automaton from 15 states, 53 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Incomplete random walk after 10000 steps, including 218 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 16:40:50] [INFO ] Invariant cache hit.
[2023-03-08 16:40:50] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 16:40:50] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 16:40:50] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:40:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 16:40:50] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 134 ms returned sat
[2023-03-08 16:40:50] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:40:50] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-08 16:40:50] [INFO ] After 368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 42 ms.
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 97/97 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 95
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 153 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 152 transition count 94
Applied a total of 9 rules in 10 ms. Remains 152 /153 variables (removed 1) and now considering 94/97 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 152/153 places, 94/97 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1228901 steps, run timeout after 3001 ms. (steps per millisecond=409 ) properties seen :{}
Probabilistic random walk after 1228901 steps, saw 171953 distinct states, run finished after 3001 ms. (steps per millisecond=409 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 16:40:54] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 16:40:54] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:40:54] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 16:40:54] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:40:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:40:54] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 132 ms returned sat
[2023-03-08 16:40:54] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:40:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 16:40:54] [INFO ] After 31ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 16:40:54] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2023-03-08 16:40:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-08 16:40:54] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-08 16:40:54] [INFO ] After 424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 60 ms.
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 152/152 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 2 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-08 16:40:54] [INFO ] Invariant cache hit.
[2023-03-08 16:40:54] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-08 16:40:54] [INFO ] Invariant cache hit.
[2023-03-08 16:40:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 16:40:54] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-08 16:40:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 16:40:54] [INFO ] Invariant cache hit.
[2023-03-08 16:40:54] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 152/152 places, 94/94 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 94
Applied a total of 1 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 16:40:55] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 16:40:55] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:40:55] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 16:40:55] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:40:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:40:55] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 140 ms returned sat
[2023-03-08 16:40:55] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:40:55] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2023-03-08 16:40:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-08 16:40:55] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-08 16:40:55] [INFO ] After 400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p1 p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), true, (X (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND p2 (NOT p3) p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND p2 (NOT p3))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2 p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p3 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p2 (NOT p1) p3)), (F p3), (F (AND p2 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (AND (NOT p2) (NOT p1)) (AND p2 (NOT p3)))))]
Knowledge based reduction with 41 factoid took 1945 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Stuttering acceptance computed with spot in 327 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Support contains 7 out of 153 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 16:40:58] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 16:40:58] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-08 16:40:58] [INFO ] Invariant cache hit.
[2023-03-08 16:40:58] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-08 16:40:58] [INFO ] Invariant cache hit.
[2023-03-08 16:40:58] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 276 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/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 p3)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (OR (AND (NOT p2) (NOT p1)) (AND p2 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 677 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 16:40:59] [INFO ] Invariant cache hit.
[2023-03-08 16:40:59] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 16:40:59] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 16:40:59] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:40:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 16:40:59] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 127 ms returned sat
[2023-03-08 16:40:59] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:40:59] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 16:40:59] [INFO ] After 344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 93 ms.
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 97/97 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 95
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 153 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 152 transition count 94
Applied a total of 9 rules in 8 ms. Remains 152 /153 variables (removed 1) and now considering 94/97 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 152/153 places, 94/97 transitions.
Incomplete random walk after 10000 steps, including 145 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1186993 steps, run timeout after 3001 ms. (steps per millisecond=395 ) properties seen :{}
Probabilistic random walk after 1186993 steps, saw 166192 distinct states, run finished after 3001 ms. (steps per millisecond=395 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 16:41:03] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 16:41:03] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:41:03] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2023-03-08 16:41:03] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:41:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:41:03] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 133 ms returned sat
[2023-03-08 16:41:03] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:41:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 16:41:03] [INFO ] After 23ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 16:41:03] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2023-03-08 16:41:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-08 16:41:03] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 16:41:03] [INFO ] After 429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 28 ms.
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 2 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 152/152 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 2 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-08 16:41:03] [INFO ] Invariant cache hit.
[2023-03-08 16:41:03] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-08 16:41:03] [INFO ] Invariant cache hit.
[2023-03-08 16:41:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 16:41:03] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-08 16:41:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 16:41:03] [INFO ] Invariant cache hit.
[2023-03-08 16:41:04] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 288 ms. Remains : 152/152 places, 94/94 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 94
Applied a total of 1 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 16:41:04] [INFO ] Computed 60 place invariants in 0 ms
[2023-03-08 16:41:04] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:41:04] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 16:41:04] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 16:41:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:41:04] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 131 ms returned sat
[2023-03-08 16:41:04] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 16:41:04] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2023-03-08 16:41:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-08 16:41:04] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-08 16:41:04] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (OR (AND (NOT p2) (NOT p1)) (AND p2 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p2 (NOT p1) p3)), (F p3), (F (AND p2 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (AND (NOT p2) (NOT p1)) (AND p2 (NOT p3)))))]
Knowledge based reduction with 15 factoid took 837 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Stuttering acceptance computed with spot in 235 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Stuttering acceptance computed with spot in 230 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Product exploration explored 100000 steps with 2216 reset in 218 ms.
Product exploration explored 100000 steps with 2238 reset in 239 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 231 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:41:06] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 16:41:06] [INFO ] Computed 58 place invariants in 0 ms
[2023-03-08 16:41:06] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 153/153 places, 97/97 transitions.
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:41:06] [INFO ] Invariant cache hit.
[2023-03-08 16:41:06] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 16:41:06] [INFO ] Invariant cache hit.
[2023-03-08 16:41:07] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-08 16:41:07] [INFO ] Invariant cache hit.
[2023-03-08 16:41:07] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 153/153 places, 97/97 transitions.
Treatment of property DES-PT-10a-LTLFireability-14 finished in 20672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(F((p1||G(p2))))))))'
Found a Shortening insensitive property : DES-PT-10a-LTLFireability-15
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:41:07] [INFO ] Invariant cache hit.
[2023-03-08 16:41:07] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-08 16:41:07] [INFO ] Invariant cache hit.
[2023-03-08 16:41:07] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-08 16:41:07] [INFO ] Invariant cache hit.
[2023-03-08 16:41:07] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 279 ms. Remains : 153/153 places, 97/97 transitions.
Running random walk in product with property : DES-PT-10a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s22 1) (EQ s69 1)), p1:(AND (EQ s26 1) (EQ s69 1)), p2:(OR (EQ s46 0) (EQ s67 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2248 reset in 225 ms.
Product exploration explored 100000 steps with 2247 reset in 238 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 231 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 342 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:41:09] [INFO ] Invariant cache hit.
[2023-03-08 16:41:09] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 16:41:09] [INFO ] Invariant cache hit.
[2023-03-08 16:41:09] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-08 16:41:09] [INFO ] Invariant cache hit.
[2023-03-08 16:41:09] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 185 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2207 reset in 222 ms.
Product exploration explored 100000 steps with 2229 reset in 251 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:41:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 16:41:11] [INFO ] Invariant cache hit.
[2023-03-08 16:41:11] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 153/153 places, 97/97 transitions.
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 16:41:11] [INFO ] Invariant cache hit.
[2023-03-08 16:41:11] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-08 16:41:11] [INFO ] Invariant cache hit.
[2023-03-08 16:41:11] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-08 16:41:11] [INFO ] Invariant cache hit.
[2023-03-08 16:41:11] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 269 ms. Remains : 153/153 places, 97/97 transitions.
Treatment of property DES-PT-10a-LTLFireability-15 finished in 4299 ms.
[2023-03-08 16:41:11] [INFO ] Flatten gal took : 11 ms
[2023-03-08 16:41:11] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 16:41:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 153 places, 97 transitions and 481 arcs took 2 ms.
Total runtime 68235 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3044/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3044/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3044/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DES-PT-10a-LTLFireability-06
Could not compute solution for formula : DES-PT-10a-LTLFireability-14
Could not compute solution for formula : DES-PT-10a-LTLFireability-15

BK_STOP 1678293672875

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name DES-PT-10a-LTLFireability-06
ltl formula formula --ltl=/tmp/3044/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 153 places, 97 transitions and 481 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3044/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3044/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3044/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3044/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DES-PT-10a-LTLFireability-14
ltl formula formula --ltl=/tmp/3044/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 153 places, 97 transitions and 481 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3044/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3044/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3044/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3044/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 19 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name DES-PT-10a-LTLFireability-15
ltl formula formula --ltl=/tmp/3044/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 153 places, 97 transitions and 481 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3044/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3044/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3044/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3044/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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="DES-PT-10a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is DES-PT-10a, 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 r105-tall-167814481200412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10a.tgz
mv DES-PT-10a 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 ;