Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r512-smll-171654407000140.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PermAdmissibility-COL-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407000140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 9.5K Apr 12 09:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 09:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 12 09:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 12 09:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 09:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 09:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 09:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 09:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 54K May 18 16:43 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-20-LTLFireability-00
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-01
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-02
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-03
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-04
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-05
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-06
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-07
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-08
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-09
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-10
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-11
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-12
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-13
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-14
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717251974392

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:26:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:26:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:26:16] [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.
[2024-06-01 14:26:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 14:26:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 958 ms
[2024-06-01 14:26:17] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 14:26:17] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 6 ms.
[2024-06-01 14:26:17] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PermAdmissibility-COL-20-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-20-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-20-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-20-LTLFireability-12 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 12 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).
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40016 steps (116 resets) in 424 ms. (94 steps per ms) remains 1/16 properties
BEST_FIRST walk for 1019 steps (0 resets) in 17 ms. (56 steps per ms) remains 0/1 properties
[2024-06-01 14:26:17] [INFO ] Flatten gal took : 30 ms
[2024-06-01 14:26:17] [INFO ] Flatten gal took : 9 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
[2024-06-01 14:26:17] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 45 ms.
[2024-06-01 14:26:17] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 28 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 16
Applied a total of 8 rules in 22 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 32 cols
[2024-06-01 14:26:18] [INFO ] Computed 16 invariants in 11 ms
[2024-06-01 14:26:18] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-06-01 14:26:18] [INFO ] Invariant cache hit.
[2024-06-01 14:26:18] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2024-06-01 14:26:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/48 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 48 constraints, problems are : Problem set: 0 solved, 15 unsolved in 397 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/48 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 15/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/48 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 63 constraints, problems are : Problem set: 0 solved, 15 unsolved in 365 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 811ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 823ms
Starting structural reductions in LTL mode, iteration 1 : 32/40 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1204 ms. Remains : 32/40 places, 16/16 transitions.
Support contains 28 out of 32 places after structural reductions.
[2024-06-01 14:26:19] [INFO ] Flatten gal took : 6 ms
[2024-06-01 14:26:19] [INFO ] Flatten gal took : 6 ms
[2024-06-01 14:26:19] [INFO ] Input system was already deterministic with 16 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40016 steps (116 resets) in 121 ms. (328 steps per ms) remains 1/16 properties
BEST_FIRST walk for 1362 steps (0 resets) in 7 ms. (170 steps per ms) remains 0/1 properties
FORMULA PermAdmissibility-COL-20-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 28 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 20 ms. Remains 26 /32 variables (removed 6) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 26 cols
[2024-06-01 14:26:19] [INFO ] Computed 12 invariants in 6 ms
[2024-06-01 14:26:19] [INFO ] Implicit Places using invariants in 81 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18]
[2024-06-01 14:26:19] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 16]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 84 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/32 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 19 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 18 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 18 transition count 11
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 4 place count 17 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 16 transition count 10
Applied a total of 5 rules in 9 ms. Remains 16 /20 variables (removed 4) and now considering 10/14 (removed 4) transitions.
// Phase 1: matrix 10 rows 16 cols
[2024-06-01 14:26:19] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 14:26:19] [INFO ] Implicit Places using invariants in 41 ms returned [4, 5, 7, 8]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 42 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/32 places, 10/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 9 transition count 5
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 8 place count 7 transition count 5
Applied a total of 8 rules in 3 ms. Remains 7 /12 variables (removed 5) and now considering 5/10 (removed 5) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-06-01 14:26:19] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 14:26:19] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 14:26:19] [INFO ] Invariant cache hit.
[2024-06-01 14:26:19] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 7/32 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 218 ms. Remains : 7/32 places, 5/16 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-00
Product exploration explored 100000 steps with 990 reset in 429 ms.
Product exploration explored 100000 steps with 990 reset in 225 ms.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-20-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-20-LTLFireability-00 finished in 1210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 9 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 81 edges and 32 vertex of which 28 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 4 ms. Remains 26 /32 variables (removed 6) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 26 cols
[2024-06-01 14:26:20] [INFO ] Computed 12 invariants in 1 ms
[2024-06-01 14:26:20] [INFO ] Implicit Places using invariants in 51 ms returned [4, 5, 6, 7, 12, 13]
[2024-06-01 14:26:20] [INFO ] Actually due to overlaps returned [4, 5, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 54 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 14/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60 ms. Remains : 22/32 places, 14/16 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-01
Stuttering criterion allowed to conclude after 280 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-LTLFireability-01 finished in 217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 12 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2024-06-01 14:26:20] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 14:26:21] [INFO ] Implicit Places using invariants in 73 ms returned [4, 6, 12, 13, 14, 15, 16, 18, 22, 23, 25, 26]
[2024-06-01 14:26:21] [INFO ] Actually due to overlaps returned [4, 12, 13, 14, 16, 22, 23]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 74 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 23/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-02
Product exploration explored 100000 steps with 2214 reset in 263 ms.
Product exploration explored 100000 steps with 2231 reset in 225 ms.
Computed a total of 23 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 265 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 844 steps (0 resets) in 8 ms. (93 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 11 factoid took 252 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 16 rows 23 cols
[2024-06-01 14:26:22] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 14:26:22] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 14:26:22] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 14:26:22] [INFO ] Computed and/alt/rep : 15/29/15 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 14:26:22] [INFO ] Added : 15 causal constraints over 3 iterations in 29 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 23 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 16/16 transitions.
Graph (complete) has 41 edges and 23 vertex of which 17 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 16 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 15 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 15 transition count 9
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 5 place count 14 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 13 transition count 8
Applied a total of 6 rules in 6 ms. Remains 13 /23 variables (removed 10) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 13 cols
[2024-06-01 14:26:22] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 14:26:22] [INFO ] Implicit Places using invariants in 40 ms returned [5, 8, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/23 places, 8/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 9 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 2 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-06-01 14:26:22] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 14:26:22] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 14:26:22] [INFO ] Invariant cache hit.
[2024-06-01 14:26:22] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/23 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 99 ms. Remains : 7/23 places, 5/16 transitions.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 102 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 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 256 steps (0 resets) in 4 ms. (51 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 111 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:26:23] [INFO ] Invariant cache hit.
[2024-06-01 14:26:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 14:26:23] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 14:26:23] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 14:26:23] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10209 reset in 67 ms.
Product exploration explored 100000 steps with 10173 reset in 83 ms.
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 6 transition count 4
Applied a total of 2 rules in 1 ms. Remains 6 /7 variables (removed 1) and now considering 4/5 (removed 1) transitions.
// Phase 1: matrix 4 rows 6 cols
[2024-06-01 14:26:23] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 14:26:23] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 14:26:23] [INFO ] Invariant cache hit.
[2024-06-01 14:26:23] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-06-01 14:26:23] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 14:26:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/10 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 3 unsolved in 55 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/10 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 11 constraints, problems are : Problem set: 0 solved, 3 unsolved in 49 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/7 places, 4/5 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 6/7 places, 4/5 transitions.
Treatment of property PermAdmissibility-COL-20-LTLFireability-02 finished in 2615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(p1)))||F(p2)))'
Support contains 9 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
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2024-06-01 14:26:23] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 14:26:23] [INFO ] Implicit Places using invariants in 70 ms returned [5, 7, 12, 15, 16, 23, 24, 26, 27]
[2024-06-01 14:26:23] [INFO ] Actually due to overlaps returned [5, 12, 15, 23, 24]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 71 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 26/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-04
Product exploration explored 100000 steps with 15081 reset in 107 ms.
Product exploration explored 100000 steps with 15042 reset in 99 ms.
Computed a total of 26 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 182 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 172 steps (0 resets) in 5 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 20 factoid took 224 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 16 rows 26 cols
[2024-06-01 14:26:24] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 14:26:24] [INFO ] [Real]Absence check using 0 positive and 10 generalized place invariants in 3 ms returned sat
[2024-06-01 14:26:24] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 14:26:24] [INFO ] Computed and/alt/rep : 15/31/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 14:26:24] [INFO ] Added : 15 causal constraints over 3 iterations in 24 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 26 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-06-01 14:26:24] [INFO ] Invariant cache hit.
[2024-06-01 14:26:24] [INFO ] Implicit Places using invariants in 53 ms returned [6, 13, 21, 22]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 55 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 22/26 places, 16/16 transitions.
Computed a total of 22 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 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 : [(NOT p2), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 172 steps (0 resets) in 4 ms. (34 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 16 rows 22 cols
[2024-06-01 14:26:25] [INFO ] Computed 6 invariants in 18 ms
[2024-06-01 14:26:25] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-01 14:26:25] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 14:26:25] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 14:26:25] [INFO ] Added : 15 causal constraints over 3 iterations in 21 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 110 ms :[(NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 15151 reset in 67 ms.
Product exploration explored 100000 steps with 15126 reset in 91 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), (NOT p2), (NOT p2)]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Graph (complete) has 35 edges and 22 vertex of which 6 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 6 transition count 4
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 5 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 5 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 5 rules in 4 ms. Remains 5 /22 variables (removed 17) and now considering 3/16 (removed 13) transitions.
[2024-06-01 14:26:26] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
// Phase 1: matrix 3 rows 5 cols
[2024-06-01 14:26:26] [INFO ] Computed 2 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem TDEAD1 is UNSAT
At refinement iteration 3 (OVERLAPS) 3/8 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 7 constraints, problems are : Problem set: 1 solved, 1 unsolved in 34 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/8 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 35 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 1 solved, 1 unsolved
Search for dead transitions found 1 dead transitions in 73ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 5/22 places, 2/16 transitions.
Graph (complete) has 3 edges and 5 vertex of which 4 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 4 /5 variables (removed 1) and now considering 2/2 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/22 places, 2/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 4/22 places, 2/16 transitions.
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2024-06-01 14:26:26] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 14:26:26] [INFO ] Implicit Places using invariants in 38 ms returned [4, 5, 12, 14]
[2024-06-01 14:26:26] [INFO ] Actually due to overlaps returned [4, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 20/22 places, 16/16 transitions.
Treatment of property PermAdmissibility-COL-20-LTLFireability-04 finished in 2802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 4 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.0 ms
Discarding 28 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 transitions
Applied a total of 1 rules in 1 ms. Remains 4 /32 variables (removed 28) and now considering 2/16 (removed 14) transitions.
// Phase 1: matrix 2 rows 4 cols
[2024-06-01 14:26:26] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 14:26:26] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 14:26:26] [INFO ] Invariant cache hit.
[2024-06-01 14:26:26] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-06-01 14:26:26] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 14:26:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/6 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/6 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/6 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 59ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/32 places, 2/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111 ms. Remains : 4/32 places, 2/16 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-05
Stuttering criterion allowed to conclude after 204 steps with 24 reset in 0 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-LTLFireability-05 finished in 194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(p1&&X(F(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 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2024-06-01 14:26:26] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 14:26:26] [INFO ] Implicit Places using invariants in 72 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 23, 25]
[2024-06-01 14:26:26] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 23]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 73 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 24/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 60 ms.
Product exploration explored 100000 steps with 50000 reset in 57 ms.
Computed a total of 24 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p1), (X (OR (NOT p0) p1)), (X p0), (X (X p1)), (X (X (OR (NOT p0) p1))), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-20-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-20-LTLFireability-09 finished in 401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
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 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
[2024-06-01 14:26:26] [INFO ] Invariant cache hit.
[2024-06-01 14:26:27] [INFO ] Implicit Places using invariants in 57 ms returned [4, 6, 12, 13, 14, 15, 16, 18, 22, 23, 25, 26]
[2024-06-01 14:26:27] [INFO ] Actually due to overlaps returned [4, 12, 13, 14, 16, 22, 23]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 58 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 23/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, p0, p0]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-10
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-LTLFireability-10 finished in 152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U p1)||F(p2)))'
Support contains 6 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 81 edges and 32 vertex of which 20 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 2 ms. Remains 18 /32 variables (removed 14) and now considering 10/16 (removed 6) transitions.
// Phase 1: matrix 10 rows 18 cols
[2024-06-01 14:26:27] [INFO ] Computed 8 invariants in 0 ms
[2024-06-01 14:26:27] [INFO ] Implicit Places using invariants in 41 ms returned [8, 9, 12, 14]
[2024-06-01 14:26:27] [INFO ] Actually due to overlaps returned [8, 9, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/32 places, 10/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 14 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 8
Applied a total of 2 rules in 2 ms. Remains 13 /15 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 13 cols
[2024-06-01 14:26:27] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 14:26:27] [INFO ] Implicit Places using invariants in 26 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/32 places, 8/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 12 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 7
Applied a total of 2 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 11 cols
[2024-06-01 14:26:27] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 14:26:27] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 14:26:27] [INFO ] Invariant cache hit.
[2024-06-01 14:26:27] [INFO ] Implicit Places using invariants and state equation in 28 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 3 : 11/32 places, 7/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 125 ms. Remains : 11/32 places, 7/16 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-11
Product exploration explored 100000 steps with 7482 reset in 140 ms.
Product exploration explored 100000 steps with 7400 reset in 197 ms.
Computed a total of 11 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 602 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 340 steps (0 resets) in 4 ms. (68 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 14 factoid took 635 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 71 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p2), (NOT p2)]
[2024-06-01 14:26:29] [INFO ] Invariant cache hit.
[2024-06-01 14:26:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 14:26:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 14:26:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:26:29] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 14:26:29] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 14:26:29] [INFO ] Computed and/alt/rep : 6/14/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 14:26:29] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 11 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-06-01 14:26:29] [INFO ] Invariant cache hit.
[2024-06-01 14:26:29] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 14:26:29] [INFO ] Invariant cache hit.
[2024-06-01 14:26:29] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-06-01 14:26:29] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 14:26:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/17 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/18 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 85 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/17 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/18 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 21 constraints, problems are : Problem set: 0 solved, 6 unsolved in 85 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 174ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 174ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 227 ms. Remains : 11/11 places, 7/7 transitions.
Computed a total of 11 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 7
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 p2), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 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 67 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 340 steps (0 resets) in 5 ms. (56 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 108 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 69 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
[2024-06-01 14:26:29] [INFO ] Invariant cache hit.
[2024-06-01 14:26:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 14:26:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 14:26:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:26:29] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 14:26:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 14:26:29] [INFO ] Computed and/alt/rep : 6/14/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 14:26:30] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 86 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 7373 reset in 91 ms.
Product exploration explored 100000 steps with 7411 reset in 146 ms.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 7/7 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 5
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 5
Applied a total of 2 rules in 15 ms. Remains 8 /11 variables (removed 3) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 8 cols
[2024-06-01 14:26:30] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 14:26:30] [INFO ] Implicit Places using invariants in 38 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/11 places, 5/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63 ms. Remains : 7/11 places, 5/7 transitions.
Treatment of property PermAdmissibility-COL-20-LTLFireability-11 finished in 3279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&G(p1))))'
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
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2024-06-01 14:26:30] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 14:26:30] [INFO ] Implicit Places using invariants in 61 ms returned [4, 5, 6, 7, 12, 15, 16, 17, 19, 24, 26]
[2024-06-01 14:26:30] [INFO ] Actually due to overlaps returned [4, 5, 12, 15, 17, 24]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 62 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 25/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-LTLFireability-13 finished in 213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(!p1)&&p0))&&F(!p2)))'
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 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2024-06-01 14:26:30] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 14:26:30] [INFO ] Implicit Places using invariants in 62 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 23, 25]
[2024-06-01 14:26:30] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 23]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 65 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 24/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-14
Product exploration explored 100000 steps with 2277 reset in 270 ms.
Product exploration explored 100000 steps with 2353 reset in 354 ms.
Computed a total of 24 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 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 p1), (X p2), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X p1), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X p1)), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 547 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40021 steps (116 resets) in 43 ms. (909 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (15 resets) in 259 ms. (153 steps per ms) remains 1/1 properties
// Phase 1: matrix 16 rows 24 cols
[2024-06-01 14:26:32] [INFO ] Computed 8 invariants in 1 ms
Problem apf3 is UNSAT
After SMT solving in domain Real declared 3/40 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 21ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X p1), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X p1)), (F (G (NOT p0))), (F (G p2)), (F (G p1)), (G (OR (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 15 factoid took 271 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
[2024-06-01 14:26:32] [INFO ] Invariant cache hit.
[2024-06-01 14:26:32] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 14:26:32] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 14:26:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:26:33] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 14:26:33] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 14:26:33] [INFO ] Computed and/alt/rep : 15/31/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 14:26:33] [INFO ] Added : 15 causal constraints over 3 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 14:26:33] [INFO ] Invariant cache hit.
[2024-06-01 14:26:33] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 14:26:33] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 14:26:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:26:33] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 14:26:33] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 14:26:33] [INFO ] Computed and/alt/rep : 15/31/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 14:26:33] [INFO ] Added : 15 causal constraints over 3 iterations in 20 ms. Result :sat
Could not prove EG p1
[2024-06-01 14:26:33] [INFO ] Invariant cache hit.
[2024-06-01 14:26:33] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 14:26:33] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 14:26:33] [INFO ] Computed and/alt/rep : 15/31/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 14:26:33] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG p2
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-06-01 14:26:33] [INFO ] Invariant cache hit.
[2024-06-01 14:26:33] [INFO ] Implicit Places using invariants in 36 ms returned [4, 5, 10, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 46 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 20/24 places, 16/16 transitions.
Computed a total of 20 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT p0)), (X (X p2)), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 169 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 1096 steps (0 resets) in 4 ms. (219 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT p0)), (X (X p2)), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F p0)]
Knowledge based reduction with 9 factoid took 301 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
// Phase 1: matrix 16 rows 20 cols
[2024-06-01 14:26:34] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:26:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 14:26:34] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 14:26:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:26:34] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 14:26:34] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 14:26:34] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 14:26:34] [INFO ] Added : 15 causal constraints over 3 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 14:26:34] [INFO ] Invariant cache hit.
[2024-06-01 14:26:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 14:26:34] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 14:26:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:26:34] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 14:26:34] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 14:26:34] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 14:26:34] [INFO ] Added : 15 causal constraints over 3 iterations in 18 ms. Result :sat
Could not prove EG p1
[2024-06-01 14:26:34] [INFO ] Invariant cache hit.
[2024-06-01 14:26:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 14:26:34] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 14:26:34] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 14:26:34] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
Product exploration explored 100000 steps with 2401 reset in 100 ms.
Product exploration explored 100000 steps with 2353 reset in 117 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 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 3 place count 20 transition count 16
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 20 transition count 16
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 18 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 18 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 5 ms. Remains 18 /20 variables (removed 2) and now considering 14/16 (removed 2) transitions.
[2024-06-01 14:26:35] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 18 cols
[2024-06-01 14:26:35] [INFO ] Computed 4 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD8 is UNSAT
At refinement iteration 2 (OVERLAPS) 14/31 variables, 17/21 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/21 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/32 variables, 1/22 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/22 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/32 variables, 0/22 constraints. Problems are: Problem set: 5 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 22 constraints, problems are : Problem set: 5 solved, 8 unsolved in 181 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 14/30 variables, 16/20 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 8/28 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/28 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/32 variables, 2/30 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/30 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/32 variables, 0/30 constraints. Problems are: Problem set: 5 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 30 constraints, problems are : Problem set: 5 solved, 8 unsolved in 137 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 8/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 323ms problems are : Problem set: 5 solved, 8 unsolved
Search for dead transitions found 5 dead transitions in 323ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 18/20 places, 9/16 transitions.
Graph (complete) has 18 edges and 18 vertex of which 13 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 13 /18 variables (removed 5) and now considering 9/9 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/20 places, 9/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 334 ms. Remains : 13/20 places, 9/16 transitions.
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 20 cols
[2024-06-01 14:26:35] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 14:26:35] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 14:26:35] [INFO ] Invariant cache hit.
[2024-06-01 14:26:35] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2024-06-01 14:26:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 16/35 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1/36 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 24 constraints, problems are : Problem set: 0 solved, 15 unsolved in 208 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 16/35 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/36 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/36 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 39 constraints, problems are : Problem set: 0 solved, 15 unsolved in 244 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 457ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 458ms
Finished structural reductions in LTL mode , in 1 iterations and 512 ms. Remains : 20/20 places, 16/16 transitions.
Treatment of property PermAdmissibility-COL-20-LTLFireability-14 finished in 5395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 1 ms. Remains 10 /32 variables (removed 22) and now considering 6/16 (removed 10) transitions.
// Phase 1: matrix 6 rows 10 cols
[2024-06-01 14:26:36] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 14:26:36] [INFO ] Implicit Places using invariants in 26 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/32 places, 6/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 8 transition count 5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 1 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-06-01 14:26:36] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 14:26:36] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 14:26:36] [INFO ] Invariant cache hit.
[2024-06-01 14:26:36] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/32 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 72 ms. Remains : 7/32 places, 5/16 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-15
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-LTLFireability-15 finished in 121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Found a Shortening insensitive property : PermAdmissibility-COL-20-LTLFireability-02
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 24 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 5 ms. Remains 22 /32 variables (removed 10) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 22 cols
[2024-06-01 14:26:36] [INFO ] Computed 10 invariants in 3 ms
[2024-06-01 14:26:36] [INFO ] Implicit Places using invariants in 50 ms returned [4, 6, 12, 13, 14, 15, 16, 18]
[2024-06-01 14:26:36] [INFO ] Actually due to overlaps returned [4, 12, 13, 14, 16]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 53 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 17/32 places, 12/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 15 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 15 transition count 9
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 4 place count 14 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 13 transition count 8
Applied a total of 5 rules in 4 ms. Remains 13 /17 variables (removed 4) and now considering 8/12 (removed 4) transitions.
// Phase 1: matrix 8 rows 13 cols
[2024-06-01 14:26:36] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 14:26:36] [INFO ] Implicit Places using invariants in 32 ms returned [5, 8, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 34 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 10/32 places, 8/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 9 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 2 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-06-01 14:26:36] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 14:26:36] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 14:26:36] [INFO ] Invariant cache hit.
[2024-06-01 14:26:36] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 7/32 places, 5/16 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 139 ms. Remains : 7/32 places, 5/16 transitions.
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-02
Product exploration explored 100000 steps with 10162 reset in 65 ms.
Product exploration explored 100000 steps with 10293 reset in 77 ms.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 238 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 256 steps (0 resets) in 4 ms. (51 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 11 factoid took 242 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:26:37] [INFO ] Invariant cache hit.
[2024-06-01 14:26:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 14:26:37] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 14:26:37] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 14:26:37] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 7 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 14:26:37] [INFO ] Invariant cache hit.
[2024-06-01 14:26:37] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 14:26:37] [INFO ] Invariant cache hit.
[2024-06-01 14:26:37] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-06-01 14:26:37] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 14:26:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/12 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 61 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/12 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 60 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 126ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 191 ms. Remains : 7/7 places, 5/5 transitions.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 114 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 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 256 steps (0 resets) in 4 ms. (51 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 108 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:26:38] [INFO ] Invariant cache hit.
[2024-06-01 14:26:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 14:26:38] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 14:26:38] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 14:26:38] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10264 reset in 72 ms.
Product exploration explored 100000 steps with 10299 reset in 75 ms.
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 6 transition count 4
Applied a total of 2 rules in 1 ms. Remains 6 /7 variables (removed 1) and now considering 4/5 (removed 1) transitions.
// Phase 1: matrix 4 rows 6 cols
[2024-06-01 14:26:38] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 14:26:38] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 14:26:38] [INFO ] Invariant cache hit.
[2024-06-01 14:26:38] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-06-01 14:26:38] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 14:26:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/10 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 3 unsolved in 53 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/10 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 11 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 102ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/7 places, 4/5 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 6/7 places, 4/5 transitions.
Treatment of property PermAdmissibility-COL-20-LTLFireability-02 finished in 2387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(p1)))||F(p2)))'
Found a Lengthening insensitive property : PermAdmissibility-COL-20-LTLFireability-04
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 9 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 81 edges and 32 vertex of which 20 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 2 ms. Remains 19 /32 variables (removed 13) and now considering 10/16 (removed 6) transitions.
// Phase 1: matrix 10 rows 19 cols
[2024-06-01 14:26:38] [INFO ] Computed 9 invariants in 0 ms
[2024-06-01 14:26:38] [INFO ] Implicit Places using invariants in 35 ms returned [8, 11, 12]
[2024-06-01 14:26:38] [INFO ] Actually due to overlaps returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 17/32 places, 10/16 transitions.
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 2 place count 16 transition count 9
Applied a total of 2 rules in 1 ms. Remains 16 /17 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 16 cols
[2024-06-01 14:26:38] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 14:26:38] [INFO ] Implicit Places using invariants in 28 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 15/32 places, 9/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 72 ms. Remains : 15/32 places, 9/16 transitions.
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-04
Product exploration explored 100000 steps with 24921 reset in 78 ms.
Product exploration explored 100000 steps with 24995 reset in 90 ms.
Computed a total of 15 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 15 transition count 9
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 17 factoid took 356 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 88 steps (0 resets) in 4 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F p2)]
Knowledge based reduction with 17 factoid took 390 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 9 rows 15 cols
[2024-06-01 14:26:40] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 14:26:40] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-01 14:26:40] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 14:26:40] [INFO ] Computed and/alt/rep : 8/16/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 14:26:40] [INFO ] Added : 8 causal constraints over 2 iterations in 9 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 15 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-06-01 14:26:40] [INFO ] Invariant cache hit.
[2024-06-01 14:26:40] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 14:26:40] [INFO ] Invariant cache hit.
[2024-06-01 14:26:40] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Running 8 sub problems to find dead transitions.
[2024-06-01 14:26:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 9/24 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 21 constraints, problems are : Problem set: 0 solved, 8 unsolved in 125 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 9/24 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 29 constraints, problems are : Problem set: 0 solved, 8 unsolved in 127 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 257ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 258ms
Finished structural reductions in LTL mode , in 1 iterations and 316 ms. Remains : 15/15 places, 9/9 transitions.
Computed a total of 15 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 15 transition count 9
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 p2), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 88 steps (0 resets) in 4 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p2), (NOT p2), (NOT p2)]
[2024-06-01 14:26:41] [INFO ] Invariant cache hit.
[2024-06-01 14:26:41] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-01 14:26:41] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 14:26:41] [INFO ] Computed and/alt/rep : 8/16/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 14:26:41] [INFO ] Added : 8 causal constraints over 2 iterations in 11 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 100 ms :[(NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 25025 reset in 58 ms.
Product exploration explored 100000 steps with 25028 reset in 68 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 99 ms :[(NOT p2), (NOT p2), (NOT p2)]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 9/9 transitions.
Graph (complete) has 26 edges and 15 vertex of which 5 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 5 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 6 ms. Remains 5 /15 variables (removed 10) and now considering 3/9 (removed 6) transitions.
[2024-06-01 14:26:41] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
// Phase 1: matrix 3 rows 5 cols
[2024-06-01 14:26:41] [INFO ] Computed 2 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem TDEAD0 is UNSAT
At refinement iteration 3 (OVERLAPS) 3/8 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 7 constraints, problems are : Problem set: 1 solved, 1 unsolved in 37 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/8 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 26 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 67ms problems are : Problem set: 1 solved, 1 unsolved
Search for dead transitions found 1 dead transitions in 68ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 5/15 places, 2/9 transitions.
Graph (complete) has 3 edges and 5 vertex of which 4 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 0 ms. Remains 4 /5 variables (removed 1) and now considering 2/2 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/15 places, 2/9 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 80 ms. Remains : 4/15 places, 2/9 transitions.
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 15 cols
[2024-06-01 14:26:41] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 14:26:41] [INFO ] Implicit Places using invariants in 35 ms returned [2, 3, 9, 11]
[2024-06-01 14:26:41] [INFO ] Actually due to overlaps returned [2, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 13/15 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 13/15 places, 9/9 transitions.
Treatment of property PermAdmissibility-COL-20-LTLFireability-04 finished in 3231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U p1)||F(p2)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(!p1)&&p0))&&F(!p2)))'
Found a Shortening insensitive property : PermAdmissibility-COL-20-LTLFireability-14
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
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.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 2 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2024-06-01 14:26:42] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 14:26:42] [INFO ] Implicit Places using invariants in 68 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 23, 25]
[2024-06-01 14:26:42] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 23]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 70 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 24/32 places, 16/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 24 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 15
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 4 place count 22 transition count 14
Applied a total of 4 rules in 5 ms. Remains 22 /24 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 22 cols
[2024-06-01 14:26:42] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 14:26:42] [INFO ] Implicit Places using invariants in 41 ms returned [4, 5, 9, 17]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 43 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 18/32 places, 14/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 18 transition count 12
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 15 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 15 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 13 transition count 9
Applied a total of 10 rules in 5 ms. Remains 13 /18 variables (removed 5) and now considering 9/14 (removed 5) transitions.
// Phase 1: matrix 9 rows 13 cols
[2024-06-01 14:26:42] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 14:26:42] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 14:26:42] [INFO ] Invariant cache hit.
[2024-06-01 14:26:42] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 13/32 places, 9/16 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 181 ms. Remains : 13/32 places, 9/16 transitions.
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-14
Product exploration explored 100000 steps with 5863 reset in 96 ms.
Product exploration explored 100000 steps with 5854 reset in 108 ms.
Computed a total of 13 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 13 transition count 9
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 p1), (X p2), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X p1), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X p1)), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 435 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40024 steps (208 resets) in 31 ms. (1250 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (36 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
[2024-06-01 14:26:43] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
After SMT solving in domain Real declared 3/22 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 22ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X p1), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X p1)), (F (G (NOT p0))), (F (G p2)), (F (G p1)), (G (OR (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 15 factoid took 267 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
[2024-06-01 14:26:43] [INFO ] Invariant cache hit.
[2024-06-01 14:26:43] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 14:26:43] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 14:26:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:26:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 14:26:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 14:26:44] [INFO ] Computed and/alt/rep : 8/16/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 14:26:44] [INFO ] Added : 8 causal constraints over 2 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 14:26:44] [INFO ] Invariant cache hit.
[2024-06-01 14:26:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 14:26:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 14:26:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:26:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 14:26:44] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 14:26:44] [INFO ] Computed and/alt/rep : 8/16/8 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 14:26:44] [INFO ] Added : 8 causal constraints over 2 iterations in 12 ms. Result :sat
Could not prove EG p1
[2024-06-01 14:26:44] [INFO ] Invariant cache hit.
[2024-06-01 14:26:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 14:26:44] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 14:26:44] [INFO ] Computed and/alt/rep : 8/16/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 14:26:44] [INFO ] Added : 8 causal constraints over 2 iterations in 11 ms. Result :sat
Could not prove EG p2
Support contains 6 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-06-01 14:26:44] [INFO ] Invariant cache hit.
[2024-06-01 14:26:44] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 14:26:44] [INFO ] Invariant cache hit.
[2024-06-01 14:26:44] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Running 8 sub problems to find dead transitions.
[2024-06-01 14:26:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 9/21 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/22 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 17 constraints, problems are : Problem set: 0 solved, 8 unsolved in 100 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 9/21 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/22 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 25 constraints, problems are : Problem set: 0 solved, 8 unsolved in 107 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 212ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 212ms
Finished structural reductions in LTL mode , in 1 iterations and 269 ms. Remains : 13/13 places, 9/9 transitions.
Computed a total of 13 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 13 transition count 9
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 p1), (X p2), (X (NOT p0)), (X (X p2)), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 164 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 468 steps (0 resets) in 4 ms. (93 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT p0)), (X (X p2)), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F p0)]
Knowledge based reduction with 9 factoid took 298 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
[2024-06-01 14:26:45] [INFO ] Invariant cache hit.
[2024-06-01 14:26:45] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 14:26:45] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 14:26:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:26:45] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 14:26:45] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 14:26:45] [INFO ] Computed and/alt/rep : 8/16/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 14:26:45] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 14:26:45] [INFO ] Invariant cache hit.
[2024-06-01 14:26:45] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 14:26:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 14:26:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:26:45] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 14:26:45] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 14:26:45] [INFO ] Computed and/alt/rep : 8/16/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 14:26:45] [INFO ] Added : 8 causal constraints over 2 iterations in 8 ms. Result :sat
Could not prove EG p1
[2024-06-01 14:26:45] [INFO ] Invariant cache hit.
[2024-06-01 14:26:45] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 14:26:45] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 14:26:45] [INFO ] Computed and/alt/rep : 8/16/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 14:26:45] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
Product exploration explored 100000 steps with 5978 reset in 90 ms.
Product exploration explored 100000 steps with 5926 reset in 103 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
Support contains 6 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-06-01 14:26:46] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-06-01 14:26:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 9/21 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/22 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 17 constraints, problems are : Problem set: 0 solved, 8 unsolved in 107 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 9/21 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/22 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 25 constraints, problems are : Problem set: 0 solved, 8 unsolved in 114 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 225ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 225ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 231 ms. Remains : 13/13 places, 9/9 transitions.
Support contains 6 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-06-01 14:26:46] [INFO ] Invariant cache hit.
[2024-06-01 14:26:46] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 14:26:46] [INFO ] Invariant cache hit.
[2024-06-01 14:26:46] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Running 8 sub problems to find dead transitions.
[2024-06-01 14:26:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 9/21 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/22 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 17 constraints, problems are : Problem set: 0 solved, 8 unsolved in 100 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 9/21 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/22 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 25 constraints, problems are : Problem set: 0 solved, 8 unsolved in 106 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 210ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 211ms
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 13/13 places, 9/9 transitions.
Treatment of property PermAdmissibility-COL-20-LTLFireability-14 finished in 4691 ms.
[2024-06-01 14:26:46] [INFO ] Flatten gal took : 5 ms
[2024-06-01 14:26:46] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 14:26:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 16 transitions and 75 arcs took 5 ms.
Total runtime 30643 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : PermAdmissibility-COL-20-LTLFireability-02
FORMULA PermAdmissibility-COL-20-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PermAdmissibility-COL-20-LTLFireability-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PermAdmissibility-COL-20-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717252022025

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name PermAdmissibility-COL-20-LTLFireability-02
ltl formula formula --ltl=/tmp/2128/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 32 places, 16 transitions and 75 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2128/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2128/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2128/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2128/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 34 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 33, there are 27 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~202 levels ~10000 states ~20512 transitions
pnml2lts-mc( 3/ 4): ~202 levels ~20000 states ~45284 transitions
pnml2lts-mc( 3/ 4): ~202 levels ~40000 states ~96512 transitions
pnml2lts-mc( 3/ 4): ~202 levels ~80000 states ~207040 transitions
pnml2lts-mc( 3/ 4): ~202 levels ~160000 states ~435152 transitions
pnml2lts-mc( 1/ 4): ~198 levels ~320000 states ~880492 transitions
pnml2lts-mc( 1/ 4): ~198 levels ~640000 states ~1807104 transitions
pnml2lts-mc( 1/ 4): ~198 levels ~1280000 states ~3728804 transitions
pnml2lts-mc( 1/ 4): ~198 levels ~2560000 states ~7698540 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3960785
pnml2lts-mc( 0/ 4): unique states count: 3961269
pnml2lts-mc( 0/ 4): unique transitions count: 13247832
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 9291265
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 3963255
pnml2lts-mc( 0/ 4): - cum. max stack depth: 790
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3963255 states 13261895 transitions, fanout: 3.346
pnml2lts-mc( 0/ 4): Total exploration time 9.360 sec (9.320 sec minimum, 9.347 sec on average)
pnml2lts-mc( 0/ 4): States per second: 423425, Transitions per second: 1416869
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 94.2MB, 24.9 B/state, compr.: 18.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 11.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 16 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 94.2MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-COL-20-LTLFireability-04
ltl formula formula --ltl=/tmp/2128/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 32 places, 16 transitions and 75 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2128/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2128/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2128/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2128/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 34 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 33, there are 52 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 441
pnml2lts-mc( 0/ 4): unique states count: 441
pnml2lts-mc( 0/ 4): unique transitions count: 634
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 390
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 730
pnml2lts-mc( 0/ 4): - cum. max stack depth: 163
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 730 states 1250 transitions, fanout: 1.712
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 73000, Transitions per second: 125000
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 62.0 B/state, compr.: 46.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 16 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-COL-20-LTLFireability-11
ltl formula formula --ltl=/tmp/2128/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 32 places, 16 transitions and 75 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2128/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2128/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2128/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2128/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 34 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 33, there are 55 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~138 levels ~10000 states ~21152 transitions
pnml2lts-mc( 1/ 4): ~138 levels ~20000 states ~45400 transitions
pnml2lts-mc( 1/ 4): ~138 levels ~40000 states ~96360 transitions
pnml2lts-mc( 1/ 4): ~138 levels ~80000 states ~200388 transitions
pnml2lts-mc( 1/ 4): ~138 levels ~160000 states ~428308 transitions
pnml2lts-mc( 1/ 4): ~138 levels ~320000 states ~884248 transitions
pnml2lts-mc( 1/ 4): ~138 levels ~640000 states ~1858580 transitions
pnml2lts-mc( 1/ 4): ~138 levels ~1280000 states ~3882328 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1545830
pnml2lts-mc( 0/ 4): unique states count: 1545830
pnml2lts-mc( 0/ 4): unique transitions count: 6546399
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 5008690
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1547439
pnml2lts-mc( 0/ 4): - cum. max stack depth: 559
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1547439 states 6563170 transitions, fanout: 4.241
pnml2lts-mc( 0/ 4): Total exploration time 4.110 sec (4.110 sec minimum, 4.110 sec on average)
pnml2lts-mc( 0/ 4): States per second: 376506, Transitions per second: 1596878
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 47.8MB, 32.4 B/state, compr.: 24.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/56.0%
pnml2lts-mc( 0/ 4): Stored 16 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 47.8MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-COL-20-LTLFireability-14
ltl formula formula --ltl=/tmp/2128/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 32 places, 16 transitions and 75 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2128/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2128/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2128/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2128/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 34 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 33, there are 102 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~321!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 937
pnml2lts-mc( 0/ 4): unique transitions count: 5454
pnml2lts-mc( 0/ 4): - self-loop count: 3
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 970
pnml2lts-mc( 0/ 4): - cum. max stack depth: 970
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 970 states 5815 transitions, fanout: 5.995
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 48500, Transitions per second: 290750
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 40.7 B/state, compr.: 30.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 16 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PermAdmissibility-COL-20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654407000140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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