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.r263-smll-167863538300459.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is PermAdmissibility-COL-01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538300459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.0K Feb 26 01:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 01:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 01:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.6K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 11K Feb 26 01:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 01:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 01:27 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-01-LTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678796032742

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-01
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 12:13:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 12:13:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 12:13:56] [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-14 12:13:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 12:13:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1110 ms
[2023-03-14 12:13:57] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 36 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 12:13:58] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 8 ms.
[2023-03-14 12:13:58] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
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 16 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 10000 steps, including 588 resets, run finished after 852 ms. (steps per millisecond=11 ) properties (out of 36) seen :22
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 16 rows 40 cols
[2023-03-14 12:14:02] [INFO ] Computed 24 place invariants in 6 ms
[2023-03-14 12:14:02] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-14 12:14:02] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :9 sat :0 real:5
[2023-03-14 12:14:02] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 43 ms returned sat
[2023-03-14 12:14:02] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :0
Fused 14 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 14 atomic propositions for a total of 16 simplifications.
FORMULA PermAdmissibility-COL-01-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 12:14:03] [INFO ] Flatten gal took : 38 ms
[2023-03-14 12:14:03] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA PermAdmissibility-COL-01-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 12:14:03] [INFO ] Flatten gal took : 13 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-14 12:14:03] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 22 ms.
[2023-03-14 12:14:03] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Support contains 28 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 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 16
Applied a total of 2 rules in 15 ms. Remains 38 /40 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 38 cols
[2023-03-14 12:14:03] [INFO ] Computed 22 place invariants in 12 ms
[2023-03-14 12:14:03] [INFO ] Implicit Places using invariants in 97 ms returned [15, 16, 26]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 101 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 35/40 places, 16/16 transitions.
Support contains 28 out of 35 places after structural reductions.
[2023-03-14 12:14:03] [INFO ] Flatten gal took : 10 ms
[2023-03-14 12:14:03] [INFO ] Flatten gal took : 9 ms
[2023-03-14 12:14:03] [INFO ] Input system was already deterministic with 16 transitions.
Support contains 27 out of 35 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 588 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 21) seen :17
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 16 rows 35 cols
[2023-03-14 12:14:04] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-14 12:14:04] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 8 ms returned sat
[2023-03-14 12:14:04] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2023-03-14 12:14:04] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 7 ms returned sat
[2023-03-14 12:14:04] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA PermAdmissibility-COL-01-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 9 simplifications.
Computed a total of 35 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 35 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' '!(F((p0&&F(G(p1)))))'
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Graph (complete) has 77 edges and 35 vertex of which 29 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 25 transition count 14
Applied a total of 6 rules in 12 ms. Remains 25 /35 variables (removed 10) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 25 cols
[2023-03-14 12:14:05] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-14 12:14:05] [INFO ] Implicit Places using invariants in 85 ms returned [5, 6, 11, 12, 13, 15, 17, 18, 20]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 87 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/35 places, 14/16 transitions.
Graph (complete) has 17 edges and 16 vertex of which 15 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 14 transition count 7
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 8 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 8 transition count 4
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 17 place count 6 transition count 4
Applied a total of 17 rules in 8 ms. Remains 6 /16 variables (removed 10) and now considering 4/14 (removed 10) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-14 12:14:05] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-14 12:14:05] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-14 12:14:05] [INFO ] Invariant cache hit.
[2023-03-14 12:14:05] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/35 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 163 ms. Remains : 6/35 places, 4/16 transitions.
Stuttering acceptance computed with spot in 360 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s5), p1:(AND (GT 3 s1) (GT 1 s5))], 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 9 steps with 1 reset in 3 ms.
FORMULA PermAdmissibility-COL-01-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLCardinality-00 finished in 604 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' '!(((p0&&X(G((p0 U p1)))) U X(X(X(X(p2))))))'
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 29 transition count 16
Applied a total of 6 rules in 2 ms. Remains 29 /35 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 29 cols
[2023-03-14 12:14:05] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-14 12:14:05] [INFO ] Implicit Places using invariants in 136 ms returned [4, 5, 6, 7, 12, 13, 14, 16, 20, 21, 23]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 139 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/35 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 143 ms. Remains : 18/35 places, 16/16 transitions.
Stuttering acceptance computed with spot in 1480 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(OR p0 p1), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 8}, { cond=p0, acceptance={} source=2 dest: 9}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(OR p0 p1), acceptance={} source=7 dest: 10}], [{ cond=true, acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 11}, { cond=(OR p0 p1), acceptance={} source=9 dest: 12}, { cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 13}, { cond=p0, acceptance={} source=9 dest: 14}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 5}, { cond=(OR p0 p1), acceptance={} source=10 dest: 15}], [{ cond=true, acceptance={} source=11 dest: 16}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=12 dest: 16}, { cond=(OR p0 p1), acceptance={} source=12 dest: 17}], [{ cond=true, acceptance={} source=13 dest: 18}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=14 dest: 18}, { cond=(OR p0 p1), acceptance={} source=14 dest: 19}, { cond=(AND (NOT p0) p1), acceptance={} source=14 dest: 20}, { cond=p0, acceptance={} source=14 dest: 21}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=15 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=15 dest: 22}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=15 dest: 23}], [{ cond=(NOT p2), acceptance={} source=16 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=17 dest: 5}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=17 dest: 15}], [{ cond=(NOT p2), acceptance={} source=18 dest: 16}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=19 dest: 16}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=19 dest: 17}], [{ cond=(NOT p2), acceptance={} source=20 dest: 18}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=21 dest: 18}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=21 dest: 19}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=21 dest: 20}, { cond=(AND p0 (NOT p2)), acceptance={0} source=21 dest: 21}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=22 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=22 dest: 22}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=23 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=23 dest: 22}, { cond=(OR p0 p1), acceptance={} source=23 dest: 23}]], initial=0, aps=[p0:(LEQ 1 s9), p1:(LEQ s17 s14), p2:(LEQ s16 s12)], 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, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 453 ms.
Product exploration explored 100000 steps with 20000 reset in 239 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 p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (OR p0 p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (OR p0 p1))), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 824 ms. Reduced automaton from 24 states, 47 edges and 3 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (OR p0 p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (OR p0 p1))), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 13 factoid took 911 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 265 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
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 3 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 18 cols
[2023-03-14 12:14:10] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-14 12:14:10] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-14 12:14:10] [INFO ] Invariant cache hit.
[2023-03-14 12:14:10] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-14 12:14:10] [INFO ] Invariant cache hit.
[2023-03-14 12:14:10] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 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 : [p2, true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [p2, true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 290 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 325 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Product exploration explored 100000 steps with 20000 reset in 128 ms.
Product exploration explored 100000 steps with 20000 reset in 397 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 281 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
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 17 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 15 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 8 place count 15 transition count 14
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 15 transition count 14
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 22 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 32 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 32 rules in 12 ms. Remains 5 /18 variables (removed 13) and now considering 4/16 (removed 12) transitions.
[2023-03-14 12:14:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2023-03-14 12:14:13] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-14 12:14:13] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/18 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52 ms. Remains : 5/18 places, 4/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.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 16
Applied a total of 1 rules in 2 ms. Remains 17 /18 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 17 cols
[2023-03-14 12:14:13] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-14 12:14:13] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-14 12:14:13] [INFO ] Invariant cache hit.
[2023-03-14 12:14:13] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-14 12:14:13] [INFO ] Invariant cache hit.
[2023-03-14 12:14:13] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 17/18 places, 16/16 transitions.
Treatment of property PermAdmissibility-COL-01-LTLCardinality-01 finished in 8086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Graph (complete) has 77 edges and 35 vertex of which 13 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 2 ms. Remains 12 /35 variables (removed 23) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-14 12:14:13] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-14 12:14:13] [INFO ] Implicit Places using invariants in 44 ms returned [4, 5, 6]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 45 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/35 places, 8/16 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 9 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 6 transition count 5
Applied a total of 6 rules in 5 ms. Remains 6 /9 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 6 cols
[2023-03-14 12:14:13] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-14 12:14:13] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-14 12:14:13] [INFO ] Invariant cache hit.
[2023-03-14 12:14:13] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/35 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 113 ms. Remains : 6/35 places, 5/16 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 16666 reset in 192 ms.
Product exploration explored 100000 steps with 16666 reset in 254 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 : [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 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-01-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-01-LTLCardinality-02 finished in 863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(F(p1))))))'
Support contains 3 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 27 transition count 16
Applied a total of 8 rules in 3 ms. Remains 27 /35 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 27 cols
[2023-03-14 12:14:14] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-14 12:14:14] [INFO ] Implicit Places using invariants in 71 ms returned [4, 5, 6, 7, 12, 13, 16, 20]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 72 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/35 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 77 ms. Remains : 19/35 places, 16/16 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-01-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p0:(LEQ s15 s8), p1:(GT s8 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 10 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-01-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLCardinality-05 finished in 376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 27 transition count 16
Applied a total of 8 rules in 3 ms. Remains 27 /35 variables (removed 8) and now considering 16/16 (removed 0) transitions.
[2023-03-14 12:14:14] [INFO ] Invariant cache hit.
[2023-03-14 12:14:15] [INFO ] Implicit Places using invariants in 97 ms returned [4, 5, 6, 7, 12, 13, 14, 16, 20, 21, 23]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 107 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/35 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 16/35 places, 16/16 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-01-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLCardinality-06 finished in 245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U !p1))'
Support contains 6 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Graph (complete) has 77 edges and 35 vertex of which 30 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 9 ms. Remains 29 /35 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 29 cols
[2023-03-14 12:14:15] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-14 12:14:15] [INFO ] Implicit Places using invariants in 98 ms returned [4, 5, 12, 13, 14, 16, 20, 21, 23]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 100 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/35 places, 16/16 transitions.
Reduce places removed 1 places and 1 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 19 transition count 14
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 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 17 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4 place count 17 transition count 11
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 8 place count 15 transition count 11
Applied a total of 8 rules in 5 ms. Remains 15 /20 variables (removed 5) and now considering 11/16 (removed 5) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-14 12:14:15] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-14 12:14:15] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-14 12:14:15] [INFO ] Invariant cache hit.
[2023-03-14 12:14:15] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/35 places, 11/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 218 ms. Remains : 15/35 places, 11/16 transitions.
Stuttering acceptance computed with spot in 115 ms :[p1, (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LEQ s4 s5) (GT 1 s13)), p0:(AND (LEQ 1 s7) (LEQ s11 s14))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 21 steps with 4 reset in 0 ms.
FORMULA PermAdmissibility-COL-01-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLCardinality-09 finished in 353 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 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Graph (complete) has 77 edges and 35 vertex of which 21 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Ensure Unique test removed 1 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 17 transition count 10
Applied a total of 6 rules in 4 ms. Remains 17 /35 variables (removed 18) and now considering 10/16 (removed 6) transitions.
// Phase 1: matrix 10 rows 17 cols
[2023-03-14 12:14:15] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-14 12:14:15] [INFO ] Implicit Places using invariants in 88 ms returned [4, 6, 12, 13, 15]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 89 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/35 places, 10/16 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 12 transition count 7
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 8 transition count 5
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 10 place count 7 transition count 5
Applied a total of 10 rules in 4 ms. Remains 7 /12 variables (removed 5) and now considering 5/10 (removed 5) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-14 12:14:15] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-14 12:14:15] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-14 12:14:15] [INFO ] Invariant cache hit.
[2023-03-14 12:14:15] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/35 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 208 ms. Remains : 7/35 places, 5/16 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s2 s3)], 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 25000 reset in 164 ms.
Product exploration explored 100000 steps with 25000 reset in 503 ms.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 223 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 237 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2023-03-14 12:14:17] [INFO ] Invariant cache hit.
[2023-03-14 12:14:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-14 12:14:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:14:17] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-14 12:14:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:14:17] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-14 12:14:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:14:17] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-14 12:14:17] [INFO ] Computed and/alt/rep : 4/6/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 12:14:17] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-14 12:14:17] [INFO ] Invariant cache hit.
[2023-03-14 12:14:17] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-14 12:14:17] [INFO ] Invariant cache hit.
[2023-03-14 12:14:17] [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-14 12:14:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 12:14:17] [INFO ] Invariant cache hit.
[2023-03-14 12:14:17] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 7/7 places, 5/5 transitions.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 233 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2023-03-14 12:14:18] [INFO ] Invariant cache hit.
[2023-03-14 12:14:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-14 12:14:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:14:18] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-14 12:14:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:14:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-14 12:14:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:14:18] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-14 12:14:18] [INFO ] Computed and/alt/rep : 4/6/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 12:14:18] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 107 ms.
Product exploration explored 100000 steps with 25000 reset in 109 ms.
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-14 12:14:18] [INFO ] Invariant cache hit.
[2023-03-14 12:14:18] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-14 12:14:18] [INFO ] Invariant cache hit.
[2023-03-14 12:14:18] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-14 12:14:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 12:14:18] [INFO ] Invariant cache hit.
[2023-03-14 12:14:18] [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 109 ms. Remains : 7/7 places, 5/5 transitions.
Treatment of property PermAdmissibility-COL-01-LTLCardinality-10 finished in 3133 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(F((p0&&X(p1))))))))'
Support contains 4 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 27 transition count 16
Applied a total of 8 rules in 1 ms. Remains 27 /35 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 27 cols
[2023-03-14 12:14:18] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-14 12:14:18] [INFO ] Implicit Places using invariants in 83 ms returned [4, 7, 12, 14, 20, 21, 23]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 84 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/35 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 20/35 places, 16/16 transitions.
Stuttering acceptance computed with spot in 326 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-01-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} 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 s5 s10), p1:(GT s4 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11111 reset in 106 ms.
Product exploration explored 100000 steps with 11111 reset in 126 ms.
Computed a total of 20 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 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 p0) (NOT p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 251 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 325 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 588 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 20 cols
[2023-03-14 12:14:20] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-14 12:14:20] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 12:14:20] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-14 12:14:20] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 362 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 316 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2023-03-14 12:14:21] [INFO ] Invariant cache hit.
[2023-03-14 12:14:21] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-14 12:14:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:14:21] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-14 12:14:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:14:21] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-14 12:14:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:14:21] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-14 12:14:21] [INFO ] Computed and/alt/rep : 15/21/15 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-14 12:14:21] [INFO ] Added : 5 causal constraints over 1 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-14 12:14:21] [INFO ] Invariant cache hit.
[2023-03-14 12:14:21] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-14 12:14:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:14:21] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-14 12:14:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:14:21] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 7 ms returned sat
[2023-03-14 12:14:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:14:21] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-14 12:14:21] [INFO ] Computed and/alt/rep : 15/21/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 12:14:21] [INFO ] Added : 4 causal constraints over 1 iterations in 14 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-14 12:14:21] [INFO ] Invariant cache hit.
[2023-03-14 12:14:21] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-14 12:14:21] [INFO ] Invariant cache hit.
[2023-03-14 12:14:21] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-14 12:14:21] [INFO ] Invariant cache hit.
[2023-03-14 12:14:21] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 20/20 places, 16/16 transitions.
Computed a total of 20 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 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)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 243 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 4 factoid took 297 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 438 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 311 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2023-03-14 12:14:23] [INFO ] Invariant cache hit.
[2023-03-14 12:14:23] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-14 12:14:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:14:23] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-14 12:14:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:14:23] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-14 12:14:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:14:23] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-14 12:14:23] [INFO ] Computed and/alt/rep : 15/21/15 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-14 12:14:23] [INFO ] Added : 5 causal constraints over 1 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-14 12:14:23] [INFO ] Invariant cache hit.
[2023-03-14 12:14:23] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-14 12:14:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:14:23] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-14 12:14:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:14:23] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-14 12:14:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:14:23] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-14 12:14:23] [INFO ] Computed and/alt/rep : 15/21/15 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-14 12:14:23] [INFO ] Added : 4 causal constraints over 1 iterations in 22 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 317 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 11111 reset in 102 ms.
Product exploration explored 100000 steps with 11111 reset in 123 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-14 12:14:24] [INFO ] Invariant cache hit.
[2023-03-14 12:14:24] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-14 12:14:24] [INFO ] Invariant cache hit.
[2023-03-14 12:14:24] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-14 12:14:24] [INFO ] Invariant cache hit.
[2023-03-14 12:14:24] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 20/20 places, 16/16 transitions.
Treatment of property PermAdmissibility-COL-01-LTLCardinality-11 finished in 5698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 27 transition count 16
Applied a total of 8 rules in 2 ms. Remains 27 /35 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 27 cols
[2023-03-14 12:14:24] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-14 12:14:24] [INFO ] Implicit Places using invariants in 69 ms returned [4, 5, 6, 7, 12, 13, 14, 20, 21, 23]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 71 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17/35 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 74 ms. Remains : 17/35 places, 16/16 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s9 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-01-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLCardinality-14 finished in 206 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' '!(((p0&&X(G((p0 U p1)))) U X(X(X(X(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((p0&&X(p1))))))))'
Found a Shortening insensitive property : PermAdmissibility-COL-01-LTLCardinality-11
Stuttering acceptance computed with spot in 311 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 35 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Graph (complete) has 77 edges and 35 vertex of which 21 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 19 transition count 11
Applied a total of 3 rules in 5 ms. Remains 19 /35 variables (removed 16) and now considering 11/16 (removed 5) transitions.
// Phase 1: matrix 11 rows 19 cols
[2023-03-14 12:14:25] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-14 12:14:25] [INFO ] Implicit Places using invariants in 48 ms returned [4, 7, 12, 14]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 49 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 15/35 places, 11/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 15 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Applied a total of 2 rules in 4 ms. Remains 14 /15 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-14 12:14:25] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-14 12:14:25] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-14 12:14:25] [INFO ] Invariant cache hit.
[2023-03-14 12:14:25] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 14/35 places, 10/16 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 148 ms. Remains : 14/35 places, 10/16 transitions.
Running random walk in product with property : PermAdmissibility-COL-01-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} 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 s5 s9), p1:(GT s4 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 12500 reset in 114 ms.
Product exploration explored 100000 steps with 12500 reset in 122 ms.
Computed a total of 14 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 14 transition count 10
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 p0) (NOT p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 253 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 311 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 909 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 12:14:26] [INFO ] Invariant cache hit.
[2023-03-14 12:14:26] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 12:14:26] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-14 12:14:26] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 368 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 313 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2023-03-14 12:14:27] [INFO ] Invariant cache hit.
[2023-03-14 12:14:27] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-14 12:14:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:14:27] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-14 12:14:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:14:27] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-14 12:14:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:14:27] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-14 12:14:27] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 12:14:27] [INFO ] Added : 4 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-14 12:14:27] [INFO ] Invariant cache hit.
[2023-03-14 12:14:27] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-14 12:14:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:14:27] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-14 12:14:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:14:27] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-14 12:14:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:14:27] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-14 12:14:27] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-14 12:14:27] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-14 12:14:27] [INFO ] Invariant cache hit.
[2023-03-14 12:14:27] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-14 12:14:27] [INFO ] Invariant cache hit.
[2023-03-14 12:14:27] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-14 12:14:27] [INFO ] Invariant cache hit.
[2023-03-14 12:14:27] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 14/14 places, 10/10 transitions.
Computed a total of 14 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 14 transition count 10
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)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 242 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 4 factoid took 295 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 314 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2023-03-14 12:14:29] [INFO ] Invariant cache hit.
[2023-03-14 12:14:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-14 12:14:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:14:29] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-14 12:14:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:14:29] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-14 12:14:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:14:29] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-14 12:14:29] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 12:14:29] [INFO ] Added : 4 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-14 12:14:29] [INFO ] Invariant cache hit.
[2023-03-14 12:14:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-14 12:14:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:14:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-14 12:14:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:14:29] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-14 12:14:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:14:29] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-14 12:14:29] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 12:14:29] [INFO ] Added : 3 causal constraints over 1 iterations in 23 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 342 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 12500 reset in 104 ms.
Product exploration explored 100000 steps with 12500 reset in 114 ms.
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-14 12:14:30] [INFO ] Invariant cache hit.
[2023-03-14 12:14:30] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-14 12:14:30] [INFO ] Invariant cache hit.
[2023-03-14 12:14:30] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-14 12:14:30] [INFO ] Invariant cache hit.
[2023-03-14 12:14:30] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 14/14 places, 10/10 transitions.
Treatment of property PermAdmissibility-COL-01-LTLCardinality-11 finished in 5612 ms.
[2023-03-14 12:14:30] [INFO ] Flatten gal took : 7 ms
[2023-03-14 12:14:30] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-14 12:14:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 35 places, 16 transitions and 71 arcs took 1 ms.
Total runtime 34020 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PermAdmissibility-COL-01
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality

FORMULA PermAdmissibility-COL-01-LTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-COL-01-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-COL-01-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678796072247

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 1 (type EXCL) for 0 PermAdmissibility-COL-01-LTLCardinality-01
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for PermAdmissibility-COL-01-LTLCardinality-01
lola: result : true
lola: markings : 25
lola: fired transitions : 24
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 PermAdmissibility-COL-01-LTLCardinality-11
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for PermAdmissibility-COL-01-LTLCardinality-11
lola: result : true
lola: markings : 12
lola: fired transitions : 13
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 9 (type EXCL) for 3 PermAdmissibility-COL-01-LTLCardinality-10
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 9 (type EXCL) for PermAdmissibility-COL-01-LTLCardinality-10
lola: result : false
lola: markings : 6
lola: fired transitions : 5
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PermAdmissibility-COL-01-LTLCardinality-01: LTL true LTL model checker
PermAdmissibility-COL-01-LTLCardinality-10: F true state space / EG
PermAdmissibility-COL-01-LTLCardinality-11: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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-01"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is PermAdmissibility-COL-01, 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 r263-smll-167863538300459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-01.tgz
mv PermAdmissibility-COL-01 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 ;