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.r492-smll-171636266100076.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 Echo-PT-d02r09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266100076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 784K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 12 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 04:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 12 04:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 303K May 18 16:42 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 Echo-PT-d02r09-LTLFireability-00
FORMULA_NAME Echo-PT-d02r09-LTLFireability-01
FORMULA_NAME Echo-PT-d02r09-LTLFireability-02
FORMULA_NAME Echo-PT-d02r09-LTLFireability-03
FORMULA_NAME Echo-PT-d02r09-LTLFireability-04
FORMULA_NAME Echo-PT-d02r09-LTLFireability-05
FORMULA_NAME Echo-PT-d02r09-LTLFireability-06
FORMULA_NAME Echo-PT-d02r09-LTLFireability-07
FORMULA_NAME Echo-PT-d02r09-LTLFireability-08
FORMULA_NAME Echo-PT-d02r09-LTLFireability-09
FORMULA_NAME Echo-PT-d02r09-LTLFireability-10
FORMULA_NAME Echo-PT-d02r09-LTLFireability-11
FORMULA_NAME Echo-PT-d02r09-LTLFireability-12
FORMULA_NAME Echo-PT-d02r09-LTLFireability-13
FORMULA_NAME Echo-PT-d02r09-LTLFireability-14
FORMULA_NAME Echo-PT-d02r09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717194698127

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d02r09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:31:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:31:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:31:41] [INFO ] Load time of PNML (sax parser for PT used): 430 ms
[2024-05-31 22:31:41] [INFO ] Transformed 735 places.
[2024-05-31 22:31:41] [INFO ] Transformed 570 transitions.
[2024-05-31 22:31:41] [INFO ] Found NUPN structural information;
[2024-05-31 22:31:41] [INFO ] Parsed PT model containing 735 places and 570 transitions and 3220 arcs in 705 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 51 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Echo-PT-d02r09-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 72 out of 735 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 735/735 places, 570/570 transitions.
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 654 transition count 570
Applied a total of 81 rules in 157 ms. Remains 654 /735 variables (removed 81) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 654 cols
[2024-05-31 22:31:42] [INFO ] Computed 288 invariants in 441 ms
[2024-05-31 22:31:47] [INFO ] Implicit Places using invariants in 5562 ms returned []
[2024-05-31 22:31:47] [INFO ] Invariant cache hit.
[2024-05-31 22:31:53] [INFO ] Implicit Places using invariants and state equation in 6183 ms returned []
Implicit Place search using SMT with State Equation took 11843 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-31 22:31:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/1224 variables, and 936 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30081 ms.
Refiners :[Domain max(s): 653/654 constraints, Generalized P Invariants (flows): 283/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 5/941 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/1224 variables, and 942 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30028 ms.
Refiners :[Domain max(s): 654/654 constraints, Generalized P Invariants (flows): 288/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 0/0 constraints]
After SMT, in 60777ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60821ms
Starting structural reductions in LTL mode, iteration 1 : 654/735 places, 570/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72886 ms. Remains : 654/735 places, 570/570 transitions.
Support contains 72 out of 654 places after structural reductions.
[2024-05-31 22:32:55] [INFO ] Flatten gal took : 231 ms
[2024-05-31 22:32:55] [INFO ] Flatten gal took : 131 ms
[2024-05-31 22:32:55] [INFO ] Input system was already deterministic with 570 transitions.
Support contains 70 out of 654 places (down from 72) after GAL structural reductions.
RANDOM walk for 19886 steps (120 resets) in 1179 ms. (16 steps per ms) remains 0/25 properties
Computed a total of 654 stabilizing places and 570 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 654 transition count 570
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' '!(X(X(X(F((!p0 U (p1||G(!p0))))))))'
Support contains 5 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 570/570 transitions.
Applied a total of 0 rules in 28 ms. Remains 654 /654 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2024-05-31 22:32:56] [INFO ] Invariant cache hit.
[2024-05-31 22:33:00] [INFO ] Implicit Places using invariants in 4074 ms returned []
[2024-05-31 22:33:00] [INFO ] Invariant cache hit.
[2024-05-31 22:33:07] [INFO ] Implicit Places using invariants and state equation in 6704 ms returned []
Implicit Place search using SMT with State Equation took 10783 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-31 22:33:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 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 Real declared 653/1224 variables, and 936 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30026 ms.
Refiners :[Domain max(s): 653/654 constraints, Generalized P Invariants (flows): 283/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 5/941 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/1224 variables, and 942 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30030 ms.
Refiners :[Domain max(s): 654/654 constraints, Generalized P Invariants (flows): 288/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 0/0 constraints]
After SMT, in 60389ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60401ms
Finished structural reductions in LTL mode , in 1 iterations and 71216 ms. Remains : 654/654 places, 570/570 transitions.
Stuttering acceptance computed with spot in 450 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Echo-PT-d02r09-LTLFireability-00
Product exploration explored 100000 steps with 14116 reset in 1204 ms.
Product exploration explored 100000 steps with 13637 reset in 756 ms.
Computed a total of 654 stabilizing places and 570 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 654 transition count 570
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r09-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r09-LTLFireability-00 finished in 74085 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)||G(F(p1)))))'
Support contains 4 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 570/570 transitions.
Graph (complete) has 1893 edges and 654 vertex of which 649 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.8 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 75 ms. Remains 648 /654 variables (removed 6) and now considering 568/570 (removed 2) transitions.
// Phase 1: matrix 568 rows 648 cols
[2024-05-31 22:34:10] [INFO ] Computed 284 invariants in 141 ms
[2024-05-31 22:34:15] [INFO ] Implicit Places using invariants in 4647 ms returned [93, 122, 125, 154]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4652 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 644/654 places, 568/570 transitions.
Applied a total of 0 rules in 77 ms. Remains 644 /644 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4807 ms. Remains : 644/654 places, 568/570 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Echo-PT-d02r09-LTLFireability-01
Product exploration explored 100000 steps with 643 reset in 978 ms.
Product exploration explored 100000 steps with 643 reset in 774 ms.
Computed a total of 644 stabilizing places and 568 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 644 transition count 568
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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 16 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r09-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r09-LTLFireability-01 finished in 7062 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||G(p1)) U X(!p2))))'
Support contains 6 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 570/570 transitions.
Applied a total of 0 rules in 12 ms. Remains 654 /654 variables (removed 0) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 654 cols
[2024-05-31 22:34:17] [INFO ] Computed 288 invariants in 112 ms
[2024-05-31 22:34:21] [INFO ] Implicit Places using invariants in 3994 ms returned []
[2024-05-31 22:34:21] [INFO ] Invariant cache hit.
[2024-05-31 22:34:29] [INFO ] Implicit Places using invariants and state equation in 7633 ms returned []
Implicit Place search using SMT with State Equation took 11633 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-31 22:34:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/1224 variables, and 936 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30033 ms.
Refiners :[Domain max(s): 653/654 constraints, Generalized P Invariants (flows): 283/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 5/941 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/1224 variables, and 942 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30026 ms.
Refiners :[Domain max(s): 654/654 constraints, Generalized P Invariants (flows): 288/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 0/0 constraints]
After SMT, in 60288ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60295ms
Finished structural reductions in LTL mode , in 1 iterations and 71942 ms. Remains : 654/654 places, 570/570 transitions.
Stuttering acceptance computed with spot in 349 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Running random walk in product with property : Echo-PT-d02r09-LTLFireability-02
Product exploration explored 100000 steps with 33392 reset in 711 ms.
Product exploration explored 100000 steps with 33242 reset in 670 ms.
Computed a total of 654 stabilizing places and 570 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 654 transition count 570
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 230 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 36872 steps (225 resets) in 1321 ms. (27 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND (OR (NOT p2) p0) (OR (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR (NOT p2) (NOT p1)))), (F p0)]
Knowledge based reduction with 20 factoid took 793 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 298 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Support contains 6 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 570/570 transitions.
Applied a total of 0 rules in 36 ms. Remains 654 /654 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2024-05-31 22:35:34] [INFO ] Invariant cache hit.
[2024-05-31 22:35:38] [INFO ] Implicit Places using invariants in 4741 ms returned []
[2024-05-31 22:35:38] [INFO ] Invariant cache hit.
[2024-05-31 22:35:46] [INFO ] Implicit Places using invariants and state equation in 8084 ms returned []
Implicit Place search using SMT with State Equation took 12836 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-31 22:35:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/1224 variables, and 936 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30031 ms.
Refiners :[Domain max(s): 653/654 constraints, Generalized P Invariants (flows): 283/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 5/941 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/1224 variables, and 942 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30026 ms.
Refiners :[Domain max(s): 654/654 constraints, Generalized P Invariants (flows): 288/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 0/0 constraints]
After SMT, in 60315ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60322ms
Finished structural reductions in LTL mode , in 1 iterations and 73195 ms. Remains : 654/654 places, 570/570 transitions.
Computed a total of 654 stabilizing places and 570 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 654 transition count 570
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p0 p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p2 p1)))), (X (NOT (AND p2 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p2 p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 237 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 38675 steps (236 resets) in 753 ms. (51 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p0 p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p2 p1)))), (X (NOT (AND p2 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p2 p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND (OR (NOT p2) p0) (OR (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR (NOT p2) (NOT p1)))), (F p0)]
Knowledge based reduction with 20 factoid took 780 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 294 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 305 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Product exploration explored 100000 steps with 33230 reset in 545 ms.
Product exploration explored 100000 steps with 33416 reset in 818 ms.
Applying partial POR strategy [false, true, false, true, true, true]
Stuttering acceptance computed with spot in 196 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Support contains 6 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 570/570 transitions.
Graph (complete) has 1893 edges and 654 vertex of which 649 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 61 ms. Remains 649 /654 variables (removed 5) and now considering 569/570 (removed 1) transitions.
[2024-05-31 22:36:52] [INFO ] Redundant transitions in 35 ms returned []
Running 568 sub problems to find dead transitions.
// Phase 1: matrix 569 rows 649 cols
[2024-05-31 22:36:52] [INFO ] Computed 284 invariants in 226 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 648/648 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/648 variables, 280/928 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 (/ 1.0 3.0))
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 (/ 2.0 3.0))
(s23 (/ 2.0 3.0))
(s24 (/ 2.0 3.0))
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 (/ 1.0 3.0))
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 (/ 2.0 3.0))
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 (/ 1.0 3.0))
(s54 (/ 1.0 3.0))
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 (/ 2.0 3.0))
(s59 0.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 1.0)
(s70 (/ 1.0 3.0))
(s71 (/ 1.0 3.0))
(s72 1.0)
(s73 (/ 1.0 3.0))
(s74 (/ 1.0 3.0))
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 (/ 2.0 3.0))
(s79 0.0)
(s80 1.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 1.0)
(s85 0.0)
(s86 (/ 2.0 3.0))
(s87 1.0)
(s88 0.0)
(s89 (/ 2.0 3.0))
(s90 1.0)
(s91 1.0)
(s92 (/ 2.0 3.0))
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 (/ 2.0 3.0))
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 (/ 2.0 3.0))
(s109 1.0)
(s110 1.0)
(s111 (/ 2.0 3.0))
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 (/ 2.0 3.0))
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 (/ 2.0 3.0))
(s129 (/ 2.0 3.0))
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 (/ 2.0 3.0))
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 (/ 2.0 3.0))
(s143 (/ 1.0 3.0))
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 (/ 1.0 3.0))
(s148 1.0)
(s149 0.0)
(s150 (/ 2.0 3.0))
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 (/ 2.0 3.0))
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 (/ 1.0 3.0))
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 (/ 2.0 3.0))
(s177 1.0)
(s178 1.0)
(s179 (/ 1.0 3.0))
(s180 1.0)
(s181 (/ 2.0 3.0))
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 1.0)
(s194 (/ 2.0 3.0))
(s195 0.0)
(s196 (/ 1.0 3.0))
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 (/ 1.0 3.0))
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 0.0)
(s208 (/ 1.0 3.0))
(s209 0.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 0.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 1.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 1.0)
(s228 (/ 2.0 3.0))
(s229 (/ 2.0 3.0))
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 (/ 1.0 6.0))
(s243 1.0)
(s244 (/ 5.0 6.0))
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 0.0)
(s251 1.0)
(s252 (/ 5.0 6.0))
(s253 (/ 5.0 6.0))
(s254 (/ 1.0 2.0))
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 1.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 0.0)
(s283 1.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 (/ 2.0 3.0))
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 (/ 1.0 3.0))
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 (/ 2.0 3.0))
(s342 1.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 (/ 1.0 3.0))
(s355 (/ 2.0 3.0))
(s356 0.0)
(s357 (/ 1.0 3.0))
(s358 (/ 2.0 3.0))
(s359 (/ 2.0 3.0))
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 (/ 2.0 3.0))
(s364 1.0)
(s365 1.0)
(s366 (/ 1.0 3.0))
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 (/ 2.0 3.0))
(s373 0.0)
(s374 (/ 2.0 3.0))
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 (/ 2.0 3.0))
(s390 0.0)
(s391 (/ 2.0 3.0))
(s392 1.0)
(s393 (/ 2.0 3.0))
(s394 1.0)
(s395 0.0)
(s396 (/ 1.0 3.0))
(s397 (/ 1.0 3.0))
(s398 1.0)
(s399 (/ 1.0 3.0))
(s400 0.0)
(s401 (/ 1.0 3.0))
(s402 0.0)
(s403 (/ 1.0 3.0))
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 (/ 2.0 3.0))
(s410 0.0)
(s411 (/ 1.0 3.0))
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 (/ 2.0 3.0))
(s416 0.0)
(s417 (/ 2.0 3.0))
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 (/ 1.0 3.0))
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 1.0)
(s434 0.0)
(s435 (/ 1.0 3.0))
(s436 (/ 2.0 3.0))
(s437 (/ 2.0 3.0))
(s438 0.0)
(s439 (/ 2.0 3.0))
(s440 (/ 1.0 3.0))
(s441 0.0)
(s442 0.0)
(s443 (/ 1.0 3.0))
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 1.0)
(s449 (/ 2.0 3.0))
(s450 (/ 2.0 3.0))
(s451 (/ 2.0 3.0))
(s452 (/ 2.0 3.0))
(s453 (/ 2.0 3.0))
(s454 0.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 (/ 1.0 3.0))
(s463 (/ 2.0 3.0))
(s464 0.0)
(s465 (/ 1.0 3.0))
(s466 (/ 2.0 3.0))
(s467 1.0)
(s468 0.0)
(s469 (/ 2.0 3.0))
(s470 (/ 1.0 3.0))
(s471 (/ 2.0 3.0))
(s472 0.0)
(s473 0.0)
(s474 (/ 1.0 3.0))
(s475 (/ 2.0 3.0))
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 (/ 2.0 3.0))
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 0.0)
(s487 1.0)
(s488 0.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 (/ 2.0 3.0))
(s496 (/ 1.0 6.0))
(s497 (/ 5.0 6.0))
(s498 (/ 1.0 3.0))
(s499 (/ 1.0 2.0))
(s500 0.0)
(s501 (/ 5.0 6.0))
(s502 0.0)
(s503 (/ 2.0 3.0))
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 (/ 1.0 3.0))
(s509 1.0)
(s510 0.0)
(s511 (/ 2.0 3.0))
(s512 1.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 1.0)
(s517 0.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 0.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 (/ 2.0 3.0))
(s534 (/ 5.0 6.0))
(s535 (/ 1.0 6.0))
(s536 0.0)
(s537 (/ 1.0 2.0))
(s538 1.0)
(s539 1.0)
(s540 0.0)
(s541 1.0)
(s542 1.0)
(s543 0.0)
(s544 1.0)
(s545 1.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 0.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 (/ 2.0 3.0))
(s572 1.0)
(s573 0.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 0.0)
(s580 (/ 2.0 3.0))
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 (/ 1.0 3.0))
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 (/ 1.0 3.0))
(s598 0.0)
(s599 (/ 1.0 3.0))
(s600 (/ 2.0 3.0))
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 (/ 1.0 3.0))
(s607 0.0)
(s608 (/ 1.0 3.0))
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 (/ 2.0 3.0))
(s618 1.0)
(s619 1.0)
(s620 0.0)
(s621 1.0)
(s622 1.0)
(s623 (/ 5.0 6.0))
(s624 (/ 5.0 6.0))
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 0.0)
(s632 0.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 0.0)
(s637 1.0)
(s638 1.0)
(s639 0.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/1218 variables, and 928 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30027 ms.
Refiners :[Domain max(s): 648/649 constraints, Generalized P Invariants (flows): 280/284 constraints, State Equation: 0/649 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 568 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 648/648 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/648 variables, 280/928 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/648 variables, 0/928 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 3 (OVERLAPS) 1/649 variables, 4/932 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/649 variables, 1/933 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 649/1218 variables, and 933 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30027 ms.
Refiners :[Domain max(s): 649/649 constraints, Generalized P Invariants (flows): 284/284 constraints, State Equation: 0/649 constraints, PredecessorRefiner: 0/568 constraints, Known Traps: 0/0 constraints]
After SMT, in 60455ms problems are : Problem set: 0 solved, 568 unsolved
Search for dead transitions found 0 dead transitions in 60462ms
Starting structural reductions in SI_LTL mode, iteration 1 : 649/654 places, 569/570 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60565 ms. Remains : 649/654 places, 569/570 transitions.
Support contains 6 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 570/570 transitions.
Applied a total of 0 rules in 29 ms. Remains 654 /654 variables (removed 0) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 654 cols
[2024-05-31 22:37:52] [INFO ] Computed 288 invariants in 168 ms
[2024-05-31 22:37:56] [INFO ] Implicit Places using invariants in 3899 ms returned []
[2024-05-31 22:37:56] [INFO ] Invariant cache hit.
[2024-05-31 22:38:04] [INFO ] Implicit Places using invariants and state equation in 7377 ms returned []
Implicit Place search using SMT with State Equation took 11277 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-31 22:38:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/1224 variables, and 936 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30021 ms.
Refiners :[Domain max(s): 653/654 constraints, Generalized P Invariants (flows): 283/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 5/941 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/1224 variables, and 942 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30023 ms.
Refiners :[Domain max(s): 654/654 constraints, Generalized P Invariants (flows): 288/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 0/0 constraints]
After SMT, in 60229ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60236ms
Finished structural reductions in LTL mode , in 1 iterations and 71545 ms. Remains : 654/654 places, 570/570 transitions.
Treatment of property Echo-PT-d02r09-LTLFireability-02 finished in 287035 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)&&X(G(p1))))'
Support contains 7 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 570/570 transitions.
Applied a total of 0 rules in 47 ms. Remains 654 /654 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2024-05-31 22:39:04] [INFO ] Invariant cache hit.
[2024-05-31 22:39:08] [INFO ] Implicit Places using invariants in 4315 ms returned []
[2024-05-31 22:39:08] [INFO ] Invariant cache hit.
[2024-05-31 22:39:16] [INFO ] Implicit Places using invariants and state equation in 7609 ms returned []
Implicit Place search using SMT with State Equation took 11929 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-31 22:39:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/1224 variables, and 936 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30024 ms.
Refiners :[Domain max(s): 653/654 constraints, Generalized P Invariants (flows): 283/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 5/941 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 0)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 1)
(s43 1)
(s44 0)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 0)
(s56 1)
(s57 1)
(s58 0)
(s59 0)
(s60 1)
(s61 1)
(s62 0)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 0)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 0)
(s88 0)
(s89 1)
(s90 1)
(s91 0)
(s92 1)
(s93 1)
(s94 1)
(s95 0)
(s96 1)
(s97 0)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 0)
(s104 0)
(s105 1)
(s106 1)
(s107 0)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 1)
(s119 1)
(s120 0)
(s121 1)
(s122 1)
(s123 1)
(s124 0)
(s125 1)
(s126 1)
(s127 1)
(s128 0)
(s129 1)
(s130 1)
(s131 1)
(s132 0)
(s133 0)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 0)
(s150 1)
(s151 1)
(s152 0)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 0)
(s164 0)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 0)
(s170 1)
(s171 1)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/1224 variables, and 942 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30026 ms.
Refiners :[Domain max(s): 654/654 constraints, Generalized P Invariants (flows): 288/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 0/0 constraints]
After SMT, in 60222ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60229ms
Finished structural reductions in LTL mode , in 1 iterations and 72206 ms. Remains : 654/654 places, 570/570 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d02r09-LTLFireability-04
Entered a terminal (fully accepting) state of product in 318 steps with 1 reset in 3 ms.
FORMULA Echo-PT-d02r09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r09-LTLFireability-04 finished in 72416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 8 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 570/570 transitions.
Graph (complete) has 1893 edges and 654 vertex of which 649 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 31 ms. Remains 648 /654 variables (removed 6) and now considering 568/570 (removed 2) transitions.
// Phase 1: matrix 568 rows 648 cols
[2024-05-31 22:40:17] [INFO ] Computed 284 invariants in 183 ms
[2024-05-31 22:40:20] [INFO ] Implicit Places using invariants in 3848 ms returned [93, 122, 125, 154]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3850 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 644/654 places, 568/570 transitions.
Applied a total of 0 rules in 26 ms. Remains 644 /644 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3908 ms. Remains : 644/654 places, 568/570 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r09-LTLFireability-06
Stuttering criterion allowed to conclude after 160 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d02r09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r09-LTLFireability-06 finished in 4060 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 4 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 570/570 transitions.
Graph (complete) has 1893 edges and 654 vertex of which 649 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 27 ms. Remains 648 /654 variables (removed 6) and now considering 568/570 (removed 2) transitions.
[2024-05-31 22:40:21] [INFO ] Invariant cache hit.
[2024-05-31 22:40:25] [INFO ] Implicit Places using invariants in 4507 ms returned [93, 122, 125, 154]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4508 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 644/654 places, 568/570 transitions.
Applied a total of 0 rules in 35 ms. Remains 644 /644 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4571 ms. Remains : 644/654 places, 568/570 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d02r09-LTLFireability-07
Product exploration explored 100000 steps with 621 reset in 1144 ms.
Product exploration explored 100000 steps with 621 reset in 810 ms.
Computed a total of 644 stabilizing places and 568 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 644 transition count 568
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 22 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r09-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r09-LTLFireability-07 finished in 7018 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((G(p0)&&X(F((p1||X(p2))))))))'
Support contains 8 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 570/570 transitions.
Applied a total of 0 rules in 8 ms. Remains 654 /654 variables (removed 0) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 654 cols
[2024-05-31 22:40:28] [INFO ] Computed 288 invariants in 169 ms
[2024-05-31 22:40:32] [INFO ] Implicit Places using invariants in 4045 ms returned []
[2024-05-31 22:40:32] [INFO ] Invariant cache hit.
[2024-05-31 22:40:38] [INFO ] Implicit Places using invariants and state equation in 6268 ms returned []
Implicit Place search using SMT with State Equation took 10314 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-31 22:40:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 0.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 0.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 0.0)
(s214 1.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 0.0)
(s222 1.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 1.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 1.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 1.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 0.0)
(s274 1.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 1.0)
(s289 0.0)
(s290 1.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 1.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 1.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 1.0)
(s353 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/1224 variables, and 936 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30029 ms.
Refiners :[Domain max(s): 653/654 constraints, Generalized P Invariants (flows): 283/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 5/941 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/1224 variables, and 942 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30027 ms.
Refiners :[Domain max(s): 654/654 constraints, Generalized P Invariants (flows): 288/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 0/0 constraints]
After SMT, in 60250ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60257ms
Finished structural reductions in LTL mode , in 1 iterations and 70584 ms. Remains : 654/654 places, 570/570 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Echo-PT-d02r09-LTLFireability-08
Stuttering criterion allowed to conclude after 162 steps with 0 reset in 3 ms.
FORMULA Echo-PT-d02r09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r09-LTLFireability-08 finished in 70879 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((X(G(p0))||(G(p2)&&p1))))'
Support contains 4 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 570/570 transitions.
Applied a total of 0 rules in 15 ms. Remains 654 /654 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2024-05-31 22:41:38] [INFO ] Invariant cache hit.
[2024-05-31 22:41:42] [INFO ] Implicit Places using invariants in 3979 ms returned []
[2024-05-31 22:41:42] [INFO ] Invariant cache hit.
[2024-05-31 22:41:48] [INFO ] Implicit Places using invariants and state equation in 5477 ms returned []
Implicit Place search using SMT with State Equation took 9460 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-31 22:41:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/1224 variables, and 936 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30023 ms.
Refiners :[Domain max(s): 653/654 constraints, Generalized P Invariants (flows): 283/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 5/941 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/1224 variables, and 942 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30025 ms.
Refiners :[Domain max(s): 654/654 constraints, Generalized P Invariants (flows): 288/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 0/0 constraints]
After SMT, in 60234ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Finished structural reductions in LTL mode , in 1 iterations and 69719 ms. Remains : 654/654 places, 570/570 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Echo-PT-d02r09-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d02r09-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r09-LTLFireability-09 finished in 69966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)&&p0))))'
Support contains 8 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 570/570 transitions.
Applied a total of 0 rules in 15 ms. Remains 654 /654 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2024-05-31 22:42:48] [INFO ] Invariant cache hit.
[2024-05-31 22:42:53] [INFO ] Implicit Places using invariants in 4515 ms returned []
[2024-05-31 22:42:53] [INFO ] Invariant cache hit.
[2024-05-31 22:42:59] [INFO ] Implicit Places using invariants and state equation in 6422 ms returned []
Implicit Place search using SMT with State Equation took 10940 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-31 22:42:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/1224 variables, and 936 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30023 ms.
Refiners :[Domain max(s): 653/654 constraints, Generalized P Invariants (flows): 283/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 5/941 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/1224 variables, and 942 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30025 ms.
Refiners :[Domain max(s): 654/654 constraints, Generalized P Invariants (flows): 288/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 0/0 constraints]
After SMT, in 60352ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60364ms
Finished structural reductions in LTL mode , in 1 iterations and 71321 ms. Remains : 654/654 places, 570/570 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Echo-PT-d02r09-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d02r09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r09-LTLFireability-11 finished in 71562 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))'
Support contains 6 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 570/570 transitions.
Graph (complete) has 1893 edges and 654 vertex of which 649 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 42 ms. Remains 648 /654 variables (removed 6) and now considering 568/570 (removed 2) transitions.
// Phase 1: matrix 568 rows 648 cols
[2024-05-31 22:44:00] [INFO ] Computed 284 invariants in 186 ms
[2024-05-31 22:44:05] [INFO ] Implicit Places using invariants in 5247 ms returned [93, 122, 125, 154]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 5250 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 644/654 places, 568/570 transitions.
Applied a total of 0 rules in 30 ms. Remains 644 /644 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5322 ms. Remains : 644/654 places, 568/570 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d02r09-LTLFireability-12
Stuttering criterion allowed to conclude after 160 steps with 0 reset in 2 ms.
FORMULA Echo-PT-d02r09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r09-LTLFireability-12 finished in 5406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&F(p1))))'
Support contains 6 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 570/570 transitions.
Applied a total of 0 rules in 13 ms. Remains 654 /654 variables (removed 0) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 654 cols
[2024-05-31 22:44:06] [INFO ] Computed 288 invariants in 151 ms
[2024-05-31 22:44:10] [INFO ] Implicit Places using invariants in 4331 ms returned []
[2024-05-31 22:44:10] [INFO ] Invariant cache hit.
[2024-05-31 22:44:16] [INFO ] Implicit Places using invariants and state equation in 5952 ms returned []
Implicit Place search using SMT with State Equation took 10285 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-31 22:44:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/1224 variables, and 936 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30021 ms.
Refiners :[Domain max(s): 653/654 constraints, Generalized P Invariants (flows): 283/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 5/941 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/1224 variables, and 942 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30025 ms.
Refiners :[Domain max(s): 654/654 constraints, Generalized P Invariants (flows): 288/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 0/0 constraints]
After SMT, in 60213ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60219ms
Finished structural reductions in LTL mode , in 1 iterations and 70519 ms. Remains : 654/654 places, 570/570 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r09-LTLFireability-13
Stuttering criterion allowed to conclude after 162 steps with 0 reset in 2 ms.
FORMULA Echo-PT-d02r09-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r09-LTLFireability-13 finished in 70711 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)&&X(F(p1)))))))'
Support contains 6 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 570/570 transitions.
Applied a total of 0 rules in 15 ms. Remains 654 /654 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2024-05-31 22:45:16] [INFO ] Invariant cache hit.
[2024-05-31 22:45:20] [INFO ] Implicit Places using invariants in 4219 ms returned []
[2024-05-31 22:45:20] [INFO ] Invariant cache hit.
[2024-05-31 22:45:26] [INFO ] Implicit Places using invariants and state equation in 5984 ms returned []
Implicit Place search using SMT with State Equation took 10208 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-31 22:45:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/1224 variables, and 936 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30020 ms.
Refiners :[Domain max(s): 653/654 constraints, Generalized P Invariants (flows): 283/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 5/941 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/1224 variables, and 942 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30023 ms.
Refiners :[Domain max(s): 654/654 constraints, Generalized P Invariants (flows): 288/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 0/0 constraints]
After SMT, in 60204ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60210ms
Finished structural reductions in LTL mode , in 1 iterations and 70435 ms. Remains : 654/654 places, 570/570 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r09-LTLFireability-14
Product exploration explored 100000 steps with 20000 reset in 806 ms.
Product exploration explored 100000 steps with 20000 reset in 700 ms.
Computed a total of 654 stabilizing places and 570 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 654 transition count 570
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 p0 p1), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r09-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r09-LTLFireability-14 finished in 72589 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||G(p1)) U X(!p2))))'
Found a Lengthening insensitive property : Echo-PT-d02r09-LTLFireability-02
Stuttering acceptance computed with spot in 183 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Support contains 6 out of 654 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 654/654 places, 570/570 transitions.
Graph (complete) has 1893 edges and 654 vertex of which 649 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 20 ms. Remains 648 /654 variables (removed 6) and now considering 568/570 (removed 2) transitions.
// Phase 1: matrix 568 rows 648 cols
[2024-05-31 22:46:29] [INFO ] Computed 284 invariants in 106 ms
[2024-05-31 22:46:32] [INFO ] Implicit Places using invariants in 3458 ms returned [93, 122, 125, 154]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3461 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 644/654 places, 568/570 transitions.
Applied a total of 0 rules in 17 ms. Remains 644 /644 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3498 ms. Remains : 644/654 places, 568/570 transitions.
Running random walk in product with property : Echo-PT-d02r09-LTLFireability-02
Product exploration explored 100000 steps with 33335 reset in 514 ms.
Product exploration explored 100000 steps with 33358 reset in 477 ms.
Computed a total of 644 stabilizing places and 568 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 644 transition count 568
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 238 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (248 resets) in 857 ms. (46 steps per ms) remains 1/10 properties
BEST_FIRST walk for 6853 steps (0 resets) in 104 ms. (65 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND (OR (NOT p2) p0) (OR (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR (NOT p2) (NOT p1)))), (F p0)]
Knowledge based reduction with 20 factoid took 776 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 249 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Support contains 6 out of 644 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 644/644 places, 568/568 transitions.
Applied a total of 0 rules in 13 ms. Remains 644 /644 variables (removed 0) and now considering 568/568 (removed 0) transitions.
// Phase 1: matrix 568 rows 644 cols
[2024-05-31 22:46:36] [INFO ] Computed 280 invariants in 169 ms
[2024-05-31 22:46:40] [INFO ] Implicit Places using invariants in 3815 ms returned []
[2024-05-31 22:46:40] [INFO ] Invariant cache hit.
[2024-05-31 22:46:44] [INFO ] Implicit Places using invariants and state equation in 3949 ms returned []
Implicit Place search using SMT with State Equation took 7774 ms to find 0 implicit places.
Running 564 sub problems to find dead transitions.
[2024-05-31 22:46:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 644/644 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/644 variables, 280/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/644 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 3 (OVERLAPS) 568/1212 variables, 644/1568 constraints. Problems are: Problem set: 0 solved, 564 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1212/1212 variables, and 1568 constraints, problems are : Problem set: 0 solved, 564 unsolved in 30025 ms.
Refiners :[Domain max(s): 644/644 constraints, Generalized P Invariants (flows): 280/280 constraints, State Equation: 644/644 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 564 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 644/644 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/644 variables, 280/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/644 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 3 (OVERLAPS) 568/1212 variables, 644/1568 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1212 variables, 564/2132 constraints. Problems are: Problem set: 0 solved, 564 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1212/1212 variables, and 2132 constraints, problems are : Problem set: 0 solved, 564 unsolved in 30021 ms.
Refiners :[Domain max(s): 644/644 constraints, Generalized P Invariants (flows): 280/280 constraints, State Equation: 644/644 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 0/0 constraints]
After SMT, in 60233ms problems are : Problem set: 0 solved, 564 unsolved
Search for dead transitions found 0 dead transitions in 60238ms
Finished structural reductions in LTL mode , in 1 iterations and 68027 ms. Remains : 644/644 places, 568/568 transitions.
Computed a total of 644 stabilizing places and 568 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 644 transition count 568
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p0 p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p2 p1)))), (X (NOT (AND p2 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p2 p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 175 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 36664 steps (227 resets) in 1220 ms. (30 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p0 p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p2 p1)))), (X (NOT (AND p2 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p2 p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND (OR (NOT p2) p0) (OR (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR (NOT p2) (NOT p1)))), (F p0)]
Knowledge based reduction with 20 factoid took 679 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 268 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 254 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Product exploration explored 100000 steps with 33240 reset in 679 ms.
Product exploration explored 100000 steps with 33550 reset in 487 ms.
Applying partial POR strategy [false, true, false, true, true, true]
Stuttering acceptance computed with spot in 184 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Support contains 6 out of 644 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 644/644 places, 568/568 transitions.
Applied a total of 0 rules in 20 ms. Remains 644 /644 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-31 22:47:48] [INFO ] Redundant transitions in 14 ms returned []
Running 564 sub problems to find dead transitions.
[2024-05-31 22:47:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 644/644 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/644 variables, 280/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/644 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 3 (OVERLAPS) 568/1212 variables, 644/1568 constraints. Problems are: Problem set: 0 solved, 564 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1212/1212 variables, and 1568 constraints, problems are : Problem set: 0 solved, 564 unsolved in 30027 ms.
Refiners :[Domain max(s): 644/644 constraints, Generalized P Invariants (flows): 280/280 constraints, State Equation: 644/644 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 564 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 644/644 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/644 variables, 280/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/644 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 3 (OVERLAPS) 568/1212 variables, 644/1568 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1212 variables, 564/2132 constraints. Problems are: Problem set: 0 solved, 564 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1212/1212 variables, and 2132 constraints, problems are : Problem set: 0 solved, 564 unsolved in 30023 ms.
Refiners :[Domain max(s): 644/644 constraints, Generalized P Invariants (flows): 280/280 constraints, State Equation: 644/644 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 0/0 constraints]
After SMT, in 60285ms problems are : Problem set: 0 solved, 564 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60333 ms. Remains : 644/644 places, 568/568 transitions.
Support contains 6 out of 644 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 644/644 places, 568/568 transitions.
Applied a total of 0 rules in 8 ms. Remains 644 /644 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-31 22:48:49] [INFO ] Invariant cache hit.
[2024-05-31 22:48:53] [INFO ] Implicit Places using invariants in 4262 ms returned []
[2024-05-31 22:48:53] [INFO ] Invariant cache hit.
[2024-05-31 22:48:58] [INFO ] Implicit Places using invariants and state equation in 5092 ms returned []
Implicit Place search using SMT with State Equation took 9359 ms to find 0 implicit places.
Running 564 sub problems to find dead transitions.
[2024-05-31 22:48:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 644/644 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/644 variables, 280/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/644 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 3 (OVERLAPS) 568/1212 variables, 644/1568 constraints. Problems are: Problem set: 0 solved, 564 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1212/1212 variables, and 1568 constraints, problems are : Problem set: 0 solved, 564 unsolved in 30017 ms.
Refiners :[Domain max(s): 644/644 constraints, Generalized P Invariants (flows): 280/280 constraints, State Equation: 644/644 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 564 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 644/644 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/644 variables, 280/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/644 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 3 (OVERLAPS) 568/1212 variables, 644/1568 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1212 variables, 564/2132 constraints. Problems are: Problem set: 0 solved, 564 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1212/1212 variables, and 2132 constraints, problems are : Problem set: 0 solved, 564 unsolved in 30020 ms.
Refiners :[Domain max(s): 644/644 constraints, Generalized P Invariants (flows): 280/280 constraints, State Equation: 644/644 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 0/0 constraints]
After SMT, in 60309ms problems are : Problem set: 0 solved, 564 unsolved
Search for dead transitions found 0 dead transitions in 60318ms
Finished structural reductions in LTL mode , in 1 iterations and 69688 ms. Remains : 644/644 places, 568/568 transitions.
Treatment of property Echo-PT-d02r09-LTLFireability-02 finished in 209775 ms.
[2024-05-31 22:49:59] [INFO ] Flatten gal took : 60 ms
[2024-05-31 22:49:59] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-31 22:49:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 654 places, 570 transitions and 2935 arcs took 17 ms.
Total runtime 1098423 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Echo-PT-d02r09-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717195800169

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name Echo-PT-d02r09-LTLFireability-02
ltl formula formula --ltl=/tmp/1524/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 654 places, 570 transitions and 2935 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.200 real 0.020 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1524/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1524/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1524/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1524/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 656 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 655, there are 603 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~163!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 342
pnml2lts-mc( 0/ 4): unique states count: 801
pnml2lts-mc( 0/ 4): unique transitions count: 18669
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 66
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 808
pnml2lts-mc( 0/ 4): - cum. max stack depth: 465
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 808 states 18703 transitions, fanout: 23.147
pnml2lts-mc( 0/ 4): Total exploration time 0.150 sec (0.140 sec minimum, 0.148 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5387, Transitions per second: 124687
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.7MB, 47.5 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 582 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.7MB (~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="Echo-PT-d02r09"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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