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-167863538300499.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-50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538300499
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.6K Feb 26 01:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 01:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 01:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 01:17 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.4K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 01:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 01:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26K Feb 26 01:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:31 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-50-LTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678804296100

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-50
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 14:31:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 14:31:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 14:31:39] [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 14:31:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 14:31:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1074 ms
[2023-03-14 14:31:40] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 14:31:41] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 8 ms.
[2023-03-14 14:31:41] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 1 formulas.
FORMULA PermAdmissibility-COL-50-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 15 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 10008 steps, including 12 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 28) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 16 rows 40 cols
[2023-03-14 14:31:41] [INFO ] Computed 24 place invariants in 12 ms
[2023-03-14 14:31:41] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 14:31:42] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-14 14:31:42] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
[2023-03-14 14:31:42] [INFO ] Flatten gal took : 38 ms
[2023-03-14 14:31:42] [INFO ] Flatten gal took : 11 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 14:31:42] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 24 ms.
[2023-03-14 14:31:42] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Support contains 29 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 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 37 transition count 16
Applied a total of 3 rules in 20 ms. Remains 37 /40 variables (removed 3) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 37 cols
[2023-03-14 14:31:42] [INFO ] Computed 21 place invariants in 5 ms
[2023-03-14 14:31:42] [INFO ] Implicit Places using invariants in 116 ms returned [4, 5, 7, 15, 26]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 120 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/40 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 32/40 places, 16/16 transitions.
Support contains 29 out of 32 places after structural reductions.
[2023-03-14 14:31:42] [INFO ] Flatten gal took : 8 ms
[2023-03-14 14:31:42] [INFO ] Flatten gal took : 7 ms
[2023-03-14 14:31:42] [INFO ] Input system was already deterministic with 16 transitions.
Support contains 28 out of 32 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10008 steps, including 12 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 26) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 16 rows 32 cols
[2023-03-14 14:31:43] [INFO ] Computed 16 place invariants in 5 ms
[2023-03-14 14:31:43] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 14:31:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-14 14:31:43] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-14 14:31:43] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA PermAdmissibility-COL-50-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
Computed a total of 32 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 61 edges and 32 vertex of which 27 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 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 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 23 transition count 14
Applied a total of 6 rules in 17 ms. Remains 23 /32 variables (removed 9) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 23 cols
[2023-03-14 14:31:43] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-14 14:31:43] [INFO ] Implicit Places using invariants in 86 ms returned [2, 7, 8, 9, 10, 11, 16, 17]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 88 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/32 places, 14/16 transitions.
Graph (complete) has 14 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 13 transition count 2
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 21 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 2 transition count 1
Applied a total of 23 rules in 6 ms. Remains 2 /15 variables (removed 13) and now considering 1/14 (removed 13) transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-14 14:31:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-14 14:31:43] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-14 14:31:43] [INFO ] Invariant cache hit.
[2023-03-14 14:31:43] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/32 places, 1/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 151 ms. Remains : 2/32 places, 1/16 transitions.
Stuttering acceptance computed with spot in 462 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-00 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 3 s1)], 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 10335 reset in 547 ms.
Product exploration explored 100000 steps with 9936 reset in 287 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 1
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 228 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
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 196 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
[2023-03-14 14:31:45] [INFO ] Invariant cache hit.
[2023-03-14 14:31:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-14 14:31:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:31:45] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-14 14:31:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 14:31:45] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-14 14:31:45] [INFO ] Invariant cache hit.
[2023-03-14 14:31:45] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-14 14:31:45] [INFO ] Invariant cache hit.
[2023-03-14 14:31:46] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-14 14:31:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 14:31:46] [INFO ] Invariant cache hit.
[2023-03-14 14:31:46] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 2/2 places, 1/1 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 1
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 219 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
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 261 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
[2023-03-14 14:31:46] [INFO ] Invariant cache hit.
[2023-03-14 14:31:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-14 14:31:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:31:46] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-14 14:31:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 14:31:46] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10160 reset in 115 ms.
Product exploration explored 100000 steps with 10175 reset in 359 ms.
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-14 14:31:47] [INFO ] Invariant cache hit.
[2023-03-14 14:31:47] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-14 14:31:47] [INFO ] Invariant cache hit.
[2023-03-14 14:31:47] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-14 14:31:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 14:31:47] [INFO ] Invariant cache hit.
[2023-03-14 14:31:47] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 2/2 places, 1/1 transitions.
Treatment of property PermAdmissibility-COL-50-LTLCardinality-00 finished in 4035 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 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 25 transition count 16
Applied a total of 7 rules in 2 ms. Remains 25 /32 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-14 14:31:47] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-14 14:31:47] [INFO ] Implicit Places using invariants in 88 ms returned [4, 9, 10, 11, 12, 13, 18, 19, 20]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 89 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/32 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 92 ms. Remains : 16/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-01 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 s15)], 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-50-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLCardinality-01 finished in 236 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((G(p0)||(p1&&X(p0))))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 25 transition count 16
Applied a total of 7 rules in 3 ms. Remains 25 /32 variables (removed 7) and now considering 16/16 (removed 0) transitions.
[2023-03-14 14:31:47] [INFO ] Invariant cache hit.
[2023-03-14 14:31:48] [INFO ] Implicit Places using invariants in 87 ms returned [4, 10, 11, 12, 13, 18, 19, 20]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 89 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 17/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s8 s12), p0:(OR (GT s1 s14) (GT s0 s6))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2607 reset in 187 ms.
Product exploration explored 100000 steps with 2578 reset in 208 ms.
Computed a total of 17 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 835 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Incomplete random walk after 10008 steps, including 12 resets, run finished after 5 ms. (steps per millisecond=2001 ) properties (out of 4) seen :3
Finished Best-First random walk after 385 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=192 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND p1 p0)), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 11 factoid took 810 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), false]
// Phase 1: matrix 16 rows 17 cols
[2023-03-14 14:31:50] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-14 14:31:51] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 14:31:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:31:51] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-14 14:31:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:31:51] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 14:31:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:31:51] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-14 14:31:51] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-14 14:31:51] [INFO ] Added : 12 causal constraints over 3 iterations in 39 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 16/16 transitions.
Graph (complete) has 17 edges and 17 vertex of which 15 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 3 place count 15 transition count 12
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 13 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 11 transition count 10
Applied a total of 9 rules in 14 ms. Remains 11 /17 variables (removed 6) and now considering 10/16 (removed 6) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-14 14:31:51] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-14 14:31:51] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-14 14:31:51] [INFO ] Invariant cache hit.
[2023-03-14 14:31:51] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-14 14:31:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 14:31:51] [INFO ] Invariant cache hit.
[2023-03-14 14:31:51] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/17 places, 10/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 11/17 places, 10/16 transitions.
Computed a total of 11 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 629 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Incomplete random walk after 10015 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=1430 ) properties (out of 4) seen :3
Finished Best-First random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND p1 p0)), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 11 factoid took 798 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (NOT p0), false]
[2023-03-14 14:31:53] [INFO ] Invariant cache hit.
[2023-03-14 14:31:53] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 14:31:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:31:53] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-14 14:31:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:31:53] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 14:31:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:31:53] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-14 14:31:53] [INFO ] Computed and/alt/rep : 9/9/9 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 14:31:53] [INFO ] Added : 8 causal constraints over 2 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Product exploration explored 100000 steps with 5697 reset in 172 ms.
Product exploration explored 100000 steps with 5750 reset in 224 ms.
Support contains 6 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 3 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-14 14:31:54] [INFO ] Invariant cache hit.
[2023-03-14 14:31:54] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-14 14:31:54] [INFO ] Invariant cache hit.
[2023-03-14 14:31:54] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-14 14:31:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 14:31:54] [INFO ] Invariant cache hit.
[2023-03-14 14:31:54] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 11/11 places, 10/10 transitions.
Treatment of property PermAdmissibility-COL-50-LTLCardinality-02 finished in 6453 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))||F(p1))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 25 transition count 16
Applied a total of 7 rules in 2 ms. Remains 25 /32 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-14 14:31:54] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-14 14:31:54] [INFO ] Implicit Places using invariants in 82 ms returned [4, 9, 10, 11, 12, 13, 18, 19]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 85 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 17/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 2 s14), p0:(LEQ 3 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 599 reset in 183 ms.
Product exploration explored 100000 steps with 628 reset in 193 ms.
Computed a total of 17 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 369 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1)]
Finished random walk after 663 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=331 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 355 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
// Phase 1: matrix 16 rows 17 cols
[2023-03-14 14:31:56] [INFO ] Computed 1 place invariants in 2 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 6 factoid took 173 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-50-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-50-LTLCardinality-03 finished in 1925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(p1))||G(p2))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 25 transition count 16
Applied a total of 7 rules in 2 ms. Remains 25 /32 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-14 14:31:56] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-14 14:31:56] [INFO ] Implicit Places using invariants in 92 ms returned [4, 9, 10, 11, 13, 19, 20]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 94 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 18/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s13), p2:(GT 2 s8), p1:(LEQ 2 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1373 reset in 210 ms.
Product exploration explored 100000 steps with 1372 reset in 230 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) p2 (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 459 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Finished random walk after 52 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F (NOT (AND p2 (NOT p1) (NOT p0)))), (F (AND (NOT p2) (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 521 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 18 cols
[2023-03-14 14:31:58] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-14 14:31:58] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-14 14:31:58] [INFO ] Invariant cache hit.
[2023-03-14 14:31:58] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-14 14:31:58] [INFO ] Invariant cache hit.
[2023-03-14 14:31:58] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 18/18 places, 16/16 transitions.
Computed a total of 18 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 371 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Finished random walk after 52 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p0) p2))), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 4 factoid took 438 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1378 reset in 231 ms.
Product exploration explored 100000 steps with 1368 reset in 254 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 18 transition count 16
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 18 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 18 transition count 16
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 15 transition count 13
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 15 transition count 13
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 14 rules in 10 ms. Remains 15 /18 variables (removed 3) and now considering 13/16 (removed 3) transitions.
[2023-03-14 14:32:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2023-03-14 14:32:01] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-14 14:32:01] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/18 places, 13/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60 ms. Remains : 15/18 places, 13/16 transitions.
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 18 cols
[2023-03-14 14:32:01] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-14 14:32:01] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-14 14:32:01] [INFO ] Invariant cache hit.
[2023-03-14 14:32:01] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-14 14:32:01] [INFO ] Invariant cache hit.
[2023-03-14 14:32:01] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 18/18 places, 16/16 transitions.
Treatment of property PermAdmissibility-COL-50-LTLCardinality-04 finished in 5196 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)&&X(G(p1)))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
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 26 transition count 16
Applied a total of 6 rules in 1 ms. Remains 26 /32 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2023-03-14 14:32:01] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-14 14:32:01] [INFO ] Implicit Places using invariants in 70 ms returned [9, 10, 12, 13, 18, 19, 20]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 72 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/32 places, 16/16 transitions.
Applied a total of 0 rules in 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 76 ms. Remains : 19/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-05 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: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (GT 3 s4) (GT s18 s8)), p1:(GT 3 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-50-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLCardinality-05 finished in 282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 25 transition count 16
Applied a total of 7 rules in 1 ms. Remains 25 /32 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-14 14:32:01] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-14 14:32:01] [INFO ] Implicit Places using invariants in 84 ms returned [4, 9, 10, 11, 12, 13, 18, 19, 20]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 86 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/32 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 90 ms. Remains : 16/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(LEQ 1 s3), p0:(GT 3 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 200 ms.
Product exploration explored 100000 steps with 33333 reset in 251 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 5 factoid took 176 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-50-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-50-LTLCardinality-06 finished in 942 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 U p1)||G(p2)))'
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 61 edges and 32 vertex of which 28 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output 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 26 transition count 15
Applied a total of 3 rules in 7 ms. Remains 26 /32 variables (removed 6) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 26 cols
[2023-03-14 14:32:02] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-14 14:32:02] [INFO ] Implicit Places using invariants in 88 ms returned [3, 9, 10, 12, 17, 18, 19]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 90 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/32 places, 15/16 transitions.
Graph (complete) has 21 edges and 19 vertex of which 18 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 3 place count 17 transition count 11
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 15 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 13 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 place count 13 transition count 8
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 11 place count 12 transition count 8
Applied a total of 11 rules in 11 ms. Remains 12 /19 variables (removed 7) and now considering 8/15 (removed 7) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-14 14:32:02] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-14 14:32:02] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-14 14:32:02] [INFO ] Invariant cache hit.
[2023-03-14 14:32:02] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/32 places, 8/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 186 ms. Remains : 12/32 places, 8/16 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(LEQ s4 s8), p0:(LEQ 1 s11), p2:(LEQ s10 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 300 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-50-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLCardinality-09 finished in 387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&X(G(p1)))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 25 transition count 16
Applied a total of 7 rules in 1 ms. Remains 25 /32 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-14 14:32:03] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-14 14:32:03] [INFO ] Implicit Places using invariants in 76 ms returned [4, 9, 10, 11, 13, 18, 19, 20]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 77 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 17/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT 2 s8), p1:(GT s9 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-50-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLCardinality-10 finished in 285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 25 transition count 16
Applied a total of 7 rules in 2 ms. Remains 25 /32 variables (removed 7) and now considering 16/16 (removed 0) transitions.
[2023-03-14 14:32:03] [INFO ] Invariant cache hit.
[2023-03-14 14:32:03] [INFO ] Implicit Places using invariants in 160 ms returned [4, 9, 10, 12, 13, 18, 19, 20]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 163 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17/32 places, 16/16 transitions.
Applied a total of 0 rules in 2 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 167 ms. Remains : 17/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 90 ms.
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Computed a total of 17 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-50-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-50-LTLCardinality-11 finished in 675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 61 edges and 32 vertex of which 27 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 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 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 23 transition count 14
Applied a total of 6 rules in 6 ms. Remains 23 /32 variables (removed 9) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 23 cols
[2023-03-14 14:32:04] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-14 14:32:04] [INFO ] Implicit Places using invariants in 73 ms returned [2, 7, 8, 9, 10, 11, 16, 17]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 89 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/32 places, 14/16 transitions.
Graph (complete) has 14 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.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 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 13 transition count 2
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 21 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 2 transition count 1
Applied a total of 23 rules in 5 ms. Remains 2 /15 variables (removed 13) and now considering 1/14 (removed 13) transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-14 14:32:04] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-14 14:32:04] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-14 14:32:04] [INFO ] Invariant cache hit.
[2023-03-14 14:32:04] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/32 places, 1/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 153 ms. Remains : 2/32 places, 1/16 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1960 reset in 70 ms.
Product exploration explored 100000 steps with 1960 reset in 81 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 1
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 p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 222 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2023-03-14 14:32:05] [INFO ] Invariant cache hit.
[2023-03-14 14:32:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-14 14:32:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:32:05] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-14 14:32:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-14 14:32:05] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-14 14:32:05] [INFO ] Invariant cache hit.
[2023-03-14 14:32:05] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-14 14:32:05] [INFO ] Invariant cache hit.
[2023-03-14 14:32:05] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-14 14:32:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 14:32:05] [INFO ] Invariant cache hit.
[2023-03-14 14:32:05] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 2/2 places, 1/1 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 1
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 p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 223 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
[2023-03-14 14:32:05] [INFO ] Invariant cache hit.
[2023-03-14 14:32:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-14 14:32:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:32:05] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-14 14:32:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-14 14:32:05] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1960 reset in 72 ms.
Product exploration explored 100000 steps with 1960 reset in 95 ms.
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-14 14:32:06] [INFO ] Invariant cache hit.
[2023-03-14 14:32:06] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-14 14:32:06] [INFO ] Invariant cache hit.
[2023-03-14 14:32:06] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-14 14:32:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 14:32:06] [INFO ] Invariant cache hit.
[2023-03-14 14:32:06] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 2/2 places, 1/1 transitions.
Treatment of property PermAdmissibility-COL-50-LTLCardinality-12 finished in 2222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((!p0&&G(F(p1))))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
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 26 transition count 16
Applied a total of 6 rules in 1 ms. Remains 26 /32 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2023-03-14 14:32:06] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-14 14:32:06] [INFO ] Implicit Places using invariants in 63 ms returned [4, 9, 10, 12, 13, 18, 19, 20]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 64 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 18/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 391 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (NOT p1), p0]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=p0, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s17 s8), p0:(GT 3 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][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 4232 steps with 18 reset in 8 ms.
FORMULA PermAdmissibility-COL-50-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLCardinality-13 finished in 493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F((!p0&&(p1 U X(p2)))))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
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 26 transition count 16
Applied a total of 6 rules in 1 ms. Remains 26 /32 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2023-03-14 14:32:06] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-14 14:32:06] [INFO ] Implicit Places using invariants in 77 ms returned [4, 9, 11, 12, 18, 19, 20]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 79 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/32 places, 16/16 transitions.
Applied a total of 0 rules in 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 82 ms. Remains : 19/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p2) p0), (NOT p2), (NOT p2), true, true, true]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(LEQ 3 s18), p1:(LEQ 2 s15), p2:(LEQ s8 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-50-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLCardinality-14 finished in 429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 61 edges and 32 vertex of which 26 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 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 22 transition count 14
Applied a total of 6 rules in 6 ms. Remains 22 /32 variables (removed 10) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 22 cols
[2023-03-14 14:32:07] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-14 14:32:07] [INFO ] Implicit Places using invariants in 83 ms returned [2, 7, 8, 9, 10, 11, 16, 17]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 84 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/32 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 13 transition count 3
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 2 transition count 2
Applied a total of 22 rules in 3 ms. Remains 2 /14 variables (removed 12) and now considering 2/14 (removed 12) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-14 14:32:07] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-14 14:32:07] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-14 14:32:07] [INFO ] Invariant cache hit.
[2023-03-14 14:32:07] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/32 places, 2/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 137 ms. Remains : 2/32 places, 2/16 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-15 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:(GT 2 s1)], 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 3923 reset in 82 ms.
Product exploration explored 100000 steps with 3881 reset in 101 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 172 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-50-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-50-LTLCardinality-15 finished in 643 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)))'
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((G(p0)||(p1&&X(p0))))))'
Found a Shortening insensitive property : PermAdmissibility-COL-50-LTLCardinality-02
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 61 edges and 32 vertex of which 22 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 2 ms. Remains 21 /32 variables (removed 11) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 21 cols
[2023-03-14 14:32:08] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-14 14:32:08] [INFO ] Implicit Places using invariants in 68 ms returned [4, 10, 11, 12, 13, 18]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 69 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 15/32 places, 14/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 15 transition count 12
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 13 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 11 transition count 10
Applied a total of 8 rules in 2 ms. Remains 11 /15 variables (removed 4) and now considering 10/14 (removed 4) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-14 14:32:08] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-14 14:32:08] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-14 14:32:08] [INFO ] Invariant cache hit.
[2023-03-14 14:32:08] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 11/32 places, 10/16 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 137 ms. Remains : 11/32 places, 10/16 transitions.
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s6 s8), p0:(OR (GT s1 s10) (GT s0 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5678 reset in 180 ms.
Product exploration explored 100000 steps with 5634 reset in 214 ms.
Computed a total of 11 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 717 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Incomplete random walk after 10015 steps, including 19 resets, run finished after 6 ms. (steps per millisecond=1669 ) properties (out of 4) seen :3
Finished Best-First random walk after 74 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=74 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND p1 p0)), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 11 factoid took 739 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), false]
[2023-03-14 14:32:10] [INFO ] Invariant cache hit.
[2023-03-14 14:32:10] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 14:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:32:10] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-14 14:32:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:32:11] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 14:32:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:32:11] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-14 14:32:11] [INFO ] Computed and/alt/rep : 9/9/9 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 14:32:11] [INFO ] Added : 8 causal constraints over 2 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-14 14:32:11] [INFO ] Invariant cache hit.
[2023-03-14 14:32:11] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-14 14:32:11] [INFO ] Invariant cache hit.
[2023-03-14 14:32:11] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-14 14:32:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 14:32:11] [INFO ] Invariant cache hit.
[2023-03-14 14:32:11] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 11/11 places, 10/10 transitions.
Computed a total of 11 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 624 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Finished random walk after 7210 steps, including 14 resets, run visited all 4 properties in 4 ms. (steps per millisecond=1802 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND p1 p0)), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 11 factoid took 783 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (NOT p0), false]
[2023-03-14 14:32:13] [INFO ] Invariant cache hit.
[2023-03-14 14:32:13] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 14:32:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:32:13] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-14 14:32:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:32:13] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-14 14:32:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:32:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-14 14:32:13] [INFO ] Computed and/alt/rep : 9/9/9 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-14 14:32:13] [INFO ] Added : 8 causal constraints over 2 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Product exploration explored 100000 steps with 5689 reset in 171 ms.
Product exploration explored 100000 steps with 5692 reset in 184 ms.
Support contains 6 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-14 14:32:14] [INFO ] Invariant cache hit.
[2023-03-14 14:32:14] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-14 14:32:14] [INFO ] Invariant cache hit.
[2023-03-14 14:32:14] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-14 14:32:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 14:32:14] [INFO ] Invariant cache hit.
[2023-03-14 14:32:14] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 11/11 places, 10/10 transitions.
Treatment of property PermAdmissibility-COL-50-LTLCardinality-02 finished in 6167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(p1))||G(p2))))'
Found a Shortening insensitive property : PermAdmissibility-COL-50-LTLCardinality-04
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 61 edges and 32 vertex of which 26 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output 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 24 transition count 15
Applied a total of 3 rules in 5 ms. Remains 24 /32 variables (removed 8) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 24 cols
[2023-03-14 14:32:14] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-14 14:32:14] [INFO ] Implicit Places using invariants in 72 ms returned [3, 8, 9, 10, 12, 18, 19]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 73 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 17/32 places, 15/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 16 transition count 10
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 12 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 12 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 10 transition count 8
Applied a total of 12 rules in 5 ms. Remains 10 /17 variables (removed 7) and now considering 8/15 (removed 7) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-14 14:32:14] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-14 14:32:14] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-14 14:32:14] [INFO ] Invariant cache hit.
[2023-03-14 14:32:14] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 10/32 places, 8/16 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 156 ms. Remains : 10/32 places, 8/16 transitions.
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s7), p2:(GT 2 s5), p1:(LEQ 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3932 reset in 167 ms.
Product exploration explored 100000 steps with 3941 reset in 184 ms.
Computed a total of 10 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 445 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F (NOT (AND p2 (NOT p1) (NOT p0)))), (F (AND (NOT p2) (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 518 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-14 14:32:16] [INFO ] Invariant cache hit.
[2023-03-14 14:32:16] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-14 14:32:16] [INFO ] Invariant cache hit.
[2023-03-14 14:32:16] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-14 14:32:16] [INFO ] Invariant cache hit.
[2023-03-14 14:32:16] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 10/10 places, 8/8 transitions.
Computed a total of 10 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 383 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p0) p2))), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 4 factoid took 438 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 3925 reset in 183 ms.
Product exploration explored 100000 steps with 3932 reset in 205 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-14 14:32:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 14:32:18] [INFO ] Invariant cache hit.
[2023-03-14 14:32:18] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46 ms. Remains : 10/10 places, 8/8 transitions.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-14 14:32:18] [INFO ] Invariant cache hit.
[2023-03-14 14:32:19] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-14 14:32:19] [INFO ] Invariant cache hit.
[2023-03-14 14:32:19] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-14 14:32:19] [INFO ] Invariant cache hit.
[2023-03-14 14:32:19] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 10/10 places, 8/8 transitions.
Treatment of property PermAdmissibility-COL-50-LTLCardinality-04 finished in 4947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-14 14:32:19] [INFO ] Flatten gal took : 7 ms
[2023-03-14 14:32:19] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-14 14:32:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 16 transitions and 64 arcs took 1 ms.
Total runtime 39613 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PermAdmissibility-COL-50
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/367
LTLCardinality

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

