Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 9.9K Apr 12 09:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 09:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 68K Apr 12 09:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 361K Apr 12 09:16 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 5.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 09:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Apr 12 09:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 80K Apr 12 09:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 401K Apr 12 09:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 340K 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-PT-10-LTLCardinality-00
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-01
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-02
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-03
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-04
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-05
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-06
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-07
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-08
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-09
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-10
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-11
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-12
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-13
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-14
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717255493409

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:24:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:24:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:24:56] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2024-06-01 15:24:56] [INFO ] Transformed 168 places.
[2024-06-01 15:24:56] [INFO ] Transformed 592 transitions.
[2024-06-01 15:24:56] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 500 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA PermAdmissibility-PT-10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-10-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 88 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 153 transition count 592
Applied a total of 15 rules in 64 ms. Remains 153 /168 variables (removed 15) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 153 cols
[2024-06-01 15:24:57] [INFO ] Computed 22 invariants in 88 ms
[2024-06-01 15:24:58] [INFO ] Implicit Places using invariants in 836 ms returned []
[2024-06-01 15:24:58] [INFO ] Invariant cache hit.
[2024-06-01 15:24:58] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1759 ms to find 0 implicit places.
Running 588 sub problems to find dead transitions.
[2024-06-01 15:24:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 33/136 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 16/152 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 588 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 592/744 variables, 152/174 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 8 (OVERLAPS) 1/745 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 745/745 variables, and 175 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30104 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 33/136 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 15:25:38] [INFO ] Deduced a trap composed of 36 places in 284 ms of which 36 ms to minimize.
[2024-06-01 15:25:38] [INFO ] Deduced a trap composed of 53 places in 265 ms of which 3 ms to minimize.
[2024-06-01 15:25:39] [INFO ] Deduced a trap composed of 29 places in 292 ms of which 3 ms to minimize.
[2024-06-01 15:25:39] [INFO ] Deduced a trap composed of 22 places in 224 ms of which 2 ms to minimize.
[2024-06-01 15:25:39] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 3 ms to minimize.
[2024-06-01 15:25:39] [INFO ] Deduced a trap composed of 28 places in 248 ms of which 3 ms to minimize.
[2024-06-01 15:25:40] [INFO ] Deduced a trap composed of 26 places in 249 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 15:25:44] [INFO ] Deduced a trap composed of 20 places in 280 ms of which 3 ms to minimize.
[2024-06-01 15:25:44] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 2 ms to minimize.
[2024-06-01 15:25:44] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 2 ms to minimize.
[2024-06-01 15:25:44] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 2 ms to minimize.
[2024-06-01 15:25:45] [INFO ] Deduced a trap composed of 22 places in 263 ms of which 2 ms to minimize.
[2024-06-01 15:25:45] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 2 ms to minimize.
[2024-06-01 15:25:45] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 2 ms to minimize.
[2024-06-01 15:25:45] [INFO ] Deduced a trap composed of 22 places in 257 ms of which 2 ms to minimize.
[2024-06-01 15:25:46] [INFO ] Deduced a trap composed of 24 places in 318 ms of which 3 ms to minimize.
[2024-06-01 15:25:46] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 2 ms to minimize.
[2024-06-01 15:25:46] [INFO ] Deduced a trap composed of 24 places in 327 ms of which 2 ms to minimize.
[2024-06-01 15:25:47] [INFO ] Deduced a trap composed of 20 places in 322 ms of which 2 ms to minimize.
[2024-06-01 15:25:47] [INFO ] Deduced a trap composed of 31 places in 262 ms of which 2 ms to minimize.
[2024-06-01 15:25:47] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 2 ms to minimize.
[2024-06-01 15:25:47] [INFO ] Deduced a trap composed of 29 places in 251 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 15:25:52] [INFO ] Deduced a trap composed of 40 places in 277 ms of which 3 ms to minimize.
[2024-06-01 15:25:52] [INFO ] Deduced a trap composed of 29 places in 210 ms of which 3 ms to minimize.
[2024-06-01 15:25:52] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 2 ms to minimize.
[2024-06-01 15:25:53] [INFO ] Deduced a trap composed of 39 places in 258 ms of which 3 ms to minimize.
[2024-06-01 15:25:53] [INFO ] Deduced a trap composed of 39 places in 250 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 7 (OVERLAPS) 16/152 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 152/745 variables, and 49 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30048 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/153 constraints, PredecessorRefiner: 0/588 constraints, Known Traps: 27/27 constraints]
After SMT, in 63033ms problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 63088ms
Starting structural reductions in LTL mode, iteration 1 : 153/168 places, 592/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64996 ms. Remains : 153/168 places, 592/592 transitions.
Support contains 88 out of 153 places after structural reductions.
[2024-06-01 15:26:02] [INFO ] Flatten gal took : 212 ms
[2024-06-01 15:26:02] [INFO ] Flatten gal took : 113 ms
[2024-06-01 15:26:02] [INFO ] Input system was already deterministic with 592 transitions.
RANDOM walk for 40017 steps (224 resets) in 917 ms. (43 steps per ms) remains 1/24 properties
BEST_FIRST walk for 40003 steps (32 resets) in 564 ms. (70 steps per ms) remains 1/1 properties
[2024-06-01 15:26:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 58/745 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 48 ms.
Refiners :[Generalized P Invariants (flows): 4/22 constraints, State Equation: 0/153 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 70ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PermAdmissibility-PT-10-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 153 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 153 transition count 592
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA PermAdmissibility-PT-10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 9 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 592/592 transitions.
Graph (complete) has 1465 edges and 153 vertex of which 104 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.9 ms
Discarding 49 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 84 transition count 356
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 84 transition count 356
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 55 place count 70 transition count 230
Iterating global reduction 0 with 14 rules applied. Total rules applied 69 place count 70 transition count 230
Applied a total of 69 rules in 90 ms. Remains 70 /153 variables (removed 83) and now considering 230/592 (removed 362) transitions.
// Phase 1: matrix 230 rows 70 cols
[2024-06-01 15:26:03] [INFO ] Computed 16 invariants in 11 ms
[2024-06-01 15:26:04] [INFO ] Implicit Places using invariants in 194 ms returned [0, 11, 25, 36]
[2024-06-01 15:26:04] [INFO ] Actually due to overlaps returned [0, 11, 25]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 201 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/153 places, 230/592 transitions.
Applied a total of 0 rules in 21 ms. Remains 67 /67 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 313 ms. Remains : 67/153 places, 230/592 transitions.
Stuttering acceptance computed with spot in 324 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-01
Product exploration explored 100000 steps with 625 reset in 961 ms.
Product exploration explored 100000 steps with 624 reset in 578 ms.
Computed a total of 67 stabilizing places and 230 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 230
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 104 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 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 400 steps (0 resets) in 5 ms. (66 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 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 9 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 230/230 transitions.
Applied a total of 0 rules in 12 ms. Remains 67 /67 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 67 cols
[2024-06-01 15:26:06] [INFO ] Computed 13 invariants in 2 ms
[2024-06-01 15:26:06] [INFO ] Implicit Places using invariants in 168 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 170 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/67 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 66 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 65 transition count 229
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 65 transition count 228
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 64 transition count 228
Applied a total of 4 rules in 38 ms. Remains 64 /66 variables (removed 2) and now considering 228/230 (removed 2) transitions.
// Phase 1: matrix 228 rows 64 cols
[2024-06-01 15:26:06] [INFO ] Computed 12 invariants in 4 ms
[2024-06-01 15:26:07] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-01 15:26:07] [INFO ] Invariant cache hit.
[2024-06-01 15:26:07] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/67 places, 228/230 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 688 ms. Remains : 64/67 places, 228/230 transitions.
Computed a total of 64 stabilizing places and 228 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 228
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 132 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 165 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 400 steps (0 resets) in 6 ms. (57 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 170 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 108 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 764 reset in 858 ms.
Product exploration explored 100000 steps with 762 reset in 586 ms.
Support contains 9 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 228/228 transitions.
Applied a total of 0 rules in 11 ms. Remains 64 /64 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2024-06-01 15:26:09] [INFO ] Invariant cache hit.
[2024-06-01 15:26:09] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-01 15:26:09] [INFO ] Invariant cache hit.
[2024-06-01 15:26:09] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-06-01 15:26:09] [INFO ] Redundant transitions in 9 ms returned []
Running 224 sub problems to find dead transitions.
[2024-06-01 15:26:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 228/292 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 224 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 76 constraints, problems are : Problem set: 0 solved, 224 unsolved in 5912 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 228/292 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 224/300 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 300 constraints, problems are : Problem set: 0 solved, 224 unsolved in 28027 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints]
After SMT, in 34363ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 34367ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34672 ms. Remains : 64/64 places, 228/228 transitions.
Treatment of property PermAdmissibility-PT-10-LTLCardinality-01 finished in 40709 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 25 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 592/592 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 112 transition count 592
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 61 place count 92 transition count 356
Iterating global reduction 1 with 20 rules applied. Total rules applied 81 place count 92 transition count 356
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 88 place count 85 transition count 244
Iterating global reduction 1 with 7 rules applied. Total rules applied 95 place count 85 transition count 244
Applied a total of 95 rules in 9 ms. Remains 85 /153 variables (removed 68) and now considering 244/592 (removed 348) transitions.
// Phase 1: matrix 244 rows 85 cols
[2024-06-01 15:26:44] [INFO ] Computed 17 invariants in 4 ms
[2024-06-01 15:26:45] [INFO ] Implicit Places using invariants in 585 ms returned [0, 19, 51]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 587 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/153 places, 244/592 transitions.
Applied a total of 0 rules in 11 ms. Remains 82 /82 variables (removed 0) and now considering 244/244 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 607 ms. Remains : 82/153 places, 244/592 transitions.
Stuttering acceptance computed with spot in 343 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p2), (NOT p0), true]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-04 finished in 987 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 33 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 592/592 transitions.
Graph (complete) has 1465 edges and 153 vertex of which 128 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.6 ms
Discarding 25 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 121 transition count 480
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 121 transition count 480
Applied a total of 15 rules in 44 ms. Remains 121 /153 variables (removed 32) and now considering 480/592 (removed 112) transitions.
// Phase 1: matrix 480 rows 121 cols
[2024-06-01 15:26:45] [INFO ] Computed 19 invariants in 7 ms
[2024-06-01 15:26:45] [INFO ] Implicit Places using invariants in 224 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 226 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/153 places, 480/592 transitions.
Applied a total of 0 rules in 16 ms. Remains 120 /120 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 287 ms. Remains : 120/153 places, 480/592 transitions.
Stuttering acceptance computed with spot in 336 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-PT-10-LTLCardinality-06
Product exploration explored 100000 steps with 621 reset in 927 ms.
Product exploration explored 100000 steps with 621 reset in 1034 ms.
Computed a total of 120 stabilizing places and 480 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 120 transition count 480
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 p2), (X p3), (X (NOT (AND (NOT p3) p2 p0))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2))), (X (OR p3 p2)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) p2))), (X (OR p3 p2 p0)), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (X (OR p3 p2))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (OR p3 p2 p0))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 3913 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 254 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 40012 steps (224 resets) in 210 ms. (189 steps per ms) remains 3/11 properties
BEST_FIRST walk for 11811 steps (1 resets) in 74 ms. (157 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p3 p2 (NOT p0) (NOT p1)), (X p2), (X p3), (X (NOT (AND (NOT p3) p2 p0))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2))), (X (OR p3 p2)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) p2))), (X (OR p3 p2 p0)), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (X (OR p3 p2))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (OR p3 p2 p0))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p3 p2 p0))), (F (NOT (OR p3 (NOT p2)))), (F (NOT (OR p3 (NOT p2) p0))), (F (NOT (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))), (F (NOT (OR p3 p2 (NOT p0)))), (F (NOT (OR p3 p2 p0))), (F p1), (F (NOT (OR p3 p2))), (F (NOT p2)), (F (NOT (OR p3 (NOT p2) (NOT p0)))), (F (NOT p3)), (F p0), (F (NOT (OR p3 p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p3 p2 p0)))
Knowledge based reduction with 31 factoid took 3882 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-PT-10-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-10-LTLCardinality-06 finished in 10986 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 17 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 592/592 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 120 transition count 592
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 45 place count 108 transition count 400
Iterating global reduction 1 with 12 rules applied. Total rules applied 57 place count 108 transition count 400
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 67 place count 98 transition count 290
Iterating global reduction 1 with 10 rules applied. Total rules applied 77 place count 98 transition count 290
Applied a total of 77 rules in 11 ms. Remains 98 /153 variables (removed 55) and now considering 290/592 (removed 302) transitions.
// Phase 1: matrix 290 rows 98 cols
[2024-06-01 15:26:56] [INFO ] Computed 18 invariants in 4 ms
[2024-06-01 15:26:56] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-06-01 15:26:56] [INFO ] Invariant cache hit.
[2024-06-01 15:26:57] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-01 15:26:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 17/98 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 290/388 variables, 98/116 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (OVERLAPS) 0/388 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 116 constraints, problems are : Problem set: 0 solved, 286 unsolved in 9120 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 17/98 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 290/388 variables, 98/116 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 286/402 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/388 variables, and 402 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints]
After SMT, in 39980ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 39988ms
Starting structural reductions in LTL mode, iteration 1 : 98/153 places, 290/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40728 ms. Remains : 98/153 places, 290/592 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-07 finished in 40934 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))||G(p2))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 592/592 transitions.
Graph (complete) has 1465 edges and 153 vertex of which 104 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.4 ms
Discarding 49 places :
Also discarding 0 output transitions
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 26 place count 79 transition count 348
Iterating global reduction 0 with 25 rules applied. Total rules applied 51 place count 79 transition count 348
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 73 place count 57 transition count 118
Iterating global reduction 0 with 22 rules applied. Total rules applied 95 place count 57 transition count 118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 97 place count 55 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 99 place count 55 transition count 102
Applied a total of 99 rules in 25 ms. Remains 55 /153 variables (removed 98) and now considering 102/592 (removed 490) transitions.
// Phase 1: matrix 102 rows 55 cols
[2024-06-01 15:27:37] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 15:27:37] [INFO ] Implicit Places using invariants in 146 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 149 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/153 places, 102/592 transitions.
Applied a total of 0 rules in 5 ms. Remains 54 /54 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 179 ms. Remains : 54/153 places, 102/592 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-09
Stuttering criterion allowed to conclude after 160 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-09 finished in 312 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(p1)))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 592/592 transitions.
Graph (complete) has 1465 edges and 153 vertex of which 105 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.4 ms
Discarding 48 places :
Also discarding 0 output transitions
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 26 place count 80 transition count 346
Iterating global reduction 0 with 25 rules applied. Total rules applied 51 place count 80 transition count 346
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 73 place count 58 transition count 124
Iterating global reduction 0 with 22 rules applied. Total rules applied 95 place count 58 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 97 place count 56 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 99 place count 56 transition count 108
Applied a total of 99 rules in 25 ms. Remains 56 /153 variables (removed 97) and now considering 108/592 (removed 484) transitions.
// Phase 1: matrix 108 rows 56 cols
[2024-06-01 15:27:37] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 15:27:37] [INFO ] Implicit Places using invariants in 151 ms returned [0, 7, 20, 28]
[2024-06-01 15:27:37] [INFO ] Actually due to overlaps returned [0, 7, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 154 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/153 places, 108/592 transitions.
Applied a total of 0 rules in 13 ms. Remains 53 /53 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 192 ms. Remains : 53/153 places, 108/592 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-10
Stuttering criterion allowed to conclude after 160 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-10 finished in 313 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 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 592/592 transitions.
Graph (complete) has 1465 edges and 153 vertex of which 50 are kept as prefixes of interest. Removing 103 places using SCC suffix rule.1 ms
Discarding 103 places :
Also discarding 384 output transitions
Drop transitions (Output transitions of discarded places.) removed 384 transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 37 transition count 84
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 37 transition count 84
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 33 place count 31 transition count 46
Iterating global reduction 0 with 6 rules applied. Total rules applied 39 place count 31 transition count 46
Applied a total of 39 rules in 20 ms. Remains 31 /153 variables (removed 122) and now considering 46/592 (removed 546) transitions.
// Phase 1: matrix 46 rows 31 cols
[2024-06-01 15:27:38] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 15:27:38] [INFO ] Implicit Places using invariants in 128 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/153 places, 46/592 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 154 ms. Remains : 30/153 places, 46/592 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-12
Product exploration explored 100000 steps with 990 reset in 401 ms.
Product exploration explored 100000 steps with 990 reset in 288 ms.
Computed a total of 30 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 46
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 87 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 34 ms :[(NOT p0)]
RANDOM walk for 552 steps (3 resets) in 6 ms. (78 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 139 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 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 46/46 (removed 0) transitions.
// Phase 1: matrix 46 rows 30 cols
[2024-06-01 15:27:39] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 15:27:39] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 15:27:39] [INFO ] Invariant cache hit.
[2024-06-01 15:27:39] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-06-01 15:27:39] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2024-06-01 15:27:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 46/76 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/76 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 39 constraints, problems are : Problem set: 0 solved, 42 unsolved in 941 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 46/76 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 42/81 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/76 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 81 constraints, problems are : Problem set: 0 solved, 42 unsolved in 955 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 1920ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1921ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2096 ms. Remains : 30/30 places, 46/46 transitions.
Computed a total of 30 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 46
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 86 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 44 ms :[(NOT p0)]
RANDOM walk for 888 steps (6 resets) in 5 ms. (148 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 111 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 990 reset in 267 ms.
Product exploration explored 100000 steps with 990 reset in 281 ms.
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2024-06-01 15:27:42] [INFO ] Invariant cache hit.
[2024-06-01 15:27:42] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 15:27:42] [INFO ] Invariant cache hit.
[2024-06-01 15:27:42] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-06-01 15:27:42] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2024-06-01 15:27:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 46/76 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/76 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 39 constraints, problems are : Problem set: 0 solved, 42 unsolved in 863 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 46/76 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 42/81 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/76 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 81 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1153 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 2045ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 2046ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2169 ms. Remains : 30/30 places, 46/46 transitions.
Treatment of property PermAdmissibility-PT-10-LTLCardinality-12 finished in 6640 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 U (p1||G(p0)))))'
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 592/592 transitions.
Graph (complete) has 1465 edges and 153 vertex of which 106 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.2 ms
Discarding 47 places :
Also discarding 0 output transitions
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 23 place count 84 transition count 360
Iterating global reduction 0 with 22 rules applied. Total rules applied 45 place count 84 transition count 360
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 61 place count 68 transition count 172
Iterating global reduction 0 with 16 rules applied. Total rules applied 77 place count 68 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 78 place count 67 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 79 place count 67 transition count 164
Applied a total of 79 rules in 35 ms. Remains 67 /153 variables (removed 86) and now considering 164/592 (removed 428) transitions.
// Phase 1: matrix 164 rows 67 cols
[2024-06-01 15:27:44] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 15:27:44] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-01 15:27:44] [INFO ] Invariant cache hit.
[2024-06-01 15:27:45] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2024-06-01 15:27:45] [INFO ] Redundant transitions in 9 ms returned []
Running 160 sub problems to find dead transitions.
[2024-06-01 15:27:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 164/229 variables, 65/81 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 2/231 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/231 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 83 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5720 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 164/229 variables, 65/81 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 136/217 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 2/231 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 24/243 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (OVERLAPS) 0/231 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 243 constraints, problems are : Problem set: 0 solved, 160 unsolved in 27556 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 33490ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 33493ms
Starting structural reductions in SI_LTL mode, iteration 1 : 67/153 places, 164/592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33930 ms. Remains : 67/153 places, 164/592 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-13
Stuttering criterion allowed to conclude after 697 steps with 6 reset in 9 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-13 finished in 34031 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 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 592/592 transitions.
Graph (complete) has 1465 edges and 153 vertex of which 105 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.2 ms
Discarding 48 places :
Also discarding 0 output transitions
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 26 place count 80 transition count 348
Iterating global reduction 0 with 25 rules applied. Total rules applied 51 place count 80 transition count 348
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 72 place count 59 transition count 122
Iterating global reduction 0 with 21 rules applied. Total rules applied 93 place count 59 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 95 place count 57 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 97 place count 57 transition count 106
Applied a total of 97 rules in 33 ms. Remains 57 /153 variables (removed 96) and now considering 106/592 (removed 486) transitions.
// Phase 1: matrix 106 rows 57 cols
[2024-06-01 15:28:18] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 15:28:18] [INFO ] Implicit Places using invariants in 176 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 181 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/153 places, 106/592 transitions.
Applied a total of 0 rules in 6 ms. Remains 56 /56 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 221 ms. Remains : 56/153 places, 106/592 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-15
Stuttering criterion allowed to conclude after 965 steps with 5 reset in 7 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-15 finished in 306 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-06-01 15:28:19] [INFO ] Flatten gal took : 93 ms
[2024-06-01 15:28:19] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 15:28:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 153 places, 592 transitions and 3336 arcs took 17 ms.
Total runtime 203671 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA PermAdmissibility-PT-10-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PermAdmissibility-PT-10-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717256396631

