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-167814481100348.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-00a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481100348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 15:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 26 15:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Feb 26 15:45 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.4K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:49 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 31K 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-00a-LTLFireability-00
FORMULA_NAME DES-PT-00a-LTLFireability-01
FORMULA_NAME DES-PT-00a-LTLFireability-02
FORMULA_NAME DES-PT-00a-LTLFireability-03
FORMULA_NAME DES-PT-00a-LTLFireability-04
FORMULA_NAME DES-PT-00a-LTLFireability-05
FORMULA_NAME DES-PT-00a-LTLFireability-06
FORMULA_NAME DES-PT-00a-LTLFireability-07
FORMULA_NAME DES-PT-00a-LTLFireability-08
FORMULA_NAME DES-PT-00a-LTLFireability-09
FORMULA_NAME DES-PT-00a-LTLFireability-10
FORMULA_NAME DES-PT-00a-LTLFireability-11
FORMULA_NAME DES-PT-00a-LTLFireability-12
FORMULA_NAME DES-PT-00a-LTLFireability-13
FORMULA_NAME DES-PT-00a-LTLFireability-14
FORMULA_NAME DES-PT-00a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678284437906

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-00a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 14:07:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 14:07:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 14:07:19] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-08 14:07:19] [INFO ] Transformed 115 places.
[2023-03-08 14:07:19] [INFO ] Transformed 76 transitions.
[2023-03-08 14:07:19] [INFO ] Found NUPN structural information;
[2023-03-08 14:07:19] [INFO ] Parsed PT model containing 115 places and 76 transitions and 373 arcs in 107 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-00a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 62/62 transitions.
Applied a total of 0 rules in 12 ms. Remains 115 /115 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 115 cols
[2023-03-08 14:07:19] [INFO ] Computed 57 place invariants in 13 ms
[2023-03-08 14:07:20] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-08 14:07:20] [INFO ] Invariant cache hit.
[2023-03-08 14:07:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 14:07:20] [INFO ] Implicit Places using invariants and state equation in 131 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 603 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/115 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 114 /114 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 619 ms. Remains : 114/115 places, 62/62 transitions.
Support contains 48 out of 114 places after structural reductions.
[2023-03-08 14:07:20] [INFO ] Flatten gal took : 28 ms
[2023-03-08 14:07:20] [INFO ] Flatten gal took : 18 ms
[2023-03-08 14:07:20] [INFO ] Input system was already deterministic with 62 transitions.
Support contains 46 out of 114 places (down from 48) after GAL structural reductions.
Finished random walk after 289 steps, including 4 resets, run visited all 25 properties in 30 ms. (steps per millisecond=9 )
Computed a total of 1 stabilizing places and 1 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' '!((F(p0)&&G((G(!p0)||p1))))'
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 110 transition count 58
Applied a total of 8 rules in 27 ms. Remains 110 /114 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 110 cols
[2023-03-08 14:07:20] [INFO ] Computed 56 place invariants in 4 ms
[2023-03-08 14:07:20] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-08 14:07:20] [INFO ] Invariant cache hit.
[2023-03-08 14:07:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 14:07:21] [INFO ] Implicit Places using invariants and state equation in 183 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 333 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/114 places, 58/62 transitions.
Applied a total of 0 rules in 7 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 367 ms. Remains : 109/114 places, 58/62 transitions.
Stuttering acceptance computed with spot in 230 ms :[(AND p0 (NOT p1)), p0, true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-00a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p1:(OR (NEQ s64 1) (NEQ s80 1)), p0:(AND (EQ s54 1) (EQ s70 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 2 ms.
FORMULA DES-PT-00a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-LTLFireability-00 finished in 649 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((p0 U (p1||F(!p2))))))'
Support contains 6 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 61
Applied a total of 2 rules in 8 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 113 cols
[2023-03-08 14:07:21] [INFO ] Computed 56 place invariants in 2 ms
[2023-03-08 14:07:21] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-08 14:07:21] [INFO ] Invariant cache hit.
[2023-03-08 14:07:21] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2023-03-08 14:07:21] [INFO ] Invariant cache hit.
[2023-03-08 14:07:21] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 113/114 places, 61/62 transitions.
Stuttering acceptance computed with spot in 156 ms :[p2, (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : DES-PT-00a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p2:(AND (EQ s41 1) (EQ s58 1)), p1:(AND (EQ s47 1) (EQ s64 1)), p0:(AND (EQ s43 1) (EQ s60 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 333 ms.
Product exploration explored 100000 steps with 33333 reset in 265 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) p2 (NOT p0)))))
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-00a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-00a-LTLFireability-01 finished in 1267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0 U (G(!p0)||(X(X(G(p2)))&&p1)))))'
Support contains 6 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 61
Applied a total of 2 rules in 7 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
[2023-03-08 14:07:22] [INFO ] Invariant cache hit.
[2023-03-08 14:07:22] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-08 14:07:22] [INFO ] Invariant cache hit.
[2023-03-08 14:07:22] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-08 14:07:22] [INFO ] Invariant cache hit.
[2023-03-08 14:07:23] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 338 ms. Remains : 113/114 places, 61/62 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : DES-PT-00a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0 p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0 p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s32 1) (EQ s34 1) (NOT (AND (EQ s39 1) (EQ s56 1)))), p0:(AND (EQ s39 1) (EQ s56 1)), p2:(AND (EQ s22 1) (EQ s24 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2188 reset in 434 ms.
Product exploration explored 100000 steps with 2226 reset in 359 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 813 ms. Reduced automaton from 4 states, 24 edges and 3 AP (stutter sensitive) to 4 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 219 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 14:07:25] [INFO ] Invariant cache hit.
[2023-03-08 14:07:25] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 p1))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 20 factoid took 1232 ms. Reduced automaton from 4 states, 24 edges and 3 AP (stutter sensitive) to 4 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[p0, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 171 ms :[p0, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 6 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-08 14:07:26] [INFO ] Invariant cache hit.
[2023-03-08 14:07:26] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 14:07:26] [INFO ] Invariant cache hit.
[2023-03-08 14:07:27] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-08 14:07:27] [INFO ] Invariant cache hit.
[2023-03-08 14:07:27] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 113/113 places, 61/61 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 481 ms. Reduced automaton from 4 states, 18 edges and 3 AP (stutter sensitive) to 4 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[p0, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 234 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 14:07:27] [INFO ] Invariant cache hit.
[2023-03-08 14:07:28] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 14:07:28] [INFO ] [Real]Absence check using 34 positive and 22 generalized place invariants in 5 ms returned sat
[2023-03-08 14:07:28] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 14:07:28] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2023-03-08 14:07:28] [INFO ] [Nat]Absence check using 34 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-08 14:07:28] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 14:07:28] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-08 14:07:28] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 3 ms.
Support contains 6 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 61/61 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 60
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 113 transition count 59
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 112 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 110 transition count 57
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 110 transition count 57
Applied a total of 12 rules in 13 ms. Remains 110 /113 variables (removed 3) and now considering 57/61 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 110/113 places, 57/61 transitions.
Finished random walk after 257 steps, including 5 resets, run visited all 1 properties in 2 ms. (steps per millisecond=128 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (AND (NOT p1) p2 (NOT p0))), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0))), (F p0), (F (AND p1 p2 (NOT p0))), (F (AND p2 p0))]
Knowledge based reduction with 13 factoid took 707 ms. Reduced automaton from 4 states, 18 edges and 3 AP (stutter sensitive) to 4 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[p0, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[p0, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 148 ms :[p0, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 2230 reset in 339 ms.
Product exploration explored 100000 steps with 2247 reset in 233 ms.
Support contains 6 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-08 14:07:30] [INFO ] Invariant cache hit.
[2023-03-08 14:07:30] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-08 14:07:30] [INFO ] Invariant cache hit.
[2023-03-08 14:07:30] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-08 14:07:30] [INFO ] Invariant cache hit.
[2023-03-08 14:07:30] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 113/113 places, 61/61 transitions.
Treatment of property DES-PT-00a-LTLFireability-02 finished in 7905 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((G(!p0) U (F(p1)&&(p2 U p3)))))'
Support contains 8 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 61
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 111 transition count 59
Applied a total of 6 rules in 8 ms. Remains 111 /114 variables (removed 3) and now considering 59/62 (removed 3) transitions.
// Phase 1: matrix 59 rows 111 cols
[2023-03-08 14:07:30] [INFO ] Computed 56 place invariants in 2 ms
[2023-03-08 14:07:30] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-08 14:07:30] [INFO ] Invariant cache hit.
[2023-03-08 14:07:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 14:07:30] [INFO ] Implicit Places using invariants and state equation in 128 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 226 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/114 places, 59/62 transitions.
Applied a total of 0 rules in 6 ms. Remains 110 /110 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 241 ms. Remains : 110/114 places, 59/62 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p3) (NOT p1)), true, p0, (NOT p1), (NOT p3), (OR (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : DES-PT-00a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p3 p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(AND (EQ s34 1) (EQ s104 1)), p2:(AND (EQ s38 1) (EQ s55 1)), p0:(OR (AND (EQ s2 1) (EQ s13 1)) (AND (EQ s38 1) (EQ s55 1))), p1:(AND (EQ s21 1) (EQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DES-PT-00a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-LTLFireability-03 finished in 502 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(!p0)||(X(p1) U ((!p2&&X(p1))||X(G(p1))))))))'
Support contains 8 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 61
Applied a total of 2 rules in 3 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 113 cols
[2023-03-08 14:07:31] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-08 14:07:31] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-08 14:07:31] [INFO ] Invariant cache hit.
[2023-03-08 14:07:31] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-08 14:07:31] [INFO ] Invariant cache hit.
[2023-03-08 14:07:31] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 113/114 places, 61/62 transitions.
Stuttering acceptance computed with spot in 285 ms :[true, (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : DES-PT-00a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p0), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(AND (EQ s2 1) (EQ s14 1)), p2:(OR (NOT (AND (EQ s15 1) (EQ s25 1))) (AND (EQ s31 1) (EQ s94 1))), p0:(AND (EQ s4 1) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA DES-PT-00a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-LTLFireability-04 finished in 570 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&&X(p1)))&&F(G(p2)))))'
Support contains 6 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 61
Applied a total of 2 rules in 4 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
[2023-03-08 14:07:31] [INFO ] Invariant cache hit.
[2023-03-08 14:07:31] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 14:07:31] [INFO ] Invariant cache hit.
[2023-03-08 14:07:31] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-08 14:07:31] [INFO ] Invariant cache hit.
[2023-03-08 14:07:31] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 113/114 places, 61/62 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : DES-PT-00a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s0 0), p2:(AND (OR (EQ s21 0) (EQ s26 0) (EQ s28 0)) (OR (EQ s39 0) (EQ s56 0))), p1:(OR (EQ s21 0) (EQ s26 0) (EQ s28 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 28562 reset in 176 ms.
Product exploration explored 100000 steps with 28575 reset in 191 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/113 stabilizing places and 1/61 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 417 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Incomplete random walk after 10000 steps, including 220 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 14:07:33] [INFO ] Invariant cache hit.
[2023-03-08 14:07:33] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 14:07:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 14:07:33] [INFO ] [Nat]Absence check using 34 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-08 14:07:33] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p2 p0 p1)), (F (AND (NOT p2) p0 p1)), (F p0), (F (AND p0 (NOT p1))), (F (NOT p2))]
Knowledge based reduction with 11 factoid took 578 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
[2023-03-08 14:07:34] [INFO ] Invariant cache hit.
[2023-03-08 14:07:34] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 14:07:34] [INFO ] [Real]Absence check using 34 positive and 22 generalized place invariants in 5 ms returned sat
[2023-03-08 14:07:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 14:07:34] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-08 14:07:34] [INFO ] Computed and/alt/rep : 58/168/58 causal constraints (skipped 2 transitions) in 5 ms.
[2023-03-08 14:07:34] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 61/61 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 113 transition count 60
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 110 transition count 58
Applied a total of 6 rules in 7 ms. Remains 110 /113 variables (removed 3) and now considering 58/61 (removed 3) transitions.
// Phase 1: matrix 58 rows 110 cols
[2023-03-08 14:07:34] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-08 14:07:34] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-08 14:07:34] [INFO ] Invariant cache hit.
[2023-03-08 14:07:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 14:07:34] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 170 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/113 places, 58/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 181 ms. Remains : 109/113 places, 58/61 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/109 stabilizing places and 1/58 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p2 p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 p0 p1))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 479 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Finished random walk after 261 steps, including 7 resets, run visited all 5 properties in 2 ms. (steps per millisecond=130 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p2 p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 p0 p1))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p2 p0 p1)), (F (AND (NOT p2) p0 p1)), (F p0), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 12 factoid took 635 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
// Phase 1: matrix 58 rows 109 cols
[2023-03-08 14:07:36] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-08 14:07:36] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 14:07:36] [INFO ] [Real]Absence check using 33 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-08 14:07:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 14:07:36] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-08 14:07:36] [INFO ] Computed and/alt/rep : 55/163/55 causal constraints (skipped 2 transitions) in 3 ms.
[2023-03-08 14:07:36] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Product exploration explored 100000 steps with 5372 reset in 214 ms.
Product exploration explored 100000 steps with 5444 reset in 236 ms.
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 58/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2023-03-08 14:07:37] [INFO ] Invariant cache hit.
[2023-03-08 14:07:37] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-08 14:07:37] [INFO ] Invariant cache hit.
[2023-03-08 14:07:37] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-08 14:07:37] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-08 14:07:37] [INFO ] Invariant cache hit.
[2023-03-08 14:07:37] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 282 ms. Remains : 109/109 places, 58/58 transitions.
Treatment of property DES-PT-00a-LTLFireability-06 finished in 5746 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(X(p0)))||X(p0)))'
Support contains 9 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 61
Applied a total of 2 rules in 2 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 113 cols
[2023-03-08 14:07:37] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-08 14:07:37] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-08 14:07:37] [INFO ] Invariant cache hit.
[2023-03-08 14:07:37] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-08 14:07:37] [INFO ] Invariant cache hit.
[2023-03-08 14:07:37] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 113/114 places, 61/62 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-00a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (EQ s35 0) (EQ s40 0) (EQ s42 0) (EQ s44 0) (EQ s46 0) (EQ s48 0) (EQ s50 0) (EQ s52 0) (EQ s54 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 171 ms.
Product exploration explored 100000 steps with 50000 reset in 193 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-00a-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-00a-LTLFireability-07 finished in 938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 110 transition count 58
Applied a total of 8 rules in 14 ms. Remains 110 /114 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 110 cols
[2023-03-08 14:07:38] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-08 14:07:38] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 14:07:38] [INFO ] Invariant cache hit.
[2023-03-08 14:07:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 14:07:38] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 173 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/114 places, 58/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 190 ms. Remains : 109/114 places, 58/62 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-00a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 0 ms.
FORMULA DES-PT-00a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-LTLFireability-08 finished in 264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 110 transition count 58
Applied a total of 8 rules in 16 ms. Remains 110 /114 variables (removed 4) and now considering 58/62 (removed 4) transitions.
[2023-03-08 14:07:38] [INFO ] Invariant cache hit.
[2023-03-08 14:07:38] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-08 14:07:38] [INFO ] Invariant cache hit.
[2023-03-08 14:07:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 14:07:38] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 165 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/114 places, 58/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 183 ms. Remains : 109/114 places, 58/62 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-00a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s20 0) (EQ s25 0) (EQ s27 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2640 reset in 172 ms.
Stack based approach found an accepted trace after 11942 steps with 308 reset with depth 78 and stack size 78 in 26 ms.
FORMULA DES-PT-00a-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property DES-PT-00a-LTLFireability-09 finished in 419 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 1 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 61
Applied a total of 2 rules in 3 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 113 cols
[2023-03-08 14:07:39] [INFO ] Computed 56 place invariants in 3 ms
[2023-03-08 14:07:39] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 14:07:39] [INFO ] Invariant cache hit.
[2023-03-08 14:07:39] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-08 14:07:39] [INFO ] Invariant cache hit.
[2023-03-08 14:07:39] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 113/114 places, 61/62 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-00a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s6 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]]
Product exploration explored 100000 steps with 50000 reset in 198 ms.
Product exploration explored 100000 steps with 50000 reset in 222 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-00a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-00a-LTLFireability-10 finished in 772 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))||(X(G(p2))&&p1))))'
Support contains 6 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Applied a total of 0 rules in 0 ms. Remains 114 /114 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 114 cols
[2023-03-08 14:07:39] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-08 14:07:39] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-08 14:07:39] [INFO ] Invariant cache hit.
[2023-03-08 14:07:40] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-08 14:07:40] [INFO ] Invariant cache hit.
[2023-03-08 14:07:40] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 114/114 places, 62/62 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-00a-LTLFireability-11 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 p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s37 1) (EQ s106 1)), p1:(AND (EQ s33 1) (EQ s105 1)), p2:(AND (EQ s4 1) (EQ s23 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 0 ms.
FORMULA DES-PT-00a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-LTLFireability-11 finished in 396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 110 transition count 58
Applied a total of 8 rules in 12 ms. Remains 110 /114 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 110 cols
[2023-03-08 14:07:40] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-08 14:07:40] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 14:07:40] [INFO ] Invariant cache hit.
[2023-03-08 14:07:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 14:07:40] [INFO ] Implicit Places using invariants and state equation in 88 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 160 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/114 places, 58/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 174 ms. Remains : 109/114 places, 58/62 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-00a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s95 1) (EQ s104 1)), p0:(AND (EQ s64 1) (EQ s80 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 68 steps with 1 reset in 0 ms.
FORMULA DES-PT-00a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-LTLFireability-12 finished in 262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 61
Applied a total of 2 rules in 3 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 113 cols
[2023-03-08 14:07:40] [INFO ] Computed 56 place invariants in 3 ms
[2023-03-08 14:07:40] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 14:07:40] [INFO ] Invariant cache hit.
[2023-03-08 14:07:40] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-08 14:07:40] [INFO ] Invariant cache hit.
[2023-03-08 14:07:40] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 113/114 places, 61/62 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DES-PT-00a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { 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: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (OR (EQ s15 0) (EQ s25 0) (EQ s6 0) (EQ s27 0)) (EQ s6 1) (EQ s27 1)), p1:(AND (EQ s15 1) (EQ s25 1))], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DES-PT-00a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-LTLFireability-13 finished in 375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0 U (G(!p0)||(X(X(G(p2)))&&p1)))))'
Found a Lengthening insensitive property : DES-PT-00a-LTLFireability-02
Stuttering acceptance computed with spot in 140 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 6 out of 114 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 110 transition count 58
Applied a total of 8 rules in 6 ms. Remains 110 /114 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 110 cols
[2023-03-08 14:07:41] [INFO ] Computed 56 place invariants in 2 ms
[2023-03-08 14:07:41] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-08 14:07:41] [INFO ] Invariant cache hit.
[2023-03-08 14:07:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 14:07:41] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 154 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 109/114 places, 58/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 163 ms. Remains : 109/114 places, 58/62 transitions.
Running random walk in product with property : DES-PT-00a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0 p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0 p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s29 1) (EQ s31 1) (NOT (AND (EQ s36 1) (EQ s53 1)))), p0:(AND (EQ s36 1) (EQ s53 1)), p2:(AND (EQ s21 1) (EQ s23 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2644 reset in 202 ms.
Product exploration explored 100000 steps with 2659 reset in 220 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 823 ms. Reduced automaton from 4 states, 24 edges and 3 AP (stutter sensitive) to 4 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 268 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 54 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 64 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 58 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 58 rows 109 cols
[2023-03-08 14:07:42] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-08 14:07:42] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 p1))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 20 factoid took 965 ms. Reduced automaton from 4 states, 24 edges and 3 AP (stutter sensitive) to 4 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[p0, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 152 ms :[p0, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2023-03-08 14:07:44] [INFO ] Invariant cache hit.
[2023-03-08 14:07:44] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-08 14:07:44] [INFO ] Invariant cache hit.
[2023-03-08 14:07:44] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-08 14:07:44] [INFO ] Invariant cache hit.
[2023-03-08 14:07:44] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 109/109 places, 58/58 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 515 ms. Reduced automaton from 4 states, 18 edges and 3 AP (stutter sensitive) to 4 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[p0, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 266 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :8
Finished Best-First random walk after 3532 steps, including 18 resets, run visited all 1 properties in 5 ms. (steps per millisecond=706 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (AND (NOT p1) p2 (NOT p0))), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0))), (F p0), (F (AND p1 p2 (NOT p0))), (F (AND p2 p0))]
Knowledge based reduction with 13 factoid took 648 ms. Reduced automaton from 4 states, 18 edges and 3 AP (stutter sensitive) to 4 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[p0, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 161 ms :[p0, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[p0, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 2631 reset in 186 ms.
Product exploration explored 100000 steps with 2650 reset in 201 ms.
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 58/58 transitions.
Applied a total of 0 rules in 1 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2023-03-08 14:07:46] [INFO ] Invariant cache hit.
[2023-03-08 14:07:46] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-08 14:07:46] [INFO ] Invariant cache hit.
[2023-03-08 14:07:46] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-08 14:07:46] [INFO ] Invariant cache hit.
[2023-03-08 14:07:46] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 109/109 places, 58/58 transitions.
Treatment of property DES-PT-00a-LTLFireability-02 finished in 6088 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&&X(p1)))&&F(G(p2)))))'
Found a Shortening insensitive property : DES-PT-00a-LTLFireability-06
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Support contains 6 out of 114 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 110 transition count 58
Applied a total of 8 rules in 10 ms. Remains 110 /114 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 110 cols
[2023-03-08 14:07:47] [INFO ] Computed 56 place invariants in 3 ms
[2023-03-08 14:07:47] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 14:07:47] [INFO ] Invariant cache hit.
[2023-03-08 14:07:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 14:07:47] [INFO ] Implicit Places using invariants and state equation in 100 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 168 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 109/114 places, 58/62 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 182 ms. Remains : 109/114 places, 58/62 transitions.
Running random walk in product with property : DES-PT-00a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s0 0), p2:(AND (OR (EQ s20 0) (EQ s25 0) (EQ s27 0)) (OR (EQ s36 0) (EQ s53 0))), p1:(OR (EQ s20 0) (EQ s25 0) (EQ s27 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 28470 reset in 170 ms.
Product exploration explored 100000 steps with 28474 reset in 188 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/109 stabilizing places and 1/58 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 410 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Incomplete random walk after 10000 steps, including 264 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 58 rows 109 cols
[2023-03-08 14:07:48] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-08 14:07:48] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 14:07:48] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 14:07:48] [INFO ] [Nat]Absence check using 33 positive and 22 generalized place invariants in 3 ms returned sat
[2023-03-08 14:07:48] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p2 p0 p1)), (F (AND (NOT p2) p0 p1)), (F p0), (F (AND p0 (NOT p1))), (F (NOT p2))]
Knowledge based reduction with 11 factoid took 628 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
[2023-03-08 14:07:49] [INFO ] Invariant cache hit.
[2023-03-08 14:07:49] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 14:07:49] [INFO ] [Real]Absence check using 33 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-08 14:07:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 14:07:49] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-08 14:07:49] [INFO ] Computed and/alt/rep : 55/163/55 causal constraints (skipped 2 transitions) in 4 ms.
[2023-03-08 14:07:49] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 58/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2023-03-08 14:07:49] [INFO ] Invariant cache hit.
[2023-03-08 14:07:49] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-08 14:07:49] [INFO ] Invariant cache hit.
[2023-03-08 14:07:49] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-08 14:07:49] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-08 14:07:49] [INFO ] Invariant cache hit.
[2023-03-08 14:07:49] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 237 ms. Remains : 109/109 places, 58/58 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/109 stabilizing places and 1/58 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p2 p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 p0 p1))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 565 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Finished random walk after 74 steps, including 1 resets, run visited all 5 properties in 2 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p2 p0 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 p0 p1))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p2 p0 p1)), (F (AND (NOT p2) p0 p1)), (F p0), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 12 factoid took 673 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
[2023-03-08 14:07:51] [INFO ] Invariant cache hit.
[2023-03-08 14:07:51] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 14:07:51] [INFO ] [Real]Absence check using 33 positive and 22 generalized place invariants in 3 ms returned sat
[2023-03-08 14:07:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 14:07:52] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-08 14:07:52] [INFO ] Computed and/alt/rep : 55/163/55 causal constraints (skipped 2 transitions) in 3 ms.
[2023-03-08 14:07:52] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Product exploration explored 100000 steps with 5373 reset in 187 ms.
Product exploration explored 100000 steps with 5418 reset in 199 ms.
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2023-03-08 14:07:52] [INFO ] Invariant cache hit.
[2023-03-08 14:07:52] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-08 14:07:52] [INFO ] Invariant cache hit.
[2023-03-08 14:07:52] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-08 14:07:52] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-08 14:07:52] [INFO ] Invariant cache hit.
[2023-03-08 14:07:52] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 221 ms. Remains : 109/109 places, 58/58 transitions.
Treatment of property DES-PT-00a-LTLFireability-06 finished in 5955 ms.
[2023-03-08 14:07:52] [INFO ] Flatten gal took : 9 ms
[2023-03-08 14:07:52] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 14:07:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 114 places, 62 transitions and 306 arcs took 1 ms.
Total runtime 33589 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2390/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2390/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DES-PT-00a-LTLFireability-02
Could not compute solution for formula : DES-PT-00a-LTLFireability-06

BK_STOP 1678284474281

--------------------
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-00a-LTLFireability-02
ltl formula formula --ltl=/tmp/2390/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
pnml2lts-mc( 0/ 4): Petri net has 114 places, 62 transitions and 306 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2390/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2390/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2390/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2390/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 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:
corrupted size vs. prev_size in fastbins
ltl formula name DES-PT-00a-LTLFireability-06
ltl formula formula --ltl=/tmp/2390/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 114 places, 62 transitions and 306 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.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2390/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2390/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2390/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2390/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-00a"
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-00a, 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-167814481100348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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