Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

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

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:20:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 10:20:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:20:17] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2024-06-01 10:20:17] [INFO ] Transformed 124 places.
[2024-06-01 10:20:17] [INFO ] Transformed 111 transitions.
[2024-06-01 10:20:17] [INFO ] Parsed PT model containing 124 places and 111 transitions and 340 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 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 78 ms. Remains 117 /124 variables (removed 7) and now considering 109/111 (removed 2) transitions.
// Phase 1: matrix 109 rows 117 cols
[2024-06-01 10:20:17] [INFO ] Computed 8 invariants in 21 ms
[2024-06-01 10:20:18] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-06-01 10:20:18] [INFO ] Invariant cache hit.
[2024-06-01 10:20:18] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2024-06-01 10:20:18] [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 4963 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 9182 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 14334ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 14364ms
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 109/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15351 ms. Remains : 117/124 places, 109/111 transitions.
Support contains 40 out of 117 places after structural reductions.
[2024-06-01 10:20:33] [INFO ] Flatten gal took : 67 ms
[2024-06-01 10:20:33] [INFO ] Flatten gal took : 26 ms
[2024-06-01 10:20:33] [INFO ] Input system was already deterministic with 109 transitions.
Reduction of identical properties reduced properties to check from 34 to 33
RANDOM walk for 430 steps (0 resets) in 207 ms. (2 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 43 ms. Remains 109 /117 variables (removed 8) and now considering 101/109 (removed 8) transitions.
// Phase 1: matrix 101 rows 109 cols
[2024-06-01 10:20:34] [INFO ] Computed 8 invariants in 7 ms
[2024-06-01 10:20:34] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-01 10:20:34] [INFO ] Invariant cache hit.
[2024-06-01 10:20:34] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-06-01 10:20:34] [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 3854 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 8144 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 12070ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 12074ms
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12560 ms. Remains : 109/117 places, 101/109 transitions.
Stuttering acceptance computed with spot in 280 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 1660 reset in 733 ms.
Product exploration explored 100000 steps with 1663 reset in 383 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 331 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 152 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 245 steps (0 resets) in 13 ms. (17 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 405 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 157 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 10:20:49] [INFO ] Invariant cache hit.
[2024-06-01 10:20:49] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 10 ms returned sat
[2024-06-01 10:20:49] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-06-01 10:20:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:20:50] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 10 ms returned sat
[2024-06-01 10:20:50] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-06-01 10:20:50] [INFO ] Computed and/alt/rep : 47/50/47 causal constraints (skipped 49 transitions) in 18 ms.
[2024-06-01 10:20:50] [INFO ] Added : 30 causal constraints over 6 iterations in 140 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 5 ms. Remains 109 /109 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-06-01 10:20:50] [INFO ] Invariant cache hit.
[2024-06-01 10:20:50] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-01 10:20:50] [INFO ] Invariant cache hit.
[2024-06-01 10:20:50] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-06-01 10:20:50] [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 3872 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 9173 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 13107ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 13110ms
Finished structural reductions in LTL mode , in 1 iterations and 13535 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 111 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 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 233 steps (0 resets) in 11 ms. (19 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 151 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 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 10:21:04] [INFO ] Invariant cache hit.
[2024-06-01 10:21:04] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 10 ms returned sat
[2024-06-01 10:21:04] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-06-01 10:21:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:21:05] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2024-06-01 10:21:05] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-06-01 10:21:05] [INFO ] Computed and/alt/rep : 47/50/47 causal constraints (skipped 49 transitions) in 16 ms.
[2024-06-01 10:21:05] [INFO ] Added : 30 causal constraints over 6 iterations in 123 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1659 reset in 299 ms.
Product exploration explored 100000 steps with 1665 reset in 467 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 0 ms
Applied a total of 43 rules in 29 ms. Remains 109 /109 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-06-01 10:21:06] [INFO ] Redundant transitions in 4 ms returned []
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 101 rows 109 cols
[2024-06-01 10:21:06] [INFO ] Computed 8 invariants in 6 ms
[2024-06-01 10:21:06] [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 2463 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 2622 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 5148ms problems are : Problem set: 43 solved, 53 unsolved
Search for dead transitions found 43 dead transitions in 5151ms
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.2 ms
Discarding 43 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 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 5210 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-06-01 10:21:11] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 10:21:11] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-01 10:21:11] [INFO ] Invariant cache hit.
[2024-06-01 10:21:12] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-06-01 10:21: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 3099 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 7203 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 10338ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 10339ms
Finished structural reductions in LTL mode , in 1 iterations and 10684 ms. Remains : 109/109 places, 101/101 transitions.
Treatment of property HirschbergSinclair-PT-05-LTLFireability-00 finished in 48347 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 20 ms. Remains 70 /117 variables (removed 47) and now considering 62/109 (removed 47) transitions.
// Phase 1: matrix 62 rows 70 cols
[2024-06-01 10:21:22] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 10:21:22] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 10:21:22] [INFO ] Invariant cache hit.
[2024-06-01 10:21:22] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-06-01 10:21:22] [INFO ] Redundant transitions in 0 ms returned []
Running 55 sub problems to find dead transitions.
[2024-06-01 10:21:22] [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 1082 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 1262 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 2359ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2364ms
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 2564 ms. Remains : 70/117 places, 62/109 transitions.
Stuttering acceptance computed with spot in 37 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 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-01 finished in 2618 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 8 ms. Remains 110 /117 variables (removed 7) and now considering 102/109 (removed 7) transitions.
// Phase 1: matrix 102 rows 110 cols
[2024-06-01 10:21:25] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 10:21:25] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 10:21:25] [INFO ] Invariant cache hit.
[2024-06-01 10:21:25] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-06-01 10:21:25] [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 3026 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 5574 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 8629ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8630ms
Starting structural reductions in LTL mode, iteration 1 : 110/117 places, 102/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8928 ms. Remains : 110/117 places, 102/109 transitions.
Stuttering acceptance computed with spot in 114 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 4674 reset in 252 ms.
Product exploration explored 100000 steps with 4683 reset in 269 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 114 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 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 80 steps (0 resets) in 8 ms. (8 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 144 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 98 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-06-01 10:21:35] [INFO ] Invariant cache hit.
[2024-06-01 10:21:35] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2024-06-01 10:21:35] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-06-01 10:21:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:21:35] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 16 ms returned sat
[2024-06-01 10:21:36] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2024-06-01 10:21:36] [INFO ] Computed and/alt/rep : 47/51/47 causal constraints (skipped 50 transitions) in 11 ms.
[2024-06-01 10:21:36] [INFO ] Added : 30 causal constraints over 6 iterations in 142 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 3 ms. Remains 110 /110 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-06-01 10:21:36] [INFO ] Invariant cache hit.
[2024-06-01 10:21:36] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 10:21:36] [INFO ] Invariant cache hit.
[2024-06-01 10:21:36] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-06-01 10:21:36] [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 2772 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 6027 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 8827ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8829ms
Finished structural reductions in LTL mode , in 1 iterations and 9105 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 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 104 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 49 steps (0 resets) in 4 ms. (9 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 152 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 142 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-06-01 10:21:46] [INFO ] Invariant cache hit.
[2024-06-01 10:21:46] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 11 ms returned sat
[2024-06-01 10:21:46] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2024-06-01 10:21:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:21:46] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 9 ms returned sat
[2024-06-01 10:21:46] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-06-01 10:21:46] [INFO ] Computed and/alt/rep : 47/51/47 causal constraints (skipped 50 transitions) in 14 ms.
[2024-06-01 10:21:46] [INFO ] Added : 30 causal constraints over 6 iterations in 162 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 4667 reset in 249 ms.
Product exploration explored 100000 steps with 4700 reset in 278 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 134 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 18 ms. Remains 110 /110 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-06-01 10:21:47] [INFO ] Redundant transitions in 3 ms returned []
Running 97 sub problems to find dead transitions.
// Phase 1: matrix 102 rows 110 cols
[2024-06-01 10:21:47] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 10:21:47] [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 3635 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 3055 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 6728ms problems are : Problem set: 34 solved, 63 unsolved
Search for dead transitions found 34 dead transitions in 6730ms
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.0 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 6764 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-06-01 10:21:54] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 10:21:54] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 10:21:54] [INFO ] Invariant cache hit.
[2024-06-01 10:21:54] [INFO ] Implicit Places using invariants and state equation in 181 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-06-01 10:21:54] [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 3232 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 6448 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 9706ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 9707ms
Finished structural reductions in LTL mode , in 1 iterations and 9987 ms. Remains : 110/110 places, 102/102 transitions.
Treatment of property HirschbergSinclair-PT-05-LTLFireability-02 finished in 39415 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 4 ms. Remains 109 /117 variables (removed 8) and now considering 101/109 (removed 8) transitions.
// Phase 1: matrix 101 rows 109 cols
[2024-06-01 10:22:04] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 10:22:04] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 10:22:04] [INFO ] Invariant cache hit.
[2024-06-01 10:22:04] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-06-01 10:22: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 2731 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 7102 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 9861ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 9864ms
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10173 ms. Remains : 109/117 places, 101/109 transitions.
Stuttering acceptance computed with spot in 172 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 2663 reset in 158 ms.
Product exploration explored 100000 steps with 2671 reset in 176 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 258 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 128 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
RANDOM walk for 265 steps (0 resets) in 13 ms. (18 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 471 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 157 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 171 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
[2024-06-01 10:22:16] [INFO ] Invariant cache hit.
[2024-06-01 10:22:16] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2024-06-01 10:22:16] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-06-01 10:22:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:22:16] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2024-06-01 10:22:17] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-01 10:22:17] [INFO ] Computed and/alt/rep : 47/50/47 causal constraints (skipped 49 transitions) in 10 ms.
[2024-06-01 10:22:17] [INFO ] Added : 16 causal constraints over 4 iterations in 72 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 1 ms. Remains 109 /109 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-06-01 10:22:17] [INFO ] Invariant cache hit.
[2024-06-01 10:22:17] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 10:22:17] [INFO ] Invariant cache hit.
[2024-06-01 10:22:17] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-06-01 10:22:17] [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 2957 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 6094 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 9076ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 9079ms
Finished structural reductions in LTL mode , in 1 iterations and 9330 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 219 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 128 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
RANDOM walk for 272 steps (0 resets) in 7 ms. (34 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 529 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 161 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
[2024-06-01 10:22:27] [INFO ] Invariant cache hit.
[2024-06-01 10:22:27] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2024-06-01 10:22:27] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-06-01 10:22:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:22:27] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2024-06-01 10:22:28] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-01 10:22:28] [INFO ] Computed and/alt/rep : 47/50/47 causal constraints (skipped 49 transitions) in 10 ms.
[2024-06-01 10:22:28] [INFO ] Added : 16 causal constraints over 4 iterations in 78 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 178 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2669 reset in 241 ms.
Product exploration explored 100000 steps with 2664 reset in 168 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 1 ms. Remains 109 /109 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-06-01 10:22:28] [INFO ] Invariant cache hit.
[2024-06-01 10:22:28] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 10:22:28] [INFO ] Invariant cache hit.
[2024-06-01 10:22:29] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-06-01 10:22:29] [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 3507 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 7489 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 11028ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 11029ms
Finished structural reductions in LTL mode , in 1 iterations and 11278 ms. Remains : 109/109 places, 101/101 transitions.
Treatment of property HirschbergSinclair-PT-05-LTLFireability-03 finished in 35422 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-06-01 10:22:40] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 10:22:40] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 10:22:40] [INFO ] Invariant cache hit.
[2024-06-01 10:22:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:22:40] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-06-01 10:22:40] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-06-01 10:22:40] [INFO ] Invariant cache hit.
[2024-06-01 10:22:40] [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 1744 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 2370 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 4129ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4130ms
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 4329 ms. Remains : 72/117 places, 64/109 transitions.
Stuttering acceptance computed with spot in 103 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 2345 reset in 466 ms.
Product exploration explored 100000 steps with 2334 reset in 242 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 13 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 5233 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 9 ms. Remains 61 /117 variables (removed 56) and now considering 53/109 (removed 56) transitions.
// Phase 1: matrix 53 rows 61 cols
[2024-06-01 10:22:45] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 10:22:45] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 10:22:45] [INFO ] Invariant cache hit.
[2024-06-01 10:22:45] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-06-01 10:22:45] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2024-06-01 10:22:45] [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 1184 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 1138 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 2330ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2331ms
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 2510 ms. Remains : 61/117 places, 53/109 transitions.
Stuttering acceptance computed with spot in 48 ms :[false]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-05
Product exploration explored 100000 steps with 1722 reset in 159 ms.
Product exploration explored 100000 steps with 1722 reset in 190 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 18 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 3002 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 5 ms. Remains 112 /117 variables (removed 5) and now considering 104/109 (removed 5) transitions.
// Phase 1: matrix 104 rows 112 cols
[2024-06-01 10:22:48] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 10:22:48] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 10:22:48] [INFO ] Invariant cache hit.
[2024-06-01 10:22:48] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2024-06-01 10:22:48] [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 3617 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 8488 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 12163ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 12166ms
Starting structural reductions in LTL mode, iteration 1 : 112/117 places, 104/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12530 ms. Remains : 112/117 places, 104/109 transitions.
Stuttering acceptance computed with spot in 112 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 12671 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 10 ms. Remains 73 /117 variables (removed 44) and now considering 65/109 (removed 44) transitions.
// Phase 1: matrix 65 rows 73 cols
[2024-06-01 10:23:01] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 10:23:01] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 10:23:01] [INFO ] Invariant cache hit.
[2024-06-01 10:23:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:23:01] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-06-01 10:23:01] [INFO ] Redundant transitions in 2 ms returned []
Running 59 sub problems to find dead transitions.
[2024-06-01 10:23:01] [INFO ] Invariant cache hit.
[2024-06-01 10:23:01] [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 2360 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 2937 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 5318ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 5320ms
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 5631 ms. Remains : 73/117 places, 65/109 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-07
Product exploration explored 100000 steps with 12699 reset in 223 ms.
Product exploration explored 100000 steps with 12635 reset in 264 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 180 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 47 ms :[(NOT p0)]
RANDOM walk for 20 steps (0 resets) in 5 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 208 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 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2024-06-01 10:23:07] [INFO ] Invariant cache hit.
[2024-06-01 10:23:07] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2024-06-01 10:23:08] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-01 10:23:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:23:08] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2024-06-01 10:23:08] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-06-01 10:23:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:23:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-06-01 10:23:08] [INFO ] Computed and/alt/rep : 48/72/48 causal constraints (skipped 11 transitions) in 8 ms.
[2024-06-01 10:23:08] [INFO ] Added : 24 causal constraints over 5 iterations in 102 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 6 ms. Remains 73 /73 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-06-01 10:23:08] [INFO ] Invariant cache hit.
[2024-06-01 10:23:08] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 10:23:08] [INFO ] Invariant cache hit.
[2024-06-01 10:23:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:23:08] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-06-01 10:23:08] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-06-01 10:23:08] [INFO ] Invariant cache hit.
[2024-06-01 10:23:08] [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 2682 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 2940 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 5642ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 5644ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6004 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 182 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 46 ms :[(NOT p0)]
RANDOM walk for 35 steps (0 resets) in 4 ms. (7 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 209 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 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2024-06-01 10:23:14] [INFO ] Invariant cache hit.
[2024-06-01 10:23:15] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2024-06-01 10:23:15] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-06-01 10:23:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:23:15] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 9 ms returned sat
[2024-06-01 10:23:15] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-06-01 10:23:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:23:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2024-06-01 10:23:15] [INFO ] Computed and/alt/rep : 48/72/48 causal constraints (skipped 11 transitions) in 9 ms.
[2024-06-01 10:23:15] [INFO ] Added : 24 causal constraints over 5 iterations in 104 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 12651 reset in 228 ms.
Product exploration explored 100000 steps with 12625 reset in 261 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 5 ms. Remains 73 /73 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-06-01 10:23:16] [INFO ] Invariant cache hit.
[2024-06-01 10:23:16] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 10:23:16] [INFO ] Invariant cache hit.
[2024-06-01 10:23:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:23:16] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-06-01 10:23:16] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-06-01 10:23:16] [INFO ] Invariant cache hit.
[2024-06-01 10:23:16] [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 2068 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 1921 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 4007ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 4009ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4364 ms. Remains : 73/73 places, 65/65 transitions.
Treatment of property HirschbergSinclair-PT-05-LTLFireability-07 finished in 19394 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 4 ms. Remains 109 /117 variables (removed 8) and now considering 101/109 (removed 8) transitions.
// Phase 1: matrix 101 rows 109 cols
[2024-06-01 10:23:20] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 10:23:20] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 10:23:20] [INFO ] Invariant cache hit.
[2024-06-01 10:23:20] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-06-01 10:23:20] [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 2495 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 6138 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 8659ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 8660ms
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8948 ms. Remains : 109/117 places, 101/109 transitions.
Stuttering acceptance computed with spot in 301 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 88 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-08 finished in 9271 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-06-01 10:23:29] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 10:23:29] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 10:23:29] [INFO ] Invariant cache hit.
[2024-06-01 10:23:29] [INFO ] Implicit Places using invariants and state equation in 174 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-06-01 10:23:29] [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 2737 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 5961 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 8728ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 8731ms
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 103/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9017 ms. Remains : 111/117 places, 103/109 transitions.
Stuttering acceptance computed with spot in 144 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 121 ms.
Product exploration explored 100000 steps with 33333 reset in 138 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 9518 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 4 ms. Remains 109 /117 variables (removed 8) and now considering 101/109 (removed 8) transitions.
// Phase 1: matrix 101 rows 109 cols
[2024-06-01 10:23:39] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 10:23:39] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 10:23:39] [INFO ] Invariant cache hit.
[2024-06-01 10:23:39] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-06-01 10:23:39] [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 2648 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 5918 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 8591ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 8593ms
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8876 ms. Remains : 109/117 places, 101/109 transitions.
Stuttering acceptance computed with spot in 160 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 9053 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 4 ms. Remains 109 /117 variables (removed 8) and now considering 101/109 (removed 8) transitions.
[2024-06-01 10:23:48] [INFO ] Invariant cache hit.
[2024-06-01 10:23:48] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 10:23:48] [INFO ] Invariant cache hit.
[2024-06-01 10:23:48] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-06-01 10:23:48] [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 3106 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 6905 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 10040ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 10041ms
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10239 ms. Remains : 109/117 places, 101/109 transitions.
Stuttering acceptance computed with spot in 370 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 10633 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 3 ms. Remains 110 /117 variables (removed 7) and now considering 102/109 (removed 7) transitions.
// Phase 1: matrix 102 rows 110 cols
[2024-06-01 10:23:58] [INFO ] Computed 8 invariants in 5 ms
[2024-06-01 10:23:58] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 10:23:58] [INFO ] Invariant cache hit.
[2024-06-01 10:23:59] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-06-01 10:23:59] [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 2466 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 6650 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 9143ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 9144ms
Starting structural reductions in LTL mode, iteration 1 : 110/117 places, 102/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9374 ms. Remains : 110/117 places, 102/109 transitions.
Stuttering acceptance computed with spot in 374 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 1 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 9772 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 8 ms. Remains 109 /117 variables (removed 8) and now considering 101/109 (removed 8) transitions.
// Phase 1: matrix 101 rows 109 cols
[2024-06-01 10:24:08] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 10:24:08] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 10:24:08] [INFO ] Invariant cache hit.
[2024-06-01 10:24:08] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-06-01 10:24:08] [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 2469 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 8745ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 8747ms
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9036 ms. Remains : 109/117 places, 101/109 transitions.
Stuttering acceptance computed with spot in 162 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 9214 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-06-01 10:24:17] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 10:24:17] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 10:24:17] [INFO ] Invariant cache hit.
[2024-06-01 10:24:18] [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 98 sub problems to find dead transitions.
[2024-06-01 10:24:18] [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 3399 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 5613 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 9037ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 9039ms
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 103/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9268 ms. Remains : 111/117 places, 103/109 transitions.
Stuttering acceptance computed with spot in 169 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 9453 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 12 ms. Remains 73 /117 variables (removed 44) and now considering 65/109 (removed 44) transitions.
// Phase 1: matrix 65 rows 73 cols
[2024-06-01 10:24:27] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 10:24:27] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 10:24:27] [INFO ] Invariant cache hit.
[2024-06-01 10:24:27] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-06-01 10:24:27] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-06-01 10:24:27] [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 1424 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 1493 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 2935ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 2937ms
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 3139 ms. Remains : 73/117 places, 65/109 transitions.
Stuttering acceptance computed with spot in 142 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 1458 reset in 139 ms.
Product exploration explored 100000 steps with 1457 reset in 152 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 18 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 3669 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 120 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-06-01 10:24:31] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 10:24:31] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 10:24:31] [INFO ] Invariant cache hit.
[2024-06-01 10:24:31] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 45 sub problems to find dead transitions.
[2024-06-01 10:24:31] [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 996 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 1028 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 2034ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 2036ms
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 2262 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 156 ms.
Product exploration explored 100000 steps with 3322 reset in 178 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 198 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 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 124 steps (0 resets) in 4 ms. (24 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 332 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 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 10:24:34] [INFO ] Invariant cache hit.
[2024-06-01 10:24:35] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2024-06-01 10:24:35] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-06-01 10:24:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:24:35] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2024-06-01 10:24:35] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-01 10:24:35] [INFO ] Computed and/alt/rep : 45/49/45 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 10:24:35] [INFO ] Added : 22 causal constraints over 5 iterations in 62 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 1 ms. Remains 62 /62 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-06-01 10:24:35] [INFO ] Invariant cache hit.
[2024-06-01 10:24:35] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 10:24:35] [INFO ] Invariant cache hit.
[2024-06-01 10:24:35] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 45 sub problems to find dead transitions.
[2024-06-01 10:24:35] [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 1258 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 1389 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 2656ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 2657ms
Finished structural reductions in LTL mode , in 1 iterations and 2921 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 113 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 148 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 127 steps (0 resets) in 4 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 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 143 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 10:24:38] [INFO ] Invariant cache hit.
[2024-06-01 10:24:39] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2024-06-01 10:24:39] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-01 10:24:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:24:39] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2024-06-01 10:24:39] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-01 10:24:39] [INFO ] Computed and/alt/rep : 45/49/45 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 10:24:39] [INFO ] Added : 22 causal constraints over 5 iterations in 61 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3323 reset in 156 ms.
Product exploration explored 100000 steps with 3324 reset in 176 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 150 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 5 ms. Remains 62 /62 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-06-01 10:24:40] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
// Phase 1: matrix 54 rows 62 cols
[2024-06-01 10:24:40] [INFO ] Computed 8 invariants in 4 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 1306 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 1267 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 2599ms problems are : Problem set: 1 solved, 44 unsolved
Search for dead transitions found 1 dead transitions in 2600ms
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.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 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 2622 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 1 ms. Remains 62 /62 variables (removed 0) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 62 cols
[2024-06-01 10:24:42] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 10:24:42] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 10:24:42] [INFO ] Invariant cache hit.
[2024-06-01 10:24:43] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 45 sub problems to find dead transitions.
[2024-06-01 10:24:43] [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 1322 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 1400 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 2736ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 2737ms
Finished structural reductions in LTL mode , in 1 iterations and 3077 ms. Remains : 62/62 places, 54/54 transitions.
Treatment of property HirschbergSinclair-PT-05-LTLFireability-00 finished in 14837 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 188 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 13 ms. Remains 62 /117 variables (removed 55) and now considering 54/109 (removed 55) transitions.
// Phase 1: matrix 54 rows 62 cols
[2024-06-01 10:24:46] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 10:24:46] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-01 10:24:46] [INFO ] Invariant cache hit.
[2024-06-01 10:24:46] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 45 sub problems to find dead transitions.
[2024-06-01 10:24:46] [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 1306 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 1457 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 2774ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 2775ms
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 3068 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 5522 reset in 208 ms.
Product exploration explored 100000 steps with 5556 reset in 230 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 391 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 215 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
RANDOM walk for 148 steps (0 resets) in 9 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 643 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 169 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 171 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
[2024-06-01 10:24:51] [INFO ] Invariant cache hit.
[2024-06-01 10:24:51] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2024-06-01 10:24:51] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-01 10:24:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:24:51] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2024-06-01 10:24:51] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-01 10:24:51] [INFO ] Computed and/alt/rep : 45/49/45 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 10:24:51] [INFO ] Added : 7 causal constraints over 2 iterations in 36 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 0 ms. Remains 62 /62 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-06-01 10:24:51] [INFO ] Invariant cache hit.
[2024-06-01 10:24:52] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 10:24:52] [INFO ] Invariant cache hit.
[2024-06-01 10:24:52] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 45 sub problems to find dead transitions.
[2024-06-01 10:24:52] [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 1335 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 1459 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 2806ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 2807ms
Finished structural reductions in LTL mode , in 1 iterations and 3114 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 266 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 165 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
RANDOM walk for 142 steps (0 resets) in 8 ms. (15 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 572 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 117 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
[2024-06-01 10:24:56] [INFO ] Invariant cache hit.
[2024-06-01 10:24:56] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2024-06-01 10:24:56] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-01 10:24:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:24:56] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2024-06-01 10:24:56] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-01 10:24:56] [INFO ] Computed and/alt/rep : 45/49/45 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 10:24:56] [INFO ] Added : 7 causal constraints over 2 iterations in 22 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 114 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 5515 reset in 119 ms.
Product exploration explored 100000 steps with 5539 reset in 132 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 1 ms. Remains 62 /62 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-06-01 10:24:57] [INFO ] Invariant cache hit.
[2024-06-01 10:24:57] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 10:24:57] [INFO ] Invariant cache hit.
[2024-06-01 10:24:57] [INFO ] Implicit Places using invariants and state equation in 103 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-06-01 10:24:57] [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 794 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 975 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 1780ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1781ms
Finished structural reductions in LTL mode , in 1 iterations and 1948 ms. Remains : 62/62 places, 54/54 transitions.
Treatment of property HirschbergSinclair-PT-05-LTLFireability-03 finished in 12978 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-06-01 10:24:59] [INFO ] Flatten gal took : 17 ms
[2024-06-01 10:24:59] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-01 10:24:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 117 places, 109 transitions and 328 arcs took 9 ms.
Total runtime 282331 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA HirschbergSinclair-PT-05-LTLFireability-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA HirschbergSinclair-PT-05-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA HirschbergSinclair-PT-05-LTLFireability-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA HirschbergSinclair-PT-05-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717237510836