FORMULA PermAdmissibility-COL-50-LTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

BK_STOP 1678804366743

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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/367/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/367/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/367/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
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: LAUNCH task # 1 (type EXCL) for 0 PermAdmissibility-COL-50-LTLCardinality-00
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for PermAdmissibility-COL-50-LTLCardinality-00
lola: result : true
lola: markings : 183638
lola: fired transitions : 526218
lola: time used : 1.000000
lola: memory pages used : 2
lola: LAUNCH task # 7 (type EXCL) for 6 PermAdmissibility-COL-50-LTLCardinality-04
lola: time limit : 1199 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PermAdmissibility-COL-50-LTLCardinality-00: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PermAdmissibility-COL-50-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
PermAdmissibility-COL-50-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
PermAdmissibility-COL-50-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 4/1199 7/32 PermAdmissibility-COL-50-LTLCardinality-04 1073647 m, 214729 m/sec, 5562579 t fired, .

Time elapsed: 5 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PermAdmissibility-COL-50-LTLCardinality-00: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PermAdmissibility-COL-50-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
PermAdmissibility-COL-50-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
PermAdmissibility-COL-50-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 9/1199 15/32 PermAdmissibility-COL-50-LTLCardinality-04 2314103 m, 248091 m/sec, 12092939 t fired, .

