About the Execution of GreatSPN+red for HirschbergSinclair-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 734.436 | 245093.00 | 295448.00 | 1151.00 | TFFTTTFTFTFFFFFT | normal |
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.r201-smll-171649586500060.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 greatspnxred
Input is HirschbergSinclair-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-171649586500060
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 03:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 13 03:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 03:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 03:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:48 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 157K 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-05-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716575543373
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 18:32:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 18:32:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 18:32:25] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-24 18:32:25] [INFO ] Transformed 124 places.
[2024-05-24 18:32:25] [INFO ] Transformed 111 transitions.
[2024-05-24 18:32:25] [INFO ] Parsed PT model containing 124 places and 111 transitions and 340 arcs in 422 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Support contains 40 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 119 transition count 111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 117 transition count 109
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 117 transition count 109
Applied a total of 9 rules in 59 ms. Remains 117 /124 variables (removed 7) and now considering 109/111 (removed 2) transitions.
// Phase 1: matrix 109 rows 117 cols
[2024-05-24 18:32:26] [INFO ] Computed 8 invariants in 21 ms
[2024-05-24 18:32:26] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-24 18:32:26] [INFO ] Invariant cache hit.
[2024-05-24 18:32:26] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2024-05-24 18:32:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 5/117 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 109/226 variables, 117/125 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 0/226 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 125 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3412 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 5/117 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 109/226 variables, 117/125 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 104/229 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/226 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 229 constraints, problems are : Problem set: 0 solved, 104 unsolved in 6812 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
After SMT, in 10389ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 10409ms
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 109/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11237 ms. Remains : 117/124 places, 109/111 transitions.
Support contains 40 out of 117 places after structural reductions.
[2024-05-24 18:32:37] [INFO ] Flatten gal took : 48 ms
[2024-05-24 18:32:37] [INFO ] Flatten gal took : 18 ms
[2024-05-24 18:32:37] [INFO ] Input system was already deterministic with 109 transitions.
Reduction of identical properties reduced properties to check from 34 to 33
RANDOM walk for 536 steps (1 resets) in 137 ms. (3 steps per ms) remains 0/33 properties
Computed a total of 117 stabilizing places and 109 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 117 transition count 109
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 109 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 109 transition count 101
Applied a total of 16 rules in 28 ms. Remains 109 /117 variables (removed 8) and now considering 101/109 (removed 8) transitions.
// Phase 1: matrix 101 rows 109 cols
[2024-05-24 18:32:38] [INFO ] Computed 8 invariants in 3 ms
[2024-05-24 18:32:38] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-24 18:32:38] [INFO ] Invariant cache hit.
[2024-05-24 18:32:38] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-24 18:32:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2583 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 96/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6149 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 8773ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 8776ms
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9120 ms. Remains : 109/117 places, 101/109 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-00
Product exploration explored 100000 steps with 1663 reset in 412 ms.
Product exploration explored 100000 steps with 1664 reset in 242 ms.
Computed a total of 109 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 109 transition count 101
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 210 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 235 steps (0 resets) in 9 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 11 factoid took 262 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-24 18:32:49] [INFO ] Invariant cache hit.
[2024-05-24 18:32:49] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 18:32:49] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-24 18:32:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 18:32:49] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-24 18:32:49] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-24 18:32:49] [INFO ] Computed and/alt/rep : 47/50/47 causal constraints (skipped 49 transitions) in 11 ms.
[2024-05-24 18:32:49] [INFO ] Added : 30 causal constraints over 6 iterations in 100 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 109 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-24 18:32:49] [INFO ] Invariant cache hit.
[2024-05-24 18:32:49] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-24 18:32:49] [INFO ] Invariant cache hit.
[2024-05-24 18:32:49] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-24 18:32:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2521 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 96/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6252 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 8820ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 8823ms
Finished structural reductions in LTL mode , in 1 iterations and 9079 ms. Remains : 109/109 places, 101/101 transitions.
Computed a total of 109 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 109 transition count 101
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 (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 227 steps (0 resets) in 8 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-24 18:32:59] [INFO ] Invariant cache hit.
[2024-05-24 18:32:59] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2024-05-24 18:32:59] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-24 18:32:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 18:32:59] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2024-05-24 18:32:59] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-24 18:32:59] [INFO ] Computed and/alt/rep : 47/50/47 causal constraints (skipped 49 transitions) in 8 ms.
[2024-05-24 18:32:59] [INFO ] Added : 30 causal constraints over 6 iterations in 76 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1662 reset in 210 ms.
Product exploration explored 100000 steps with 1663 reset in 319 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 101/101 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 109 transition count 101
Deduced a syphon composed of 43 places in 1 ms
Applied a total of 43 rules in 18 ms. Remains 109 /109 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-24 18:33:00] [INFO ] Redundant transitions in 2 ms returned []
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 101 rows 109 cols
[2024-05-24 18:33:00] [INFO ] Computed 8 invariants in 6 ms
[2024-05-24 18:33:00] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 43 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 43/160 constraints. Problems are: Problem set: 43 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/160 constraints. Problems are: Problem set: 43 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/160 constraints. Problems are: Problem set: 43 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 160 constraints, problems are : Problem set: 43 solved, 53 unsolved in 2345 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 43 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 43 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 48/109 variables, 8/8 constraints. Problems are: Problem set: 43 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 43 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 43 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 43/160 constraints. Problems are: Problem set: 43 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 53/213 constraints. Problems are: Problem set: 43 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 43 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 43 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 43 solved, 53 unsolved in 2076 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 53/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 4477ms problems are : Problem set: 43 solved, 53 unsolved
Search for dead transitions found 43 dead transitions in 4480ms
Found 43 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 43 transitions
Dead transitions reduction (with SMT) removed 43 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 109/109 places, 58/101 transitions.
Graph (complete) has 165 edges and 109 vertex of which 66 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.1 ms
Discarding 43 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 66 /109 variables (removed 43) and now considering 58/58 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/109 places, 58/101 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4526 ms. Remains : 66/109 places, 58/101 transitions.
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 109 cols
[2024-05-24 18:33:05] [INFO ] Computed 8 invariants in 2 ms
[2024-05-24 18:33:05] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-24 18:33:05] [INFO ] Invariant cache hit.
[2024-05-24 18:33:05] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-24 18:33:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2565 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 96/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6243 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 8840ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 8842ms
Finished structural reductions in LTL mode , in 1 iterations and 9206 ms. Remains : 109/109 places, 101/101 transitions.
Treatment of property HirschbergSinclair-PT-05-LTLFireability-00 finished in 36355 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 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Reduce places removed 4 places and 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 113 transition count 71
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 79 transition count 71
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 74 transition count 66
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 74 transition count 66
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 74 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 72 transition count 64
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 84 place count 70 transition count 62
Iterating global reduction 4 with 2 rules applied. Total rules applied 86 place count 70 transition count 62
Applied a total of 86 rules in 22 ms. Remains 70 /117 variables (removed 47) and now considering 62/109 (removed 47) transitions.
// Phase 1: matrix 62 rows 70 cols
[2024-05-24 18:33:14] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 18:33:14] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-24 18:33:14] [INFO ] Invariant cache hit.
[2024-05-24 18:33:14] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-24 18:33:14] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-24 18:33:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 56/120 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 0/120 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/132 variables, and 72 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1058 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/70 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 56/120 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 55/127 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/132 variables, and 127 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1330 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/70 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
After SMT, in 2401ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2402ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/117 places, 62/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2673 ms. Remains : 70/117 places, 62/109 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-01
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-01 finished in 2736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 113 transition count 105
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 113 transition count 105
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 110 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 110 transition count 102
Applied a total of 14 rules in 4 ms. Remains 110 /117 variables (removed 7) and now considering 102/109 (removed 7) transitions.
// Phase 1: matrix 102 rows 110 cols
[2024-05-24 18:33:17] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 18:33:17] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-24 18:33:17] [INFO ] Invariant cache hit.
[2024-05-24 18:33:17] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-24 18:33:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 5/110 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 102/212 variables, 110/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/212 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 118 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2552 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 5/110 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 102/212 variables, 110/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 97/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 215 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6062 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
After SMT, in 8650ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8652ms
Starting structural reductions in LTL mode, iteration 1 : 110/117 places, 102/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8917 ms. Remains : 110/117 places, 102/109 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-02
Product exploration explored 100000 steps with 4665 reset in 233 ms.
Product exploration explored 100000 steps with 4700 reset in 258 ms.
Computed a total of 110 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 110 transition count 102
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 p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 124 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 75 steps (0 resets) in 6 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 150 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-24 18:33:27] [INFO ] Invariant cache hit.
[2024-05-24 18:33:27] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2024-05-24 18:33:27] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-24 18:33:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 18:33:27] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-24 18:33:27] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-24 18:33:27] [INFO ] Computed and/alt/rep : 47/51/47 causal constraints (skipped 50 transitions) in 10 ms.
[2024-05-24 18:33:28] [INFO ] Added : 30 causal constraints over 6 iterations in 114 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 110 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 110 /110 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-24 18:33:28] [INFO ] Invariant cache hit.
[2024-05-24 18:33:28] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-24 18:33:28] [INFO ] Invariant cache hit.
[2024-05-24 18:33:28] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-24 18:33:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 5/110 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 102/212 variables, 110/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/212 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 118 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2857 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 5/110 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 102/212 variables, 110/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 97/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 215 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5828 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
After SMT, in 8718ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8719ms
Finished structural reductions in LTL mode , in 1 iterations and 9000 ms. Remains : 110/110 places, 102/102 transitions.
Computed a total of 110 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 110 transition count 102
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 p1), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 75 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-24 18:33:37] [INFO ] Invariant cache hit.
[2024-05-24 18:33:37] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-24 18:33:38] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-24 18:33:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 18:33:38] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-24 18:33:38] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-05-24 18:33:38] [INFO ] Computed and/alt/rep : 47/51/47 causal constraints (skipped 50 transitions) in 10 ms.
[2024-05-24 18:33:38] [INFO ] Added : 30 causal constraints over 6 iterations in 109 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 4689 reset in 162 ms.
Product exploration explored 100000 steps with 4688 reset in 281 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 102/102 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 110 transition count 102
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 34 rules in 13 ms. Remains 110 /110 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-24 18:33:39] [INFO ] Redundant transitions in 3 ms returned []
Running 97 sub problems to find dead transitions.
// Phase 1: matrix 102 rows 110 cols
[2024-05-24 18:33:39] [INFO ] Computed 8 invariants in 2 ms
[2024-05-24 18:33:39] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 5/110 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 4 (OVERLAPS) 102/212 variables, 110/118 constraints. Problems are: Problem set: 34 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 34/152 constraints. Problems are: Problem set: 34 solved, 63 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/152 constraints. Problems are: Problem set: 34 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/152 constraints. Problems are: Problem set: 34 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 152 constraints, problems are : Problem set: 34 solved, 63 unsolved in 2386 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 34 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 34 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 39/110 variables, 8/8 constraints. Problems are: Problem set: 34 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 34 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 102/212 variables, 110/118 constraints. Problems are: Problem set: 34 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 34/152 constraints. Problems are: Problem set: 34 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 63/215 constraints. Problems are: Problem set: 34 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/215 constraints. Problems are: Problem set: 34 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/215 constraints. Problems are: Problem set: 34 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 215 constraints, problems are : Problem set: 34 solved, 63 unsolved in 2548 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 63/97 constraints, Known Traps: 0/0 constraints]
After SMT, in 4957ms problems are : Problem set: 34 solved, 63 unsolved
Search for dead transitions found 34 dead transitions in 4958ms
Found 34 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 34 transitions
Dead transitions reduction (with SMT) removed 34 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 110/110 places, 68/102 transitions.
Graph (complete) has 175 edges and 110 vertex of which 76 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 76 /110 variables (removed 34) and now considering 68/68 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/110 places, 68/102 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4984 ms. Remains : 76/110 places, 68/102 transitions.
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 110 /110 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 110 cols
[2024-05-24 18:33:44] [INFO ] Computed 8 invariants in 2 ms
[2024-05-24 18:33:44] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-24 18:33:44] [INFO ] Invariant cache hit.
[2024-05-24 18:33:44] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-24 18:33:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 5/110 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 102/212 variables, 110/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/212 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 118 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2577 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 5/110 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 102/212 variables, 110/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 97/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 215 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5855 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
After SMT, in 8457ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8458ms
Finished structural reductions in LTL mode , in 1 iterations and 8714 ms. Remains : 110/110 places, 102/102 transitions.
Treatment of property HirschbergSinclair-PT-05-LTLFireability-02 finished in 35720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((p0||X(!p0))) U (!p0||X(p1))) U p1))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 109 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 109 transition count 101
Applied a total of 16 rules in 6 ms. Remains 109 /117 variables (removed 8) and now considering 101/109 (removed 8) transitions.
// Phase 1: matrix 101 rows 109 cols
[2024-05-24 18:33:52] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 18:33:52] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-24 18:33:52] [INFO ] Invariant cache hit.
[2024-05-24 18:33:53] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-24 18:33:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2511 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 96/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6170 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 8712ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 8713ms
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8973 ms. Remains : 109/117 places, 101/109 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-03
Product exploration explored 100000 steps with 2664 reset in 153 ms.
Product exploration explored 100000 steps with 2663 reset in 166 ms.
Computed a total of 109 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 109 transition count 101
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 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 196 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
RANDOM walk for 267 steps (0 resets) in 17 ms. (14 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p1 p0))), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 411 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 212 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
[2024-05-24 18:34:03] [INFO ] Invariant cache hit.
[2024-05-24 18:34:03] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-24 18:34:03] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-24 18:34:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 18:34:03] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-24 18:34:03] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-24 18:34:03] [INFO ] Computed and/alt/rep : 47/50/47 causal constraints (skipped 49 transitions) in 9 ms.
[2024-05-24 18:34:03] [INFO ] Added : 16 causal constraints over 4 iterations in 59 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-24 18:34:03] [INFO ] Invariant cache hit.
[2024-05-24 18:34:03] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-24 18:34:03] [INFO ] Invariant cache hit.
[2024-05-24 18:34:04] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-24 18:34:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2500 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 96/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6158 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 8689ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 8690ms
Finished structural reductions in LTL mode , in 1 iterations and 8985 ms. Remains : 109/109 places, 101/101 transitions.
Computed a total of 109 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 109 transition count 101
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 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 232 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
RANDOM walk for 281 steps (0 resets) in 9 ms. (28 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p1 p0))), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 535 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
[2024-05-24 18:34:14] [INFO ] Invariant cache hit.
[2024-05-24 18:34:14] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2024-05-24 18:34:14] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-24 18:34:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 18:34:14] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2024-05-24 18:34:14] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-24 18:34:14] [INFO ] Computed and/alt/rep : 47/50/47 causal constraints (skipped 49 transitions) in 9 ms.
[2024-05-24 18:34:14] [INFO ] Added : 16 causal constraints over 4 iterations in 60 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 126 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2662 reset in 162 ms.
Product exploration explored 100000 steps with 2661 reset in 170 ms.
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-24 18:34:15] [INFO ] Invariant cache hit.
[2024-05-24 18:34:15] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-24 18:34:15] [INFO ] Invariant cache hit.
[2024-05-24 18:34:15] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-24 18:34:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2758 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 96/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6147 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 8934ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 8936ms
Finished structural reductions in LTL mode , in 1 iterations and 9284 ms. Remains : 109/109 places, 101/101 transitions.
Treatment of property HirschbergSinclair-PT-05-LTLFireability-03 finished in 31559 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 U (p1 U p2))||G(!p1)))))'
Support contains 3 out of 117 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 : 117/117 places, 109/109 transitions.
Reduce places removed 3 places and 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 114 transition count 72
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 80 transition count 72
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 75 transition count 67
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 75 transition count 67
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 75 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 73 transition count 65
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 72 transition count 64
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 72 transition count 64
Applied a total of 84 rules in 12 ms. Remains 72 /117 variables (removed 45) and now considering 64/109 (removed 45) transitions.
// Phase 1: matrix 64 rows 72 cols
[2024-05-24 18:34:24] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 18:34:24] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-24 18:34:24] [INFO ] Invariant cache hit.
[2024-05-24 18:34:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 18:34:24] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-24 18:34:24] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-24 18:34:24] [INFO ] Invariant cache hit.
[2024-05-24 18:34:24] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 2/70 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 62/132 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/136 variables, and 86 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1160 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 70/72 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 2/70 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 62/132 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 60/146 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/136 variables, and 146 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1494 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 70/72 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2666ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2666ms
Starting structural reductions in SI_LTL mode, iteration 1 : 72/117 places, 64/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2903 ms. Remains : 72/117 places, 64/109 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-04
Product exploration explored 100000 steps with 2331 reset in 263 ms.
Product exploration explored 100000 steps with 2321 reset in 307 ms.
Computed a total of 72 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 72 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 15 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-05-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLFireability-04 finished in 3641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(!p0))))'
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Reduce places removed 5 places and 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 112 transition count 60
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 68 transition count 60
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 93 place count 63 transition count 55
Iterating global reduction 2 with 5 rules applied. Total rules applied 98 place count 63 transition count 55
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 63 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 61 transition count 53
Applied a total of 102 rules in 10 ms. Remains 61 /117 variables (removed 56) and now considering 53/109 (removed 56) transitions.
// Phase 1: matrix 53 rows 61 cols
[2024-05-24 18:34:28] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 18:34:28] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-24 18:34:28] [INFO ] Invariant cache hit.
[2024-05-24 18:34:28] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-24 18:34:28] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-24 18:34:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 46/100 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 0/100 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/114 variables, and 62 constraints, problems are : Problem set: 0 solved, 44 unsolved in 749 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 54/61 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 46/100 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 44/106 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/114 variables, and 106 constraints, problems are : Problem set: 0 solved, 44 unsolved in 758 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 54/61 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1516ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1517ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/117 places, 53/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1719 ms. Remains : 61/117 places, 53/109 transitions.
Stuttering acceptance computed with spot in 36 ms :[false]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-05
Product exploration explored 100000 steps with 1723 reset in 91 ms.
Product exploration explored 100000 steps with 1724 reset in 104 ms.
Computed a total of 61 stabilizing places and 53 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 53
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), (F (G (NOT 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 14 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-05-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLFireability-05 finished in 2020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 114 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 114 transition count 106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 112 transition count 104
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 112 transition count 104
Applied a total of 10 rules in 4 ms. Remains 112 /117 variables (removed 5) and now considering 104/109 (removed 5) transitions.
// Phase 1: matrix 104 rows 112 cols
[2024-05-24 18:34:30] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 18:34:30] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-24 18:34:30] [INFO ] Invariant cache hit.
[2024-05-24 18:34:30] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2024-05-24 18:34:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 5/112 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 104/216 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/216 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 120 constraints, problems are : Problem set: 0 solved, 99 unsolved in 2750 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 5/112 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 104/216 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 99/219 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/216 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 219 constraints, problems are : Problem set: 0 solved, 99 unsolved in 6114 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 8891ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 8893ms
Starting structural reductions in LTL mode, iteration 1 : 112/117 places, 104/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9144 ms. Remains : 112/117 places, 104/109 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-06 finished in 9295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Reduce places removed 3 places and 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 114 transition count 70
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 78 transition count 70
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 76 place count 74 transition count 66
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 74 transition count 66
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 81 place count 74 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 73 transition count 65
Applied a total of 82 rules in 15 ms. Remains 73 /117 variables (removed 44) and now considering 65/109 (removed 44) transitions.
// Phase 1: matrix 65 rows 73 cols
[2024-05-24 18:34:39] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 18:34:39] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-24 18:34:39] [INFO ] Invariant cache hit.
[2024-05-24 18:34:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 18:34:39] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-24 18:34:39] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-24 18:34:39] [INFO ] Invariant cache hit.
[2024-05-24 18:34:39] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 3/70 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 62/132 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 2/134 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/134 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/138 variables, and 87 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1774 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 71/73 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 3/70 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 62/132 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 47/133 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 2/134 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 12/146 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/134 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/138 variables, and 146 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1823 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 71/73 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 3609ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3610ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/117 places, 65/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3845 ms. Remains : 73/117 places, 65/109 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-07
Product exploration explored 100000 steps with 12688 reset in 191 ms.
Product exploration explored 100000 steps with 12611 reset in 231 ms.
Computed a total of 73 stabilizing places and 65 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 65
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)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 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 38 ms :[(NOT p0)]
RANDOM walk for 29 steps (0 resets) in 7 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 154 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-24 18:34:44] [INFO ] Invariant cache hit.
[2024-05-24 18:34:44] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 18:34:44] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-24 18:34:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 18:34:44] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 18:34:44] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-24 18:34:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 18:34:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-24 18:34:44] [INFO ] Computed and/alt/rep : 48/72/48 causal constraints (skipped 11 transitions) in 6 ms.
[2024-05-24 18:34:44] [INFO ] Added : 24 causal constraints over 5 iterations in 66 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 65/65 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-24 18:34:44] [INFO ] Invariant cache hit.
[2024-05-24 18:34:44] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-24 18:34:44] [INFO ] Invariant cache hit.
[2024-05-24 18:34:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 18:34:44] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-24 18:34:44] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-24 18:34:44] [INFO ] Invariant cache hit.
[2024-05-24 18:34:44] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 3/70 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 62/132 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 2/134 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/134 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/138 variables, and 87 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1787 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 71/73 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 3/70 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 62/132 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 47/133 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 2/134 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 12/146 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/134 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/138 variables, and 146 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1807 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 71/73 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 3605ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3607ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3822 ms. Remains : 73/73 places, 65/65 transitions.
Computed a total of 73 stabilizing places and 65 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 65
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)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 139 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 44 ms :[(NOT p0)]
RANDOM walk for 33 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 148 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-24 18:34:48] [INFO ] Invariant cache hit.
[2024-05-24 18:34:48] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-24 18:34:48] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-24 18:34:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 18:34:48] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 18:34:49] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-24 18:34:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 18:34:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-24 18:34:49] [INFO ] Computed and/alt/rep : 48/72/48 causal constraints (skipped 11 transitions) in 6 ms.
[2024-05-24 18:34:49] [INFO ] Added : 24 causal constraints over 5 iterations in 66 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 12611 reset in 132 ms.
Product exploration explored 100000 steps with 12610 reset in 156 ms.
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-24 18:34:49] [INFO ] Invariant cache hit.
[2024-05-24 18:34:49] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-24 18:34:49] [INFO ] Invariant cache hit.
[2024-05-24 18:34:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 18:34:49] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-05-24 18:34:49] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-24 18:34:49] [INFO ] Invariant cache hit.
[2024-05-24 18:34:49] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 3/70 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 62/132 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 2/134 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/134 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/138 variables, and 87 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1749 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 71/73 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 3/70 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 62/132 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 47/133 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 2/134 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 12/146 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/134 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/138 variables, and 146 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1905 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 71/73 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 3666ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3667ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3894 ms. Remains : 73/73 places, 65/65 transitions.
Treatment of property HirschbergSinclair-PT-05-LTLFireability-07 finished in 13965 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(X(X((G(p0)||(!(p0 U p1)&&X(p2))))))))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 109 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 109 transition count 101
Applied a total of 16 rules in 6 ms. Remains 109 /117 variables (removed 8) and now considering 101/109 (removed 8) transitions.
// Phase 1: matrix 101 rows 109 cols
[2024-05-24 18:34:53] [INFO ] Computed 8 invariants in 5 ms
[2024-05-24 18:34:53] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-24 18:34:53] [INFO ] Invariant cache hit.
[2024-05-24 18:34:53] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-24 18:34:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2563 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 96/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6224 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 8812ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 8814ms
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9075 ms. Remains : 109/117 places, 101/109 transitions.
Stuttering acceptance computed with spot in 315 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-08
Entered a terminal (fully accepting) state of product in 87 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-08 finished in 9413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(F((p1||X(!p0))))))))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 113 transition count 105
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 113 transition count 105
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 111 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 111 transition count 103
Applied a total of 12 rules in 4 ms. Remains 111 /117 variables (removed 6) and now considering 103/109 (removed 6) transitions.
// Phase 1: matrix 103 rows 111 cols
[2024-05-24 18:35:02] [INFO ] Computed 8 invariants in 0 ms
[2024-05-24 18:35:02] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-24 18:35:02] [INFO ] Invariant cache hit.
[2024-05-24 18:35:03] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-24 18:35:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 5/111 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 103/214 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/214 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 119 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2525 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 5/111 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 103/214 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 98/217 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/214 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 217 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6098 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 8660ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 8661ms
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 103/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8950 ms. Remains : 111/117 places, 103/109 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 122 ms.
Product exploration explored 100000 steps with 33333 reset in 131 ms.
Computed a total of 111 stabilizing places and 103 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 111 transition count 103
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 14 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-05-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLFireability-09 finished in 9452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(X(F(p0))) U p1)&&G(X(G(p2)))))'
Support contains 5 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 109 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 109 transition count 101
Applied a total of 16 rules in 6 ms. Remains 109 /117 variables (removed 8) and now considering 101/109 (removed 8) transitions.
// Phase 1: matrix 101 rows 109 cols
[2024-05-24 18:35:12] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 18:35:12] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-24 18:35:12] [INFO ] Invariant cache hit.
[2024-05-24 18:35:12] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-24 18:35:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2569 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 96/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6163 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 8771ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 8773ms
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9040 ms. Remains : 109/117 places, 101/109 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p2), true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-10 finished in 9241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(p0)&&F(!((p0 U p1) U G(p2))))))))'
Support contains 6 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 109 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 109 transition count 101
Applied a total of 16 rules in 3 ms. Remains 109 /117 variables (removed 8) and now considering 101/109 (removed 8) transitions.
[2024-05-24 18:35:21] [INFO ] Invariant cache hit.
[2024-05-24 18:35:21] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-24 18:35:21] [INFO ] Invariant cache hit.
[2024-05-24 18:35:21] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-24 18:35:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2595 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 96/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6187 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 8808ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 8809ms
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9048 ms. Remains : 109/117 places, 101/109 transitions.
Stuttering acceptance computed with spot in 362 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), p2, p2, (NOT p0), (AND p1 p2), true]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-11
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-11 finished in 9436 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(p0)||(p1&&(p2 U G((p0 U p3)))))))'
Support contains 7 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 104
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 110 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 110 transition count 102
Applied a total of 14 rules in 4 ms. Remains 110 /117 variables (removed 7) and now considering 102/109 (removed 7) transitions.
// Phase 1: matrix 102 rows 110 cols
[2024-05-24 18:35:30] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 18:35:30] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-24 18:35:31] [INFO ] Invariant cache hit.
[2024-05-24 18:35:31] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-24 18:35:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 5/110 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 102/212 variables, 110/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/212 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 118 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2531 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 5/110 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 102/212 variables, 110/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 97/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 215 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5971 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
After SMT, in 8526ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8528ms
Starting structural reductions in LTL mode, iteration 1 : 110/117 places, 102/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8756 ms. Remains : 110/117 places, 102/109 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-12 finished in 9117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 109 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 109 transition count 101
Applied a total of 16 rules in 4 ms. Remains 109 /117 variables (removed 8) and now considering 101/109 (removed 8) transitions.
// Phase 1: matrix 101 rows 109 cols
[2024-05-24 18:35:40] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 18:35:40] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-24 18:35:40] [INFO ] Invariant cache hit.
[2024-05-24 18:35:40] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-24 18:35:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2540 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 96/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6243 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 8806ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 8807ms
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9086 ms. Remains : 109/117 places, 101/109 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-13
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-13 finished in 9261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(G(p2))))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 113 transition count 105
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 113 transition count 105
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 111 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 111 transition count 103
Applied a total of 12 rules in 4 ms. Remains 111 /117 variables (removed 6) and now considering 103/109 (removed 6) transitions.
// Phase 1: matrix 103 rows 111 cols
[2024-05-24 18:35:49] [INFO ] Computed 8 invariants in 0 ms
[2024-05-24 18:35:49] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-24 18:35:49] [INFO ] Invariant cache hit.
[2024-05-24 18:35:49] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-24 18:35:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 5/111 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 103/214 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/214 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 119 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2693 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 5/111 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 103/214 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 98/217 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/214 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 217 constraints, problems are : Problem set: 0 solved, 98 unsolved in 5672 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 8393ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 8394ms
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 103/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8655 ms. Remains : 111/117 places, 103/109 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-14
Entered a terminal (fully accepting) state of product in 86 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-14 finished in 8839 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((((p1||G(p2)) U (!p3&&(p1||G(p2))))||p0))))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Reduce places removed 4 places and 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 113 transition count 72
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 80 transition count 72
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 76 transition count 68
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 76 transition count 68
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 76 place count 76 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 74 transition count 66
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 73 transition count 65
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 73 transition count 65
Applied a total of 80 rules in 10 ms. Remains 73 /117 variables (removed 44) and now considering 65/109 (removed 44) transitions.
// Phase 1: matrix 65 rows 73 cols
[2024-05-24 18:35:58] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 18:35:58] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-24 18:35:58] [INFO ] Invariant cache hit.
[2024-05-24 18:35:58] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-24 18:35:58] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-24 18:35:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 3/70 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 62/132 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 0/132 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/138 variables, and 78 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1195 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 70/73 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 3/70 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 62/132 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 59/137 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/138 variables, and 137 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1323 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 70/73 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 2529ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 2530ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/117 places, 65/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2720 ms. Remains : 73/117 places, 65/109 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-15
Product exploration explored 100000 steps with 1460 reset in 123 ms.
Product exploration explored 100000 steps with 1457 reset in 142 ms.
Computed a total of 73 stabilizing places and 65 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 65
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 p3) p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p1) (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0) p2))), (X p0), (X (NOT p1)), (X (X (NOT p3))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p1) (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0) p2)))), (X (X (NOT (OR (AND p3 (NOT p0) p2) (AND (NOT p1) (NOT p0) p2))))), (X (X (NOT (OR (AND p3 (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p2)))))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p3))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 19 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-05-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLFireability-15 finished in 3212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Found a Lengthening insensitive property : HirschbergSinclair-PT-05-LTLFireability-00
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Reduce places removed 5 places and 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 112 transition count 61
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 69 transition count 61
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 64 transition count 56
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 64 transition count 56
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 98 place count 64 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 100 place count 62 transition count 54
Applied a total of 100 rules in 7 ms. Remains 62 /117 variables (removed 55) and now considering 54/109 (removed 55) transitions.
// Phase 1: matrix 54 rows 62 cols
[2024-05-24 18:36:01] [INFO ] Computed 8 invariants in 0 ms
[2024-05-24 18:36:01] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-24 18:36:01] [INFO ] Invariant cache hit.
[2024-05-24 18:36:01] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 45 sub problems to find dead transitions.
[2024-05-24 18:36:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 47/102 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/116 variables, and 63 constraints, problems are : Problem set: 0 solved, 45 unsolved in 831 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/62 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 47/102 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 45/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/116 variables, and 108 constraints, problems are : Problem set: 0 solved, 45 unsolved in 844 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/62 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 1682ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1683ms
Starting structural reductions in LI_LTL mode, iteration 1 : 62/117 places, 54/109 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1864 ms. Remains : 62/117 places, 54/109 transitions.
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-00
Product exploration explored 100000 steps with 3321 reset in 96 ms.
Product exploration explored 100000 steps with 3326 reset in 118 ms.
Computed a total of 62 stabilizing places and 54 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 62 transition count 54
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 202 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 136 steps (0 resets) in 5 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 11 factoid took 263 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-24 18:36:04] [INFO ] Invariant cache hit.
[2024-05-24 18:36:04] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 18:36:04] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-24 18:36:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 18:36:04] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 18:36:04] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-24 18:36:04] [INFO ] Computed and/alt/rep : 45/49/45 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 18:36:04] [INFO ] Added : 22 causal constraints over 5 iterations in 41 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 54/54 transitions.
Applied a total of 0 rules in 0 ms. Remains 62 /62 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-05-24 18:36:04] [INFO ] Invariant cache hit.
[2024-05-24 18:36:04] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-24 18:36:04] [INFO ] Invariant cache hit.
[2024-05-24 18:36:04] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 45 sub problems to find dead transitions.
[2024-05-24 18:36:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 47/102 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/116 variables, and 63 constraints, problems are : Problem set: 0 solved, 45 unsolved in 834 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/62 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 47/102 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 45/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/116 variables, and 108 constraints, problems are : Problem set: 0 solved, 45 unsolved in 875 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/62 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 1722ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1722ms
Finished structural reductions in LTL mode , in 1 iterations and 1912 ms. Remains : 62/62 places, 54/54 transitions.
Computed a total of 62 stabilizing places and 54 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 62 transition count 54
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 (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 123 steps (0 resets) in 4 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-24 18:36:07] [INFO ] Invariant cache hit.
[2024-05-24 18:36:07] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 18:36:07] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-24 18:36:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 18:36:07] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 18:36:07] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-24 18:36:07] [INFO ] Computed and/alt/rep : 45/49/45 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 18:36:07] [INFO ] Added : 22 causal constraints over 5 iterations in 42 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3320 reset in 93 ms.
Product exploration explored 100000 steps with 3325 reset in 109 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 54/54 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-05-24 18:36:07] [INFO ] Redundant transitions in 0 ms returned []
Running 45 sub problems to find dead transitions.
// Phase 1: matrix 54 rows 62 cols
[2024-05-24 18:36:07] [INFO ] Computed 8 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem TDEAD25 is UNSAT
At refinement iteration 4 (OVERLAPS) 47/102 variables, 55/63 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/116 variables, and 63 constraints, problems are : Problem set: 1 solved, 44 unsolved in 798 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/62 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 3/55 variables, 7/8 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 47/102 variables, 55/63 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 44/107 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/116 variables, and 107 constraints, problems are : Problem set: 1 solved, 44 unsolved in 768 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/62 constraints, PredecessorRefiner: 44/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 1574ms problems are : Problem set: 1 solved, 44 unsolved
Search for dead transitions found 1 dead transitions in 1575ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/62 places, 53/54 transitions.
Graph (complete) has 150 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 61 /62 variables (removed 1) and now considering 53/53 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/62 places, 53/54 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1589 ms. Remains : 61/62 places, 53/54 transitions.
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 54/54 transitions.
Applied a total of 0 rules in 0 ms. Remains 62 /62 variables (removed 0) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 62 cols
[2024-05-24 18:36:09] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 18:36:09] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-24 18:36:09] [INFO ] Invariant cache hit.
[2024-05-24 18:36:09] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 45 sub problems to find dead transitions.
[2024-05-24 18:36:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 47/102 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/116 variables, and 63 constraints, problems are : Problem set: 0 solved, 45 unsolved in 834 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/62 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 47/102 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 45/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/116 variables, and 108 constraints, problems are : Problem set: 0 solved, 45 unsolved in 897 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/62 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 1744ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1745ms
Finished structural reductions in LTL mode , in 1 iterations and 1913 ms. Remains : 62/62 places, 54/54 transitions.
Treatment of property HirschbergSinclair-PT-05-LTLFireability-00 finished in 10158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((p0||X(!p0))) U (!p0||X(p1))) U p1))'
Found a Shortening insensitive property : HirschbergSinclair-PT-05-LTLFireability-03
Stuttering acceptance computed with spot in 138 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Reduce places removed 5 places and 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 112 transition count 61
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 69 transition count 61
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 64 transition count 56
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 64 transition count 56
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 98 place count 64 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 100 place count 62 transition count 54
Applied a total of 100 rules in 9 ms. Remains 62 /117 variables (removed 55) and now considering 54/109 (removed 55) transitions.
// Phase 1: matrix 54 rows 62 cols
[2024-05-24 18:36:12] [INFO ] Computed 8 invariants in 0 ms
[2024-05-24 18:36:12] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-24 18:36:12] [INFO ] Invariant cache hit.
[2024-05-24 18:36:12] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 45 sub problems to find dead transitions.
[2024-05-24 18:36:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 47/102 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/116 variables, and 63 constraints, problems are : Problem set: 0 solved, 45 unsolved in 837 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/62 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 47/102 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 45/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/116 variables, and 108 constraints, problems are : Problem set: 0 solved, 45 unsolved in 895 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/62 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 1741ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1742ms
Starting structural reductions in LI_LTL mode, iteration 1 : 62/117 places, 54/109 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1935 ms. Remains : 62/117 places, 54/109 transitions.
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-03
Product exploration explored 100000 steps with 5540 reset in 122 ms.
Product exploration explored 100000 steps with 5519 reset in 139 ms.
Computed a total of 62 stabilizing places and 54 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 62 transition count 54
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 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 200 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
RANDOM walk for 152 steps (0 resets) in 6 ms. (21 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p1 p0))), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 413 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
[2024-05-24 18:36:15] [INFO ] Invariant cache hit.
[2024-05-24 18:36:15] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 18:36:15] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-24 18:36:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 18:36:15] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 18:36:15] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-24 18:36:15] [INFO ] Computed and/alt/rep : 45/49/45 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 18:36:15] [INFO ] Added : 7 causal constraints over 2 iterations in 22 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 54/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-05-24 18:36:15] [INFO ] Invariant cache hit.
[2024-05-24 18:36:15] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-24 18:36:15] [INFO ] Invariant cache hit.
[2024-05-24 18:36:15] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 45 sub problems to find dead transitions.
[2024-05-24 18:36:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 47/102 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/116 variables, and 63 constraints, problems are : Problem set: 0 solved, 45 unsolved in 841 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/62 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 47/102 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 45/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/116 variables, and 108 constraints, problems are : Problem set: 0 solved, 45 unsolved in 911 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/62 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 1759ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1760ms
Finished structural reductions in LTL mode , in 1 iterations and 1932 ms. Remains : 62/62 places, 54/54 transitions.
Computed a total of 62 stabilizing places and 54 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 62 transition count 54
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 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 250 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
RANDOM walk for 149 steps (0 resets) in 6 ms. (21 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p1 p0))), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 415 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
[2024-05-24 18:36:18] [INFO ] Invariant cache hit.
[2024-05-24 18:36:18] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 18:36:18] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-24 18:36:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 18:36:18] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 18:36:18] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-24 18:36:18] [INFO ] Computed and/alt/rep : 45/49/45 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 18:36:18] [INFO ] Added : 7 causal constraints over 2 iterations in 23 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 121 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 5514 reset in 123 ms.
Product exploration explored 100000 steps with 5521 reset in 139 ms.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 54/54 transitions.
Applied a total of 0 rules in 0 ms. Remains 62 /62 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-05-24 18:36:19] [INFO ] Invariant cache hit.
[2024-05-24 18:36:19] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-24 18:36:19] [INFO ] Invariant cache hit.
[2024-05-24 18:36:19] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 45 sub problems to find dead transitions.
[2024-05-24 18:36:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 47/102 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/116 variables, and 63 constraints, problems are : Problem set: 0 solved, 45 unsolved in 782 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/62 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 47/102 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 45/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/116 variables, and 108 constraints, problems are : Problem set: 0 solved, 45 unsolved in 931 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/62 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 1722ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1723ms
Finished structural reductions in LTL mode , in 1 iterations and 1908 ms. Remains : 62/62 places, 54/54 transitions.
Treatment of property HirschbergSinclair-PT-05-LTLFireability-03 finished in 9482 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))'
[2024-05-24 18:36:21] [INFO ] Flatten gal took : 11 ms
[2024-05-24 18:36:21] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-24 18:36:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 117 places, 109 transitions and 328 arcs took 7 ms.
Total runtime 236073 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running HirschbergSinclair-PT-05
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 117
TRANSITIONS: 109
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2274
MODEL NAME: /home/mcc/execution/413/model
117 places, 109 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA HirschbergSinclair-PT-05-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HirschbergSinclair-PT-05-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HirschbergSinclair-PT-05-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HirschbergSinclair-PT-05-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716575788466
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
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-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is HirschbergSinclair-PT-05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r201-smll-171649586500060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-05.tgz
mv HirschbergSinclair-PT-05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;