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.r500-smll-171649587500123.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is HirschbergSinclair-PT-45, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649587500123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 11K 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 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 13 02:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Apr 13 02:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 02:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 13 02:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 616K 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 HirschbergSinclair-PT-45-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717252861974

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-45
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:41:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:41:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:41:05] [INFO ] Load time of PNML (sax parser for PT used): 285 ms
[2024-06-01 14:41:05] [INFO ] Transformed 1138 places.
[2024-06-01 14:41:05] [INFO ] Transformed 1042 transitions.
[2024-06-01 14:41:05] [INFO ] Parsed PT model containing 1138 places and 1042 transitions and 3176 arcs in 694 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 1138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1138/1138 places, 1042/1042 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1096 transition count 1042
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 81 place count 1057 transition count 1003
Iterating global reduction 1 with 39 rules applied. Total rules applied 120 place count 1057 transition count 1003
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 159 place count 1018 transition count 964
Iterating global reduction 1 with 39 rules applied. Total rules applied 198 place count 1018 transition count 964
Applied a total of 198 rules in 477 ms. Remains 1018 /1138 variables (removed 120) and now considering 964/1042 (removed 78) transitions.
// Phase 1: matrix 964 rows 1018 cols
[2024-06-01 14:41:06] [INFO ] Computed 54 invariants in 38 ms
[2024-06-01 14:41:07] [INFO ] Implicit Places using invariants in 1329 ms returned []
[2024-06-01 14:41:07] [INFO ] Invariant cache hit.
[2024-06-01 14:41:16] [INFO ] Implicit Places using invariants and state equation in 8293 ms returned []
Implicit Place search using SMT with State Equation took 9684 ms to find 0 implicit places.
Running 919 sub problems to find dead transitions.
[2024-06-01 14:41:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/970 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 919 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 970/1982 variables, and 6 constraints, problems are : Problem set: 0 solved, 919 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1018 constraints, PredecessorRefiner: 919/919 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 919 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/970 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/970 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 2 (OVERLAPS) 6/976 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 919 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 Int declared 976/1982 variables, and 9 constraints, problems are : Problem set: 0 solved, 919 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1018 constraints, PredecessorRefiner: 0/919 constraints, Known Traps: 0/0 constraints]
After SMT, in 60949ms problems are : Problem set: 0 solved, 919 unsolved
Search for dead transitions found 0 dead transitions in 61027ms
Starting structural reductions in LTL mode, iteration 1 : 1018/1138 places, 964/1042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71246 ms. Remains : 1018/1138 places, 964/1042 transitions.
Support contains 38 out of 1018 places after structural reductions.
[2024-06-01 14:42:17] [INFO ] Flatten gal took : 227 ms
[2024-06-01 14:42:17] [INFO ] Flatten gal took : 98 ms
[2024-06-01 14:42:18] [INFO ] Input system was already deterministic with 964 transitions.
RANDOM walk for 40000 steps (36 resets) in 2765 ms. (14 steps per ms) remains 7/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 240 ms. (165 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 7/7 properties
[2024-06-01 14:42:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 892/908 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/908 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 6/914 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/914 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 17/931 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/931 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 9 (OVERLAPS) 964/1895 variables, 931/985 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1895 variables, 0/985 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 87/1982 variables, 87/1072 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1982 variables, 0/1072 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1982 variables, 0/1072 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1982/1982 variables, and 1072 constraints, problems are : Problem set: 6 solved, 1 unsolved in 2730 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 1018/1018 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 844/847 variables, 45/45 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/847 variables, 0/45 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/856 variables, 3/48 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/856 variables, 0/48 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 75/931 variables, 6/54 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/931 variables, 0/54 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 964/1895 variables, 931/985 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1895 variables, 0/985 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 87/1982 variables, 87/1072 constraints. Problems are: Problem set: 6 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1982/1982 variables, and 1073 constraints, problems are : Problem set: 6 solved, 1 unsolved in 1806 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 1018/1018 constraints, PredecessorRefiner: 1/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 4609ms problems are : Problem set: 6 solved, 1 unsolved
Parikh walk visited 0 properties in 412 ms.
Support contains 3 out of 1018 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Graph (complete) has 1936 edges and 1018 vertex of which 984 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.7 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 452 rules applied. Total rules applied 453 place count 984 transition count 512
Reduce places removed 421 places and 0 transitions.
Graph (complete) has 980 edges and 563 vertex of which 473 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.2 ms
Discarding 90 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 423 rules applied. Total rules applied 876 place count 473 transition count 511
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 91 rules applied. Total rules applied 967 place count 472 transition count 421
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 968 place count 471 transition count 420
Iterating global reduction 3 with 1 rules applied. Total rules applied 969 place count 471 transition count 420
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 970 place count 470 transition count 419
Iterating global reduction 3 with 1 rules applied. Total rules applied 971 place count 470 transition count 419
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 3 with 14 rules applied. Total rules applied 985 place count 470 transition count 405
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 999 place count 456 transition count 405
Reduce places removed 44 places and 44 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 1043 place count 412 transition count 361
Reduce places removed 31 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 4 with 238 rules applied. Total rules applied 1281 place count 381 transition count 154
Reduce places removed 207 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 208 rules applied. Total rules applied 1489 place count 174 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1490 place count 173 transition count 153
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 17 Pre rules applied. Total rules applied 1490 place count 173 transition count 136
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 1524 place count 156 transition count 136
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 1525 place count 155 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1525 place count 155 transition count 135
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1527 place count 154 transition count 135
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1533 place count 151 transition count 132
Applied a total of 1533 rules in 565 ms. Remains 151 /1018 variables (removed 867) and now considering 132/964 (removed 832) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 565 ms. Remains : 151/1018 places, 132/964 transitions.
RANDOM walk for 4102 steps (27 resets) in 60 ms. (67 steps per ms) remains 0/1 properties
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1018 stabilizing places and 964 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1018 transition count 964
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||(p1&&G(p2))))))'
Support contains 5 out of 1018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1016 transition count 964
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 1011 transition count 959
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 1011 transition count 959
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 1006 transition count 954
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 1006 transition count 954
Applied a total of 22 rules in 147 ms. Remains 1006 /1018 variables (removed 12) and now considering 954/964 (removed 10) transitions.
// Phase 1: matrix 954 rows 1006 cols
[2024-06-01 14:42:25] [INFO ] Computed 52 invariants in 16 ms
[2024-06-01 14:42:26] [INFO ] Implicit Places using invariants in 998 ms returned []
[2024-06-01 14:42:26] [INFO ] Invariant cache hit.
[2024-06-01 14:42:35] [INFO ] Implicit Places using invariants and state equation in 8832 ms returned []
Implicit Place search using SMT with State Equation took 9833 ms to find 0 implicit places.
Running 909 sub problems to find dead transitions.
[2024-06-01 14:42:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/1960 variables, and 6 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1006 constraints, PredecessorRefiner: 909/909 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 909 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/960 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 2 (OVERLAPS) 2/962 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 962/1960 variables, and 7 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1006 constraints, PredecessorRefiner: 0/909 constraints, Known Traps: 0/0 constraints]
After SMT, in 60465ms problems are : Problem set: 0 solved, 909 unsolved
Search for dead transitions found 0 dead transitions in 60478ms
Starting structural reductions in LTL mode, iteration 1 : 1006/1018 places, 954/964 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70471 ms. Remains : 1006/1018 places, 954/964 transitions.
Stuttering acceptance computed with spot in 557 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-00
Stuttering criterion allowed to conclude after 1020 steps with 0 reset in 26 ms.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-00 finished in 71183 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(p0)))'
Support contains 2 out of 1018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1015 transition count 964
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 1010 transition count 959
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 1010 transition count 959
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 1005 transition count 954
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 1005 transition count 954
Applied a total of 23 rules in 775 ms. Remains 1005 /1018 variables (removed 13) and now considering 954/964 (removed 10) transitions.
// Phase 1: matrix 954 rows 1005 cols
[2024-06-01 14:43:37] [INFO ] Computed 51 invariants in 17 ms
[2024-06-01 14:43:38] [INFO ] Implicit Places using invariants in 1124 ms returned []
[2024-06-01 14:43:38] [INFO ] Invariant cache hit.
[2024-06-01 14:43:47] [INFO ] Implicit Places using invariants and state equation in 9003 ms returned []
Implicit Place search using SMT with State Equation took 10136 ms to find 0 implicit places.
Running 909 sub problems to find dead transitions.
[2024-06-01 14:43:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s3 1.0)
(s5 1.0)
(s7 1.0)
(s9 1.0)
(s11 1.0)
(s13 1.0)
(s15 1.0)
(s17 1.0)
(s19 1.0)
(s21 1.0)
(s23 1.0)
(s25 1.0)
(s27 1.0)
(s29 1.0)
(s31 1.0)
(s33 1.0)
(s35 1.0)
(s37 1.0)
(s39 1.0)
(s41 1.0)
(s43 1.0)
(s45 1.0)
(s47 1.0)
(s49 1.0)
(s51 1.0)
(s53 1.0)
(s55 1.0)
(s57 1.0)
(s59 1.0)
(s61 1.0)
(s63 1.0)
(s65 1.0)
(s67 1.0)
(s69 1.0)
(s71 1.0)
(s73 1.0)
(s75 1.0)
(s77 1.0)
(s79 1.0)
(s81 1.0)
(s83 1.0)
(s85 1.0)
(s87 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/1959 variables, and 6 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 909/909 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 909 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/960 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 2 (OVERLAPS) 45/1005 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 723)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 723)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 721)
(s16 0)
(s17 721)
(s18 719)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 1)
(s24 0)
(s25 1)
(s26 0)
(s27 1)
(s28 712)
(s29 1)
(s30 0)
(s31 713)
(s32 0)
(s33 713)
(s34 0)
(s35 1)
(s36 0)
(s37 711)
(s38 0)
(s39 1)
(s40 708)
(s41 1)
(s42 0)
(s43 708)
(s44 706)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 704)
(s52 0)
(s53 703)
(s54 0)
(s55 1)
(s56 0)
(s57 700)
(s58 697)
(s59 1)
(s60 0)
(s61 697)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 1)
(s68 0)
(s69 1)
(s70 693)
(s71 1)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 0)
(s79 1)
(s80 0)
(s81 1)
(s82 683)
(s83 1)
(s84 681)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 723)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 723)
(s104 1)
(s105 1)
(s106 1)
(s107 723)
(s108 1)
(s109 722)
(s110 1)
(s111 1)
(s112 1)
(s113 721)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 719)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 718)
(s140 1)
(s141 714)
(s142 1)
(s143 716)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 712)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 710)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 705)
(s186 1)
(s187 706)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 702)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 697)
(s220 1)
(s221 1)
(s222 1)
(s223 697)
(s224 1)
(s225 1)
(s226 1)
(s227 696)
(s228 1)
(s229 1)
(s230 1)
(s231 695)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 692)
(s240 1)
(s241 689)
(s242 1)
(s243 690)
(s244 1)
(s245 688)
(s246 1)
(s247 1)
(s248 1)
(s249 686)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 680)
(s262 1)
(s263 1)
(s264 1)
(s265 723)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1005/1959 variables, and 51 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 0/909 constraints, Known Traps: 0/0 constraints]
After SMT, in 60535ms problems are : Problem set: 0 solved, 909 unsolved
Search for dead transitions found 0 dead transitions in 60553ms
Starting structural reductions in LTL mode, iteration 1 : 1005/1018 places, 954/964 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71470 ms. Remains : 1005/1018 places, 954/964 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-02 finished in 71696 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&&X(p1)))))'
Support contains 3 out of 1018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1015 transition count 964
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 1010 transition count 959
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 1010 transition count 959
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 1005 transition count 954
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 1005 transition count 954
Applied a total of 23 rules in 218 ms. Remains 1005 /1018 variables (removed 13) and now considering 954/964 (removed 10) transitions.
// Phase 1: matrix 954 rows 1005 cols
[2024-06-01 14:44:48] [INFO ] Computed 51 invariants in 14 ms
[2024-06-01 14:44:49] [INFO ] Implicit Places using invariants in 1397 ms returned []
[2024-06-01 14:44:49] [INFO ] Invariant cache hit.
[2024-06-01 14:44:58] [INFO ] Implicit Places using invariants and state equation in 8788 ms returned []
Implicit Place search using SMT with State Equation took 10187 ms to find 0 implicit places.
Running 909 sub problems to find dead transitions.
[2024-06-01 14:44:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s3 1.0)
(s5 1.0)
(s7 1.0)
(s9 1.0)
(s11 1.0)
(s13 1.0)
(s15 1.0)
(s17 1.0)
(s19 1.0)
(s21 1.0)
(s23 1.0)
(s25 1.0)
(s27 1.0)
(s29 1.0)
(s31 1.0)
(s33 1.0)
(s35 1.0)
(s37 1.0)
(s39 1.0)
(s41 1.0)
(s43 1.0)
(s45 1.0)
(s47 1.0)
(s49 1.0)
(s51 1.0)
(s53 1.0)
(s55 1.0)
(s57 1.0)
(s59 1.0)
(s61 1.0)
(s63 1.0)
(s65 1.0)
(s67 1.0)
(s69 1.0)
(s71 1.0)
(s73 1.0)
(s75 1.0)
(s77 1.0)
(s79 1.0)
(s81 1.0)
(s83 1.0)
(s85 1.0)
(s87 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/1959 variables, and 6 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 909/909 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 909 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/960 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 2 (OVERLAPS) 45/1005 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 722)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 0)
(s19 720)
(s20 0)
(s21 1)
(s22 0)
(s23 718)
(s24 0)
(s25 716)
(s26 0)
(s27 714)
(s28 712)
(s29 1)
(s30 0)
(s31 713)
(s32 712)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 706)
(s46 0)
(s47 1)
(s48 0)
(s49 705)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 702)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 1)
(s68 694)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 692)
(s74 0)
(s75 690)
(s76 0)
(s77 1)
(s78 0)
(s79 1)
(s80 0)
(s81 686)
(s82 0)
(s83 684)
(s84 0)
(s85 682)
(s86 679)
(s87 1)
(s88 0)
(s89 724)
(s90 1)
(s91 1)
(s92 1)
(s93 723)
(s94 1)
(s95 1)
(s96 1)
(s97 723)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 723)
(s106 1)
(s107 723)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 721)
(s114 1)
(s115 722)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 721)
(s124 1)
(s125 1)
(s126 1)
(s127 721)
(s128 1)
(s129 719)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 712)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 710)
(s166 1)
(s167 711)
(s168 1)
(s169 709)
(s170 1)
(s171 1)
(s172 1)
(s173 708)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 706)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 703)
(s196 1)
(s197 704)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 700)
(s210 1)
(s211 697)
(s212 1)
(s213 698)
(s214 1)
(s215 697)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 697)
(s226 1)
(s227 1)
(s228 1)
(s229 696)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 694)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 689)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 688)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1005/1959 variables, and 51 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 0/909 constraints, Known Traps: 0/0 constraints]
After SMT, in 60593ms problems are : Problem set: 0 solved, 909 unsolved
Search for dead transitions found 0 dead transitions in 60611ms
Starting structural reductions in LTL mode, iteration 1 : 1005/1018 places, 954/964 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71021 ms. Remains : 1005/1018 places, 954/964 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-05
Product exploration explored 100000 steps with 218 reset in 992 ms.
Product exploration explored 100000 steps with 218 reset in 719 ms.
Computed a total of 1005 stabilizing places and 954 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1005 transition count 954
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 267 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
RANDOM walk for 40000 steps (36 resets) in 444 ms. (89 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 1/1 properties
[2024-06-01 14:46:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 653/656 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/656 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 261/917 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/917 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 954/1871 variables, 917/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1871 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/1959 variables, 88/1056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1959 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1959 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1959/1959 variables, and 1056 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1310 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 1005/1005 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 653/656 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/656 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 261/917 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/917 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 954/1871 variables, 917/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1871 variables, 1/969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1871 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 88/1959 variables, 88/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1959 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1959 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1959/1959 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1621 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 1005/1005 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2973ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 173 ms.
Support contains 3 out of 1005 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1005/1005 places, 954/954 transitions.
Graph (complete) has 1918 edges and 1005 vertex of which 960 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.4 ms
Discarding 45 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 424 transitions
Trivial Post-agglo rules discarded 424 transitions
Performed 424 trivial Post agglomeration. Transition count delta: 424
Iterating post reduction 0 with 469 rules applied. Total rules applied 470 place count 960 transition count 485
Reduce places removed 424 places and 0 transitions.
Graph (complete) has 936 edges and 536 vertex of which 211 are kept as prefixes of interest. Removing 325 places using SCC suffix rule.2 ms
Discarding 325 places :
Also discarding 99 output transitions
Drop transitions (Output transitions of discarded places.) removed 99 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 427 rules applied. Total rules applied 897 place count 211 transition count 384
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 214 transitions
Reduce isomorphic transitions removed 214 transitions.
Iterating post reduction 2 with 216 rules applied. Total rules applied 1113 place count 209 transition count 170
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1113 place count 209 transition count 168
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1117 place count 207 transition count 168
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1119 place count 207 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1121 place count 205 transition count 166
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1122 place count 205 transition count 166
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1123 place count 204 transition count 165
Iterating global reduction 4 with 1 rules applied. Total rules applied 1124 place count 204 transition count 165
Reduce places removed 33 places and 33 transitions.
Iterating global reduction 4 with 33 rules applied. Total rules applied 1157 place count 171 transition count 132
Reduce places removed 33 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 4 with 144 rules applied. Total rules applied 1301 place count 138 transition count 21
Reduce places removed 111 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 112 rules applied. Total rules applied 1413 place count 27 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1414 place count 26 transition count 20
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 10 Pre rules applied. Total rules applied 1414 place count 26 transition count 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1438 place count 12 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 4 rules applied. Total rules applied 1442 place count 11 transition count 7
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1445 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1445 place count 8 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1447 place count 7 transition count 6
Applied a total of 1447 rules in 142 ms. Remains 7 /1005 variables (removed 998) and now considering 6/954 (removed 948) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 7/1005 places, 6/954 transitions.
RANDOM walk for 29 steps (3 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 816 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
[2024-06-01 14:46:07] [INFO ] Invariant cache hit.
[2024-06-01 14:46:08] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 242 ms returned sat
[2024-06-01 14:46:22] [INFO ] [Real]Absence check using state equation in 13583 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 1005 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1005/1005 places, 954/954 transitions.
Reduce places removed 45 places and 45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 424 transitions
Trivial Post-agglo rules discarded 424 transitions
Performed 424 trivial Post agglomeration. Transition count delta: 424
Iterating post reduction 0 with 424 rules applied. Total rules applied 424 place count 960 transition count 485
Reduce places removed 424 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 426 rules applied. Total rules applied 850 place count 536 transition count 483
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 852 place count 534 transition count 483
Applied a total of 852 rules in 78 ms. Remains 534 /1005 variables (removed 471) and now considering 483/954 (removed 471) transitions.
// Phase 1: matrix 483 rows 534 cols
[2024-06-01 14:46:22] [INFO ] Computed 51 invariants in 4 ms
[2024-06-01 14:46:23] [INFO ] Implicit Places using invariants in 971 ms returned []
[2024-06-01 14:46:23] [INFO ] Invariant cache hit.
[2024-06-01 14:46:26] [INFO ] Implicit Places using invariants and state equation in 3181 ms returned []
Implicit Place search using SMT with State Equation took 4155 ms to find 0 implicit places.
[2024-06-01 14:46:26] [INFO ] Redundant transitions in 38 ms returned []
Running 394 sub problems to find dead transitions.
[2024-06-01 14:46:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 2/447 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 398/845 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 845/1017 variables, and 498 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 2/447 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 398/845 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/845 variables, 394/892 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 845/1017 variables, and 892 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 60206ms
Starting structural reductions in SI_LTL mode, iteration 1 : 534/1005 places, 483/954 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64487 ms. Remains : 534/1005 places, 483/954 transitions.
Computed a total of 534 stabilizing places and 483 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 534 transition count 483
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 920 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
RANDOM walk for 40001 steps (72 resets) in 336 ms. (118 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 1/1 properties
[2024-06-01 14:47:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 342/345 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/446 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 396/842 variables, 446/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/842 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/843 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/843 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/843 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 843/1017 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 615 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 342/345 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/446 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 396/842 variables, 446/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/842 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/842 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/843 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/843 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/843 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 843/1017 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 769 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1398ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 76 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=38 )
Parikh walk visited 1 properties in 12 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F p0), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 9 factoid took 1303 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
[2024-06-01 14:47:31] [INFO ] Invariant cache hit.
[2024-06-01 14:47:32] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 401 ms returned sat
[2024-06-01 14:47:44] [INFO ] [Real]Absence check using state equation in 11675 ms returned sat
[2024-06-01 14:47:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:47:45] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 365 ms returned sat
[2024-06-01 14:47:46] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2024-06-01 14:47:46] [INFO ] Computed and/alt/rep : 394/401/394 causal constraints (skipped 0 transitions) in 52 ms.
[2024-06-01 14:47:47] [INFO ] Added : 102 causal constraints over 21 iterations in 1283 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Product exploration explored 100000 steps with 471 reset in 1039 ms.
Product exploration explored 100000 steps with 471 reset in 1069 ms.
Support contains 3 out of 534 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 534/534 places, 483/483 transitions.
Applied a total of 0 rules in 25 ms. Remains 534 /534 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2024-06-01 14:47:49] [INFO ] Invariant cache hit.
[2024-06-01 14:47:50] [INFO ] Implicit Places using invariants in 1081 ms returned []
[2024-06-01 14:47:50] [INFO ] Invariant cache hit.
[2024-06-01 14:47:55] [INFO ] Implicit Places using invariants and state equation in 4063 ms returned []
Implicit Place search using SMT with State Equation took 5153 ms to find 0 implicit places.
[2024-06-01 14:47:55] [INFO ] Redundant transitions in 17 ms returned []
Running 394 sub problems to find dead transitions.
[2024-06-01 14:47:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 2/447 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 398/845 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 394 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 845/1017 variables, and 498 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 2/447 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 398/845 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/845 variables, 394/892 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s89 0)
(s91 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(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 0)
(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 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 845/1017 variables, and 892 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65342 ms. Remains : 534/534 places, 483/483 transitions.
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-05 finished in 247130 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))'
Support contains 3 out of 1018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Graph (complete) has 1936 edges and 1018 vertex of which 1015 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 44 places and 44 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 421 rules applied. Total rules applied 422 place count 971 transition count 499
Reduce places removed 421 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 422 rules applied. Total rules applied 844 place count 550 transition count 498
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 845 place count 549 transition count 498
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 851 place count 543 transition count 492
Iterating global reduction 3 with 6 rules applied. Total rules applied 857 place count 543 transition count 492
Applied a total of 857 rules in 62 ms. Remains 543 /1018 variables (removed 475) and now considering 492/964 (removed 472) transitions.
// Phase 1: matrix 492 rows 543 cols
[2024-06-01 14:48:55] [INFO ] Computed 51 invariants in 7 ms
[2024-06-01 14:48:56] [INFO ] Implicit Places using invariants in 969 ms returned []
[2024-06-01 14:48:56] [INFO ] Invariant cache hit.
[2024-06-01 14:48:59] [INFO ] Implicit Places using invariants and state equation in 3271 ms returned []
Implicit Place search using SMT with State Equation took 4243 ms to find 0 implicit places.
[2024-06-01 14:48:59] [INFO ] Redundant transitions in 9 ms returned []
Running 406 sub problems to find dead transitions.
[2024-06-01 14:48:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 3/460 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (OVERLAPS) 409/869 variables, 460/511 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/1035 variables, and 511 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 460/543 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 3/460 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (OVERLAPS) 409/869 variables, 460/511 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/869 variables, 406/917 constraints. Problems are: Problem set: 0 solved, 406 unsolved
(s422 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 0)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 0)
(s135 0)
(s136 0)
(s137 0)
(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 0)
(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 0)
(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 0)
(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 0)
(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 1)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(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 0)
(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 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/1035 variables, and 917 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 460/543 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 0/0 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Starting structural reductions in SI_LTL mode, iteration 1 : 543/1018 places, 492/964 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64459 ms. Remains : 543/1018 places, 492/964 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-06
Stuttering criterion allowed to conclude after 538 steps with 0 reset in 4 ms.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-06 finished in 64606 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)))'
Support contains 2 out of 1018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Graph (complete) has 1936 edges and 1018 vertex of which 1015 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 44 places and 44 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 432 transitions
Trivial Post-agglo rules discarded 432 transitions
Performed 432 trivial Post agglomeration. Transition count delta: 432
Iterating post reduction 0 with 432 rules applied. Total rules applied 433 place count 971 transition count 488
Reduce places removed 432 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 433 rules applied. Total rules applied 866 place count 539 transition count 487
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 867 place count 538 transition count 487
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 873 place count 532 transition count 481
Iterating global reduction 3 with 6 rules applied. Total rules applied 879 place count 532 transition count 481
Applied a total of 879 rules in 120 ms. Remains 532 /1018 variables (removed 486) and now considering 481/964 (removed 483) transitions.
// Phase 1: matrix 481 rows 532 cols
[2024-06-01 14:50:00] [INFO ] Computed 51 invariants in 5 ms
[2024-06-01 14:50:01] [INFO ] Implicit Places using invariants in 1103 ms returned []
[2024-06-01 14:50:01] [INFO ] Invariant cache hit.
[2024-06-01 14:50:02] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 14:50:06] [INFO ] Implicit Places using invariants and state equation in 4855 ms returned []
Implicit Place search using SMT with State Equation took 5961 ms to find 0 implicit places.
[2024-06-01 14:50:06] [INFO ] Redundant transitions in 4 ms returned []
Running 395 sub problems to find dead transitions.
[2024-06-01 14:50:06] [INFO ] Invariant cache hit.
[2024-06-01 14:50:06] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 3/449 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (OVERLAPS) 398/847 variables, 449/500 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 9/509 constraints. Problems are: Problem set: 0 solved, 395 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 847/1013 variables, and 509 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 449/532 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 3/449 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (OVERLAPS) 398/847 variables, 449/500 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 9/509 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/847 variables, 395/904 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 847/1013 variables, and 904 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 449/532 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in SI_LTL mode, iteration 1 : 532/1018 places, 481/964 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66221 ms. Remains : 532/1018 places, 481/964 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-08
Product exploration explored 100000 steps with 323 reset in 866 ms.
Product exploration explored 100000 steps with 344 reset in 616 ms.
Computed a total of 532 stabilizing places and 481 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 532 transition count 481
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 705 steps (0 resets) in 10 ms. (64 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 481/481 transitions.
Applied a total of 0 rules in 38 ms. Remains 532 /532 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2024-06-01 14:51:08] [INFO ] Invariant cache hit.
[2024-06-01 14:51:09] [INFO ] Implicit Places using invariants in 795 ms returned []
[2024-06-01 14:51:09] [INFO ] Invariant cache hit.
[2024-06-01 14:51:10] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 14:51:14] [INFO ] Implicit Places using invariants and state equation in 4520 ms returned []
Implicit Place search using SMT with State Equation took 5321 ms to find 0 implicit places.
[2024-06-01 14:51:14] [INFO ] Redundant transitions in 5 ms returned []
Running 395 sub problems to find dead transitions.
[2024-06-01 14:51:14] [INFO ] Invariant cache hit.
[2024-06-01 14:51:14] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 3/449 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (OVERLAPS) 398/847 variables, 449/500 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 9/509 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 847/1013 variables, and 509 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 449/532 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 3/449 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (OVERLAPS) 398/847 variables, 449/500 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 9/509 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/847 variables, 395/904 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 847/1013 variables, and 904 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 449/532 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65499 ms. Remains : 532/532 places, 481/481 transitions.
Computed a total of 532 stabilizing places and 481 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 532 transition count 481
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 692 steps (0 resets) in 12 ms. (53 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 328 reset in 770 ms.
Product exploration explored 100000 steps with 344 reset in 581 ms.
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 481/481 transitions.
Applied a total of 0 rules in 22 ms. Remains 532 /532 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2024-06-01 14:52:16] [INFO ] Invariant cache hit.
[2024-06-01 14:52:17] [INFO ] Implicit Places using invariants in 922 ms returned []
[2024-06-01 14:52:17] [INFO ] Invariant cache hit.
[2024-06-01 14:52:18] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 14:52:21] [INFO ] Implicit Places using invariants and state equation in 4301 ms returned []
Implicit Place search using SMT with State Equation took 5227 ms to find 0 implicit places.
[2024-06-01 14:52:21] [INFO ] Redundant transitions in 2 ms returned []
Running 395 sub problems to find dead transitions.
[2024-06-01 14:52:21] [INFO ] Invariant cache hit.
[2024-06-01 14:52:21] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 3/449 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (OVERLAPS) 398/847 variables, 449/500 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 9/509 constraints. Problems are: Problem set: 0 solved, 395 unsolved
(s135 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 847/1013 variables, and 509 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 449/532 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 3/449 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (OVERLAPS) 398/847 variables, 449/500 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 9/509 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/847 variables, 395/904 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 847/1013 variables, and 904 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 449/532 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65349 ms. Remains : 532/532 places, 481/481 transitions.
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-08 finished in 202161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 4 out of 1018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Graph (complete) has 1936 edges and 1018 vertex of which 1015 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 44 places and 44 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 429 transitions
Trivial Post-agglo rules discarded 429 transitions
Performed 429 trivial Post agglomeration. Transition count delta: 429
Iterating post reduction 0 with 429 rules applied. Total rules applied 430 place count 971 transition count 491
Reduce places removed 429 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 432 rules applied. Total rules applied 862 place count 542 transition count 488
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 865 place count 539 transition count 488
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 870 place count 534 transition count 483
Iterating global reduction 3 with 5 rules applied. Total rules applied 875 place count 534 transition count 483
Applied a total of 875 rules in 79 ms. Remains 534 /1018 variables (removed 484) and now considering 483/964 (removed 481) transitions.
// Phase 1: matrix 483 rows 534 cols
[2024-06-01 14:53:22] [INFO ] Computed 51 invariants in 5 ms
[2024-06-01 14:53:23] [INFO ] Implicit Places using invariants in 1251 ms returned []
[2024-06-01 14:53:23] [INFO ] Invariant cache hit.
[2024-06-01 14:53:24] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 14:53:27] [INFO ] Implicit Places using invariants and state equation in 3752 ms returned []
Implicit Place search using SMT with State Equation took 5006 ms to find 0 implicit places.
[2024-06-01 14:53:27] [INFO ] Redundant transitions in 4 ms returned []
Running 397 sub problems to find dead transitions.
[2024-06-01 14:53:27] [INFO ] Invariant cache hit.
[2024-06-01 14:53:27] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 3/451 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/451 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (OVERLAPS) 401/852 variables, 451/502 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/852 variables, 10/512 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 (/ 1.0 4.0))
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s91 1.0)
(s92 (/ 3.0 4.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 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 0.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 1.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 0.0)
(s257 0.0)
(s258 1.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 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 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 852/1017 variables, and 512 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 451/534 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 3/451 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/451 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (OVERLAPS) 401/852 variables, 451/502 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/852 variables, 10/512 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/852 variables, 397/909 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 852/1017 variables, and 909 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 451/534 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Starting structural reductions in SI_LTL mode, iteration 1 : 534/1018 places, 483/964 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65230 ms. Remains : 534/1018 places, 483/964 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 205 steps with 0 reset in 3 ms.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-09 finished in 65409 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(p1))))'
Support contains 4 out of 1018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Graph (complete) has 1936 edges and 1018 vertex of which 1015 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 45 places and 45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 428 transitions
Trivial Post-agglo rules discarded 428 transitions
Performed 428 trivial Post agglomeration. Transition count delta: 428
Iterating post reduction 0 with 428 rules applied. Total rules applied 429 place count 970 transition count 491
Reduce places removed 428 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 430 rules applied. Total rules applied 859 place count 542 transition count 489
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 861 place count 540 transition count 489
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 867 place count 534 transition count 483
Iterating global reduction 3 with 6 rules applied. Total rules applied 873 place count 534 transition count 483
Applied a total of 873 rules in 54 ms. Remains 534 /1018 variables (removed 484) and now considering 483/964 (removed 481) transitions.
// Phase 1: matrix 483 rows 534 cols
[2024-06-01 14:54:27] [INFO ] Computed 51 invariants in 6 ms
[2024-06-01 14:54:28] [INFO ] Implicit Places using invariants in 775 ms returned []
[2024-06-01 14:54:28] [INFO ] Invariant cache hit.
[2024-06-01 14:54:31] [INFO ] Implicit Places using invariants and state equation in 3070 ms returned []
Implicit Place search using SMT with State Equation took 3850 ms to find 0 implicit places.
[2024-06-01 14:54:31] [INFO ] Redundant transitions in 2 ms returned []
Running 394 sub problems to find dead transitions.
[2024-06-01 14:54:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 2/447 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 396/843 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 843/1017 variables, and 498 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 2/447 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 396/843 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/843 variables, 394/892 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 843/1017 variables, and 892 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in SI_LTL mode, iteration 1 : 534/1018 places, 483/964 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64013 ms. Remains : 534/1018 places, 483/964 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-12
Product exploration explored 100000 steps with 189 reset in 686 ms.
Product exploration explored 100000 steps with 189 reset in 630 ms.
Computed a total of 534 stabilizing places and 483 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 534 transition count 483
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 218 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (72 resets) in 261 ms. (152 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
[2024-06-01 14:55:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 401/405 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/447 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 396/843 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/843 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/843 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 843/1017 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 516 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 401/405 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/447 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 843/1017 variables, and 498 constraints, problems are : Problem set: 1 solved, 0 unsolved in 497 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1025ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 21 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-45-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-12 finished in 67225 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(p0)&&F(p1)))'
Support contains 3 out of 1018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1016 transition count 964
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 1012 transition count 960
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 1012 transition count 960
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 1008 transition count 956
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 1008 transition count 956
Applied a total of 18 rules in 207 ms. Remains 1008 /1018 variables (removed 10) and now considering 956/964 (removed 8) transitions.
// Phase 1: matrix 956 rows 1008 cols
[2024-06-01 14:55:35] [INFO ] Computed 52 invariants in 12 ms
[2024-06-01 14:55:36] [INFO ] Implicit Places using invariants in 1120 ms returned []
[2024-06-01 14:55:36] [INFO ] Invariant cache hit.
[2024-06-01 14:55:44] [INFO ] Implicit Places using invariants and state equation in 7891 ms returned []
Implicit Place search using SMT with State Equation took 9019 ms to find 0 implicit places.
Running 911 sub problems to find dead transitions.
[2024-06-01 14:55:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/962 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 911 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 962/1964 variables, and 6 constraints, problems are : Problem set: 0 solved, 911 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1008 constraints, PredecessorRefiner: 911/911 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 911 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/962 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 911 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/962 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 911 unsolved
At refinement iteration 2 (OVERLAPS) 2/964 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 911 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 964/1964 variables, and 7 constraints, problems are : Problem set: 0 solved, 911 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1008 constraints, PredecessorRefiner: 0/911 constraints, Known Traps: 0/0 constraints]
After SMT, in 60422ms problems are : Problem set: 0 solved, 911 unsolved
Search for dead transitions found 0 dead transitions in 60437ms
Starting structural reductions in LTL mode, iteration 1 : 1008/1018 places, 956/964 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69668 ms. Remains : 1008/1018 places, 956/964 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 826 ms.
Product exploration explored 100000 steps with 50000 reset in 739 ms.
Computed a total of 1008 stabilizing places and 956 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1008 transition count 956
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 35 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-45-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-14 finished in 72005 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&&X(p1)))))'
Found a Shortening insensitive property : HirschbergSinclair-PT-45-LTLCardinality-05
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 1018 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Graph (complete) has 1936 edges and 1018 vertex of which 1015 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 45 places and 45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 429 transitions
Trivial Post-agglo rules discarded 429 transitions
Performed 429 trivial Post agglomeration. Transition count delta: 429
Iterating post reduction 0 with 429 rules applied. Total rules applied 430 place count 970 transition count 490
Reduce places removed 429 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 431 rules applied. Total rules applied 861 place count 541 transition count 488
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 863 place count 539 transition count 488
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 868 place count 534 transition count 483
Iterating global reduction 3 with 5 rules applied. Total rules applied 873 place count 534 transition count 483
Applied a total of 873 rules in 76 ms. Remains 534 /1018 variables (removed 484) and now considering 483/964 (removed 481) transitions.
// Phase 1: matrix 483 rows 534 cols
[2024-06-01 14:56:47] [INFO ] Computed 51 invariants in 6 ms
[2024-06-01 14:56:48] [INFO ] Implicit Places using invariants in 1090 ms returned []
[2024-06-01 14:56:48] [INFO ] Invariant cache hit.
[2024-06-01 14:56:52] [INFO ] Implicit Places using invariants and state equation in 3992 ms returned []
Implicit Place search using SMT with State Equation took 5095 ms to find 0 implicit places.
Running 394 sub problems to find dead transitions.
[2024-06-01 14:56:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 2/447 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 398/845 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 845/1017 variables, and 498 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 2/447 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 398/845 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/845 variables, 394/892 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 845/1017 variables, and 892 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in LI_LTL mode, iteration 1 : 534/1018 places, 483/964 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 65334 ms. Remains : 534/1018 places, 483/964 transitions.
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-05
Product exploration explored 100000 steps with 471 reset in 810 ms.
Product exploration explored 100000 steps with 471 reset in 1089 ms.
Computed a total of 534 stabilizing places and 483 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 534 transition count 483
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 738 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
RANDOM walk for 40001 steps (72 resets) in 241 ms. (165 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
[2024-06-01 14:57:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 342/345 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/446 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 396/842 variables, 446/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/842 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/843 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/843 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/843 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 843/1017 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 608 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 342/345 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/446 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 396/842 variables, 446/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/842 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/842 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/843 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/843 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/843 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 843/1017 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 768 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1388ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 82 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=82 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F p0), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 1075 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
[2024-06-01 14:57:59] [INFO ] Invariant cache hit.
[2024-06-01 14:58:00] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 262 ms returned sat
[2024-06-01 14:58:11] [INFO ] [Real]Absence check using state equation in 11261 ms returned sat
[2024-06-01 14:58:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:58:12] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 438 ms returned sat
[2024-06-01 14:58:12] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2024-06-01 14:58:12] [INFO ] Computed and/alt/rep : 394/401/394 causal constraints (skipped 0 transitions) in 47 ms.
[2024-06-01 14:58:14] [INFO ] Added : 102 causal constraints over 21 iterations in 1141 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 534 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 534/534 places, 483/483 transitions.
Applied a total of 0 rules in 29 ms. Remains 534 /534 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2024-06-01 14:58:14] [INFO ] Invariant cache hit.
[2024-06-01 14:58:15] [INFO ] Implicit Places using invariants in 1234 ms returned []
[2024-06-01 14:58:15] [INFO ] Invariant cache hit.
[2024-06-01 14:58:18] [INFO ] Implicit Places using invariants and state equation in 3279 ms returned []
Implicit Place search using SMT with State Equation took 4516 ms to find 0 implicit places.
[2024-06-01 14:58:18] [INFO ] Redundant transitions in 5 ms returned []
Running 394 sub problems to find dead transitions.
[2024-06-01 14:58:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 2/447 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 398/845 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 394 unsolved
(s229 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s89 0.0)
(s91 1.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 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 0.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.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 845/1017 variables, and 498 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 2/447 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 398/845 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/845 variables, 394/892 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 845/1017 variables, and 892 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64696 ms. Remains : 534/534 places, 483/483 transitions.
Computed a total of 534 stabilizing places and 483 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 534 transition count 483
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 9 factoid took 992 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
RANDOM walk for 40000 steps (72 resets) in 228 ms. (174 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
[2024-06-01 14:59:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 342/345 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/446 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 396/842 variables, 446/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/842 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/843 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/843 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/843 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 843/1017 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 633 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 342/345 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/446 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 396/842 variables, 446/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/842 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/842 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/843 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/843 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/843 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 843/1017 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 773 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1417ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 82 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F p0), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 9 factoid took 1279 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
[2024-06-01 14:59:23] [INFO ] Invariant cache hit.
[2024-06-01 14:59:24] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 403 ms returned sat
[2024-06-01 14:59:36] [INFO ] [Real]Absence check using state equation in 11293 ms returned sat
[2024-06-01 14:59:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:59:37] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 375 ms returned sat
[2024-06-01 14:59:37] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2024-06-01 14:59:37] [INFO ] Computed and/alt/rep : 394/401/394 causal constraints (skipped 0 transitions) in 45 ms.
[2024-06-01 14:59:38] [INFO ] Added : 102 causal constraints over 21 iterations in 1022 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Product exploration explored 100000 steps with 470 reset in 988 ms.
Product exploration explored 100000 steps with 471 reset in 670 ms.
Support contains 3 out of 534 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 534/534 places, 483/483 transitions.
Applied a total of 0 rules in 16 ms. Remains 534 /534 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2024-06-01 14:59:40] [INFO ] Invariant cache hit.
[2024-06-01 14:59:41] [INFO ] Implicit Places using invariants in 1186 ms returned []
[2024-06-01 14:59:41] [INFO ] Invariant cache hit.
[2024-06-01 14:59:45] [INFO ] Implicit Places using invariants and state equation in 3349 ms returned []
Implicit Place search using SMT with State Equation took 4546 ms to find 0 implicit places.
[2024-06-01 14:59:45] [INFO ] Redundant transitions in 3 ms returned []
Running 394 sub problems to find dead transitions.
[2024-06-01 14:59:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 2/447 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 398/845 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 845/1017 variables, and 498 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 2/447 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 398/845 variables, 447/498 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/845 variables, 394/892 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 845/1017 variables, and 892 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 447/534 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64697 ms. Remains : 534/534 places, 483/483 transitions.
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-05 finished in 238453 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)))'
[2024-06-01 15:00:45] [INFO ] Flatten gal took : 97 ms
[2024-06-01 15:00:45] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 15:00:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1018 places, 964 transitions and 2895 arcs took 22 ms.
Total runtime 1180937 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : HirschbergSinclair-PT-45-LTLCardinality-05
Could not compute solution for formula : HirschbergSinclair-PT-45-LTLCardinality-08

