About the Execution of GreatSPN+red for PermAdmissibility-COL-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 508.191 | 43181.00 | 59068.00 | 534.70 | TTFFFTFFFFFFFTTT | normal |
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.r267-smll-171654405700131.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 greatspnxred
Input is PermAdmissibility-COL-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405700131
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.0K Apr 12 09:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 09:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 09:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 09:15 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.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 9.6K Apr 12 09:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 09:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 09:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 09:27 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 37K 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-10-LTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716668585437
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 20:23:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 20:23:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 20:23:07] [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-05-25 20:23:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 20:23:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 987 ms
[2024-05-25 20:23:08] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 20:23:08] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 6 ms.
[2024-05-25 20:23:08] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PermAdmissibility-COL-10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-10-LTLCardinality-13 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).
RANDOM walk for 40005 steps (224 resets) in 408 ms. (97 steps per ms) remains 1/24 properties
BEST_FIRST walk for 40002 steps (88 resets) in 294 ms. (135 steps per ms) remains 1/1 properties
// Phase 1: matrix 16 rows 40 cols
[2024-05-25 20:23:09] [INFO ] Computed 24 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 40/56 variables, and 24 constraints, problems are : Problem set: 1 solved, 0 unsolved in 238 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 305ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2024-05-25 20:23:09] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-25 20:23:09] [INFO ] Flatten gal took : 31 ms
FORMULA PermAdmissibility-COL-10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 20:23:09] [INFO ] Flatten gal took : 10 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-05-25 20:23:09] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 23 ms.
[2024-05-25 20:23:09] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 24 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 37 transition count 16
Applied a total of 3 rules in 24 ms. Remains 37 /40 variables (removed 3) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 37 cols
[2024-05-25 20:23:09] [INFO ] Computed 21 invariants in 7 ms
[2024-05-25 20:23:09] [INFO ] Implicit Places using invariants in 165 ms returned [4, 5, 15, 17, 18, 23, 26]
[2024-05-25 20:23:09] [INFO ] Actually due to overlaps returned [4, 5, 15, 18, 23, 26]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 180 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 223 ms. Remains : 31/40 places, 16/16 transitions.
Support contains 24 out of 31 places after structural reductions.
[2024-05-25 20:23:09] [INFO ] Flatten gal took : 5 ms
[2024-05-25 20:23:09] [INFO ] Flatten gal took : 5 ms
[2024-05-25 20:23:09] [INFO ] Input system was already deterministic with 16 transitions.
RANDOM walk for 704 steps (0 resets) in 33 ms. (20 steps per ms) remains 0/22 properties
Computed a total of 31 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 31 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' '!(G(F(p0)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Graph (complete) has 57 edges and 31 vertex of which 25 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 21 ms. Remains 24 /31 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 24 cols
[2024-05-25 20:23:10] [INFO ] Computed 8 invariants in 3 ms
[2024-05-25 20:23:10] [INFO ] Implicit Places using invariants in 91 ms returned [4, 5, 10, 11, 12, 13, 18]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 93 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/31 places, 16/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 17 transition count 6
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 22 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 5 transition count 4
Applied a total of 24 rules in 11 ms. Remains 5 /17 variables (removed 12) and now considering 4/16 (removed 12) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-05-25 20:23:10] [INFO ] Computed 1 invariants in 2 ms
[2024-05-25 20:23:10] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 20:23:10] [INFO ] Invariant cache hit.
[2024-05-25 20:23:10] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/31 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 182 ms. Remains : 5/31 places, 4/16 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-01
Product exploration explored 100000 steps with 3200 reset in 418 ms.
Product exploration explored 100000 steps with 3174 reset in 180 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 106 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 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 48 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 20:23:11] [INFO ] Invariant cache hit.
[2024-05-25 20:23:11] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 20:23:11] [INFO ] Invariant cache hit.
[2024-05-25 20:23:11] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-25 20:23:11] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 20:23:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/9 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 3 unsolved in 72 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 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/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/9 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 59 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 139ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 199 ms. Remains : 5/5 places, 4/4 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 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 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 48 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 124 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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3137 reset in 79 ms.
Product exploration explored 100000 steps with 3175 reset in 176 ms.
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 20:23:12] [INFO ] Invariant cache hit.
[2024-05-25 20:23:12] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-25 20:23:12] [INFO ] Invariant cache hit.
[2024-05-25 20:23:12] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-25 20:23:12] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 20:23:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/9 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 3 unsolved in 82 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 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/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/9 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 74 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 162ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 163ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 224 ms. Remains : 5/5 places, 4/4 transitions.
Treatment of property PermAdmissibility-COL-10-LTLCardinality-01 finished in 3009 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)||p1))&&(!X(p2) U p1)))'
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 25 transition count 16
Applied a total of 6 rules in 1 ms. Remains 25 /31 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 25 cols
[2024-05-25 20:23:13] [INFO ] Computed 9 invariants in 1 ms
[2024-05-25 20:23:13] [INFO ] Implicit Places using invariants in 59 ms returned [4, 13, 18, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 63 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/31 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 21/31 places, 16/16 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p2), (NOT p0), true]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-10-LTLCardinality-04 finished in 276 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 U (F(G(p1))&&(p2 U p3)))))'
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Graph (complete) has 57 edges and 31 vertex of which 28 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 2 ms. Remains 27 /31 variables (removed 4) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 27 cols
[2024-05-25 20:23:13] [INFO ] Computed 11 invariants in 1 ms
[2024-05-25 20:23:13] [INFO ] Implicit Places using invariants in 59 ms returned [4, 5, 10, 11, 12, 13, 18]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 60 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/31 places, 16/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 19 transition count 9
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 13 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 12 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 12 transition count 6
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 18 place count 10 transition count 6
Applied a total of 18 rules in 5 ms. Remains 10 /20 variables (removed 10) and now considering 6/16 (removed 10) transitions.
// Phase 1: matrix 6 rows 10 cols
[2024-05-25 20:23:13] [INFO ] Computed 4 invariants in 1 ms
[2024-05-25 20:23:13] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 20:23:13] [INFO ] Invariant cache hit.
[2024-05-25 20:23:13] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/31 places, 6/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 122 ms. Remains : 10/31 places, 6/16 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p3) (NOT p1)), true, (NOT p1), (NOT p3), (OR (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-06
Product exploration explored 100000 steps with 1639 reset in 107 ms.
Product exploration explored 100000 steps with 1639 reset in 104 ms.
Computed a total of 10 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p3 p2 (NOT p0) (NOT p1)), (X (NOT p2)), (X (OR p3 p2)), (X p3), (X (NOT (AND (NOT p3) p2))), (X (OR p3 p2 p0)), (X (NOT (AND (NOT p3) p2 p0))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (X (OR p3 p2))), (X (X p3)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (OR p3 p2 p0))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (F (OR (G p3) (G (NOT p3)))), (F (G p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 30 factoid took 6697 ms. Reduced automaton from 6 states, 20 edges and 4 AP (stutter insensitive) to 6 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p3) (NOT p1)), true, (NOT p1), (NOT p3), (OR (NOT p1) (NOT p3)), (NOT p3)]
Reduction of identical properties reduced properties to check from 13 to 11
RANDOM walk for 40015 steps (596 resets) in 137 ms. (289 steps per ms) remains 3/11 properties
BEST_FIRST walk for 509 steps (0 resets) in 6 ms. (72 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p3 p2 (NOT p0) (NOT p1)), (X (NOT p2)), (X (OR p3 p2)), (X p3), (X (NOT (AND (NOT p3) p2))), (X (OR p3 p2 p0)), (X (NOT (AND (NOT p3) p2 p0))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (X (OR p3 p2))), (X (X p3)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (OR p3 p2 p0))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (F (OR (G p3) (G (NOT p3)))), (F (G p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p2 p3))), (F (NOT (OR p2 p3 (NOT p0)))), (F (NOT (OR (NOT p2) p3 (NOT p0)))), (F (NOT (OR (AND p2 (NOT p1)) (AND p3 (NOT p1))))), (F (NOT (OR p2 p3 p0))), (F (NOT (OR (NOT p2) p3 p0))), (F (NOT (OR p2 p3))), (F (NOT p2)), (F (NOT (OR p2 p3 p0))), (F (NOT p3)), (F p1), (F p0)]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p2 p3 p0)))
Knowledge based reduction with 30 factoid took 12313 ms. Reduced automaton from 6 states, 20 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-10-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-10-LTLCardinality-06 finished in 20057 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(G(p1))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 26 transition count 16
Applied a total of 5 rules in 1 ms. Remains 26 /31 variables (removed 5) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2024-05-25 20:23:33] [INFO ] Computed 10 invariants in 1 ms
[2024-05-25 20:23:33] [INFO ] Implicit Places using invariants in 81 ms returned [4, 5, 10, 11, 12, 13, 18, 19]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 82 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/31 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 18/31 places, 16/16 transitions.
Stuttering acceptance computed with spot in 341 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-10-LTLCardinality-07 finished in 442 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(X(F(p0)))))'
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 24 transition count 16
Applied a total of 7 rules in 1 ms. Remains 24 /31 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 24 cols
[2024-05-25 20:23:33] [INFO ] Computed 8 invariants in 1 ms
[2024-05-25 20:23:34] [INFO ] Implicit Places using invariants in 100 ms returned [4, 5, 10, 11, 12, 13, 18, 19]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 102 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/31 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 16/31 places, 16/16 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-08
Stuttering criterion allowed to conclude after 2856 steps with 116 reset in 11 ms.
FORMULA PermAdmissibility-COL-10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-10-LTLCardinality-08 finished in 307 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 U p1))))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Graph (complete) has 57 edges and 31 vertex of which 19 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 5 ms. Remains 18 /31 variables (removed 13) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 18 cols
[2024-05-25 20:23:34] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 20:23:34] [INFO ] Implicit Places using invariants in 74 ms returned [5, 10, 11, 12, 13]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 76 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/31 places, 12/16 transitions.
Graph (complete) has 14 edges and 13 vertex of which 12 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 11 transition count 6
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 7 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 9 place count 7 transition count 4
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 13 place count 5 transition count 4
Applied a total of 13 rules in 7 ms. Remains 5 /13 variables (removed 8) and now considering 4/12 (removed 8) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-05-25 20:23:34] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 20:23:34] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-25 20:23:34] [INFO ] Invariant cache hit.
[2024-05-25 20:23:34] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/31 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 152 ms. Remains : 5/31 places, 4/16 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-09
Stuttering criterion allowed to conclude after 93 steps with 2 reset in 0 ms.
FORMULA PermAdmissibility-COL-10-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-10-LTLCardinality-09 finished in 258 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(p0)||(G(p0) U G((p1||X(p2))))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 24 transition count 16
Applied a total of 7 rules in 1 ms. Remains 24 /31 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 24 cols
[2024-05-25 20:23:34] [INFO ] Computed 8 invariants in 1 ms
[2024-05-25 20:23:34] [INFO ] Implicit Places using invariants in 72 ms returned [4, 10, 11, 12, 13, 18, 19]
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 : 17/31 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 17/31 places, 16/16 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-10
Stuttering criterion allowed to conclude after 4199 steps with 32 reset in 13 ms.
FORMULA PermAdmissibility-COL-10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-10-LTLCardinality-10 finished in 257 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))||G(p1)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 24 transition count 16
Applied a total of 7 rules in 1 ms. Remains 24 /31 variables (removed 7) and now considering 16/16 (removed 0) transitions.
[2024-05-25 20:23:34] [INFO ] Invariant cache hit.
[2024-05-25 20:23:34] [INFO ] Implicit Places using invariants in 107 ms returned [4, 5, 10, 11, 12, 13, 18, 19]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 109 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/31 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 16/31 places, 16/16 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-10-LTLCardinality-11 finished in 358 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((F(p0) U G(p1)))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 24 transition count 16
Applied a total of 7 rules in 1 ms. Remains 24 /31 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 24 cols
[2024-05-25 20:23:35] [INFO ] Computed 8 invariants in 1 ms
[2024-05-25 20:23:35] [INFO ] Implicit Places using invariants in 92 ms returned [4, 5, 12, 13, 18, 19]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 114 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/31 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 18/31 places, 16/16 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-12
Stuttering criterion allowed to conclude after 160 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-10-LTLCardinality-12 finished in 374 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(F(p0))||G(!p0))))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 24 transition count 16
Applied a total of 7 rules in 1 ms. Remains 24 /31 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 24 cols
[2024-05-25 20:23:35] [INFO ] Computed 8 invariants in 1 ms
[2024-05-25 20:23:35] [INFO ] Implicit Places using invariants in 83 ms returned [4, 5, 10, 11, 12, 13, 18, 19]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 95 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/31 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 16/31 places, 16/16 transitions.
Stuttering acceptance computed with spot in 198 ms :[false, false, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-14
Product exploration explored 100000 steps with 658 reset in 241 ms.
Product exploration explored 100000 steps with 654 reset in 321 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 24 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-10-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-10-LTLCardinality-14 finished in 942 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 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Graph (complete) has 57 edges and 31 vertex of which 22 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 4 ms. Remains 21 /31 variables (removed 10) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 21 cols
[2024-05-25 20:23:36] [INFO ] Computed 7 invariants in 0 ms
[2024-05-25 20:23:36] [INFO ] Implicit Places using invariants in 88 ms returned [4, 5, 10, 11, 12, 13]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 90 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/31 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 14 transition count 8
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 8 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 8 transition count 5
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 16 place count 6 transition count 5
Applied a total of 16 rules in 4 ms. Remains 6 /15 variables (removed 9) and now considering 5/14 (removed 9) transitions.
// Phase 1: matrix 5 rows 6 cols
[2024-05-25 20:23:36] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 20:23:36] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 20:23:36] [INFO ] Invariant cache hit.
[2024-05-25 20:23:36] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/31 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 155 ms. Remains : 6/31 places, 5/16 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLCardinality-15
Product exploration explored 100000 steps with 1960 reset in 132 ms.
Product exploration explored 100000 steps with 1960 reset in 160 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
RANDOM walk for 92 steps (0 resets) in 4 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-05-25 20:23:37] [INFO ] Invariant cache hit.
[2024-05-25 20:23:37] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 20:23:37] [INFO ] Invariant cache hit.
[2024-05-25 20:23:37] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-25 20:23:37] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-25 20:23:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/11 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 7 constraints, problems are : Problem set: 0 solved, 4 unsolved in 86 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 6/6 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/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/11 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 11 constraints, problems are : Problem set: 0 solved, 4 unsolved in 67 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 157ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 158ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 216 ms. Remains : 6/6 places, 5/5 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 92 steps (0 resets) in 4 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1960 reset in 79 ms.
Product exploration explored 100000 steps with 1960 reset in 90 ms.
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-05-25 20:23:38] [INFO ] Invariant cache hit.
[2024-05-25 20:23:38] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 20:23:38] [INFO ] Invariant cache hit.
[2024-05-25 20:23:38] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-25 20:23:38] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-25 20:23:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/11 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 7 constraints, problems are : Problem set: 0 solved, 4 unsolved in 82 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 6/6 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/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/11 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 11 constraints, problems are : Problem set: 0 solved, 4 unsolved in 66 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 153ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 153ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 215 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property PermAdmissibility-COL-10-LTLCardinality-15 finished in 2003 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)))'
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)))'
[2024-05-25 20:23:38] [INFO ] Flatten gal took : 7 ms
[2024-05-25 20:23:38] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-25 20:23:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 31 places, 16 transitions and 61 arcs took 6 ms.
Total runtime 31813 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running PermAdmissibility-COL-10
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 31
TRANSITIONS: 16
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.002s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1106
MODEL NAME: /home/mcc/execution/414/model
31 places, 16 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA PermAdmissibility-COL-10-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PermAdmissibility-COL-10-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716668628618
--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
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-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PermAdmissibility-COL-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r267-smll-171654405700131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-10.tgz
mv PermAdmissibility-COL-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;