--------------------
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
mcc2024
ltl formula name PermAdmissibility-PT-10-LTLCardinality-01
ltl formula formula --ltl=/tmp/1123/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 153 places, 592 transitions and 3336 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1123/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1123/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1123/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.020 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1123/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 106 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 154, there are 595 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~161 levels ~10000 states ~24656 transitions
pnml2lts-mc( 3/ 4): ~161 levels ~20000 states ~54052 transitions
pnml2lts-mc( 3/ 4): ~161 levels ~40000 states ~110676 transitions
pnml2lts-mc( 3/ 4): ~161 levels ~80000 states ~208468 transitions
pnml2lts-mc( 3/ 4): ~161 levels ~160000 states ~432176 transitions
pnml2lts-mc( 3/ 4): ~161 levels ~320000 states ~924964 transitions
pnml2lts-mc( 3/ 4): ~161 levels ~640000 states ~1916628 transitions
pnml2lts-mc( 3/ 4): ~161 levels ~1280000 states ~3857068 transitions
pnml2lts-mc( 0/ 4): ~161 levels ~2560000 states ~7508836 transitions
pnml2lts-mc( 0/ 4): ~161 levels ~5120000 states ~15496188 transitions
pnml2lts-mc( 2/ 4): ~161 levels ~10240000 states ~42013268 transitions
pnml2lts-mc( 2/ 4): ~161 levels ~20480000 states ~88084680 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33549734
pnml2lts-mc( 0/ 4): unique states count: 33550352
pnml2lts-mc( 0/ 4): unique transitions count: 151792607
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 118238177
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33550356
pnml2lts-mc( 0/ 4): - cum. max stack depth: 644
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33550356 states 151792629 transitions, fanout: 4.524
pnml2lts-mc( 0/ 4): Total exploration time 350.410 sec (350.360 sec minimum, 350.392 sec on average)
pnml2lts-mc( 0/ 4): States per second: 95746, Transitions per second: 433186
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 264.1MB, 8.3 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/12.0%
pnml2lts-mc( 0/ 4): Stored 604 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 264.1MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-PT-10-LTLCardinality-12
ltl formula formula --ltl=/tmp/1123/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 153 places, 592 transitions and 3336 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.050 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1123/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1123/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1123/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1123/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 105 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 154, there are 596 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~161 levels ~10000 states ~15676 transitions
pnml2lts-mc( 2/ 4): ~161 levels ~20000 states ~29352 transitions
pnml2lts-mc( 3/ 4): ~161 levels ~40000 states ~61044 transitions
pnml2lts-mc( 2/ 4): ~161 levels ~80000 states ~155376 transitions
pnml2lts-mc( 2/ 4): ~161 levels ~160000 states ~337572 transitions
pnml2lts-mc( 2/ 4): ~161 levels ~320000 states ~720204 transitions
pnml2lts-mc( 2/ 4): ~161 levels ~640000 states ~1672492 transitions
pnml2lts-mc( 2/ 4): ~161 levels ~1280000 states ~3517308 transitions
pnml2lts-mc( 2/ 4): ~161 levels ~2560000 states ~6842660 transitions
pnml2lts-mc( 2/ 4): ~161 levels ~5120000 states ~13884748 transitions
pnml2lts-mc( 2/ 4): ~161 levels ~10240000 states ~29530336 transitions
pnml2lts-mc( 2/ 4): ~161 levels ~20480000 states ~60696348 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33550093
pnml2lts-mc( 0/ 4): unique states count: 33550705
pnml2lts-mc( 0/ 4): unique transitions count: 138923876
pnml2lts-mc( 0/ 4): - self-loop count: 405945
pnml2lts-mc( 0/ 4): - claim dead count: 104963525
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33550708
pnml2lts-mc( 0/ 4): - cum. max stack depth: 644
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33550708 states 138923891 transitions, fanout: 4.141
pnml2lts-mc( 0/ 4): Total exploration time 344.660 sec (344.540 sec minimum, 344.575 sec on average)
pnml2lts-mc( 0/ 4): States per second: 97344, Transitions per second: 403075
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 266.4MB, 8.3 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/16.0%
pnml2lts-mc( 0/ 4): Stored 604 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 266.4MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PermAdmissibility-PT-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 r512-smll-171654407100179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-10.tgz
mv PermAdmissibility-PT-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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;