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.r180-tall-171640602700108.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 FlexibleBarrier-PT-16b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602700108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Apr 13 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 08:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 13 08:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 945K 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 FlexibleBarrier-PT-16b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716426220738

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-16b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-23 01:03:41] [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:03:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 01:03:42] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2024-05-23 01:03:42] [INFO ] Transformed 3472 places.
[2024-05-23 01:03:42] [INFO ] Transformed 4001 transitions.
[2024-05-23 01:03:42] [INFO ] Found NUPN structural information;
[2024-05-23 01:03:42] [INFO ] Parsed PT model containing 3472 places and 4001 transitions and 10043 arcs in 299 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 3472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3472/3472 places, 4001/4001 transitions.
Discarding 1422 places :
Symmetric choice reduction at 0 with 1422 rule applications. Total rules 1422 place count 2050 transition count 2579
Iterating global reduction 0 with 1422 rules applied. Total rules applied 2844 place count 2050 transition count 2579
Discarding 670 places :
Symmetric choice reduction at 0 with 670 rule applications. Total rules 3514 place count 1380 transition count 1909
Iterating global reduction 0 with 670 rules applied. Total rules applied 4184 place count 1380 transition count 1909
Discarding 433 places :
Symmetric choice reduction at 0 with 433 rule applications. Total rules 4617 place count 947 transition count 1476
Iterating global reduction 0 with 433 rules applied. Total rules applied 5050 place count 947 transition count 1476
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Iterating post reduction 0 with 211 rules applied. Total rules applied 5261 place count 947 transition count 1265
Applied a total of 5261 rules in 643 ms. Remains 947 /3472 variables (removed 2525) and now considering 1265/4001 (removed 2736) transitions.
// Phase 1: matrix 1265 rows 947 cols
[2024-05-23 01:03:43] [INFO ] Computed 18 invariants in 47 ms
[2024-05-23 01:03:43] [INFO ] Implicit Places using invariants in 706 ms returned []
[2024-05-23 01:03:43] [INFO ] Invariant cache hit.
[2024-05-23 01:03:44] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
Running 1264 sub problems to find dead transitions.
[2024-05-23 01:03:44] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/946 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1264 unsolved
SMT process timed out in 31364ms, After SMT, problems are : Problem set: 0 solved, 1264 unsolved
Search for dead transitions found 0 dead transitions in 31387ms
Starting structural reductions in LTL mode, iteration 1 : 947/3472 places, 1265/4001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33571 ms. Remains : 947/3472 places, 1265/4001 transitions.
Support contains 34 out of 947 places after structural reductions.
[2024-05-23 01:04:16] [INFO ] Flatten gal took : 97 ms
[2024-05-23 01:04:16] [INFO ] Flatten gal took : 56 ms
[2024-05-23 01:04:16] [INFO ] Input system was already deterministic with 1265 transitions.
Support contains 32 out of 947 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (353 resets) in 1607 ms. (24 steps per ms) remains 13/29 properties
BEST_FIRST walk for 40003 steps (34 resets) in 98 ms. (404 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (32 resets) in 181 ms. (219 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (32 resets) in 125 ms. (317 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (33 resets) in 112 ms. (354 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (31 resets) in 60 ms. (655 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (31 resets) in 71 ms. (555 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (32 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (32 resets) in 54 ms. (727 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (34 resets) in 150 ms. (264 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (33 resets) in 88 ms. (449 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (33 resets) in 80 ms. (493 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (34 resets) in 50 ms. (784 steps per ms) remains 12/12 properties
[2024-05-23 01:04:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 507/522 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-23 01:04:17] [INFO ] Deduced a trap composed of 279 places in 241 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-23 01:04:18] [INFO ] Deduced a trap composed of 314 places in 187 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 425/947 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-23 01:04:18] [INFO ] Deduced a trap composed of 292 places in 235 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/947 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/947 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1265/2212 variables, 947/968 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2212 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/2212 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2212/2212 variables, and 968 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2488 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 947/947 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 507/522 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-23 01:04:20] [INFO ] Deduced a trap composed of 276 places in 171 ms of which 4 ms to minimize.
[2024-05-23 01:04:20] [INFO ] Deduced a trap composed of 276 places in 177 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 425/947 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/947 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1265/2212 variables, 947/970 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2212 variables, 12/982 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2212 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/2212 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2212/2212 variables, and 982 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2453 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 947/947 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 5/5 constraints]
After SMT, in 4962ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 10 properties in 2750 ms.
Support contains 3 out of 947 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Graph (trivial) has 892 edges and 947 vertex of which 97 / 947 are part of one of the 16 SCC in 6 ms
Free SCC test removed 81 places
Drop transitions (Empty/Sink Transition effects.) removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 866 transition count 1086
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 163 place count 785 transition count 1086
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 163 place count 785 transition count 1050
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 235 place count 749 transition count 1050
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 281 place count 703 transition count 1004
Iterating global reduction 2 with 46 rules applied. Total rules applied 327 place count 703 transition count 1004
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 327 place count 703 transition count 1003
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 329 place count 702 transition count 1003
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 338 place count 693 transition count 994
Iterating global reduction 2 with 9 rules applied. Total rules applied 347 place count 693 transition count 994
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 354 place count 693 transition count 987
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 554 place count 593 transition count 887
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 586 place count 593 transition count 855
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 606 place count 573 transition count 835
Iterating global reduction 4 with 20 rules applied. Total rules applied 626 place count 573 transition count 835
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 630 place count 573 transition count 831
Free-agglomeration rule applied 485 times.
Iterating global reduction 5 with 485 rules applied. Total rules applied 1115 place count 573 transition count 346
Reduce places removed 485 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 225 transitions
Reduce isomorphic transitions removed 225 transitions.
Graph (complete) has 240 edges and 88 vertex of which 33 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 711 rules applied. Total rules applied 1826 place count 33 transition count 121
Drop transitions (Empty/Sink Transition effects.) removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Iterating post reduction 6 with 77 rules applied. Total rules applied 1903 place count 33 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1904 place count 32 transition count 43
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 25 edges and 31 vertex of which 10 / 31 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 1906 place count 26 transition count 43
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1916 place count 26 transition count 33
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 5 Pre rules applied. Total rules applied 1916 place count 26 transition count 28
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1926 place count 21 transition count 28
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1931 place count 21 transition count 23
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 1941 place count 16 transition count 18
Free-agglomeration rule applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 1946 place count 16 transition count 13
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1959 place count 8 transition count 8
Applied a total of 1959 rules in 373 ms. Remains 8 /947 variables (removed 939) and now considering 8/1265 (removed 1257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 373 ms. Remains : 8/947 places, 8/1265 transitions.
RANDOM walk for 108 steps (0 resets) in 6 ms. (15 steps per ms) remains 0/2 properties
FORMULA FlexibleBarrier-PT-16b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FlexibleBarrier-PT-16b-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FlexibleBarrier-PT-16b-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 18 stabilizing places and 18 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(((p0 U p1)||F(p2)))||(((p0 U p1)||F(p2))&&F((G(F(p3))||(!p1&&F(p3))))))))'
Support contains 4 out of 947 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 930 transition count 1248
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 930 transition count 1248
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 49 place count 915 transition count 1233
Iterating global reduction 0 with 15 rules applied. Total rules applied 64 place count 915 transition count 1233
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 72 place count 915 transition count 1225
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 910 transition count 1220
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 910 transition count 1220
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 87 place count 910 transition count 1215
Applied a total of 87 rules in 96 ms. Remains 910 /947 variables (removed 37) and now considering 1215/1265 (removed 50) transitions.
// Phase 1: matrix 1215 rows 910 cols
[2024-05-23 01:04:26] [INFO ] Computed 18 invariants in 25 ms
[2024-05-23 01:04:26] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-23 01:04:26] [INFO ] Invariant cache hit.
[2024-05-23 01:04:27] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 1030 ms to find 0 implicit places.
Running 1214 sub problems to find dead transitions.
[2024-05-23 01:04:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/909 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 1 (OVERLAPS) 1/910 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 910/2125 variables, and 18 constraints, problems are : Problem set: 0 solved, 1214 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/910 constraints, PredecessorRefiner: 1214/1214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/909 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 1 (OVERLAPS) 1/910 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 910/2125 variables, and 18 constraints, problems are : Problem set: 0 solved, 1214 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/910 constraints, PredecessorRefiner: 0/1214 constraints, Known Traps: 0/0 constraints]
After SMT, in 61290ms problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 61302ms
Starting structural reductions in LTL mode, iteration 1 : 910/947 places, 1215/1265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62433 ms. Remains : 910/947 places, 1215/1265 transitions.
Stuttering acceptance computed with spot in 640 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 323 ms.
Product exploration explored 100000 steps with 50000 reset in 310 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2 p3), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p3), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 27 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-16b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-00 finished in 63826 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 2 out of 947 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Graph (trivial) has 863 edges and 947 vertex of which 84 / 947 are part of one of the 14 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 876 transition count 1110
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 86 rules applied. Total rules applied 171 place count 792 transition count 1108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 172 place count 791 transition count 1108
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 172 place count 791 transition count 1068
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 252 place count 751 transition count 1068
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 298 place count 705 transition count 1022
Iterating global reduction 3 with 46 rules applied. Total rules applied 344 place count 705 transition count 1022
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 344 place count 705 transition count 1021
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 346 place count 704 transition count 1021
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 356 place count 694 transition count 1011
Iterating global reduction 3 with 10 rules applied. Total rules applied 366 place count 694 transition count 1011
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 376 place count 694 transition count 1001
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 1 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 4 with 206 rules applied. Total rules applied 582 place count 591 transition count 898
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 586 place count 587 transition count 894
Iterating global reduction 4 with 4 rules applied. Total rules applied 590 place count 587 transition count 894
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 594 place count 587 transition count 890
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 598 place count 585 transition count 890
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 616 place count 585 transition count 872
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 618 place count 583 transition count 870
Applied a total of 618 rules in 413 ms. Remains 583 /947 variables (removed 364) and now considering 870/1265 (removed 395) transitions.
[2024-05-23 01:05:30] [INFO ] Flow matrix only has 841 transitions (discarded 29 similar events)
// Phase 1: matrix 841 rows 583 cols
[2024-05-23 01:05:30] [INFO ] Computed 18 invariants in 18 ms
[2024-05-23 01:05:30] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-23 01:05:30] [INFO ] Flow matrix only has 841 transitions (discarded 29 similar events)
[2024-05-23 01:05:30] [INFO ] Invariant cache hit.
[2024-05-23 01:05:30] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
[2024-05-23 01:05:30] [INFO ] Redundant transitions in 48 ms returned []
Running 403 sub problems to find dead transitions.
[2024-05-23 01:05:30] [INFO ] Flow matrix only has 841 transitions (discarded 29 similar events)
[2024-05-23 01:05:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/567 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 16/583 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (OVERLAPS) 840/1423 variables, 583/601 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1423 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 0/1423 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1423/1424 variables, and 601 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/567 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 16/583 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (OVERLAPS) 840/1423 variables, 583/601 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1423 variables, 403/1004 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1423 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1423/1424 variables, and 1004 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 0/0 constraints]
After SMT, in 60387ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 60391ms
Starting structural reductions in SI_LTL mode, iteration 1 : 583/947 places, 870/1265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61649 ms. Remains : 583/947 places, 870/1265 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-02 finished in 61775 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 1 out of 947 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Graph (trivial) has 894 edges and 947 vertex of which 97 / 947 are part of one of the 16 SCC in 3 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 865 transition count 1099
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 167 place count 782 transition count 1099
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 167 place count 782 transition count 1062
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 241 place count 745 transition count 1062
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 289 place count 697 transition count 1014
Iterating global reduction 2 with 48 rules applied. Total rules applied 337 place count 697 transition count 1014
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 337 place count 697 transition count 1013
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 339 place count 696 transition count 1013
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 349 place count 686 transition count 1003
Iterating global reduction 2 with 10 rules applied. Total rules applied 359 place count 686 transition count 1003
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 369 place count 686 transition count 993
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 565 place count 588 transition count 895
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 569 place count 584 transition count 891
Iterating global reduction 3 with 4 rules applied. Total rules applied 573 place count 584 transition count 891
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 577 place count 584 transition count 887
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 593 place count 584 transition count 871
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 595 place count 582 transition count 869
Applied a total of 595 rules in 212 ms. Remains 582 /947 variables (removed 365) and now considering 869/1265 (removed 396) transitions.
[2024-05-23 01:06:31] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
// Phase 1: matrix 838 rows 582 cols
[2024-05-23 01:06:31] [INFO ] Computed 18 invariants in 12 ms
[2024-05-23 01:06:31] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-23 01:06:31] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2024-05-23 01:06:31] [INFO ] Invariant cache hit.
[2024-05-23 01:06:32] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 843 ms to find 0 implicit places.
[2024-05-23 01:06:32] [INFO ] Redundant transitions in 48 ms returned []
Running 371 sub problems to find dead transitions.
[2024-05-23 01:06:32] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2024-05-23 01:06:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 16/582 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 837/1419 variables, 582/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1419 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (OVERLAPS) 0/1419 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1419/1420 variables, and 600 constraints, problems are : Problem set: 0 solved, 371 unsolved in 29297 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 16/582 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 837/1419 variables, 582/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1419 variables, 371/971 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1419 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1419/1420 variables, and 971 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints]
After SMT, in 59647ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 59651ms
Starting structural reductions in SI_LTL mode, iteration 1 : 582/947 places, 869/1265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60764 ms. Remains : 582/947 places, 869/1265 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-04
Product exploration explored 100000 steps with 4444 reset in 1043 ms.
Product exploration explored 100000 steps with 4429 reset in 874 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 40000 steps (1809 resets) in 1059 ms. (37 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 656251 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :0 out of 1
Probabilistic random walk after 656251 steps, saw 156894 distinct states, run finished after 3004 ms. (steps per millisecond=218 ) properties seen :0
[2024-05-23 01:07:37] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2024-05-23 01:07:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 227/228 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 452/680 variables, 228/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/680 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 544/1224 variables, 256/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1224 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 96/1320 variables, 16/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1320 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 96/1416 variables, 96/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 01:07:38] [INFO ] Deduced a trap composed of 246 places in 158 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1416 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1416 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/1419 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1419 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1419 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1419 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1419/1420 variables, and 601 constraints, problems are : Problem set: 0 solved, 1 unsolved in 626 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 227/228 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 452/680 variables, 228/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/680 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/680 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 544/1224 variables, 256/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1224 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 96/1320 variables, 16/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1320 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1320 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 96/1416 variables, 96/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1416 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/1419 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1419 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1419 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1419 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1419/1420 variables, and 602 constraints, problems are : Problem set: 0 solved, 1 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 988ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 1 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 869/869 transitions.
Applied a total of 0 rules in 40 ms. Remains 582 /582 variables (removed 0) and now considering 869/869 (removed 0) transitions.
[2024-05-23 01:07:38] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2024-05-23 01:07:38] [INFO ] Invariant cache hit.
[2024-05-23 01:07:39] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-23 01:07:39] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2024-05-23 01:07:39] [INFO ] Invariant cache hit.
[2024-05-23 01:07:39] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
[2024-05-23 01:07:39] [INFO ] Redundant transitions in 7 ms returned []
Running 371 sub problems to find dead transitions.
[2024-05-23 01:07:39] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2024-05-23 01:07:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 16/582 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 837/1419 variables, 582/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1419 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (OVERLAPS) 0/1419 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1419/1420 variables, and 600 constraints, problems are : Problem set: 0 solved, 371 unsolved in 28915 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 16/582 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 837/1419 variables, 582/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1419 variables, 371/971 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1419 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1419/1420 variables, and 971 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints]
After SMT, in 59278ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 59283ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60183 ms. Remains : 582/582 places, 869/869 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 40000 steps (1811 resets) in 459 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 675102 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :0 out of 1
Probabilistic random walk after 675102 steps, saw 160098 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) properties seen :0
[2024-05-23 01:08:42] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2024-05-23 01:08:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 227/228 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 452/680 variables, 228/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/680 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 544/1224 variables, 256/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1224 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 96/1320 variables, 16/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1320 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 96/1416 variables, 96/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 01:08:42] [INFO ] Deduced a trap composed of 246 places in 150 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1416 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1416 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/1419 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1419 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1419 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1419 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1419/1420 variables, and 601 constraints, problems are : Problem set: 0 solved, 1 unsolved in 576 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 227/228 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 452/680 variables, 228/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/680 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/680 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 544/1224 variables, 256/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1224 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 96/1320 variables, 16/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1320 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1320 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 96/1416 variables, 96/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1416 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/1419 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1419 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1419 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1419 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1419/1420 variables, and 602 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 887ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 14 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4416 reset in 749 ms.
Product exploration explored 100000 steps with 4436 reset in 762 ms.
Built C files in :
/tmp/ltsmin9680062845573895237
[2024-05-23 01:08:45] [INFO ] Computing symmetric may disable matrix : 869 transitions.
[2024-05-23 01:08:45] [INFO ] Computation of Complete disable matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:08:45] [INFO ] Computing symmetric may enable matrix : 869 transitions.
[2024-05-23 01:08:45] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:08:45] [INFO ] Computing Do-Not-Accords matrix : 869 transitions.
[2024-05-23 01:08:45] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:08:45] [INFO ] Built C files in 217ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9680062845573895237
Running compilation step : cd /tmp/ltsmin9680062845573895237;'/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 2885 ms.
Running link step : cd /tmp/ltsmin9680062845573895237;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin9680062845573895237;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased915400739805300369.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 869/869 transitions.
Applied a total of 0 rules in 51 ms. Remains 582 /582 variables (removed 0) and now considering 869/869 (removed 0) transitions.
[2024-05-23 01:09:00] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2024-05-23 01:09:00] [INFO ] Invariant cache hit.
[2024-05-23 01:09:00] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-23 01:09:00] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2024-05-23 01:09:00] [INFO ] Invariant cache hit.
[2024-05-23 01:09:00] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
[2024-05-23 01:09:00] [INFO ] Redundant transitions in 6 ms returned []
Running 371 sub problems to find dead transitions.
[2024-05-23 01:09:00] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2024-05-23 01:09:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 16/582 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 837/1419 variables, 582/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1419 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (OVERLAPS) 0/1419 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1419/1420 variables, and 600 constraints, problems are : Problem set: 0 solved, 371 unsolved in 29740 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 16/582 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 837/1419 variables, 582/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1419 variables, 371/971 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1419 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1419/1420 variables, and 971 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60936 ms. Remains : 582/582 places, 869/869 transitions.
Built C files in :
/tmp/ltsmin15909889635089846189
[2024-05-23 01:10:01] [INFO ] Computing symmetric may disable matrix : 869 transitions.
[2024-05-23 01:10:01] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:10:01] [INFO ] Computing symmetric may enable matrix : 869 transitions.
[2024-05-23 01:10:01] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:10:01] [INFO ] Computing Do-Not-Accords matrix : 869 transitions.
[2024-05-23 01:10:01] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:10:01] [INFO ] Built C files in 179ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15909889635089846189
Running compilation step : cd /tmp/ltsmin15909889635089846189;'/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 2866 ms.
Running link step : cd /tmp/ltsmin15909889635089846189;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin15909889635089846189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5585174093308630139.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 01:10:16] [INFO ] Flatten gal took : 35 ms
[2024-05-23 01:10:16] [INFO ] Flatten gal took : 32 ms
[2024-05-23 01:10:16] [INFO ] Time to serialize gal into /tmp/LTL14421908181649577420.gal : 8 ms
[2024-05-23 01:10:16] [INFO ] Time to serialize properties into /tmp/LTL9664936357916170840.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/LTL14421908181649577420.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3286133322433320833.hoa' '-atoms' '/tmp/LTL9664936357916170840.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...318
Loading property file /tmp/LTL9664936357916170840.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3286133322433320833.hoa
Detected timeout of ITS tools.
[2024-05-23 01:10:31] [INFO ] Flatten gal took : 27 ms
[2024-05-23 01:10:31] [INFO ] Flatten gal took : 27 ms
[2024-05-23 01:10:31] [INFO ] Time to serialize gal into /tmp/LTL17197230901556403820.gal : 8 ms
[2024-05-23 01:10:31] [INFO ] Time to serialize properties into /tmp/LTL343842830350911922.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/LTL17197230901556403820.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL343842830350911922.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...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(p3396!=1)"))))
Formula 0 simplified : GF!"(p3396!=1)"
Detected timeout of ITS tools.
[2024-05-23 01:10:46] [INFO ] Flatten gal took : 23 ms
[2024-05-23 01:10:46] [INFO ] Applying decomposition
[2024-05-23 01:10:46] [INFO ] Flatten gal took : 20 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/graph14338450906016857718.txt' '-o' '/tmp/graph14338450906016857718.bin' '-w' '/tmp/graph14338450906016857718.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14338450906016857718.bin' '-l' '-1' '-v' '-w' '/tmp/graph14338450906016857718.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:10:46] [INFO ] Decomposing Gal with order
[2024-05-23 01:10:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:10:46] [INFO ] Removed a total of 351 redundant transitions.
[2024-05-23 01:10:46] [INFO ] Flatten gal took : 231 ms
[2024-05-23 01:10:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 17 ms.
[2024-05-23 01:10:46] [INFO ] Time to serialize gal into /tmp/LTL12001611005751694023.gal : 9 ms
[2024-05-23 01:10:46] [INFO ] Time to serialize properties into /tmp/LTL8487964253724287364.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/LTL12001611005751694023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8487964253724287364.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 : !((F(G("(i15.u49.p3396!=1)"))))
Formula 0 simplified : GF!"(i15.u49.p3396!=1)"
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-04 finished in 270495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)||G((F(p0) U p2)))))'
Support contains 3 out of 947 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Graph (trivial) has 668 edges and 947 vertex of which 97 / 947 are part of one of the 16 SCC in 1 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 865 transition count 1100
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 165 place count 783 transition count 1100
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 165 place count 783 transition count 1062
Deduced a syphon composed of 38 places in 5 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 241 place count 745 transition count 1062
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 288 place count 698 transition count 1015
Iterating global reduction 2 with 47 rules applied. Total rules applied 335 place count 698 transition count 1015
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 345 place count 688 transition count 1005
Iterating global reduction 2 with 10 rules applied. Total rules applied 355 place count 688 transition count 1005
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 364 place count 688 transition count 996
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 560 place count 590 transition count 898
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 563 place count 587 transition count 895
Iterating global reduction 3 with 3 rules applied. Total rules applied 566 place count 587 transition count 895
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 569 place count 587 transition count 892
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 571 place count 585 transition count 890
Applied a total of 571 rules in 146 ms. Remains 585 /947 variables (removed 362) and now considering 890/1265 (removed 375) transitions.
[2024-05-23 01:11:02] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
// Phase 1: matrix 844 rows 585 cols
[2024-05-23 01:11:02] [INFO ] Computed 18 invariants in 16 ms
[2024-05-23 01:11:02] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-23 01:11:02] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2024-05-23 01:11:02] [INFO ] Invariant cache hit.
[2024-05-23 01:11:02] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
[2024-05-23 01:11:02] [INFO ] Redundant transitions in 26 ms returned []
Running 614 sub problems to find dead transitions.
[2024-05-23 01:11:02] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2024-05-23 01:11:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 2 (OVERLAPS) 1/585 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 4 (OVERLAPS) 843/1428 variables, 585/603 constraints. Problems are: Problem set: 0 solved, 614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1428/1429 variables, and 603 constraints, problems are : Problem set: 0 solved, 614 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 614/614 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 2 (OVERLAPS) 1/585 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 4 (OVERLAPS) 843/1428 variables, 585/603 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1428 variables, 614/1217 constraints. Problems are: Problem set: 0 solved, 614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 1217 constraints, problems are : Problem set: 0 solved, 614 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 614/614 constraints, Known Traps: 0/0 constraints]
After SMT, in 61208ms problems are : Problem set: 0 solved, 614 unsolved
Search for dead transitions found 0 dead transitions in 61213ms
Starting structural reductions in SI_LTL mode, iteration 1 : 585/947 places, 890/1265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62172 ms. Remains : 585/947 places, 890/1265 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-05
Product exploration explored 100000 steps with 5445 reset in 700 ms.
Product exploration explored 100000 steps with 5462 reset in 691 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
Knowledge based reduction with 9 factoid took 310 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (1742 resets) in 465 ms. (85 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (13 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (14 resets) in 31 ms. (1250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (13 resets) in 21 ms. (1818 steps per ms) remains 4/4 properties
[2024-05-23 01:12:06] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2024-05-23 01:12:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 249/252 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 511/763 variables, 252/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 620/1383 variables, 288/542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1383 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1383 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 45/1428 variables, 15/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1428 variables, 45/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1428 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1428 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1428/1429 variables, and 603 constraints, problems are : Problem set: 0 solved, 4 unsolved in 613 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 249/252 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 511/763 variables, 252/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 620/1383 variables, 288/542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1383 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1383 variables, 4/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1383 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 45/1428 variables, 15/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1428 variables, 45/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1428 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1428 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 607 constraints, problems are : Problem set: 0 solved, 4 unsolved in 828 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1459ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 31 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=15 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 6 ms.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p1 p2))), (F p0), (F p1), (F (NOT (AND (NOT p1) p2 (NOT p0)))), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 610 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 890/890 transitions.
Applied a total of 0 rules in 25 ms. Remains 585 /585 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2024-05-23 01:12:08] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2024-05-23 01:12:08] [INFO ] Invariant cache hit.
[2024-05-23 01:12:09] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-23 01:12:09] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2024-05-23 01:12:09] [INFO ] Invariant cache hit.
[2024-05-23 01:12:09] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
[2024-05-23 01:12:09] [INFO ] Redundant transitions in 9 ms returned []
Running 614 sub problems to find dead transitions.
[2024-05-23 01:12:09] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2024-05-23 01:12:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 2 (OVERLAPS) 1/585 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 4 (OVERLAPS) 843/1428 variables, 585/603 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1428 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1428/1429 variables, and 603 constraints, problems are : Problem set: 0 solved, 614 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 614/614 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 2 (OVERLAPS) 1/585 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 4 (OVERLAPS) 843/1428 variables, 585/603 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1428 variables, 614/1217 constraints. Problems are: Problem set: 0 solved, 614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 1217 constraints, problems are : Problem set: 0 solved, 614 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 614/614 constraints, Known Traps: 0/0 constraints]
After SMT, in 61135ms problems are : Problem set: 0 solved, 614 unsolved
Search for dead transitions found 0 dead transitions in 61141ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62022 ms. Remains : 585/585 places, 890/890 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
Knowledge based reduction with 9 factoid took 368 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (1738 resets) in 1342 ms. (29 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 22 ms. (1739 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (15 resets) in 30 ms. (1290 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (15 resets) in 26 ms. (1481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (13 resets) in 28 ms. (1379 steps per ms) remains 4/4 properties
[2024-05-23 01:13:11] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2024-05-23 01:13:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 249/252 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 511/763 variables, 252/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 620/1383 variables, 288/542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1383 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1383 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 45/1428 variables, 15/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1428 variables, 45/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1428 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1428 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1428/1429 variables, and 603 constraints, problems are : Problem set: 0 solved, 4 unsolved in 606 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 249/252 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 511/763 variables, 252/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 620/1383 variables, 288/542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1383 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1383 variables, 4/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1383 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 45/1428 variables, 15/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1428 variables, 45/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1428 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1428 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 607 constraints, problems are : Problem set: 0 solved, 4 unsolved in 835 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1455ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 28 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=14 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p1 p2))), (F p0), (F p1), (F (NOT (AND (NOT p1) p2 (NOT p0)))), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 574 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5464 reset in 690 ms.
Product exploration explored 100000 steps with 5438 reset in 698 ms.
Built C files in :
/tmp/ltsmin3783879062447624
[2024-05-23 01:13:15] [INFO ] Computing symmetric may disable matrix : 890 transitions.
[2024-05-23 01:13:15] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:13:15] [INFO ] Computing symmetric may enable matrix : 890 transitions.
[2024-05-23 01:13:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:13:15] [INFO ] Computing Do-Not-Accords matrix : 890 transitions.
[2024-05-23 01:13:15] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:13:15] [INFO ] Built C files in 168ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3783879062447624
Running compilation step : cd /tmp/ltsmin3783879062447624;'/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 2848 ms.
Running link step : cd /tmp/ltsmin3783879062447624;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin3783879062447624;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4457459678126973114.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 890/890 transitions.
Applied a total of 0 rules in 22 ms. Remains 585 /585 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2024-05-23 01:13:30] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2024-05-23 01:13:30] [INFO ] Invariant cache hit.
[2024-05-23 01:13:30] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-23 01:13:30] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2024-05-23 01:13:30] [INFO ] Invariant cache hit.
[2024-05-23 01:13:31] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
[2024-05-23 01:13:31] [INFO ] Redundant transitions in 8 ms returned []
Running 614 sub problems to find dead transitions.
[2024-05-23 01:13:31] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2024-05-23 01:13:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 2 (OVERLAPS) 1/585 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 4 (OVERLAPS) 843/1428 variables, 585/603 constraints. Problems are: Problem set: 0 solved, 614 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 1428/1429 variables, and 603 constraints, problems are : Problem set: 0 solved, 614 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 614/614 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 2 (OVERLAPS) 1/585 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 4 (OVERLAPS) 843/1428 variables, 585/603 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1428 variables, 614/1217 constraints. Problems are: Problem set: 0 solved, 614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 1217 constraints, problems are : Problem set: 0 solved, 614 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 614/614 constraints, Known Traps: 0/0 constraints]
After SMT, in 61300ms problems are : Problem set: 0 solved, 614 unsolved
Search for dead transitions found 0 dead transitions in 61307ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62176 ms. Remains : 585/585 places, 890/890 transitions.
Built C files in :
/tmp/ltsmin6722339799096500502
[2024-05-23 01:14:32] [INFO ] Computing symmetric may disable matrix : 890 transitions.
[2024-05-23 01:14:32] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:14:32] [INFO ] Computing symmetric may enable matrix : 890 transitions.
[2024-05-23 01:14:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:14:33] [INFO ] Computing Do-Not-Accords matrix : 890 transitions.
[2024-05-23 01:14:33] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:14:33] [INFO ] Built C files in 168ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6722339799096500502
Running compilation step : cd /tmp/ltsmin6722339799096500502;'/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 2917 ms.
Running link step : cd /tmp/ltsmin6722339799096500502;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin6722339799096500502;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7411859323424159153.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 01:14:47] [INFO ] Flatten gal took : 27 ms
[2024-05-23 01:14:47] [INFO ] Flatten gal took : 22 ms
[2024-05-23 01:14:48] [INFO ] Time to serialize gal into /tmp/LTL6924810294162987663.gal : 6 ms
[2024-05-23 01:14:48] [INFO ] Time to serialize properties into /tmp/LTL5933425788981034930.prop : 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/LTL6924810294162987663.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10032853317160517393.hoa' '-atoms' '/tmp/LTL5933425788981034930.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...318
Loading property file /tmp/LTL5933425788981034930.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10032853317160517393.hoa
Detected timeout of ITS tools.
[2024-05-23 01:15:03] [INFO ] Flatten gal took : 20 ms
[2024-05-23 01:15:03] [INFO ] Flatten gal took : 19 ms
[2024-05-23 01:15:03] [INFO ] Time to serialize gal into /tmp/LTL6456440529220508560.gal : 4 ms
[2024-05-23 01:15:03] [INFO ] Time to serialize properties into /tmp/LTL15439864457286012720.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/LTL6456440529220508560.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15439864457286012720.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 : !((F((("(p3394==1)")U("(p3457==1)"))||(G((F("(p3394==1)"))U("(p272!=1)"))))))
Formula 0 simplified : G((!"(p3394==1)" R !"(p3457==1)") & F(G!"(p3394==1)" R !"(p272!=1)"))
Detected timeout of ITS tools.
[2024-05-23 01:15:18] [INFO ] Flatten gal took : 23 ms
[2024-05-23 01:15:18] [INFO ] Applying decomposition
[2024-05-23 01:15:18] [INFO ] Flatten gal took : 21 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/graph12353325727233113138.txt' '-o' '/tmp/graph12353325727233113138.bin' '-w' '/tmp/graph12353325727233113138.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12353325727233113138.bin' '-l' '-1' '-v' '-w' '/tmp/graph12353325727233113138.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:15:18] [INFO ] Decomposing Gal with order
[2024-05-23 01:15:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:15:18] [INFO ] Removed a total of 370 redundant transitions.
[2024-05-23 01:15:18] [INFO ] Flatten gal took : 82 ms
[2024-05-23 01:15:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 7 ms.
[2024-05-23 01:15:18] [INFO ] Time to serialize gal into /tmp/LTL11444112490485595022.gal : 6 ms
[2024-05-23 01:15:18] [INFO ] Time to serialize properties into /tmp/LTL10217878287567593256.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/LTL11444112490485595022.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10217878287567593256.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...256
Read 1 LTL properties
Checking formula 0 : !((F((("(u48.p3394==1)")U("(u48.p3457==1)"))||(G((F("(u48.p3394==1)"))U("(u5.p272!=1)"))))))
Formula 0 simplified : G((!"(u48.p3394==1)" R !"(u48.p3457==1)") & F(G!"(u48.p3394==1)" R !"(u5.p272!=1)"))
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-05 finished in 271516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||(p0&&F(!p1)))))))'
Support contains 2 out of 947 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 929 transition count 1247
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 929 transition count 1247
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 52 place count 913 transition count 1231
Iterating global reduction 0 with 16 rules applied. Total rules applied 68 place count 913 transition count 1231
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 76 place count 913 transition count 1223
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 907 transition count 1217
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 907 transition count 1217
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 93 place count 907 transition count 1212
Applied a total of 93 rules in 103 ms. Remains 907 /947 variables (removed 40) and now considering 1212/1265 (removed 53) transitions.
// Phase 1: matrix 1212 rows 907 cols
[2024-05-23 01:15:33] [INFO ] Computed 18 invariants in 20 ms
[2024-05-23 01:15:33] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-23 01:15:33] [INFO ] Invariant cache hit.
[2024-05-23 01:15:34] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
Running 1211 sub problems to find dead transitions.
[2024-05-23 01:15:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/906 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1211 unsolved
At refinement iteration 1 (OVERLAPS) 1/907 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 907/2119 variables, and 18 constraints, problems are : Problem set: 0 solved, 1211 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/907 constraints, PredecessorRefiner: 1211/1211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/906 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1211 unsolved
At refinement iteration 1 (OVERLAPS) 1/907 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/2119 variables, and 18 constraints, problems are : Problem set: 0 solved, 1211 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/907 constraints, PredecessorRefiner: 0/1211 constraints, Known Traps: 0/0 constraints]
After SMT, in 61348ms problems are : Problem set: 0 solved, 1211 unsolved
Search for dead transitions found 0 dead transitions in 61362ms
Starting structural reductions in LTL mode, iteration 1 : 907/947 places, 1212/1265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62544 ms. Remains : 907/947 places, 1212/1265 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 202 ms.
Product exploration explored 100000 steps with 33333 reset in 197 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-16b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-06 finished in 63236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||X((G(F(p0)) U p2)))))'
Support contains 3 out of 947 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 930 transition count 1248
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 930 transition count 1248
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 49 place count 915 transition count 1233
Iterating global reduction 0 with 15 rules applied. Total rules applied 64 place count 915 transition count 1233
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 71 place count 915 transition count 1226
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 77 place count 909 transition count 1220
Iterating global reduction 1 with 6 rules applied. Total rules applied 83 place count 909 transition count 1220
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 88 place count 909 transition count 1215
Applied a total of 88 rules in 94 ms. Remains 909 /947 variables (removed 38) and now considering 1215/1265 (removed 50) transitions.
// Phase 1: matrix 1215 rows 909 cols
[2024-05-23 01:16:36] [INFO ] Computed 18 invariants in 20 ms
[2024-05-23 01:16:37] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-23 01:16:37] [INFO ] Invariant cache hit.
[2024-05-23 01:16:37] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 1158 ms to find 0 implicit places.
Running 1214 sub problems to find dead transitions.
[2024-05-23 01:16:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 1 (OVERLAPS) 1/909 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 909/2124 variables, and 18 constraints, problems are : Problem set: 0 solved, 1214 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/909 constraints, PredecessorRefiner: 1214/1214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 1 (OVERLAPS) 1/909 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 909/2124 variables, and 18 constraints, problems are : Problem set: 0 solved, 1214 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/909 constraints, PredecessorRefiner: 0/1214 constraints, Known Traps: 0/0 constraints]
After SMT, in 61176ms problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 61190ms
Starting structural reductions in LTL mode, iteration 1 : 909/947 places, 1215/1265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62446 ms. Remains : 909/947 places, 1215/1265 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-07
Stuttering criterion allowed to conclude after 117 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-07 finished in 62690 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)||F(G(p1))))'
Support contains 2 out of 947 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Graph (trivial) has 878 edges and 947 vertex of which 91 / 947 are part of one of the 15 SCC in 1 ms
Free SCC test removed 76 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 870 transition count 1105
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 165 place count 788 transition count 1105
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 165 place count 788 transition count 1066
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 243 place count 749 transition count 1066
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 290 place count 702 transition count 1019
Iterating global reduction 2 with 47 rules applied. Total rules applied 337 place count 702 transition count 1019
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 337 place count 702 transition count 1018
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 339 place count 701 transition count 1018
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 349 place count 691 transition count 1008
Iterating global reduction 2 with 10 rules applied. Total rules applied 359 place count 691 transition count 1008
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 369 place count 691 transition count 998
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 569 place count 591 transition count 898
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 573 place count 587 transition count 894
Iterating global reduction 3 with 4 rules applied. Total rules applied 577 place count 587 transition count 894
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 581 place count 587 transition count 890
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 583 place count 586 transition count 890
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 600 place count 586 transition count 873
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 601 place count 586 transition count 873
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 603 place count 584 transition count 871
Applied a total of 603 rules in 241 ms. Remains 584 /947 variables (removed 363) and now considering 871/1265 (removed 394) transitions.
[2024-05-23 01:17:39] [INFO ] Flow matrix only has 841 transitions (discarded 30 similar events)
// Phase 1: matrix 841 rows 584 cols
[2024-05-23 01:17:39] [INFO ] Computed 18 invariants in 18 ms
[2024-05-23 01:17:39] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-23 01:17:39] [INFO ] Flow matrix only has 841 transitions (discarded 30 similar events)
[2024-05-23 01:17:39] [INFO ] Invariant cache hit.
[2024-05-23 01:17:40] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 837 ms to find 0 implicit places.
[2024-05-23 01:17:40] [INFO ] Redundant transitions in 7 ms returned []
Running 388 sub problems to find dead transitions.
[2024-05-23 01:17:40] [INFO ] Flow matrix only has 841 transitions (discarded 30 similar events)
[2024-05-23 01:17:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (OVERLAPS) 16/584 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (OVERLAPS) 840/1424 variables, 584/602 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 388 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1424/1425 variables, and 602 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 388 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (OVERLAPS) 16/584 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (OVERLAPS) 840/1424 variables, 584/602 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1424 variables, 388/990 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1424 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 timeout
0)
(s59 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1424/1425 variables, and 990 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 0/0 constraints]
After SMT, in 60362ms problems are : Problem set: 0 solved, 388 unsolved
Search for dead transitions found 0 dead transitions in 60366ms
Starting structural reductions in SI_LTL mode, iteration 1 : 584/947 places, 871/1265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61457 ms. Remains : 584/947 places, 871/1265 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-08 finished in 61552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 947 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 929 transition count 1247
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 929 transition count 1247
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 52 place count 913 transition count 1231
Iterating global reduction 0 with 16 rules applied. Total rules applied 68 place count 913 transition count 1231
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 76 place count 913 transition count 1223
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 907 transition count 1217
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 907 transition count 1217
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 93 place count 907 transition count 1212
Applied a total of 93 rules in 100 ms. Remains 907 /947 variables (removed 40) and now considering 1212/1265 (removed 53) transitions.
// Phase 1: matrix 1212 rows 907 cols
[2024-05-23 01:18:41] [INFO ] Computed 18 invariants in 22 ms
[2024-05-23 01:18:41] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-23 01:18:41] [INFO ] Invariant cache hit.
[2024-05-23 01:18:42] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
Running 1211 sub problems to find dead transitions.
[2024-05-23 01:18:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/906 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1211 unsolved
At refinement iteration 1 (OVERLAPS) 1/907 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1211 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 907/2119 variables, and 18 constraints, problems are : Problem set: 0 solved, 1211 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/907 constraints, PredecessorRefiner: 1211/1211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/906 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1211 unsolved
At refinement iteration 1 (OVERLAPS) 1/907 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1211 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 1)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 1)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 1)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 1)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 1)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 1)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 1)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 1)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 1)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 1)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/2119 variables, and 18 constraints, problems are : Problem set: 0 solved, 1211 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/907 constraints, PredecessorRefiner: 0/1211 constraints, Known Traps: 0/0 constraints]
After SMT, in 61216ms problems are : Problem set: 0 solved, 1211 unsolved
Search for dead transitions found 0 dead transitions in 61229ms
Starting structural reductions in LTL mode, iteration 1 : 907/947 places, 1212/1265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62418 ms. Remains : 907/947 places, 1212/1265 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-10
Product exploration explored 100000 steps with 889 reset in 205 ms.
Product exploration explored 100000 steps with 887 reset in 221 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (355 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (31 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 505635 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 505635 steps, saw 155944 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2024-05-23 01:19:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 231/232 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 675/907 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/907 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1212/2119 variables, 907/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2119 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2119 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2119/2119 variables, and 925 constraints, problems are : Problem set: 0 solved, 1 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 907/907 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 231/232 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 675/907 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/907 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1212/2119 variables, 907/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2119 variables, 1/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2119 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2119 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2119/2119 variables, and 926 constraints, problems are : Problem set: 0 solved, 1 unsolved in 514 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 907/907 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 978ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 85 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-16b-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-10 finished in 67286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 947 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 928 transition count 1246
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 928 transition count 1246
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 55 place count 911 transition count 1229
Iterating global reduction 0 with 17 rules applied. Total rules applied 72 place count 911 transition count 1229
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 81 place count 911 transition count 1220
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 87 place count 905 transition count 1214
Iterating global reduction 1 with 6 rules applied. Total rules applied 93 place count 905 transition count 1214
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 98 place count 905 transition count 1209
Applied a total of 98 rules in 95 ms. Remains 905 /947 variables (removed 42) and now considering 1209/1265 (removed 56) transitions.
// Phase 1: matrix 1209 rows 905 cols
[2024-05-23 01:19:48] [INFO ] Computed 18 invariants in 25 ms
[2024-05-23 01:19:48] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-23 01:19:48] [INFO ] Invariant cache hit.
[2024-05-23 01:19:49] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
Running 1208 sub problems to find dead transitions.
[2024-05-23 01:19:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/904 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1208 unsolved
At refinement iteration 1 (OVERLAPS) 1/905 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 905/2114 variables, and 18 constraints, problems are : Problem set: 0 solved, 1208 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/905 constraints, PredecessorRefiner: 1208/1208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/904 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1208 unsolved
At refinement iteration 1 (OVERLAPS) 1/905 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1208 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 905/2114 variables, and 18 constraints, problems are : Problem set: 0 solved, 1208 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/905 constraints, PredecessorRefiner: 0/1208 constraints, Known Traps: 0/0 constraints]
After SMT, in 61251ms problems are : Problem set: 0 solved, 1208 unsolved
Search for dead transitions found 0 dead transitions in 61264ms
Starting structural reductions in LTL mode, iteration 1 : 905/947 places, 1209/1265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62426 ms. Remains : 905/947 places, 1209/1265 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 6238 steps with 55 reset in 18 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-11 finished in 62551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 947 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 928 transition count 1246
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 928 transition count 1246
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 55 place count 911 transition count 1229
Iterating global reduction 0 with 17 rules applied. Total rules applied 72 place count 911 transition count 1229
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 81 place count 911 transition count 1220
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 87 place count 905 transition count 1214
Iterating global reduction 1 with 6 rules applied. Total rules applied 93 place count 905 transition count 1214
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 98 place count 905 transition count 1209
Applied a total of 98 rules in 100 ms. Remains 905 /947 variables (removed 42) and now considering 1209/1265 (removed 56) transitions.
[2024-05-23 01:20:50] [INFO ] Invariant cache hit.
[2024-05-23 01:20:51] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-23 01:20:51] [INFO ] Invariant cache hit.
[2024-05-23 01:20:52] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
Running 1208 sub problems to find dead transitions.
[2024-05-23 01:20:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/904 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1208 unsolved
At refinement iteration 1 (OVERLAPS) 1/905 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1208 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 1.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 1.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 1.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 1.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 905/2114 variables, and 18 constraints, problems are : Problem set: 0 solved, 1208 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/905 constraints, PredecessorRefiner: 1208/1208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/904 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1208 unsolved
At refinement iteration 1 (OVERLAPS) 1/905 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1208 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 905/2114 variables, and 18 constraints, problems are : Problem set: 0 solved, 1208 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/905 constraints, PredecessorRefiner: 0/1208 constraints, Known Traps: 0/0 constraints]
After SMT, in 61379ms problems are : Problem set: 0 solved, 1208 unsolved
Search for dead transitions found 0 dead transitions in 61392ms
Starting structural reductions in LTL mode, iteration 1 : 905/947 places, 1209/1265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62630 ms. Remains : 905/947 places, 1209/1265 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-12
Stuttering criterion allowed to conclude after 128 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-12 finished in 62733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(p1))))'
Support contains 3 out of 947 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 930 transition count 1248
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 930 transition count 1248
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 49 place count 915 transition count 1233
Iterating global reduction 0 with 15 rules applied. Total rules applied 64 place count 915 transition count 1233
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 73 place count 915 transition count 1224
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 911 transition count 1220
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 911 transition count 1220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 911 transition count 1217
Applied a total of 84 rules in 90 ms. Remains 911 /947 variables (removed 36) and now considering 1217/1265 (removed 48) transitions.
// Phase 1: matrix 1217 rows 911 cols
[2024-05-23 01:21:53] [INFO ] Computed 18 invariants in 22 ms
[2024-05-23 01:21:53] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-23 01:21:54] [INFO ] Invariant cache hit.
[2024-05-23 01:21:54] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 1157 ms to find 0 implicit places.
Running 1216 sub problems to find dead transitions.
[2024-05-23 01:21:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (OVERLAPS) 1/911 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 1.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 1.0)
(s507 0.0)
(s508 timeout
0.0)
(s509 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 911/2128 variables, and 18 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/911 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (OVERLAPS) 1/911 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 911/2128 variables, and 18 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/911 constraints, PredecessorRefiner: 0/1216 constraints, Known Traps: 0/0 constraints]
After SMT, in 61465ms problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 61480ms
Starting structural reductions in LTL mode, iteration 1 : 911/947 places, 1217/1265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62733 ms. Remains : 911/947 places, 1217/1265 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-13
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-13 finished in 62917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 4 out of 947 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 947/947 places, 1265/1265 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 932 transition count 1250
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 932 transition count 1250
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 44 place count 918 transition count 1236
Iterating global reduction 0 with 14 rules applied. Total rules applied 58 place count 918 transition count 1236
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 66 place count 918 transition count 1228
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 914 transition count 1224
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 914 transition count 1224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 77 place count 914 transition count 1221
Applied a total of 77 rules in 100 ms. Remains 914 /947 variables (removed 33) and now considering 1221/1265 (removed 44) transitions.
// Phase 1: matrix 1221 rows 914 cols
[2024-05-23 01:22:56] [INFO ] Computed 18 invariants in 16 ms
[2024-05-23 01:22:56] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-23 01:22:56] [INFO ] Invariant cache hit.
[2024-05-23 01:22:57] [INFO ] Implicit Places using invariants and state equation in 794 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
Running 1220 sub problems to find dead transitions.
[2024-05-23 01:22:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/913 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (OVERLAPS) 1/914 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 914/2135 variables, and 18 constraints, problems are : Problem set: 0 solved, 1220 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/914 constraints, PredecessorRefiner: 1220/1220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/913 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (OVERLAPS) 1/914 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 914/2135 variables, and 18 constraints, problems are : Problem set: 0 solved, 1220 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/914 constraints, PredecessorRefiner: 0/1220 constraints, Known Traps: 0/0 constraints]
After SMT, in 61266ms problems are : Problem set: 0 solved, 1220 unsolved
Search for dead transitions found 0 dead transitions in 61278ms
Starting structural reductions in LTL mode, iteration 1 : 914/947 places, 1221/1265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62508 ms. Remains : 914/947 places, 1221/1265 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 266 ms.
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 17 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-16b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-15 finished in 63302 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)||G((F(p0) U p2)))))'
[2024-05-23 01:24:00] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4837866159849031076
[2024-05-23 01:24:00] [INFO ] Computing symmetric may disable matrix : 1265 transitions.
[2024-05-23 01:24:00] [INFO ] Applying decomposition
[2024-05-23 01:24:00] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:24:00] [INFO ] Computing symmetric may enable matrix : 1265 transitions.
[2024-05-23 01:24:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:24:00] [INFO ] Flatten gal took : 30 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/graph8754977963815418325.txt' '-o' '/tmp/graph8754977963815418325.bin' '-w' '/tmp/graph8754977963815418325.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8754977963815418325.bin' '-l' '-1' '-v' '-w' '/tmp/graph8754977963815418325.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:24:00] [INFO ] Decomposing Gal with order
[2024-05-23 01:24:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:24:00] [INFO ] Computing Do-Not-Accords matrix : 1265 transitions.
[2024-05-23 01:24:00] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:24:00] [INFO ] Removed a total of 373 redundant transitions.
[2024-05-23 01:24:00] [INFO ] Built C files in 287ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4837866159849031076
Running compilation step : cd /tmp/ltsmin4837866159849031076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' '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'
[2024-05-23 01:24:00] [INFO ] Flatten gal took : 125 ms
[2024-05-23 01:24:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 41 ms.
[2024-05-23 01:24:00] [INFO ] Time to serialize gal into /tmp/LTLFireability293806203246399385.gal : 25 ms
[2024-05-23 01:24:00] [INFO ] Time to serialize properties into /tmp/LTLFireability6601347145147447768.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/LTLFireability293806203246399385.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6601347145147447768.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...275
Read 2 LTL properties
Checking formula 0 : !((F(G("(i5.u178.p3396!=1)"))))
Formula 0 simplified : GF!"(i5.u178.p3396!=1)"
Compilation finished in 4697 ms.
Running link step : cd /tmp/ltsmin4837866159849031076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin4837866159849031076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin4837866159849031076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4837866159849031076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((((LTLAPp1==true) U (LTLAPp2==true))||[]((<>((LTLAPp1==true)) U (LTLAPp3==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 01:50:47] [INFO ] Applying decomposition
[2024-05-23 01:50:47] [INFO ] Flatten gal took : 66 ms
[2024-05-23 01:50:47] [INFO ] Decomposing Gal with order
[2024-05-23 01:50:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:50:48] [INFO ] Removed a total of 334 redundant transitions.
[2024-05-23 01:50:48] [INFO ] Flatten gal took : 250 ms
[2024-05-23 01:50:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 1037 labels/synchronizations in 367 ms.
[2024-05-23 01:50:48] [INFO ] Time to serialize gal into /tmp/LTLFireability4319671103821099113.gal : 27 ms
[2024-05-23 01:50:48] [INFO ] Time to serialize properties into /tmp/LTLFireability5942417110084147524.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/LTLFireability4319671103821099113.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5942417110084147524.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...276
Read 2 LTL properties
Checking formula 0 : !((F(G("(i1.u33.p3396!=1)"))))
Formula 0 simplified : GF!"(i1.u33.p3396!=1)"
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin4837866159849031076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((((LTLAPp1==true) U (LTLAPp2==true))||[]((<>((LTLAPp1==true)) U (LTLAPp3==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin4837866159849031076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'

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="FlexibleBarrier-PT-16b"
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 FlexibleBarrier-PT-16b, 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 r180-tall-171640602700108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-16b.tgz
mv FlexibleBarrier-PT-16b 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 ;