BK_STOP 1717254785205

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name HirschbergSinclair-PT-45-LTLCardinality-05
ltl formula formula --ltl=/tmp/1697/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1018 places, 964 transitions and 2895 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.030 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1697/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1697/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1697/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1697/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1017 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1019, there are 971 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~509 levels ~10000 states ~48876 transitions
pnml2lts-mc( 0/ 4): ~509 levels ~20000 states ~75104 transitions
pnml2lts-mc( 2/ 4): ~508 levels ~40000 states ~136872 transitions
pnml2lts-mc( 2/ 4): ~508 levels ~80000 states ~277552 transitions
pnml2lts-mc( 3/ 4): ~508 levels ~160000 states ~557952 transitions
pnml2lts-mc( 2/ 4): ~508 levels ~320000 states ~1223348 transitions
pnml2lts-mc( 1/ 4): ~508 levels ~640000 states ~2427804 transitions
pnml2lts-mc( 1/ 4): ~508 levels ~1280000 states ~5365872 transitions
pnml2lts-mc( 1/ 4): ~508 levels ~2560000 states ~11832344 transitions
pnml2lts-mc( 3/ 4): ~508 levels ~5120000 states ~25032312 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8513575
pnml2lts-mc( 0/ 4): unique states count: 8515270
pnml2lts-mc( 0/ 4): unique transitions count: 42911919
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 34367494
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8516241
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2033
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8516241 states 42914096 transitions, fanout: 5.039
pnml2lts-mc( 0/ 4): Total exploration time 300.290 sec (300.270 sec minimum, 300.275 sec on average)
pnml2lts-mc( 0/ 4): States per second: 28360, Transitions per second: 142909
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 129.2MB, 15.9 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 25.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 994 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 129.2MB (~256.0MB paged-in)
ltl formula name HirschbergSinclair-PT-45-LTLCardinality-08
ltl formula formula --ltl=/tmp/1697/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1018 places, 964 transitions and 2895 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.040 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1697/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1697/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1697/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1697/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1017 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1019, there are 967 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~1043 levels ~10000 states ~45764 transitions
pnml2lts-mc( 0/ 4): ~1043 levels ~20000 states ~63600 transitions
pnml2lts-mc( 1/ 4): ~1027 levels ~40000 states ~104672 transitions
pnml2lts-mc( 0/ 4): ~1043 levels ~80000 states ~182424 transitions
pnml2lts-mc( 0/ 4): ~1043 levels ~160000 states ~406480 transitions
pnml2lts-mc( 0/ 4): ~1043 levels ~320000 states ~874320 transitions
pnml2lts-mc( 0/ 4): ~1043 levels ~640000 states ~1803796 transitions
pnml2lts-mc( 0/ 4): ~1043 levels ~1280000 states ~4192784 transitions
pnml2lts-mc( 0/ 4): ~1043 levels ~2560000 states ~8685588 transitions
pnml2lts-mc( 0/ 4): ~1043 levels ~5120000 states ~19108260 transitions
pnml2lts-mc( 0/ 4): ~1043 levels ~10240000 states ~40626020 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 12675455
pnml2lts-mc( 0/ 4): unique states count: 12678144
pnml2lts-mc( 0/ 4): unique transitions count: 51765282
pnml2lts-mc( 0/ 4): - self-loop count: 5682
pnml2lts-mc( 0/ 4): - claim dead count: 39068892
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 12700087
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3482
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12700087 states 51808732 transitions, fanout: 4.079
pnml2lts-mc( 0/ 4): Total exploration time 436.820 sec (436.810 sec minimum, 436.812 sec on average)
pnml2lts-mc( 0/ 4): States per second: 29074, Transitions per second: 118604
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 161.0MB, 13.3 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 37.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 994 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 161.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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