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.r265-smll-167863540100475.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 PermAdmissibility-COL-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540100475
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.1K Feb 26 01:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 01:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 01:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 01:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 01:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 01:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 01:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 54K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679030039666

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-05
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 05:14:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 05:14:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 05:14:02] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-17 05:14:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-17 05:14:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 906 ms
[2023-03-17 05:14:03] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
[2023-03-17 05:14:03] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 6 ms.
[2023-03-17 05:14:03] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PermAdmissibility-COL-05-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10003 steps, including 103 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 28) seen :27
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 40 cols
[2023-03-17 05:14:04] [INFO ] Computed 24 place invariants in 10 ms
[2023-03-17 05:14:04] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 05:14:04] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-17 05:14:04] [INFO ] After 69ms 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 1 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2023-03-17 05:14:04] [INFO ] Flatten gal took : 26 ms
[2023-03-17 05:14:04] [INFO ] Flatten gal took : 7 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2023-03-17 05:14:04] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 11 ms.
[2023-03-17 05:14:04] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Support contains 26 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 37 transition count 16
Applied a total of 3 rules in 20 ms. Remains 37 /40 variables (removed 3) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 37 cols
[2023-03-17 05:14:04] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-17 05:14:04] [INFO ] Implicit Places using invariants in 103 ms returned [4, 7, 16, 22, 25]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 120 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141 ms. Remains : 32/40 places, 16/16 transitions.
Support contains 26 out of 32 places after structural reductions.
[2023-03-17 05:14:04] [INFO ] Flatten gal took : 12 ms
[2023-03-17 05:14:04] [INFO ] Flatten gal took : 5 ms
[2023-03-17 05:14:04] [INFO ] Input system was already deterministic with 16 transitions.
Support contains 25 out of 32 places (down from 26) after GAL structural reductions.
Finished random walk after 96 steps, including 0 resets, run visited all 26 properties in 8 ms. (steps per millisecond=12 )
Computed a total of 32 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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)||G(F(p2))))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 26 transition count 16
Applied a total of 6 rules in 1 ms. Remains 26 /32 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2023-03-17 05:14:05] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-17 05:14:05] [INFO ] Implicit Places using invariants in 119 ms returned [4, 5, 10, 11, 12, 13, 15]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 120 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 19/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 436 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s18 s12), p0:(OR (LEQ s14 s12) (LEQ 2 s3)), p2:(GT 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 338 ms.
Product exploration explored 100000 steps with 33333 reset in 176 ms.
Computed a total of 19 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 8 factoid took 257 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-05-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLCardinality-01 finished in 1486 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||X(F(p1))))&&(p0||G(p2)))))'
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 27 transition count 16
Applied a total of 5 rules in 2 ms. Remains 27 /32 variables (removed 5) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 27 cols
[2023-03-17 05:14:06] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-17 05:14:06] [INFO ] Implicit Places using invariants in 63 ms returned [4, 5, 10, 11, 12, 13, 15, 19]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 65 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 19/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s0 s17), p2:(LEQ 1 s18), p1:(LEQ s13 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 98 ms.
Product exploration explored 100000 steps with 33333 reset in 79 ms.
Computed a total of 19 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (OR p0 p2)), (X (X (NOT p2))), true, (X (X p0)), (F (G p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 10 factoid took 236 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-05-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLCardinality-02 finished in 763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)&&F(p1)))||(F(p0)&&X((F(p1)&&F(p2)))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 25 transition count 16
Applied a total of 7 rules in 2 ms. Remains 25 /32 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-17 05:14:07] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-17 05:14:07] [INFO ] Implicit Places using invariants in 54 ms returned [4, 5, 10, 11, 13, 15, 21]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 56 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 18/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GT 3 s1), p1:(GT 3 s8), p2:(LEQ 3 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3023 reset in 115 ms.
Product exploration explored 100000 steps with 2995 reset in 226 ms.
Computed a total of 18 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p1), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 667 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Finished random walk after 54 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p1), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 10 factoid took 564 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 18 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 18 cols
[2023-03-17 05:14:09] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-17 05:14:09] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-17 05:14:09] [INFO ] Invariant cache hit.
[2023-03-17 05:14:09] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-17 05:14:09] [INFO ] Invariant cache hit.
[2023-03-17 05:14:09] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 18/18 places, 16/16 transitions.
Computed a total of 18 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 262 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Finished random walk after 54 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 5 factoid took 279 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 2992 reset in 116 ms.
Product exploration explored 100000 steps with 2982 reset in 116 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Graph (complete) has 21 edges and 18 vertex of which 16 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 16 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 5 place count 16 transition count 14
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 16 transition count 14
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 12 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 12 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 17 rules in 15 ms. Remains 12 /18 variables (removed 6) and now considering 10/16 (removed 6) transitions.
[2023-03-17 05:14:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2023-03-17 05:14:11] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-17 05:14:11] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/18 places, 10/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56 ms. Remains : 12/18 places, 10/16 transitions.
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 18 cols
[2023-03-17 05:14:11] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-17 05:14:11] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-17 05:14:11] [INFO ] Invariant cache hit.
[2023-03-17 05:14:12] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-17 05:14:12] [INFO ] Invariant cache hit.
[2023-03-17 05:14:12] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 18/18 places, 16/16 transitions.
Treatment of property PermAdmissibility-COL-05-LTLCardinality-03 finished in 4780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 61 edges and 32 vertex of which 25 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 25 /32 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-17 05:14:12] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-17 05:14:12] [INFO ] Implicit Places using invariants in 68 ms returned [4, 5, 10, 11, 12, 13, 15, 19, 21]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 70 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/32 places, 16/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 15 transition count 3
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 2 transition count 2
Applied a total of 26 rules in 4 ms. Remains 2 /16 variables (removed 14) and now considering 2/16 (removed 14) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-17 05:14:12] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 05:14:12] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 05:14:12] [INFO ] Invariant cache hit.
[2023-03-17 05:14:12] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/32 places, 2/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 120 ms. Remains : 2/32 places, 2/16 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 s1)], 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 9090 reset in 134 ms.
Product exploration explored 100000 steps with 9090 reset in 161 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-05-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLCardinality-05 finished in 609 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||X((G(p1) U (p0&&G(p1)))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 25 transition count 16
Applied a total of 7 rules in 1 ms. Remains 25 /32 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-17 05:14:12] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-17 05:14:12] [INFO ] Implicit Places using invariants in 57 ms returned [4, 10, 11, 12, 13, 15, 19, 21]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 58 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61 ms. Remains : 17/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p0), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(GT s8 s3), p0:(GT 2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 54 ms.
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Computed a total of 17 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 355 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-05-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLCardinality-06 finished in 752 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((p0&&X(X(p1))))||X(!p1)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 26 transition count 16
Applied a total of 6 rules in 1 ms. Remains 26 /32 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2023-03-17 05:14:13] [INFO ] Computed 10 place invariants in 6 ms
[2023-03-17 05:14:13] [INFO ] Implicit Places using invariants in 57 ms returned [4, 5, 10, 11, 12, 13, 15, 19, 21]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 58 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 17/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ 1 s13), p0:(OR (LEQ 2 s9) (LEQ 2 s16))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Product exploration explored 100000 steps with 50000 reset in 68 ms.
Computed a total of 17 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 9 factoid took 162 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-05-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLCardinality-07 finished in 616 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)||(p0&&G(p1))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 61 edges and 32 vertex of which 23 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 2 ms. Remains 23 /32 variables (removed 9) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 23 cols
[2023-03-17 05:14:14] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-17 05:14:14] [INFO ] Implicit Places using invariants in 53 ms returned [4, 5, 10, 11, 12, 13, 15, 19]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 54 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/32 places, 14/16 transitions.
Graph (complete) has 14 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 13 transition count 7
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 6 transition count 5
Applied a total of 15 rules in 4 ms. Remains 6 /15 variables (removed 9) and now considering 5/14 (removed 9) transitions.
// Phase 1: matrix 5 rows 6 cols
[2023-03-17 05:14:14] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-17 05:14:14] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 05:14:14] [INFO ] Invariant cache hit.
[2023-03-17 05:14:14] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/32 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 106 ms. Remains : 6/32 places, 5/16 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p1:(GT 2 s0), p0:(GT s5 s3)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3846 reset in 161 ms.
Product exploration explored 100000 steps with 3846 reset in 203 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 521 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (AND (NOT p1) (NOT p0))]
Finished random walk after 241 steps, including 7 resets, run visited all 5 properties in 8 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F (AND p1 p0)), (F p0)]
Knowledge based reduction with 13 factoid took 615 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (AND (NOT p1) (NOT p0))]
[2023-03-17 05:14:16] [INFO ] Invariant cache hit.
[2023-03-17 05:14:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-17 05:14:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:14:16] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-17 05:14:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:14:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-17 05:14:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:14:16] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-17 05:14:16] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-17 05:14:16] [INFO ] Added : 4 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 2 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-17 05:14:16] [INFO ] Invariant cache hit.
[2023-03-17 05:14:16] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-17 05:14:16] [INFO ] Invariant cache hit.
[2023-03-17 05:14:16] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-17 05:14:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 05:14:16] [INFO ] Invariant cache hit.
[2023-03-17 05:14:16] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 6/6 places, 5/5 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 519 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (AND (NOT p1) (NOT p0))]
Finished random walk after 2748 steps, including 88 resets, run visited all 5 properties in 6 ms. (steps per millisecond=458 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F (AND p1 p0)), (F p0)]
Knowledge based reduction with 13 factoid took 633 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (AND (NOT p1) (NOT p0))]
[2023-03-17 05:14:17] [INFO ] Invariant cache hit.
[2023-03-17 05:14:17] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-17 05:14:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:14:17] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-17 05:14:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:14:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-17 05:14:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:14:17] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-17 05:14:17] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-17 05:14:17] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3846 reset in 97 ms.
Product exploration explored 100000 steps with 3846 reset in 110 ms.
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-17 05:14:18] [INFO ] Invariant cache hit.
[2023-03-17 05:14:18] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 05:14:18] [INFO ] Invariant cache hit.
[2023-03-17 05:14:18] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-17 05:14:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 05:14:18] [INFO ] Invariant cache hit.
[2023-03-17 05:14:18] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property PermAdmissibility-COL-05-LTLCardinality-08 finished in 4077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 26 transition count 16
Applied a total of 6 rules in 1 ms. Remains 26 /32 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2023-03-17 05:14:18] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-17 05:14:18] [INFO ] Implicit Places using invariants in 80 ms returned [4, 5, 10, 11, 12, 13, 15, 19, 21]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 82 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 17/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 277 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GT 3 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 71 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-05-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLCardinality-09 finished in 377 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))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 61 edges and 32 vertex of which 23 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 2 ms. Remains 23 /32 variables (removed 9) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 23 cols
[2023-03-17 05:14:18] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-17 05:14:18] [INFO ] Implicit Places using invariants in 55 ms returned [4, 5, 10, 11, 12, 15, 19]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 56 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/32 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 15 transition count 6
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 7 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 6 transition count 4
Applied a total of 18 rules in 4 ms. Remains 6 /16 variables (removed 10) and now considering 4/14 (removed 10) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-17 05:14:18] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-17 05:14:18] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-17 05:14:18] [INFO ] Invariant cache hit.
[2023-03-17 05:14:18] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/32 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112 ms. Remains : 6/32 places, 4/16 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s2 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 56 ms.
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-05-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLCardinality-10 finished in 386 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 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 26 transition count 16
Applied a total of 6 rules in 1 ms. Remains 26 /32 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2023-03-17 05:14:18] [INFO ] Computed 10 place invariants in 6 ms
[2023-03-17 05:14:18] [INFO ] Implicit Places using invariants in 57 ms returned [4, 5, 11, 12, 13, 15, 19, 21]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 59 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61 ms. Remains : 18/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s17 s8)], 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 55 ms.
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Computed a total of 18 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-05-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLCardinality-11 finished in 402 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(((p0 U G(p1)) U X(p2))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 26 transition count 16
Applied a total of 6 rules in 1 ms. Remains 26 /32 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2023-03-17 05:14:19] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-17 05:14:19] [INFO ] Implicit Places using invariants in 52 ms returned [4, 5, 10, 11, 13, 15, 19, 21]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 53 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/32 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 18/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 310 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ 2 s13), p0:(LEQ s8 s6), p2:(LEQ 3 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLCardinality-13 finished in 387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 61 edges and 32 vertex of which 9 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Applied a total of 1 rules in 1 ms. Remains 9 /32 variables (removed 23) and now considering 6/16 (removed 10) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-17 05:14:19] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-17 05:14:19] [INFO ] Implicit Places using invariants in 35 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/32 places, 6/16 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 7 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 3 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-17 05:14:19] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-17 05:14:19] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-17 05:14:19] [INFO ] Invariant cache hit.
[2023-03-17 05:14:19] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/32 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 108 ms. Remains : 6/32 places, 4/16 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ 3 s2) (LEQ 1 s4)), p1:(LEQ 1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLCardinality-14 finished in 241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 26 transition count 16
Applied a total of 6 rules in 2 ms. Remains 26 /32 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2023-03-17 05:14:19] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-17 05:14:19] [INFO ] Implicit Places using invariants in 48 ms returned [4, 5, 10, 12, 13, 15, 19, 21]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 50 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 18/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(GT s0 s16), p0:(LEQ s8 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2936 reset in 102 ms.
Product exploration explored 100000 steps with 2931 reset in 112 ms.
Computed a total of 18 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 279 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10003 steps, including 103 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Finished Best-First random walk after 90 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=90 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 322 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 16 rows 18 cols
[2023-03-17 05:14:21] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-17 05:14:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-17 05:14:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:14:21] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-17 05:14:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:14:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-17 05:14:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:14:21] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-17 05:14:21] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 05:14:21] [INFO ] Added : 12 causal constraints over 3 iterations in 25 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-17 05:14:21] [INFO ] Invariant cache hit.
[2023-03-17 05:14:21] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 05:14:21] [INFO ] Invariant cache hit.
[2023-03-17 05:14:21] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-17 05:14:21] [INFO ] Invariant cache hit.
[2023-03-17 05:14:21] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 18/18 places, 16/16 transitions.
Computed a total of 18 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 270 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10003 steps, including 103 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Finished Best-First random walk after 146 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=146 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 333 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-17 05:14:22] [INFO ] Invariant cache hit.
[2023-03-17 05:14:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-17 05:14:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:14:22] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-17 05:14:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:14:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-17 05:14:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:14:22] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-17 05:14:22] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 05:14:22] [INFO ] Added : 12 causal constraints over 3 iterations in 18 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2939 reset in 94 ms.
Product exploration explored 100000 steps with 2924 reset in 112 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Graph (complete) has 18 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 17 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 8 place count 17 transition count 15
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 17 transition count 15
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 15 place count 12 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 20 place count 12 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 20 rules in 9 ms. Remains 12 /18 variables (removed 6) and now considering 10/16 (removed 6) transitions.
[2023-03-17 05:14:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2023-03-17 05:14:22] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-17 05:14:22] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/18 places, 10/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43 ms. Remains : 12/18 places, 10/16 transitions.
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 18 cols
[2023-03-17 05:14:22] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-17 05:14:22] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 05:14:22] [INFO ] Invariant cache hit.
[2023-03-17 05:14:22] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-17 05:14:22] [INFO ] Invariant cache hit.
[2023-03-17 05:14:22] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 18/18 places, 16/16 transitions.
Treatment of property PermAdmissibility-COL-05-LTLCardinality-15 finished in 3078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)&&F(p1)))||(F(p0)&&X((F(p1)&&F(p2)))))))'
Found a Shortening insensitive property : PermAdmissibility-COL-05-LTLCardinality-03
Stuttering acceptance computed with spot in 410 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 61 edges and 32 vertex of which 22 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 2 ms. Remains 22 /32 variables (removed 10) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 22 cols
[2023-03-17 05:14:23] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-17 05:14:23] [INFO ] Implicit Places using invariants in 39 ms returned [4, 5, 10, 11, 13, 15]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 40 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 16/32 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 15 transition count 11
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 12 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 12 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 10 transition count 8
Applied a total of 10 rules in 5 ms. Remains 10 /16 variables (removed 6) and now considering 8/14 (removed 6) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-17 05:14:23] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-17 05:14:23] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-17 05:14:23] [INFO ] Invariant cache hit.
[2023-03-17 05:14:23] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 10/32 places, 8/16 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 107 ms. Remains : 10/32 places, 8/16 transitions.
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GT 3 s0), p1:(GT 3 s4), p2:(LEQ 3 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7914 reset in 82 ms.
Product exploration explored 100000 steps with 7907 reset in 98 ms.
Computed a total of 10 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p1), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 9 factoid took 578 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Finished random walk after 24 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p1), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F p2)]
Knowledge based reduction with 9 factoid took 591 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 10 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-17 05:14:25] [INFO ] Invariant cache hit.
[2023-03-17 05:14:25] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-17 05:14:25] [INFO ] Invariant cache hit.
[2023-03-17 05:14:25] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-17 05:14:25] [INFO ] Invariant cache hit.
[2023-03-17 05:14:25] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 10/10 places, 8/8 transitions.
Computed a total of 10 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p2)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 239 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Finished random walk after 24 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p1 (NOT p2)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F p2)]
Knowledge based reduction with 4 factoid took 307 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 7897 reset in 79 ms.
Product exploration explored 100000 steps with 7965 reset in 89 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 256 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 8
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 10 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 10 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-17 05:14:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2023-03-17 05:14:27] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-17 05:14:27] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/10 places, 8/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33 ms. Remains : 10/10 places, 8/8 transitions.
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-17 05:14:27] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-17 05:14:27] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-17 05:14:27] [INFO ] Invariant cache hit.
[2023-03-17 05:14:28] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-17 05:14:28] [INFO ] Invariant cache hit.
[2023-03-17 05:14:28] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 10/10 places, 8/8 transitions.
Treatment of property PermAdmissibility-COL-05-LTLCardinality-03 finished in 5031 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)||(p0&&G(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Found a Shortening insensitive property : PermAdmissibility-COL-05-LTLCardinality-15
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 61 edges and 32 vertex of which 26 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 26 /32 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2023-03-17 05:14:28] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-17 05:14:28] [INFO ] Implicit Places using invariants in 51 ms returned [4, 5, 10, 12, 13, 15, 19, 21]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 52 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 18/32 places, 16/16 transitions.
Graph (complete) has 18 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 16 transition count 9
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 9 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 8 transition count 6
Applied a total of 17 rules in 6 ms. Remains 8 /18 variables (removed 10) and now considering 6/16 (removed 10) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-17 05:14:28] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-17 05:14:28] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-17 05:14:28] [INFO ] Invariant cache hit.
[2023-03-17 05:14:28] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 8/32 places, 6/16 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 127 ms. Remains : 8/32 places, 6/16 transitions.
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(GT s0 s6), p0:(LEQ s4 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 6395 reset in 91 ms.
Product exploration explored 100000 steps with 6380 reset in 100 ms.
Computed a total of 8 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 275 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1372 steps, including 37 resets, run visited all 2 properties in 2 ms. (steps per millisecond=686 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 314 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-17 05:14:29] [INFO ] Invariant cache hit.
[2023-03-17 05:14:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-17 05:14:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:14:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-17 05:14:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:14:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-17 05:14:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:14:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-17 05:14:29] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-17 05:14:29] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-17 05:14:29] [INFO ] Invariant cache hit.
[2023-03-17 05:14:29] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 05:14:29] [INFO ] Invariant cache hit.
[2023-03-17 05:14:29] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-17 05:14:29] [INFO ] Invariant cache hit.
[2023-03-17 05:14:29] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 8/8 places, 6/6 transitions.
Computed a total of 8 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 300 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 2783 steps, including 75 resets, run visited all 2 properties in 3 ms. (steps per millisecond=927 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 321 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-17 05:14:30] [INFO ] Invariant cache hit.
[2023-03-17 05:14:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-17 05:14:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:14:30] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-17 05:14:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:14:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-17 05:14:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:14:30] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-17 05:14:30] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-17 05:14:30] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 6388 reset in 84 ms.
Product exploration explored 100000 steps with 6374 reset in 101 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-17 05:14:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 05:14:31] [INFO ] Invariant cache hit.
[2023-03-17 05:14:31] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34 ms. Remains : 8/8 places, 6/6 transitions.
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-17 05:14:31] [INFO ] Invariant cache hit.
[2023-03-17 05:14:31] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 05:14:31] [INFO ] Invariant cache hit.
[2023-03-17 05:14:31] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-17 05:14:31] [INFO ] Invariant cache hit.
[2023-03-17 05:14:31] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 8/8 places, 6/6 transitions.
Treatment of property PermAdmissibility-COL-05-LTLCardinality-15 finished in 3225 ms.
[2023-03-17 05:14:31] [INFO ] Flatten gal took : 3 ms
[2023-03-17 05:14:31] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-17 05:14:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 16 transitions and 63 arcs took 1 ms.
Total runtime 28871 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2315/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2315/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2315/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PermAdmissibility-COL-05-LTLCardinality-03
Could not compute solution for formula : PermAdmissibility-COL-05-LTLCardinality-08
Could not compute solution for formula : PermAdmissibility-COL-05-LTLCardinality-15

BK_STOP 1679030073132

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name PermAdmissibility-COL-05-LTLCardinality-03
ltl formula formula --ltl=/tmp/2315/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 32 places, 16 transitions and 63 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2315/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2315/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2315/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2315/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
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:
ltl formula name PermAdmissibility-COL-05-LTLCardinality-08
ltl formula formula --ltl=/tmp/2315/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
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 32 places, 16 transitions and 63 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2315/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2315/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2315/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2315/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name PermAdmissibility-COL-05-LTLCardinality-15
ltl formula formula --ltl=/tmp/2315/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 32 places, 16 transitions and 63 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
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2315/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2315/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2315/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2315/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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="PermAdmissibility-COL-05"
export BK_EXAMINATION="LTLCardinality"
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 PermAdmissibility-COL-05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-smll-167863540100475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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