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-171649587500107.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-35, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649587500107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1000K
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 03:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 13 03:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 13 03:11 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 544K 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-35-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717246945267

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-35
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:02:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:02:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:02:27] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2024-06-01 13:02:27] [INFO ] Transformed 998 places.
[2024-06-01 13:02:27] [INFO ] Transformed 922 transitions.
[2024-06-01 13:02:27] [INFO ] Parsed PT model containing 998 places and 922 transitions and 2806 arcs in 365 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HirschbergSinclair-PT-35-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 922/922 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 963 transition count 922
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 64 place count 934 transition count 893
Iterating global reduction 1 with 29 rules applied. Total rules applied 93 place count 934 transition count 893
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 121 place count 906 transition count 865
Iterating global reduction 1 with 28 rules applied. Total rules applied 149 place count 906 transition count 865
Applied a total of 149 rules in 431 ms. Remains 906 /998 variables (removed 92) and now considering 865/922 (removed 57) transitions.
// Phase 1: matrix 865 rows 906 cols
[2024-06-01 13:02:28] [INFO ] Computed 41 invariants in 50 ms
[2024-06-01 13:02:29] [INFO ] Implicit Places using invariants in 1225 ms returned []
[2024-06-01 13:02:29] [INFO ] Invariant cache hit.
[2024-06-01 13:02:35] [INFO ] Implicit Places using invariants and state equation in 5994 ms returned []
Implicit Place search using SMT with State Equation took 7410 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2024-06-01 13:02:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/871 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/871 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 35/906 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 906/1771 variables, and 41 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30053 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/906 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/871 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/871 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 35/906 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/906 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 4 (OVERLAPS) 865/1771 variables, 906/947 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1771/1771 variables, and 1777 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30129 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 906/906 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints]
After SMT, in 60775ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60814ms
Starting structural reductions in LTL mode, iteration 1 : 906/998 places, 865/922 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68705 ms. Remains : 906/998 places, 865/922 transitions.
Support contains 48 out of 906 places after structural reductions.
[2024-06-01 13:03:36] [INFO ] Flatten gal took : 142 ms
[2024-06-01 13:03:37] [INFO ] Flatten gal took : 81 ms
[2024-06-01 13:03:37] [INFO ] Input system was already deterministic with 865 transitions.
Support contains 46 out of 906 places (down from 48) after GAL structural reductions.
RANDOM walk for 40000 steps (40 resets) in 2243 ms. (17 steps per ms) remains 9/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 152 ms. (261 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 9/9 properties
[2024-06-01 13:03:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 758/768 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 64/832 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/832 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 5 (OVERLAPS) 865/1697 variables, 832/873 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1697 variables, 0/873 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 74/1771 variables, 74/947 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1771 variables, 0/947 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1771 variables, 0/947 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1771/1771 variables, and 947 constraints, problems are : Problem set: 8 solved, 1 unsolved in 1443 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 906/906 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 690/692 variables, 34/34 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/692 variables, 0/34 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 140/832 variables, 7/41 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/832 variables, 0/41 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 865/1697 variables, 832/873 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1697 variables, 0/873 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 74/1771 variables, 74/947 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1771 variables, 1/948 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1771 variables, 0/948 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1771 variables, 0/948 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1771/1771 variables, and 948 constraints, problems are : Problem set: 8 solved, 1 unsolved in 1325 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 906/906 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 2798ms problems are : Problem set: 8 solved, 1 unsolved
Parikh walk visited 0 properties in 359 ms.
Support contains 2 out of 906 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 906/906 places, 865/865 transitions.
Graph (complete) has 1734 edges and 906 vertex of which 874 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.4 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 379 transitions
Trivial Post-agglo rules discarded 379 transitions
Performed 379 trivial Post agglomeration. Transition count delta: 379
Iterating post reduction 0 with 411 rules applied. Total rules applied 412 place count 874 transition count 454
Reduce places removed 379 places and 0 transitions.
Graph (complete) has 874 edges and 495 vertex of which 427 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.1 ms
Discarding 68 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 380 rules applied. Total rules applied 792 place count 427 transition count 454
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 860 place count 427 transition count 386
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 862 place count 425 transition count 384
Iterating global reduction 3 with 2 rules applied. Total rules applied 864 place count 425 transition count 384
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 865 place count 425 transition count 383
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 744 edges and 424 vertex of which 422 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 867 place count 422 transition count 383
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 869 place count 422 transition count 381
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 870 place count 421 transition count 380
Iterating global reduction 6 with 1 rules applied. Total rules applied 871 place count 421 transition count 380
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 873 place count 421 transition count 378
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 875 place count 419 transition count 378
Reduce places removed 34 places and 34 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 909 place count 385 transition count 344
Reduce places removed 31 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 7 with 281 rules applied. Total rules applied 1190 place count 354 transition count 94
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 8 with 250 rules applied. Total rules applied 1440 place count 104 transition count 94
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 27 Pre rules applied. Total rules applied 1440 place count 104 transition count 67
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 9 with 54 rules applied. Total rules applied 1494 place count 77 transition count 67
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 1495 place count 76 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1495 place count 76 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1497 place count 75 transition count 66
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 1503 place count 72 transition count 63
Applied a total of 1503 rules in 501 ms. Remains 72 /906 variables (removed 834) and now considering 63/865 (removed 802) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 501 ms. Remains : 72/906 places, 63/865 transitions.
RANDOM walk for 372 steps (2 resets) in 5 ms. (62 steps per ms) remains 0/1 properties
Successfully simplified 8 atomic propositions for a total of 13 simplifications.
FORMULA HirschbergSinclair-PT-35-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 906 stabilizing places and 865 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 906 transition count 865
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-35-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 906 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 906/906 places, 865/865 transitions.
Reduce places removed 35 places and 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 871 transition count 440
Reduce places removed 390 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 391 rules applied. Total rules applied 781 place count 481 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 782 place count 480 transition count 439
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 789 place count 473 transition count 432
Iterating global reduction 3 with 7 rules applied. Total rules applied 796 place count 473 transition count 432
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 797 place count 473 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 798 place count 472 transition count 431
Applied a total of 798 rules in 200 ms. Remains 472 /906 variables (removed 434) and now considering 431/865 (removed 434) transitions.
// Phase 1: matrix 431 rows 472 cols
[2024-06-01 13:03:42] [INFO ] Computed 41 invariants in 7 ms
[2024-06-01 13:03:43] [INFO ] Implicit Places using invariants in 610 ms returned []
[2024-06-01 13:03:43] [INFO ] Invariant cache hit.
[2024-06-01 13:03:45] [INFO ] Implicit Places using invariants and state equation in 2619 ms returned []
Implicit Place search using SMT with State Equation took 3231 ms to find 0 implicit places.
[2024-06-01 13:03:46] [INFO ] Redundant transitions in 28 ms returned []
Running 362 sub problems to find dead transitions.
[2024-06-01 13:03:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 2/405 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (OVERLAPS) 364/769 variables, 405/446 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/903 variables, and 446 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 405/472 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 2/405 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (OVERLAPS) 364/769 variables, 405/446 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 362/808 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/903 variables, and 808 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 405/472 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in SI_LTL mode, iteration 1 : 472/906 places, 431/865 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63615 ms. Remains : 472/906 places, 431/865 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-01
Product exploration explored 100000 steps with 425 reset in 798 ms.
Product exploration explored 100000 steps with 425 reset in 495 ms.
Computed a total of 472 stabilizing places and 431 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 472 transition count 431
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
RANDOM walk for 1002 steps (0 resets) in 15 ms. (62 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2024-06-01 13:04:48] [INFO ] Invariant cache hit.
[2024-06-01 13:04:49] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 318 ms returned sat
[2024-06-01 13:05:03] [INFO ] [Real]Absence check using state equation in 14015 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 472 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 472/472 places, 431/431 transitions.
Applied a total of 0 rules in 25 ms. Remains 472 /472 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-06-01 13:05:03] [INFO ] Invariant cache hit.
[2024-06-01 13:05:04] [INFO ] Implicit Places using invariants in 1025 ms returned []
[2024-06-01 13:05:04] [INFO ] Invariant cache hit.
[2024-06-01 13:05:07] [INFO ] Implicit Places using invariants and state equation in 3022 ms returned []
Implicit Place search using SMT with State Equation took 4051 ms to find 0 implicit places.
[2024-06-01 13:05:07] [INFO ] Redundant transitions in 14 ms returned []
Running 362 sub problems to find dead transitions.
[2024-06-01 13:05:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 2/405 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (OVERLAPS) 364/769 variables, 405/446 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/903 variables, and 446 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 405/472 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 2/405 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (OVERLAPS) 364/769 variables, 405/446 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 362/808 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/903 variables, and 808 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 405/472 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 0/0 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64236 ms. Remains : 472/472 places, 431/431 transitions.
Computed a total of 472 stabilizing places and 431 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 472 transition count 431
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
RANDOM walk for 993 steps (0 resets) in 20 ms. (47 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2024-06-01 13:06:08] [INFO ] Invariant cache hit.
[2024-06-01 13:06:09] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 356 ms returned sat
[2024-06-01 13:06:23] [INFO ] [Real]Absence check using state equation in 13981 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 425 reset in 345 ms.
Product exploration explored 100000 steps with 425 reset in 602 ms.
Support contains 2 out of 472 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 472/472 places, 431/431 transitions.
Applied a total of 0 rules in 35 ms. Remains 472 /472 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-06-01 13:06:24] [INFO ] Invariant cache hit.
[2024-06-01 13:06:25] [INFO ] Implicit Places using invariants in 610 ms returned []
[2024-06-01 13:06:25] [INFO ] Invariant cache hit.
[2024-06-01 13:06:27] [INFO ] Implicit Places using invariants and state equation in 2612 ms returned []
Implicit Place search using SMT with State Equation took 3233 ms to find 0 implicit places.
[2024-06-01 13:06:27] [INFO ] Redundant transitions in 4 ms returned []
Running 362 sub problems to find dead transitions.
[2024-06-01 13:06:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 2/405 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (OVERLAPS) 364/769 variables, 405/446 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/903 variables, and 446 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 405/472 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 2/405 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (OVERLAPS) 364/769 variables, 405/446 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 362/808 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/903 variables, and 808 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 405/472 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 0/0 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63393 ms. Remains : 472/472 places, 431/431 transitions.
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-01 finished in 225886 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(G(p1))||p0) U p2)))'
Support contains 6 out of 906 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 906/906 places, 865/865 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 901 transition count 860
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 901 transition count 860
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 897 transition count 856
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 897 transition count 856
Applied a total of 18 rules in 193 ms. Remains 897 /906 variables (removed 9) and now considering 856/865 (removed 9) transitions.
// Phase 1: matrix 856 rows 897 cols
[2024-06-01 13:07:28] [INFO ] Computed 41 invariants in 16 ms
[2024-06-01 13:07:29] [INFO ] Implicit Places using invariants in 701 ms returned []
[2024-06-01 13:07:29] [INFO ] Invariant cache hit.
[2024-06-01 13:07:35] [INFO ] Implicit Places using invariants and state equation in 6230 ms returned []
Implicit Place search using SMT with State Equation took 6955 ms to find 0 implicit places.
Running 821 sub problems to find dead transitions.
[2024-06-01 13:07:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 821 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 862/1753 variables, and 6 constraints, problems are : Problem set: 0 solved, 821 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 6/41 constraints, State Equation: 0/897 constraints, PredecessorRefiner: 821/821 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 821 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/862 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 2 (OVERLAPS) 35/897 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 821 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/1753 variables, and 41 constraints, problems are : Problem set: 0 solved, 821 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/897 constraints, PredecessorRefiner: 0/821 constraints, Known Traps: 0/0 constraints]
After SMT, in 60484ms problems are : Problem set: 0 solved, 821 unsolved
Search for dead transitions found 0 dead transitions in 60497ms
Starting structural reductions in LTL mode, iteration 1 : 897/906 places, 856/865 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67648 ms. Remains : 897/906 places, 856/865 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p2), (NOT p1), (NOT p2), true]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 582 steps with 1 reset in 7 ms.
FORMULA HirschbergSinclair-PT-35-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-02 finished in 67945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (G(F(p1))||G(p2)))))'
Support contains 6 out of 906 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 906/906 places, 865/865 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 899 transition count 858
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 899 transition count 858
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 893 transition count 852
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 893 transition count 852
Applied a total of 26 rules in 179 ms. Remains 893 /906 variables (removed 13) and now considering 852/865 (removed 13) transitions.
// Phase 1: matrix 852 rows 893 cols
[2024-06-01 13:08:36] [INFO ] Computed 41 invariants in 12 ms
[2024-06-01 13:08:37] [INFO ] Implicit Places using invariants in 1174 ms returned []
[2024-06-01 13:08:37] [INFO ] Invariant cache hit.
[2024-06-01 13:08:43] [INFO ] Implicit Places using invariants and state equation in 6035 ms returned []
Implicit Place search using SMT with State Equation took 7215 ms to find 0 implicit places.
Running 817 sub problems to find dead transitions.
[2024-06-01 13:08:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 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)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 858/1745 variables, and 6 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 6/41 constraints, State Equation: 0/893 constraints, PredecessorRefiner: 817/817 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 817 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/858 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (OVERLAPS) 35/893 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 893/1745 variables, and 41 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/893 constraints, PredecessorRefiner: 0/817 constraints, Known Traps: 0/0 constraints]
After SMT, in 60378ms problems are : Problem set: 0 solved, 817 unsolved
Search for dead transitions found 0 dead transitions in 60393ms
Starting structural reductions in LTL mode, iteration 1 : 893/906 places, 852/865 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67791 ms. Remains : 893/906 places, 852/865 transitions.
Stuttering acceptance computed with spot in 540 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-09
Product exploration explored 100000 steps with 108 reset in 633 ms.
Product exploration explored 100000 steps with 108 reset in 557 ms.
Computed a total of 893 stabilizing places and 852 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 852
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 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X p1), (X (AND p2 (NOT p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p1)), (X (X (AND p2 (NOT p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 24 factoid took 896 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (40 resets) in 668 ms. (59 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 245 ms. (162 steps per ms) remains 1/1 properties
[2024-06-01 13:09:47] [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) 755/759 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/759 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/826 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/826 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 852/1678 variables, 826/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1678 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 67/1745 variables, 67/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1745 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1745 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1745/1745 variables, and 934 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1185 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 893/893 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) 755/759 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/759 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/826 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/826 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
Problem apf1 is UNSAT
After SMT solving in domain Int declared 1678/1745 variables, and 867 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1550 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 826/893 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2791ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X p1), (X (AND p2 (NOT p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p1)), (X (X (AND p2 (NOT p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 25 factoid took 1284 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 893 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 893/893 places, 852/852 transitions.
Reduce places removed 34 places and 34 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 372 transitions
Trivial Post-agglo rules discarded 372 transitions
Performed 372 trivial Post agglomeration. Transition count delta: 372
Iterating post reduction 0 with 372 rules applied. Total rules applied 372 place count 859 transition count 446
Reduce places removed 372 places and 0 transitions.
Iterating post reduction 1 with 372 rules applied. Total rules applied 744 place count 487 transition count 446
Applied a total of 744 rules in 62 ms. Remains 487 /893 variables (removed 406) and now considering 446/852 (removed 406) transitions.
// Phase 1: matrix 446 rows 487 cols
[2024-06-01 13:09:52] [INFO ] Computed 41 invariants in 5 ms
[2024-06-01 13:09:53] [INFO ] Implicit Places using invariants in 822 ms returned []
[2024-06-01 13:09:53] [INFO ] Invariant cache hit.
[2024-06-01 13:09:55] [INFO ] Implicit Places using invariants and state equation in 2736 ms returned []
Implicit Place search using SMT with State Equation took 3586 ms to find 0 implicit places.
[2024-06-01 13:09:55] [INFO ] Redundant transitions in 2 ms returned []
Running 380 sub problems to find dead transitions.
[2024-06-01 13:09:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 3/424 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (OVERLAPS) 383/807 variables, 424/465 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 807/933 variables, and 465 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 424/487 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 3/424 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (OVERLAPS) 383/807 variables, 424/465 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/807 variables, 380/845 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 807/933 variables, and 845 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 424/487 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in SI_LTL mode, iteration 1 : 487/893 places, 446/852 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63818 ms. Remains : 487/893 places, 446/852 transitions.
Computed a total of 487 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 487 transition count 446
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 p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (G p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 289 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (80 resets) in 215 ms. (185 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
[2024-06-01 13:10:56] [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) 349/353 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/420 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 381/801 variables, 420/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/801 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/807 variables, 4/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/807 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/807 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 807/933 variables, and 465 constraints, problems are : Problem set: 0 solved, 1 unsolved in 601 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 424/487 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) 349/353 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/420 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 801/933 variables, and 461 constraints, problems are : Problem set: 1 solved, 0 unsolved in 550 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 420/487 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1165ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (G p2)), (F (OR (G p1) (G (NOT p1)))), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 479 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 208 reset in 450 ms.
Product exploration explored 100000 steps with 208 reset in 347 ms.
Support contains 4 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 446/446 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 487 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 486 transition count 445
Applied a total of 2 rules in 27 ms. Remains 486 /487 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 486 cols
[2024-06-01 13:10:59] [INFO ] Computed 41 invariants in 3 ms
[2024-06-01 13:11:00] [INFO ] Implicit Places using invariants in 900 ms returned []
[2024-06-01 13:11:00] [INFO ] Invariant cache hit.
[2024-06-01 13:11:03] [INFO ] Implicit Places using invariants and state equation in 3086 ms returned []
Implicit Place search using SMT with State Equation took 3991 ms to find 0 implicit places.
[2024-06-01 13:11:03] [INFO ] Redundant transitions in 4 ms returned []
Running 379 sub problems to find dead transitions.
[2024-06-01 13:11:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 3/423 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (OVERLAPS) 382/805 variables, 423/464 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 805/931 variables, and 464 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 423/486 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 3/423 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (OVERLAPS) 382/805 variables, 423/464 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/805 variables, 379/843 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 805/931 variables, and 843 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 423/486 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 379 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in SI_LTL mode, iteration 1 : 486/487 places, 445/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64170 ms. Remains : 486/487 places, 445/446 transitions.
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-09 finished in 207846 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 1 out of 906 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 906/906 places, 865/865 transitions.
Reduce places removed 35 places and 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 871 transition count 438
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 1 with 392 rules applied. Total rules applied 784 place count 479 transition count 438
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 790 place count 473 transition count 432
Iterating global reduction 2 with 6 rules applied. Total rules applied 796 place count 473 transition count 432
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 797 place count 473 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 798 place count 472 transition count 431
Applied a total of 798 rules in 85 ms. Remains 472 /906 variables (removed 434) and now considering 431/865 (removed 434) transitions.
// Phase 1: matrix 431 rows 472 cols
[2024-06-01 13:12:04] [INFO ] Computed 41 invariants in 6 ms
[2024-06-01 13:12:05] [INFO ] Implicit Places using invariants in 1063 ms returned []
[2024-06-01 13:12:05] [INFO ] Invariant cache hit.
[2024-06-01 13:12:08] [INFO ] Implicit Places using invariants and state equation in 2852 ms returned []
Implicit Place search using SMT with State Equation took 3918 ms to find 0 implicit places.
[2024-06-01 13:12:08] [INFO ] Redundant transitions in 2 ms returned []
Running 362 sub problems to find dead transitions.
[2024-06-01 13:12:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 2/405 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (OVERLAPS) 366/771 variables, 405/446 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 771/903 variables, and 446 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 405/472 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 2/405 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (OVERLAPS) 366/771 variables, 405/446 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/771 variables, 362/808 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 771/903 variables, and 808 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 405/472 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 0/0 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in SI_LTL mode, iteration 1 : 472/906 places, 431/865 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64109 ms. Remains : 472/906 places, 431/865 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-10
Product exploration explored 100000 steps with 1234 reset in 1002 ms.
Product exploration explored 100000 steps with 1196 reset in 799 ms.
Computed a total of 472 stabilizing places and 431 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 472 transition count 431
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, (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-10 finished in 66352 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||G(F(p1))))))'
Support contains 4 out of 906 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 906/906 places, 865/865 transitions.
Reduce places removed 34 places and 34 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 872 transition count 441
Reduce places removed 390 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 391 rules applied. Total rules applied 781 place count 482 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 782 place count 481 transition count 440
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 788 place count 475 transition count 434
Iterating global reduction 3 with 6 rules applied. Total rules applied 794 place count 475 transition count 434
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 796 place count 474 transition count 433
Applied a total of 796 rules in 99 ms. Remains 474 /906 variables (removed 432) and now considering 433/865 (removed 432) transitions.
// Phase 1: matrix 433 rows 474 cols
[2024-06-01 13:13:10] [INFO ] Computed 41 invariants in 6 ms
[2024-06-01 13:13:11] [INFO ] Implicit Places using invariants in 1033 ms returned []
[2024-06-01 13:13:11] [INFO ] Invariant cache hit.
[2024-06-01 13:13:12] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 13:13:14] [INFO ] Implicit Places using invariants and state equation in 2703 ms returned []
Implicit Place search using SMT with State Equation took 3763 ms to find 0 implicit places.
[2024-06-01 13:13:14] [INFO ] Redundant transitions in 2 ms returned []
Running 367 sub problems to find dead transitions.
[2024-06-01 13:13:14] [INFO ] Invariant cache hit.
[2024-06-01 13:13:14] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 3/411 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 370/781 variables, 411/452 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/781 variables, 12/464 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 781/907 variables, and 464 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 411/474 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 3/411 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 370/781 variables, 411/452 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/781 variables, 12/464 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/781 variables, 367/831 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 781/907 variables, and 831 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 411/474 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Starting structural reductions in SI_LTL mode, iteration 1 : 474/906 places, 433/865 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63955 ms. Remains : 474/906 places, 433/865 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-11
Product exploration explored 100000 steps with 214 reset in 435 ms.
Product exploration explored 100000 steps with 214 reset in 478 ms.
Computed a total of 474 stabilizing places and 433 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 474 transition count 433
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 446 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 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (80 resets) in 161 ms. (246 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
[2024-06-01 13:14:16] [INFO ] Invariant cache hit.
[2024-06-01 13:14:16] [INFO ] State equation strengthened by 12 read => feed constraints.
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) 288/292 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/407 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 366/773 variables, 407/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/773 variables, 10/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/773 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/775 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/775 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/777 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/777 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/777 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/778 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/778 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/781 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/781 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/781 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 781/907 variables, and 464 constraints, problems are : Problem set: 0 solved, 1 unsolved in 680 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 411/474 constraints, ReadFeed: 12/12 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) 288/292 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/407 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 366/773 variables, 407/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/773 variables, 10/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/773 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/775 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/775 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/775 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/777 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/777 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/777 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/778 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/778 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/781 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/781 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/781 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 781/907 variables, and 465 constraints, problems are : Problem set: 0 solved, 1 unsolved in 768 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 411/474 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1462ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 45 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 18 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 811 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 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 433/433 transitions.
Applied a total of 0 rules in 31 ms. Remains 474 /474 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2024-06-01 13:14:19] [INFO ] Invariant cache hit.
[2024-06-01 13:14:20] [INFO ] Implicit Places using invariants in 1033 ms returned []
[2024-06-01 13:14:20] [INFO ] Invariant cache hit.
[2024-06-01 13:14:20] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 13:14:23] [INFO ] Implicit Places using invariants and state equation in 3001 ms returned []
Implicit Place search using SMT with State Equation took 4039 ms to find 0 implicit places.
[2024-06-01 13:14:23] [INFO ] Redundant transitions in 3 ms returned []
Running 367 sub problems to find dead transitions.
[2024-06-01 13:14:23] [INFO ] Invariant cache hit.
[2024-06-01 13:14:23] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 3/411 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 370/781 variables, 411/452 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/781 variables, 12/464 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 781/907 variables, and 464 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 411/474 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 3/411 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 370/781 variables, 411/452 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/781 variables, 12/464 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/781 variables, 367/831 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 781/907 variables, and 831 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 411/474 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64219 ms. Remains : 474/474 places, 433/433 transitions.
Computed a total of 474 stabilizing places and 433 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 474 transition count 433
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 (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 566 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 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (80 resets) in 171 ms. (232 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
[2024-06-01 13:15:24] [INFO ] Invariant cache hit.
[2024-06-01 13:15:24] [INFO ] State equation strengthened by 12 read => feed constraints.
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) 288/292 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/407 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 366/773 variables, 407/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/773 variables, 10/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/773 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/775 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/775 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/777 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/777 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/777 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/778 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/778 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/781 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/781 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/781 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 781/907 variables, and 464 constraints, problems are : Problem set: 0 solved, 1 unsolved in 678 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 411/474 constraints, ReadFeed: 12/12 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) 288/292 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/407 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 366/773 variables, 407/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/773 variables, 10/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/773 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/775 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/775 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/775 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/777 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/777 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/777 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/778 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/778 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/781 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/781 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/781 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 781/907 variables, and 465 constraints, problems are : Problem set: 0 solved, 1 unsolved in 777 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 411/474 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1480ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 42 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 849 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 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 214 reset in 429 ms.
Product exploration explored 100000 steps with 214 reset in 492 ms.
Support contains 4 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 433/433 transitions.
Applied a total of 0 rules in 29 ms. Remains 474 /474 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2024-06-01 13:15:27] [INFO ] Invariant cache hit.
[2024-06-01 13:15:28] [INFO ] Implicit Places using invariants in 1064 ms returned []
[2024-06-01 13:15:28] [INFO ] Invariant cache hit.
[2024-06-01 13:15:29] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 13:15:31] [INFO ] Implicit Places using invariants and state equation in 2727 ms returned []
Implicit Place search using SMT with State Equation took 3803 ms to find 0 implicit places.
[2024-06-01 13:15:31] [INFO ] Redundant transitions in 2 ms returned []
Running 367 sub problems to find dead transitions.
[2024-06-01 13:15:31] [INFO ] Invariant cache hit.
[2024-06-01 13:15:31] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 3/411 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 370/781 variables, 411/452 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/781 variables, 12/464 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 781/907 variables, and 464 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 411/474 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 3/411 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 370/781 variables, 411/452 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/781 variables, 12/464 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/781 variables, 367/831 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 781/907 variables, and 831 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 411/474 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 0/0 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63937 ms. Remains : 474/474 places, 433/433 transitions.
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-11 finished in 201363 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)))||X(p1)))'
Support contains 4 out of 906 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 906/906 places, 865/865 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 899 transition count 858
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 899 transition count 858
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 893 transition count 852
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 893 transition count 852
Applied a total of 26 rules in 169 ms. Remains 893 /906 variables (removed 13) and now considering 852/865 (removed 13) transitions.
// Phase 1: matrix 852 rows 893 cols
[2024-06-01 13:16:32] [INFO ] Computed 41 invariants in 14 ms
[2024-06-01 13:16:33] [INFO ] Implicit Places using invariants in 1147 ms returned []
[2024-06-01 13:16:33] [INFO ] Invariant cache hit.
[2024-06-01 13:16:39] [INFO ] Implicit Places using invariants and state equation in 6294 ms returned []
Implicit Place search using SMT with State Equation took 7444 ms to find 0 implicit places.
Running 817 sub problems to find dead transitions.
[2024-06-01 13:16:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 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)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 858/1745 variables, and 6 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 6/41 constraints, State Equation: 0/893 constraints, PredecessorRefiner: 817/817 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 817 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/858 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (OVERLAPS) 35/893 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 817 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 893/1745 variables, and 41 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/893 constraints, PredecessorRefiner: 0/817 constraints, Known Traps: 0/0 constraints]
After SMT, in 60517ms problems are : Problem set: 0 solved, 817 unsolved
Search for dead transitions found 0 dead transitions in 60529ms
Starting structural reductions in LTL mode, iteration 1 : 893/906 places, 852/865 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68144 ms. Remains : 893/906 places, 852/865 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 788 ms.
Product exploration explored 100000 steps with 50000 reset in 540 ms.
Computed a total of 893 stabilizing places and 852 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 852
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 22 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-12 finished in 70224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 906 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 906/906 places, 865/865 transitions.
Reduce places removed 35 places and 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 391 transitions
Trivial Post-agglo rules discarded 391 transitions
Performed 391 trivial Post agglomeration. Transition count delta: 391
Iterating post reduction 0 with 391 rules applied. Total rules applied 391 place count 871 transition count 439
Reduce places removed 391 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 392 rules applied. Total rules applied 783 place count 480 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 784 place count 479 transition count 438
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 791 place count 472 transition count 431
Iterating global reduction 3 with 7 rules applied. Total rules applied 798 place count 472 transition count 431
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 799 place count 472 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 800 place count 471 transition count 430
Applied a total of 800 rules in 77 ms. Remains 471 /906 variables (removed 435) and now considering 430/865 (removed 435) transitions.
// Phase 1: matrix 430 rows 471 cols
[2024-06-01 13:17:42] [INFO ] Computed 41 invariants in 5 ms
[2024-06-01 13:17:42] [INFO ] Implicit Places using invariants in 805 ms returned []
[2024-06-01 13:17:42] [INFO ] Invariant cache hit.
[2024-06-01 13:17:46] [INFO ] Implicit Places using invariants and state equation in 3184 ms returned []
Implicit Place search using SMT with State Equation took 3994 ms to find 0 implicit places.
[2024-06-01 13:17:46] [INFO ] Redundant transitions in 4 ms returned []
Running 361 sub problems to find dead transitions.
[2024-06-01 13:17:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 2/404 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 363/767 variables, 404/445 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/901 variables, and 445 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 404/471 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 2/404 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 363/767 variables, 404/445 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/767 variables, 361/806 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/901 variables, and 806 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 404/471 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in SI_LTL mode, iteration 1 : 471/906 places, 430/865 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64198 ms. Remains : 471/906 places, 430/865 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-13
Stuttering criterion allowed to conclude after 462 steps with 0 reset in 4 ms.
FORMULA HirschbergSinclair-PT-35-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-13 finished in 64307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p0 U (p1||G(p0)))))))'
Support contains 2 out of 906 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 906/906 places, 865/865 transitions.
Reduce places removed 35 places and 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 389 transitions
Trivial Post-agglo rules discarded 389 transitions
Performed 389 trivial Post agglomeration. Transition count delta: 389
Iterating post reduction 0 with 389 rules applied. Total rules applied 389 place count 871 transition count 441
Reduce places removed 389 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 390 rules applied. Total rules applied 779 place count 482 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 780 place count 481 transition count 440
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 785 place count 476 transition count 435
Iterating global reduction 3 with 5 rules applied. Total rules applied 790 place count 476 transition count 435
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 791 place count 476 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 792 place count 475 transition count 434
Applied a total of 792 rules in 89 ms. Remains 475 /906 variables (removed 431) and now considering 434/865 (removed 431) transitions.
// Phase 1: matrix 434 rows 475 cols
[2024-06-01 13:18:46] [INFO ] Computed 41 invariants in 4 ms
[2024-06-01 13:18:47] [INFO ] Implicit Places using invariants in 1022 ms returned []
[2024-06-01 13:18:47] [INFO ] Invariant cache hit.
[2024-06-01 13:18:50] [INFO ] Implicit Places using invariants and state equation in 3129 ms returned []
Implicit Place search using SMT with State Equation took 4162 ms to find 0 implicit places.
[2024-06-01 13:18:50] [INFO ] Redundant transitions in 2 ms returned []
Running 365 sub problems to find dead transitions.
[2024-06-01 13:18:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 2/408 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 370/778 variables, 408/449 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 778/909 variables, and 449 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 408/475 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 2/408 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 370/778 variables, 408/449 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/778 variables, 365/814 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 778/909 variables, and 814 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 408/475 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in SI_LTL mode, iteration 1 : 475/906 places, 434/865 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64353 ms. Remains : 475/906 places, 434/865 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-15
Stuttering criterion allowed to conclude after 464 steps with 0 reset in 3 ms.
FORMULA HirschbergSinclair-PT-35-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-15 finished in 64448 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))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (G(F(p1))||G(p2)))))'
Found a Lengthening insensitive property : HirschbergSinclair-PT-35-LTLCardinality-09
Stuttering acceptance computed with spot in 545 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 906 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 906/906 places, 865/865 transitions.
Reduce places removed 34 places and 34 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 377 transitions
Trivial Post-agglo rules discarded 377 transitions
Performed 377 trivial Post agglomeration. Transition count delta: 377
Iterating post reduction 0 with 377 rules applied. Total rules applied 377 place count 872 transition count 454
Reduce places removed 377 places and 0 transitions.
Iterating post reduction 1 with 377 rules applied. Total rules applied 754 place count 495 transition count 454
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 761 place count 488 transition count 447
Iterating global reduction 2 with 7 rules applied. Total rules applied 768 place count 488 transition count 447
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 769 place count 488 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 770 place count 487 transition count 446
Applied a total of 770 rules in 97 ms. Remains 487 /906 variables (removed 419) and now considering 446/865 (removed 419) transitions.
// Phase 1: matrix 446 rows 487 cols
[2024-06-01 13:19:52] [INFO ] Computed 41 invariants in 4 ms
[2024-06-01 13:19:53] [INFO ] Implicit Places using invariants in 931 ms returned []
[2024-06-01 13:19:53] [INFO ] Invariant cache hit.
[2024-06-01 13:19:56] [INFO ] Implicit Places using invariants and state equation in 2999 ms returned []
Implicit Place search using SMT with State Equation took 3934 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2024-06-01 13:19:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 3/424 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (OVERLAPS) 383/807 variables, 424/465 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 807/933 variables, and 465 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 424/487 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 3/424 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (OVERLAPS) 383/807 variables, 424/465 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/807 variables, 380/845 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 807/933 variables, and 845 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 424/487 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Starting structural reductions in LI_LTL mode, iteration 1 : 487/906 places, 446/865 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 64158 ms. Remains : 487/906 places, 446/865 transitions.
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-09
Product exploration explored 100000 steps with 208 reset in 452 ms.
Product exploration explored 100000 steps with 207 reset in 320 ms.
Computed a total of 487 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 487 transition count 446
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 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X p1), (X (AND p2 (NOT p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p1)), (X (X (AND p2 (NOT p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 24 factoid took 1017 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (80 resets) in 439 ms. (90 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
[2024-06-01 13:20:58] [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) 349/353 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/420 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 381/801 variables, 420/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/801 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/807 variables, 4/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/807 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/807 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 807/933 variables, and 465 constraints, problems are : Problem set: 0 solved, 1 unsolved in 596 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 424/487 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) 349/353 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/420 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 801/933 variables, and 461 constraints, problems are : Problem set: 1 solved, 0 unsolved in 568 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 420/487 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1180ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X p1), (X (AND p2 (NOT p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p1)), (X (X (AND p2 (NOT p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 25 factoid took 1522 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 487 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 446/446 transitions.
Applied a total of 0 rules in 36 ms. Remains 487 /487 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-06-01 13:21:01] [INFO ] Invariant cache hit.
[2024-06-01 13:21:02] [INFO ] Implicit Places using invariants in 1047 ms returned []
[2024-06-01 13:21:02] [INFO ] Invariant cache hit.
[2024-06-01 13:21:05] [INFO ] Implicit Places using invariants and state equation in 3027 ms returned []
Implicit Place search using SMT with State Equation took 4085 ms to find 0 implicit places.
[2024-06-01 13:21:05] [INFO ] Redundant transitions in 2 ms returned []
Running 380 sub problems to find dead transitions.
[2024-06-01 13:21:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 3/424 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (OVERLAPS) 383/807 variables, 424/465 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 807/933 variables, and 465 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 424/487 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 3/424 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (OVERLAPS) 383/807 variables, 424/465 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/807 variables, 380/845 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 807/933 variables, and 845 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 424/487 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64225 ms. Remains : 487/487 places, 446/446 transitions.
Computed a total of 487 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 487 transition count 446
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 p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (G p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 281 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40002 steps (80 resets) in 1186 ms. (33 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
[2024-06-01 13:22:07] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 349/353 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 67/420 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 381/801 variables, 420/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/801 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/807 variables, 4/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/807 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/807 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 807/933 variables, and 465 constraints, problems are : Problem set: 0 solved, 2 unsolved in 728 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 424/487 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 349/353 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 67/420 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 5 (OVERLAPS) 381/801 variables, 420/461 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/801 variables, 0/461 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/807 variables, 4/465 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/807 variables, 1/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/807 variables, 0/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/807 variables, 0/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 807/933 variables, and 466 constraints, problems are : Problem set: 1 solved, 1 unsolved in 932 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 424/487 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1676ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 331 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=110 )
Parikh walk visited 1 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (G p2)), (F (OR (G p1) (G (NOT p1)))), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 462 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 207 reset in 450 ms.
Product exploration explored 100000 steps with 208 reset in 539 ms.
Support contains 4 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 446/446 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 487 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 486 transition count 445
Applied a total of 2 rules in 19 ms. Remains 486 /487 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 486 cols
[2024-06-01 13:22:10] [INFO ] Computed 41 invariants in 3 ms
[2024-06-01 13:22:11] [INFO ] Implicit Places using invariants in 892 ms returned []
[2024-06-01 13:22:11] [INFO ] Invariant cache hit.
[2024-06-01 13:22:14] [INFO ] Implicit Places using invariants and state equation in 3008 ms returned []
Implicit Place search using SMT with State Equation took 3906 ms to find 0 implicit places.
[2024-06-01 13:22:14] [INFO ] Redundant transitions in 3 ms returned []
Running 379 sub problems to find dead transitions.
[2024-06-01 13:22:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 3/423 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (OVERLAPS) 382/805 variables, 423/464 constraints. Problems are: Problem set: 0 solved, 379 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 805/931 variables, and 464 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 423/486 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 3/423 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (OVERLAPS) 382/805 variables, 423/464 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/805 variables, 379/843 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 805/931 variables, and 843 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 423/486 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 0/0 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 379 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in SI_LTL mode, iteration 1 : 486/487 places, 445/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64065 ms. Remains : 486/487 places, 445/446 transitions.
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-09 finished in 203781 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||G(F(p1))))))'
[2024-06-01 13:23:15] [INFO ] Flatten gal took : 77 ms
[2024-06-01 13:23:15] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 13:23:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 906 places, 865 transitions and 2595 arcs took 16 ms.
Total runtime 1248336 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

--------------------
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

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-35"
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-35, 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-171649587500107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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