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.r158-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 itstools
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 r158-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 1716428980878

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d02r09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-23 01:49:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 01:49:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 01:49:43] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2024-05-23 01:49:43] [INFO ] Transformed 735 places.
[2024-05-23 01:49:43] [INFO ] Transformed 570 transitions.
[2024-05-23 01:49:43] [INFO ] Found NUPN structural information;
[2024-05-23 01:49:43] [INFO ] Parsed PT model containing 735 places and 570 transitions and 3220 arcs in 443 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 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 270 ms. Remains 654 /735 variables (removed 81) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 654 cols
[2024-05-23 01:49:44] [INFO ] Computed 288 invariants in 263 ms
[2024-05-23 01:49:50] [INFO ] Implicit Places using invariants in 5654 ms returned []
[2024-05-23 01:49:50] [INFO ] Invariant cache hit.
[2024-05-23 01:49:56] [INFO ] Implicit Places using invariants and state equation in 6913 ms returned []
Implicit Place search using SMT with State Equation took 12642 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-23 01:49:57] [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 30063 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 30035 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 60752ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60805ms
Starting structural reductions in LTL mode, iteration 1 : 654/735 places, 570/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73773 ms. Remains : 654/735 places, 570/570 transitions.
Support contains 72 out of 654 places after structural reductions.
[2024-05-23 01:50:58] [INFO ] Flatten gal took : 236 ms
[2024-05-23 01:50:58] [INFO ] Flatten gal took : 129 ms
[2024-05-23 01:50:58] [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 33065 steps (201 resets) in 1884 ms. (17 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 36 ms. Remains 654 /654 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2024-05-23 01:50:59] [INFO ] Invariant cache hit.
[2024-05-23 01:51:03] [INFO ] Implicit Places using invariants in 4082 ms returned []
[2024-05-23 01:51:03] [INFO ] Invariant cache hit.
[2024-05-23 01:51:11] [INFO ] Implicit Places using invariants and state equation in 7145 ms returned []
Implicit Place search using SMT with State Equation took 11235 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-23 01:51:11] [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
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
SMT process timed out in 30477ms, After SMT, problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 30489ms
Finished structural reductions in LTL mode , in 1 iterations and 41763 ms. Remains : 654/654 places, 570/570 transitions.
Stuttering acceptance computed with spot in 551 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 13821 reset in 933 ms.
Product exploration explored 100000 steps with 14026 reset in 849 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 22 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 44672 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-23 01:51:44] [INFO ] Computed 284 invariants in 213 ms
[2024-05-23 01:51:47] [INFO ] Implicit Places using invariants in 3455 ms returned [93, 122, 125, 154]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3463 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 73 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 3613 ms. Remains : 644/654 places, 568/570 transitions.
Stuttering acceptance computed with spot in 123 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 645 reset in 1140 ms.
Product exploration explored 100000 steps with 652 reset in 803 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 6050 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 10 ms. Remains 654 /654 variables (removed 0) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 654 cols
[2024-05-23 01:51:50] [INFO ] Computed 288 invariants in 112 ms
[2024-05-23 01:51:53] [INFO ] Implicit Places using invariants in 3263 ms returned []
[2024-05-23 01:51:53] [INFO ] Invariant cache hit.
[2024-05-23 01:52:00] [INFO ] Implicit Places using invariants and state equation in 7038 ms returned []
Implicit Place search using SMT with State Equation took 10304 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-23 01:52:00] [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
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
SMT process timed out in 30260ms, After SMT, problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 30270ms
Finished structural reductions in LTL mode , in 1 iterations and 40587 ms. Remains : 654/654 places, 570/570 transitions.
Stuttering acceptance computed with spot in 296 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 33419 reset in 745 ms.
Product exploration explored 100000 steps with 33295 reset in 546 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 233 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 307 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 32498 steps (198 resets) in 903 ms. (35 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 803 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 293 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 312 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 17 ms. Remains 654 /654 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2024-05-23 01:52:35] [INFO ] Invariant cache hit.
[2024-05-23 01:52:39] [INFO ] Implicit Places using invariants in 4427 ms returned []
[2024-05-23 01:52:39] [INFO ] Invariant cache hit.
[2024-05-23 01:52:46] [INFO ] Implicit Places using invariants and state equation in 6337 ms returned []
Implicit Place search using SMT with State Equation took 10772 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-23 01:52: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 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
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 0)
(s12 0)
(s13 1)
(s14 1)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 0)
(s24 1)
(s25 1)
(s26 1)
(s27 0)
(s28 1)
(s29 1)
(s30 1)
(s31 0)
(s32 1)
(s33 1)
(s34 1)
(s35 0)
(s36 0)
(s37 1)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 1)
(s51 0)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 0)
(s60 1)
(s61 1)
(s62 0)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 0)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 0)
(s81 1)
(s82 1)
(s83 1)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 1)
(s93 1)
(s94 1)
(s95 0)
(s96 1)
(s97 1)
(s98 1)
(s99 0)
(s100 1)
(s101 1)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 1)
(s109 0)
(s110 0)
(s111 1)
(s112 1)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 0)
(s133 1)
(s134 1)
(s135 1)
(s136 0)
(s137 1)
(s138 1)
(s139 0)
(s140 0)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 0)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 1)
(s165 1)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 1)
(s186 1)
(s187 0)
(s188 0)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 0)
(s203 0)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 0)
(s237 0)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 0)
(s265 0)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 0)
(s274 1)
(s275 1)
(s276 0)
(s277 1)
(s278 1)
(s279 0)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 0)
(s294 0)
(s295 1)
(s296 0)
(s297 1)
(s298 1)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 1)
(s306 1)
(s307 0)
(s308 1)
(s309 1)
(s310 0)
(s311 1)
(s312 0)
(s313 1)
(s314 0)
(s315 1)
(s316 0)
(s317 1)
(s318 0)
(s319 1)
(s320 0)
(s321 1)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 1)
(s329 1)
(s330 0)
(s331 1)
(s332 1)
(s333 0)
(s334 0)
(s335 0)
(s336 1)
(s337 0)
(s338 0)
(s339 1)
(s340 0)
(s341 1)
(s342 0)
(s343 1)
(s344 0)
(s345 1)
(s346 0)
(s347 1)
(s348 0)
(s349 1)
(s350 1)
(s351 0)
(s352 0)
(s353 1)
(s354 1)
(s355 0)
(s356 0)
(s357 0)
(s358 1)
(s359 0)
(s360 0)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 0)
(s368 1)
(s369 1)
(s370 0)
(s371 0)
(s372 0)
(s373 1)
(s374 0)
(s375 1)
(s376 0)
(s377 0)
(s378 0)
(s379 1)
(s380 0)
(s381 0)
(s382 0)
(s383 1)
(s384 0)
(s385 0)
(s386 0)
(s387 1)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 1)
(s398 1)
(s399 1)
(s400 0)
(s401 1)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 1)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 1)
(s417 0)
(s418 0)
(s419 0)
(s420 timeout
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 30034 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 60282ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60289ms
Finished structural reductions in LTL mode , in 1 iterations and 71079 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 218 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 230 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 (244 resets) in 553 ms. (72 steps per ms) remains 1/10 properties
BEST_FIRST walk for 8065 steps (0 resets) in 121 ms. (66 steps per ms) remains 0/1 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 633 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 275 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 257 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Product exploration explored 100000 steps with 33602 reset in 673 ms.
Product exploration explored 100000 steps with 33276 reset in 502 ms.
Applying partial POR strategy [false, true, false, true, true, true]
Stuttering acceptance computed with spot in 243 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.8 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 66 ms. Remains 649 /654 variables (removed 5) and now considering 569/570 (removed 1) transitions.
[2024-05-23 01:53:50] [INFO ] Redundant transitions in 39 ms returned []
Running 568 sub problems to find dead transitions.
// Phase 1: matrix 569 rows 649 cols
[2024-05-23 01:53:51] [INFO ] Computed 284 invariants in 138 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: (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 30026 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 60424ms problems are : Problem set: 0 solved, 568 unsolved
Search for dead transitions found 0 dead transitions in 60431ms
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 60544 ms. Remains : 649/654 places, 569/570 transitions.
Built C files in :
/tmp/ltsmin12981593023026142818
[2024-05-23 01:54:51] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12981593023026142818
Running compilation step : cd /tmp/ltsmin12981593023026142818;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2782 ms.
Running link step : cd /tmp/ltsmin12981593023026142818;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin12981593023026142818;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3430590572217659250.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 20 ms. Remains 654 /654 variables (removed 0) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 654 cols
[2024-05-23 01:55:06] [INFO ] Computed 288 invariants in 108 ms
[2024-05-23 01:55:10] [INFO ] Implicit Places using invariants in 3637 ms returned []
[2024-05-23 01:55:10] [INFO ] Invariant cache hit.
[2024-05-23 01:55:16] [INFO ] Implicit Places using invariants and state equation in 6457 ms returned []
Implicit Place search using SMT with State Equation took 10098 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-23 01:55: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 30017 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 60235ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60242ms
Finished structural reductions in LTL mode , in 1 iterations and 70361 ms. Remains : 654/654 places, 570/570 transitions.
Built C files in :
/tmp/ltsmin1931978654720736401
[2024-05-23 01:56:16] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1931978654720736401
Running compilation step : cd /tmp/ltsmin1931978654720736401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2621 ms.
Running link step : cd /tmp/ltsmin1931978654720736401;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1931978654720736401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4723022718272810867.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 01:56:32] [INFO ] Flatten gal took : 55 ms
[2024-05-23 01:56:32] [INFO ] Flatten gal took : 52 ms
[2024-05-23 01:56:32] [INFO ] Time to serialize gal into /tmp/LTL14960986988049743492.gal : 11 ms
[2024-05-23 01:56:32] [INFO ] Time to serialize properties into /tmp/LTL4277055552841181239.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14960986988049743492.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18287269386035368233.hoa' '-atoms' '/tmp/LTL4277055552841181239.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4277055552841181239.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18287269386035368233.hoa
Detected timeout of ITS tools.
[2024-05-23 01:56:47] [INFO ] Flatten gal took : 47 ms
[2024-05-23 01:56:47] [INFO ] Flatten gal took : 42 ms
[2024-05-23 01:56:47] [INFO ] Time to serialize gal into /tmp/LTL13243742829114920493.gal : 10 ms
[2024-05-23 01:56:47] [INFO ] Time to serialize properties into /tmp/LTL2166410418317201819.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13243742829114920493.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2166410418317201819.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(((!("((p239==1)&&(p698==1))"))||(G("((p141==1)&&(p674==1))")))U(X(!("((p658==1)&&(p87==1))"))))))
Formula 0 simplified : F(("((p239==1)&&(p698==1))" & F!"((p141==1)&&(p674==1))") R X"((p658==1)&&(p87==1))")
Detected timeout of ITS tools.
[2024-05-23 01:57:02] [INFO ] Flatten gal took : 41 ms
[2024-05-23 01:57:02] [INFO ] Applying decomposition
[2024-05-23 01:57:02] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10356171697705710201.txt' '-o' '/tmp/graph10356171697705710201.bin' '-w' '/tmp/graph10356171697705710201.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10356171697705710201.bin' '-l' '-1' '-v' '-w' '/tmp/graph10356171697705710201.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:57:02] [INFO ] Decomposing Gal with order
[2024-05-23 01:57:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:57:03] [INFO ] Removed a total of 677 redundant transitions.
[2024-05-23 01:57:03] [INFO ] Flatten gal took : 235 ms
[2024-05-23 01:57:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 111 ms.
[2024-05-23 01:57:03] [INFO ] Time to serialize gal into /tmp/LTL5060196880446335235.gal : 27 ms
[2024-05-23 01:57:03] [INFO ] Time to serialize properties into /tmp/LTL14136416617772027915.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5060196880446335235.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14136416617772027915.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(((!("((i2.i1.u38.p239==1)&&(i2.i1.u38.p698==1))"))||(G("((i8.u102.p141==1)&&(i8.u102.p674==1))")))U(X(!("((i8.u105.p658==1)&&(i8....175
Formula 0 simplified : F(("((i2.i1.u38.p239==1)&&(i2.i1.u38.p698==1))" & F!"((i8.u102.p141==1)&&(i8.u102.p674==1))") R X"((i8.u105.p658==1)&&(i8.u103.p87==...160
Detected timeout of ITS tools.
Treatment of property Echo-PT-d02r09-LTLFireability-02 finished in 328195 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 13 ms. Remains 654 /654 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2024-05-23 01:57:18] [INFO ] Invariant cache hit.
[2024-05-23 01:57:22] [INFO ] Implicit Places using invariants in 4063 ms returned []
[2024-05-23 01:57:22] [INFO ] Invariant cache hit.
[2024-05-23 01:57:30] [INFO ] Implicit Places using invariants and state equation in 7782 ms returned []
Implicit Place search using SMT with State Equation took 11858 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-23 01:57:30] [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 0.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 0.0)
(s149 1.0)
(s150 1.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 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 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 30028 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 60335ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60344ms
Finished structural reductions in LTL mode , in 1 iterations and 72218 ms. Remains : 654/654 places, 570/570 transitions.
Stuttering acceptance computed with spot in 209 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 17 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d02r09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r09-LTLFireability-04 finished in 72457 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.7 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 50 ms. Remains 648 /654 variables (removed 6) and now considering 568/570 (removed 2) transitions.
// Phase 1: matrix 568 rows 648 cols
[2024-05-23 01:58:31] [INFO ] Computed 284 invariants in 193 ms
[2024-05-23 01:58:34] [INFO ] Implicit Places using invariants in 3496 ms returned [93, 122, 125, 154]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3501 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 27 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 3579 ms. Remains : 644/654 places, 568/570 transitions.
Stuttering acceptance computed with spot in 156 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 2 ms.
FORMULA Echo-PT-d02r09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r09-LTLFireability-06 finished in 3762 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.9 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 51 ms. Remains 648 /654 variables (removed 6) and now considering 568/570 (removed 2) transitions.
[2024-05-23 01:58:34] [INFO ] Invariant cache hit.
[2024-05-23 01:58:39] [INFO ] Implicit Places using invariants in 4424 ms returned [93, 122, 125, 154]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4427 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 24 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 4503 ms. Remains : 644/654 places, 568/570 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d02r09-LTLFireability-07
Product exploration explored 100000 steps with 621 reset in 800 ms.
Product exploration explored 100000 steps with 621 reset in 862 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 20 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 6599 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 15 ms. Remains 654 /654 variables (removed 0) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 654 cols
[2024-05-23 01:58:41] [INFO ] Computed 288 invariants in 110 ms
[2024-05-23 01:58:45] [INFO ] Implicit Places using invariants in 4401 ms returned []
[2024-05-23 01:58:45] [INFO ] Invariant cache hit.
[2024-05-23 01:58:52] [INFO ] Implicit Places using invariants and state equation in 6965 ms returned []
Implicit Place search using SMT with State Equation took 11369 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-23 01:58:52] [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 30036 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 30039 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 60287ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60294ms
Finished structural reductions in LTL mode , in 1 iterations and 71683 ms. Remains : 654/654 places, 570/570 transitions.
Stuttering acceptance computed with spot in 277 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 2 ms.
FORMULA Echo-PT-d02r09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r09-LTLFireability-08 finished in 71984 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 11 ms. Remains 654 /654 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2024-05-23 01:59:53] [INFO ] Invariant cache hit.
[2024-05-23 01:59:57] [INFO ] Implicit Places using invariants in 3745 ms returned []
[2024-05-23 01:59:57] [INFO ] Invariant cache hit.
[2024-05-23 02:00:03] [INFO ] Implicit Places using invariants and state equation in 6383 ms returned []
Implicit Place search using SMT with State Equation took 10131 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-23 02:00:03] [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 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 60288ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60296ms
Finished structural reductions in LTL mode , in 1 iterations and 70444 ms. Remains : 654/654 places, 570/570 transitions.
Stuttering acceptance computed with spot in 247 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 70719 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-23 02:01:04] [INFO ] Invariant cache hit.
[2024-05-23 02:01:08] [INFO ] Implicit Places using invariants in 4458 ms returned []
[2024-05-23 02:01:08] [INFO ] Invariant cache hit.
[2024-05-23 02:01:15] [INFO ] Implicit Places using invariants and state equation in 6708 ms returned []
Implicit Place search using SMT with State Equation took 11197 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-23 02:01:15] [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
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
SMT process timed out in 30342ms, After SMT, problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 30354ms
Finished structural reductions in LTL mode , in 1 iterations and 41568 ms. Remains : 654/654 places, 570/570 transitions.
Stuttering acceptance computed with spot in 239 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 0 ms.
FORMULA Echo-PT-d02r09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r09-LTLFireability-11 finished in 41831 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.7 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 73 ms. Remains 648 /654 variables (removed 6) and now considering 568/570 (removed 2) transitions.
// Phase 1: matrix 568 rows 648 cols
[2024-05-23 02:01:46] [INFO ] Computed 284 invariants in 183 ms
[2024-05-23 02:01:50] [INFO ] Implicit Places using invariants in 4642 ms returned [93, 122, 125, 154]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4653 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 4756 ms. Remains : 644/654 places, 568/570 transitions.
Stuttering acceptance computed with spot in 51 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 4832 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 15 ms. Remains 654 /654 variables (removed 0) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 654 cols
[2024-05-23 02:01:50] [INFO ] Computed 288 invariants in 110 ms
[2024-05-23 02:01:54] [INFO ] Implicit Places using invariants in 4101 ms returned []
[2024-05-23 02:01:54] [INFO ] Invariant cache hit.
[2024-05-23 02:02:02] [INFO ] Implicit Places using invariants and state equation in 7093 ms returned []
Implicit Place search using SMT with State Equation took 11200 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-23 02:02:02] [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 30037 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 30019 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 60256ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60263ms
Finished structural reductions in LTL mode , in 1 iterations and 71479 ms. Remains : 654/654 places, 570/570 transitions.
Stuttering acceptance computed with spot in 150 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 71659 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 12 ms. Remains 654 /654 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2024-05-23 02:03:02] [INFO ] Invariant cache hit.
[2024-05-23 02:03:06] [INFO ] Implicit Places using invariants in 4309 ms returned []
[2024-05-23 02:03:06] [INFO ] Invariant cache hit.
[2024-05-23 02:03:12] [INFO ] Implicit Places using invariants and state equation in 5604 ms returned []
Implicit Place search using SMT with State Equation took 9918 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-23 02:03:12] [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
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
SMT process timed out in 30185ms, After SMT, problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 30191ms
Finished structural reductions in LTL mode , in 1 iterations and 40123 ms. Remains : 654/654 places, 570/570 transitions.
Stuttering acceptance computed with spot in 329 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 881 ms.
Product exploration explored 100000 steps with 20000 reset in 765 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 156 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 42678 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 331 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 40 ms. Remains 648 /654 variables (removed 6) and now considering 568/570 (removed 2) transitions.
// Phase 1: matrix 568 rows 648 cols
[2024-05-23 02:03:45] [INFO ] Computed 284 invariants in 181 ms
[2024-05-23 02:03:49] [INFO ] Implicit Places using invariants in 4089 ms returned [93, 122, 125, 154]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4092 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 24 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 4158 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 501 ms.
Product exploration explored 100000 steps with 33433 reset in 826 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 150 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 335 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 36504 steps (226 resets) in 826 ms. (44 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 794 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 257 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 267 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 15 ms. Remains 644 /644 variables (removed 0) and now considering 568/568 (removed 0) transitions.
// Phase 1: matrix 568 rows 644 cols
[2024-05-23 02:03:53] [INFO ] Computed 280 invariants in 181 ms
[2024-05-23 02:03:57] [INFO ] Implicit Places using invariants in 3800 ms returned []
[2024-05-23 02:03:57] [INFO ] Invariant cache hit.
[2024-05-23 02:04:02] [INFO ] Implicit Places using invariants and state equation in 5318 ms returned []
Implicit Place search using SMT with State Equation took 9147 ms to find 0 implicit places.
Running 564 sub problems to find dead transitions.
[2024-05-23 02:04:02] [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 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 60324ms problems are : Problem set: 0 solved, 564 unsolved
Search for dead transitions found 0 dead transitions in 60334ms
Finished structural reductions in LTL mode , in 1 iterations and 69497 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 245 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 304 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 502 ms. (79 steps per ms) remains 1/10 properties
BEST_FIRST walk for 7900 steps (0 resets) in 105 ms. (74 steps per ms) remains 0/1 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 714 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 268 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 277 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 285 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Product exploration explored 100000 steps with 33355 reset in 751 ms.
Product exploration explored 100000 steps with 33313 reset in 520 ms.
Applying partial POR strategy [false, true, false, true, true, true]
Stuttering acceptance computed with spot in 217 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 16 ms. Remains 644 /644 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-23 02:05:07] [INFO ] Redundant transitions in 14 ms returned []
Running 564 sub problems to find dead transitions.
[2024-05-23 02:05:07] [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 60331ms problems are : Problem set: 0 solved, 564 unsolved
Search for dead transitions found 0 dead transitions in 60337ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60384 ms. Remains : 644/644 places, 568/568 transitions.
Built C files in :
/tmp/ltsmin13937352329211954420
[2024-05-23 02:06:07] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13937352329211954420
Running compilation step : cd /tmp/ltsmin13937352329211954420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2188 ms.
Running link step : cd /tmp/ltsmin13937352329211954420;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13937352329211954420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11455045726173988849.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 9 ms. Remains 644 /644 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-23 02:06:23] [INFO ] Invariant cache hit.
[2024-05-23 02:06:25] [INFO ] Implicit Places using invariants in 2928 ms returned []
[2024-05-23 02:06:25] [INFO ] Invariant cache hit.
[2024-05-23 02:06:29] [INFO ] Implicit Places using invariants and state equation in 3846 ms returned []
Implicit Place search using SMT with State Equation took 6776 ms to find 0 implicit places.
Running 564 sub problems to find dead transitions.
[2024-05-23 02:06:29] [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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30026 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 30026 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 60236ms problems are : Problem set: 0 solved, 564 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Finished structural reductions in LTL mode , in 1 iterations and 67029 ms. Remains : 644/644 places, 568/568 transitions.
Built C files in :
/tmp/ltsmin9349801507111061707
[2024-05-23 02:07:30] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9349801507111061707
Running compilation step : cd /tmp/ltsmin9349801507111061707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2192 ms.
Running link step : cd /tmp/ltsmin9349801507111061707;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9349801507111061707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1053281747085489037.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 02:07:45] [INFO ] Flatten gal took : 32 ms
[2024-05-23 02:07:45] [INFO ] Flatten gal took : 32 ms
[2024-05-23 02:07:45] [INFO ] Time to serialize gal into /tmp/LTL12440606736766341693.gal : 7 ms
[2024-05-23 02:07:45] [INFO ] Time to serialize properties into /tmp/LTL17654352927058082492.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12440606736766341693.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15765467554108260821.hoa' '-atoms' '/tmp/LTL17654352927058082492.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17654352927058082492.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15765467554108260821.hoa
Detected timeout of ITS tools.
[2024-05-23 02:08:00] [INFO ] Flatten gal took : 47 ms
[2024-05-23 02:08:00] [INFO ] Flatten gal took : 46 ms
[2024-05-23 02:08:00] [INFO ] Time to serialize gal into /tmp/LTL6116781487407052349.gal : 10 ms
[2024-05-23 02:08:00] [INFO ] Time to serialize properties into /tmp/LTL18263972435635565042.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6116781487407052349.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18263972435635565042.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(((!("((p239==1)&&(p698==1))"))||(G("((p141==1)&&(p674==1))")))U(X(!("((p658==1)&&(p87==1))"))))))
Formula 0 simplified : F(("((p239==1)&&(p698==1))" & F!"((p141==1)&&(p674==1))") R X"((p658==1)&&(p87==1))")
Detected timeout of ITS tools.
[2024-05-23 02:08:15] [INFO ] Flatten gal took : 48 ms
[2024-05-23 02:08:15] [INFO ] Applying decomposition
[2024-05-23 02:08:15] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5785618955954798532.txt' '-o' '/tmp/graph5785618955954798532.bin' '-w' '/tmp/graph5785618955954798532.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5785618955954798532.bin' '-l' '-1' '-v' '-w' '/tmp/graph5785618955954798532.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:08:15] [INFO ] Decomposing Gal with order
[2024-05-23 02:08:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:08:15] [INFO ] Removed a total of 702 redundant transitions.
[2024-05-23 02:08:15] [INFO ] Flatten gal took : 107 ms
[2024-05-23 02:08:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 42 ms.
[2024-05-23 02:08:16] [INFO ] Time to serialize gal into /tmp/LTL7713097953464478786.gal : 19 ms
[2024-05-23 02:08:16] [INFO ] Time to serialize properties into /tmp/LTL9732183021311380014.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7713097953464478786.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9732183021311380014.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(((!("((i3.u44.p239==1)&&(i3.u55.p698==1))"))||(G("((i10.i0.u16.p141==1)&&(i10.i0.u6.p674==1))")))U(X(!("((i10.i1.u113.p658==1)&&(...182
Formula 0 simplified : F(("((i3.u44.p239==1)&&(i3.u55.p698==1))" & F!"((i10.i0.u16.p141==1)&&(i10.i0.u6.p674==1))") R X"((i10.i1.u113.p658==1)&&(i10.i1.u11...167
Detected timeout of ITS tools.
Treatment of property Echo-PT-d02r09-LTLFireability-02 finished in 286006 ms.
[2024-05-23 02:08:31] [INFO ] Flatten gal took : 42 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14100042613356101144
[2024-05-23 02:08:31] [INFO ] Computing symmetric may disable matrix : 570 transitions.
[2024-05-23 02:08:31] [INFO ] Applying decomposition
[2024-05-23 02:08:31] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:08:31] [INFO ] Computing symmetric may enable matrix : 570 transitions.
[2024-05-23 02:08:31] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:08:31] [INFO ] Flatten gal took : 44 ms
[2024-05-23 02:08:31] [INFO ] Computing Do-Not-Accords matrix : 570 transitions.
[2024-05-23 02:08:31] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5916052664659693120.txt' '-o' '/tmp/graph5916052664659693120.bin' '-w' '/tmp/graph5916052664659693120.weights'
[2024-05-23 02:08:31] [INFO ] Built C files in 183ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14100042613356101144
Running compilation step : cd /tmp/ltsmin14100042613356101144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5916052664659693120.bin' '-l' '-1' '-v' '-w' '/tmp/graph5916052664659693120.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:08:31] [INFO ] Decomposing Gal with order
[2024-05-23 02:08:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:08:31] [INFO ] Removed a total of 640 redundant transitions.
[2024-05-23 02:08:31] [INFO ] Flatten gal took : 130 ms
[2024-05-23 02:08:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 18 ms.
[2024-05-23 02:08:31] [INFO ] Time to serialize gal into /tmp/LTLFireability2117278474226457968.gal : 16 ms
[2024-05-23 02:08:31] [INFO ] Time to serialize properties into /tmp/LTLFireability18280413465518028877.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2117278474226457968.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18280413465518028877.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(((!("((i1.i1.u84.p239==1)&&(i1.i1.u84.p698==1))"))||(G("((i2.i0.u12.p141==1)&&(i2.i0.u4.p674==1))")))U(X(!("((i8.i1.u95.p658==1)&...182
Formula 0 simplified : F(("((i1.i1.u84.p239==1)&&(i1.i1.u84.p698==1))" & F!"((i2.i0.u12.p141==1)&&(i2.i0.u4.p674==1))") R X"((i8.i1.u95.p658==1)&&(i8.i0.u9...167
Compilation finished in 3201 ms.
Running link step : cd /tmp/ltsmin14100042613356101144;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin14100042613356101144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((!(LTLAPp0==true)||[]((LTLAPp1==true))) U X(!(LTLAPp2==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.039: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.039: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.039: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.058: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.058: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.087: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.088: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.243: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.243: LTL layer: formula: [](((!(LTLAPp0==true)||[]((LTLAPp1==true))) U X(!(LTLAPp2==true))))
pins2lts-mc-linux64( 3/ 8), 0.243: "[](((!(LTLAPp0==true)||[]((LTLAPp1==true))) U X(!(LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.257: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.258: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.269: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.282: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.283: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.300: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.306: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.310: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.347: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.553: DFS-FIFO for weak LTL, using special progress label 574
pins2lts-mc-linux64( 0/ 8), 0.553: There are 575 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.553: State length is 655, there are 585 groups
pins2lts-mc-linux64( 0/ 8), 0.553: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.553: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.553: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.553: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.680: ~2 levels ~960 states ~2448 transitions
pins2lts-mc-linux64( 0/ 8), 0.757: ~2 levels ~1920 states ~5360 transitions
pins2lts-mc-linux64( 0/ 8), 0.888: ~2 levels ~3840 states ~12144 transitions
pins2lts-mc-linux64( 0/ 8), 1.167: ~2 levels ~7680 states ~25952 transitions
pins2lts-mc-linux64( 3/ 8), 1.659: ~2 levels ~15360 states ~54080 transitions
pins2lts-mc-linux64( 0/ 8), 2.381: ~2 levels ~30720 states ~112992 transitions
pins2lts-mc-linux64( 3/ 8), 3.576: ~2 levels ~61440 states ~240032 transitions
pins2lts-mc-linux64( 1/ 8), 5.430: ~143 levels ~122880 states ~259976 transitions
pins2lts-mc-linux64( 1/ 8), 8.828: ~143 levels ~245760 states ~503848 transitions
pins2lts-mc-linux64( 4/ 8), 14.912: ~144 levels ~491520 states ~999128 transitions
pins2lts-mc-linux64( 1/ 8), 26.036: ~143 levels ~983040 states ~2117736 transitions
pins2lts-mc-linux64( 3/ 8), 46.753: ~143 levels ~1966080 states ~4582056 transitions
pins2lts-mc-linux64( 3/ 8), 94.311: ~143 levels ~3932160 states ~9266424 transitions
pins2lts-mc-linux64( 7/ 8), 205.393: ~143 levels ~7864320 states ~18506600 transitions
pins2lts-mc-linux64( 3/ 8), 393.089: ~143 levels ~15728640 states ~38034368 transitions
pins2lts-mc-linux64( 1/ 8), 496.715: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 496.920:
pins2lts-mc-linux64( 0/ 8), 496.920: mean standard work distribution: 0.6% (states) 1.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 496.920:
pins2lts-mc-linux64( 0/ 8), 496.920: Explored 19852324 states 49283690 transitions, fanout: 2.483
pins2lts-mc-linux64( 0/ 8), 496.920: Total exploration time 496.340 sec (496.170 sec minimum, 496.256 sec on average)
pins2lts-mc-linux64( 0/ 8), 496.920: States per second: 39997, Transitions per second: 99294
pins2lts-mc-linux64( 0/ 8), 496.920:
pins2lts-mc-linux64( 0/ 8), 496.920: Progress states detected: 106956
pins2lts-mc-linux64( 0/ 8), 496.920: Redundant explorations: -0.5483
pins2lts-mc-linux64( 0/ 8), 496.920:
pins2lts-mc-linux64( 0/ 8), 496.920: Queue width: 8B, total height: 133683, memory: 1.02MB
pins2lts-mc-linux64( 0/ 8), 496.920: Tree memory: 408.3MB, 21.4 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 496.920: Tree fill ratio (roots/leafs): 14.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 496.920: Stored 592 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 496.920: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 496.920: Est. total memory use: 409.3MB (~1025.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14100042613356101144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((!(LTLAPp0==true)||[]((LTLAPp1==true))) U X(!(LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14100042613356101144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((!(LTLAPp0==true)||[]((LTLAPp1==true))) U X(!(LTLAPp2==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-23 02:26:21] [INFO ] Applying decomposition
[2024-05-23 02:26:21] [INFO ] Flatten gal took : 27 ms
[2024-05-23 02:26:21] [INFO ] Decomposing Gal with order
[2024-05-23 02:26:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:26:21] [INFO ] Removed a total of 1411 redundant transitions.
[2024-05-23 02:26:22] [INFO ] Flatten gal took : 103 ms
[2024-05-23 02:26:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 13 ms.
[2024-05-23 02:26:22] [INFO ] Time to serialize gal into /tmp/LTLFireability2318151494972165321.gal : 13 ms
[2024-05-23 02:26:22] [INFO ] Time to serialize properties into /tmp/LTLFireability16359657775743555466.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2318151494972165321.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16359657775743555466.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(((!("((u227.p239==1)&&(u35.p698==1))"))||(G("((u59.p141==1)&&(u56.p674==1))")))U(X(!("((u61.p658==1)&&(u74.p87==1))"))))))
Formula 0 simplified : F(("((u227.p239==1)&&(u35.p698==1))" & F!"((u59.p141==1)&&(u56.p674==1))") R X"((u61.p658==1)&&(u74.p87==1))")
ITS-tools command line returned an error code 137
[2024-05-23 02:36:35] [INFO ] Flatten gal took : 32 ms
[2024-05-23 02:36:35] [INFO ] Input system was already deterministic with 570 transitions.
[2024-05-23 02:36:35] [INFO ] Transformed 654 places.
[2024-05-23 02:36:35] [INFO ] Transformed 570 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-23 02:36:36] [INFO ] Time to serialize gal into /tmp/LTLFireability17956069063053845057.gal : 5 ms
[2024-05-23 02:36:36] [INFO ] Time to serialize properties into /tmp/LTLFireability60379671863961144.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17956069063053845057.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability60379671863961144.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...341
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(((!("((p239==1)&&(p698==1))"))||(G("((p141==1)&&(p674==1))")))U(X(!("((p658==1)&&(p87==1))"))))))
Formula 0 simplified : F(("((p239==1)&&(p698==1))" & F!"((p141==1)&&(p674==1))") R X"((p658==1)&&(p87==1))")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r158-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 ;