Time elapsed: 10 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PermAdmissibility-COL-50-LTLCardinality-00: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PermAdmissibility-COL-50-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
PermAdmissibility-COL-50-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
PermAdmissibility-COL-50-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 14/1199 23/32 PermAdmissibility-COL-50-LTLCardinality-04 3551228 m, 247425 m/sec, 18673559 t fired, .

Time elapsed: 15 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PermAdmissibility-COL-50-LTLCardinality-00: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PermAdmissibility-COL-50-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
PermAdmissibility-COL-50-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
PermAdmissibility-COL-50-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 19/1199 31/32 PermAdmissibility-COL-50-LTLCardinality-04 4773186 m, 244391 m/sec, 25239074 t fired, .

Time elapsed: 20 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 7 (type EXCL) for PermAdmissibility-COL-50-LTLCardinality-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PermAdmissibility-COL-50-LTLCardinality-00: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PermAdmissibility-COL-50-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
PermAdmissibility-COL-50-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
PermAdmissibility-COL-50-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 4 (type EXCL) for 3 PermAdmissibility-COL-50-LTLCardinality-02
lola: time limit : 1787 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for PermAdmissibility-COL-50-LTLCardinality-02
lola: result : false
lola: markings : 801
lola: fired transitions : 801
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 PermAdmissibility-COL-50-LTLCardinality-12
lola: time limit : 3575 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for PermAdmissibility-COL-50-LTLCardinality-12
lola: result : true
lola: markings : 183634
lola: fired transitions : 700765
lola: time used : 1.000000
lola: memory pages used : 2
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PermAdmissibility-COL-50-LTLCardinality-00: LTL true LTL model checker
PermAdmissibility-COL-50-LTLCardinality-02: LTL false LTL model checker
PermAdmissibility-COL-50-LTLCardinality-04: LTL unknown AGGR
PermAdmissibility-COL-50-LTLCardinality-12: LTL true LTL model checker


Time elapsed: 26 secs. Pages in use: 32

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

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