--------------------
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
mcc2024
ltl formula name HirschbergSinclair-PT-05-LTLFireability-00
ltl formula formula --ltl=/tmp/2245/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 117 places, 109 transitions and 328 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2245/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2245/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2245/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2245/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 119 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 118, there are 113 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~72 levels ~10000 states ~32684 transitions
pnml2lts-mc( 1/ 4): ~72 levels ~20000 states ~65824 transitions
pnml2lts-mc( 1/ 4): ~72 levels ~40000 states ~136832 transitions
pnml2lts-mc( 1/ 4): ~72 levels ~80000 states ~294612 transitions
pnml2lts-mc( 1/ 4): ~72 levels ~160000 states ~608016 transitions
pnml2lts-mc( 1/ 4): ~72 levels ~320000 states ~1296372 transitions
pnml2lts-mc( 1/ 4): ~72 levels ~640000 states ~2777164 transitions
pnml2lts-mc( 1/ 4): ~72 levels ~1280000 states ~6073248 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1796095
pnml2lts-mc( 0/ 4): unique states count: 1796095
pnml2lts-mc( 0/ 4): unique transitions count: 8873108
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 7090771
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1801277
pnml2lts-mc( 0/ 4): - cum. max stack depth: 288
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1801277 states 8909031 transitions, fanout: 4.946
pnml2lts-mc( 0/ 4): Total exploration time 6.850 sec (6.850 sec minimum, 6.850 sec on average)
pnml2lts-mc( 0/ 4): States per second: 262960, Transitions per second: 1300588
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 26.2MB, 15.3 B/state, compr.: 3.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 5.0%/19.0%
pnml2lts-mc( 0/ 4): Stored 109 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 26.2MB (~256.0MB paged-in)
ltl formula name HirschbergSinclair-PT-05-LTLFireability-02
ltl formula formula --ltl=/tmp/2245/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 117 places, 109 transitions and 328 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2245/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2245/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2245/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2245/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 119 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 118, there are 117 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~106!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6349
pnml2lts-mc( 0/ 4): unique states count: 6557
pnml2lts-mc( 0/ 4): unique transitions count: 13347
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 6166
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6560
pnml2lts-mc( 0/ 4): - cum. max stack depth: 253
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6560 states 13381 transitions, fanout: 2.040
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 109333, Transitions per second: 223017
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 18.8 B/state, compr.: 4.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 109 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name HirschbergSinclair-PT-05-LTLFireability-03
ltl formula formula --ltl=/tmp/2245/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 117 places, 109 transitions and 328 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2245/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2245/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2245/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2245/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 119 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 118, there are 116 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~45 levels ~10000 states ~20972 transitions
pnml2lts-mc( 0/ 4): ~45 levels ~20000 states ~45152 transitions
pnml2lts-mc( 0/ 4): ~45 levels ~40000 states ~104964 transitions
pnml2lts-mc( 1/ 4): ~45 levels ~80000 states ~215700 transitions
pnml2lts-mc( 0/ 4): ~45 levels ~160000 states ~465380 transitions
pnml2lts-mc( 0/ 4): ~45 levels ~320000 states ~1098176 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 482443
pnml2lts-mc( 0/ 4): unique states count: 482443
pnml2lts-mc( 0/ 4): unique transitions count: 2045704
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1563535
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 482663
pnml2lts-mc( 0/ 4): - cum. max stack depth: 181
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 482663 states 2047013 transitions, fanout: 4.241
pnml2lts-mc( 0/ 4): Total exploration time 2.510 sec (2.510 sec minimum, 2.510 sec on average)
pnml2lts-mc( 0/ 4): States per second: 192296, Transitions per second: 815543
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 9.7MB, 21.0 B/state, compr.: 4.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 1.0%/9.0%
pnml2lts-mc( 0/ 4): Stored 109 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 9.7MB (~256.0MB paged-in)
ltl formula name HirschbergSinclair-PT-05-LTLFireability-07
ltl formula formula --ltl=/tmp/2245/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 117 places, 109 transitions and 328 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2245/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2245/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2245/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2245/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 119 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 118, there are 111 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~40 levels ~10000 states ~21292 transitions
pnml2lts-mc( 0/ 4): ~40 levels ~20000 states ~43636 transitions
pnml2lts-mc( 0/ 4): ~40 levels ~40000 states ~94436 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 52727
pnml2lts-mc( 0/ 4): unique states count: 52727
pnml2lts-mc( 0/ 4): unique transitions count: 124976
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 77063
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 55003
pnml2lts-mc( 0/ 4): - cum. max stack depth: 156
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 55003 states 137852 transitions, fanout: 2.506
pnml2lts-mc( 0/ 4): Total exploration time 0.380 sec (0.380 sec minimum, 0.380 sec on average)
pnml2lts-mc( 0/ 4): States per second: 144745, Transitions per second: 362768
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.0MB, 20.2 B/state, compr.: 4.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 109 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is HirschbergSinclair-PT-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 r500-smll-171649587400060"
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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;