Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 9.7K Feb 26 02:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 02:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 02:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 26 02:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 02:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 02:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 02:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 321K Mar 5 18:22 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-25-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678716570739

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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-25
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 14:09:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 14:09:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 14:09:33] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2023-03-13 14:09:33] [INFO ] Transformed 600 places.
[2023-03-13 14:09:33] [INFO ] Transformed 545 transitions.
[2023-03-13 14:09:33] [INFO ] Parsed PT model containing 600 places and 545 transitions and 1664 arcs in 290 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HirschbergSinclair-PT-25-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 545/545 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 575 transition count 545
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 48 place count 552 transition count 522
Iterating global reduction 1 with 23 rules applied. Total rules applied 71 place count 552 transition count 522
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 91 place count 532 transition count 502
Iterating global reduction 1 with 20 rules applied. Total rules applied 111 place count 532 transition count 502
Applied a total of 111 rules in 177 ms. Remains 532 /600 variables (removed 68) and now considering 502/545 (removed 43) transitions.
// Phase 1: matrix 502 rows 532 cols
[2023-03-13 14:09:34] [INFO ] Computed 30 place invariants in 40 ms
[2023-03-13 14:09:35] [INFO ] Implicit Places using invariants in 757 ms returned []
[2023-03-13 14:09:35] [INFO ] Invariant cache hit.
[2023-03-13 14:09:36] [INFO ] Implicit Places using invariants and state equation in 1813 ms returned []
Implicit Place search using SMT with State Equation took 2633 ms to find 0 implicit places.
[2023-03-13 14:09:36] [INFO ] Invariant cache hit.
[2023-03-13 14:09:37] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/600 places, 502/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3417 ms. Remains : 532/600 places, 502/545 transitions.
Support contains 50 out of 532 places after structural reductions.
[2023-03-13 14:09:37] [INFO ] Flatten gal took : 119 ms
[2023-03-13 14:09:38] [INFO ] Flatten gal took : 69 ms
[2023-03-13 14:09:38] [INFO ] Input system was already deterministic with 502 transitions.
Support contains 49 out of 532 places (down from 50) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 30) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-13 14:09:38] [INFO ] Invariant cache hit.
[2023-03-13 14:09:39] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 84 ms returned sat
[2023-03-13 14:09:39] [INFO ] After 623ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA HirschbergSinclair-PT-25-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 532 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 532 transition count 502
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 5 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 527 transition count 497
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 527 transition count 497
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 525 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 525 transition count 495
Applied a total of 14 rules in 97 ms. Remains 525 /532 variables (removed 7) and now considering 495/502 (removed 7) transitions.
// Phase 1: matrix 495 rows 525 cols
[2023-03-13 14:09:40] [INFO ] Computed 30 place invariants in 6 ms
[2023-03-13 14:09:40] [INFO ] Implicit Places using invariants in 466 ms returned []
[2023-03-13 14:09:40] [INFO ] Invariant cache hit.
[2023-03-13 14:09:42] [INFO ] Implicit Places using invariants and state equation in 1917 ms returned []
Implicit Place search using SMT with State Equation took 2387 ms to find 0 implicit places.
[2023-03-13 14:09:42] [INFO ] Invariant cache hit.
[2023-03-13 14:09:43] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/532 places, 495/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3093 ms. Remains : 525/532 places, 495/502 transitions.
Stuttering acceptance computed with spot in 309 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s9 1) (LT s519 1) (AND (GEQ s459 1) (OR (LT s23 1) (LT s375 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 531 steps with 0 reset in 18 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-00 finished in 3501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U (p2||X(p0))))'
Support contains 5 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 528 transition count 498
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 528 transition count 498
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 526 transition count 496
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 526 transition count 496
Applied a total of 12 rules in 72 ms. Remains 526 /532 variables (removed 6) and now considering 496/502 (removed 6) transitions.
// Phase 1: matrix 496 rows 526 cols
[2023-03-13 14:09:43] [INFO ] Computed 30 place invariants in 17 ms
[2023-03-13 14:09:43] [INFO ] Implicit Places using invariants in 445 ms returned []
[2023-03-13 14:09:43] [INFO ] Invariant cache hit.
[2023-03-13 14:09:45] [INFO ] Implicit Places using invariants and state equation in 2043 ms returned []
Implicit Place search using SMT with State Equation took 2500 ms to find 0 implicit places.
[2023-03-13 14:09:45] [INFO ] Invariant cache hit.
[2023-03-13 14:09:46] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 526/532 places, 496/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3133 ms. Remains : 526/532 places, 496/502 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s478 1), p0:(AND (GEQ s41 1) (GEQ s132 1)), p1:(AND (GEQ s1 1) (GEQ s268 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 355 reset in 490 ms.
Product exploration explored 100000 steps with 355 reset in 484 ms.
Computed a total of 526 stabilizing places and 496 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 526 transition count 496
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 p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 560 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Finished random walk after 286 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 11 factoid took 657 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 246 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
[2023-03-13 14:09:49] [INFO ] Invariant cache hit.
[2023-03-13 14:09:50] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 103 ms returned sat
[2023-03-13 14:09:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:09:55] [INFO ] [Real]Absence check using state equation in 5141 ms returned sat
[2023-03-13 14:09:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:09:56] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 131 ms returned sat
[2023-03-13 14:09:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:09:59] [INFO ] [Nat]Absence check using state equation in 3017 ms returned sat
[2023-03-13 14:09:59] [INFO ] Computed and/alt/rep : 253/483/253 causal constraints (skipped 218 transitions) in 52 ms.
[2023-03-13 14:10:02] [INFO ] Added : 207 causal constraints over 42 iterations in 3342 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2023-03-13 14:10:02] [INFO ] Invariant cache hit.
[2023-03-13 14:10:03] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 128 ms returned sat
[2023-03-13 14:10:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:10:11] [INFO ] [Real]Absence check using state equation in 8846 ms returned sat
[2023-03-13 14:10:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:10:12] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 190 ms returned sat
[2023-03-13 14:10:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:10:16] [INFO ] [Nat]Absence check using state equation in 4384 ms returned sat
[2023-03-13 14:10:17] [INFO ] Computed and/alt/rep : 253/483/253 causal constraints (skipped 218 transitions) in 48 ms.
[2023-03-13 14:10:25] [INFO ] Added : 186 causal constraints over 38 iterations in 8896 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 5 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 496/496 transitions.
Applied a total of 0 rules in 15 ms. Remains 526 /526 variables (removed 0) and now considering 496/496 (removed 0) transitions.
[2023-03-13 14:10:25] [INFO ] Invariant cache hit.
[2023-03-13 14:10:26] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-13 14:10:26] [INFO ] Invariant cache hit.
[2023-03-13 14:10:28] [INFO ] Implicit Places using invariants and state equation in 2027 ms returned []
Implicit Place search using SMT with State Equation took 2409 ms to find 0 implicit places.
[2023-03-13 14:10:28] [INFO ] Invariant cache hit.
[2023-03-13 14:10:28] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2913 ms. Remains : 526/526 places, 496/496 transitions.
Computed a total of 526 stabilizing places and 496 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 526 transition count 496
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) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 554 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Finished random walk after 278 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 11 factoid took 708 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
[2023-03-13 14:10:30] [INFO ] Invariant cache hit.
[2023-03-13 14:10:31] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 103 ms returned sat
[2023-03-13 14:10:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:10:36] [INFO ] [Real]Absence check using state equation in 5157 ms returned sat
[2023-03-13 14:10:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:10:37] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 129 ms returned sat
[2023-03-13 14:10:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:10:40] [INFO ] [Nat]Absence check using state equation in 2967 ms returned sat
[2023-03-13 14:10:40] [INFO ] Computed and/alt/rep : 253/483/253 causal constraints (skipped 218 transitions) in 50 ms.
[2023-03-13 14:10:43] [INFO ] Added : 207 causal constraints over 42 iterations in 3099 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2023-03-13 14:10:43] [INFO ] Invariant cache hit.
[2023-03-13 14:10:43] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 128 ms returned sat
[2023-03-13 14:10:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:10:52] [INFO ] [Real]Absence check using state equation in 8782 ms returned sat
[2023-03-13 14:10:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:10:53] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 148 ms returned sat
[2023-03-13 14:10:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:10:57] [INFO ] [Nat]Absence check using state equation in 4273 ms returned sat
[2023-03-13 14:10:57] [INFO ] Computed and/alt/rep : 253/483/253 causal constraints (skipped 218 transitions) in 45 ms.
[2023-03-13 14:11:06] [INFO ] Added : 186 causal constraints over 38 iterations in 8861 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 354 reset in 293 ms.
Product exploration explored 100000 steps with 355 reset in 340 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Support contains 5 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 496/496 transitions.
Performed 196 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 526 transition count 496
Deduced a syphon composed of 196 places in 2 ms
Applied a total of 196 rules in 82 ms. Remains 526 /526 variables (removed 0) and now considering 496/496 (removed 0) transitions.
[2023-03-13 14:11:07] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 496 rows 526 cols
[2023-03-13 14:11:07] [INFO ] Computed 30 place invariants in 4 ms
[2023-03-13 14:11:08] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 526/526 places, 496/496 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 674 ms. Remains : 526/526 places, 496/496 transitions.
Support contains 5 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 496/496 transitions.
Applied a total of 0 rules in 20 ms. Remains 526 /526 variables (removed 0) and now considering 496/496 (removed 0) transitions.
// Phase 1: matrix 496 rows 526 cols
[2023-03-13 14:11:08] [INFO ] Computed 30 place invariants in 5 ms
[2023-03-13 14:11:08] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-13 14:11:08] [INFO ] Invariant cache hit.
[2023-03-13 14:11:10] [INFO ] Implicit Places using invariants and state equation in 2066 ms returned []
Implicit Place search using SMT with State Equation took 2467 ms to find 0 implicit places.
[2023-03-13 14:11:10] [INFO ] Invariant cache hit.
[2023-03-13 14:11:11] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3067 ms. Remains : 526/526 places, 496/496 transitions.
Treatment of property HirschbergSinclair-PT-25-LTLFireability-01 finished in 88030 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 508 transition count 266
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 296 transition count 266
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 429 place count 291 transition count 261
Iterating global reduction 2 with 5 rules applied. Total rules applied 434 place count 291 transition count 261
Drop transitions 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 436 place count 291 transition count 259
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 438 place count 289 transition count 259
Applied a total of 438 rules in 68 ms. Remains 289 /532 variables (removed 243) and now considering 259/502 (removed 243) transitions.
// Phase 1: matrix 259 rows 289 cols
[2023-03-13 14:11:11] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-13 14:11:11] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-13 14:11:11] [INFO ] Invariant cache hit.
[2023-03-13 14:11:12] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 1023 ms to find 0 implicit places.
[2023-03-13 14:11:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 14:11:12] [INFO ] Invariant cache hit.
[2023-03-13 14:11:12] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/532 places, 259/502 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1387 ms. Remains : 289/532 places, 259/502 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s278 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 365 reset in 212 ms.
Product exploration explored 100000 steps with 365 reset in 370 ms.
Computed a total of 289 stabilizing places and 259 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 289 transition count 259
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 150 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 37 ms :[(NOT p0)]
Finished random walk after 284 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=94 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 234 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2023-03-13 14:11:14] [INFO ] Invariant cache hit.
[2023-03-13 14:11:14] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 57 ms returned sat
[2023-03-13 14:11:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:11:16] [INFO ] [Real]Absence check using state equation in 2252 ms returned sat
[2023-03-13 14:11:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:11:16] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 90 ms returned sat
[2023-03-13 14:11:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:11:17] [INFO ] [Nat]Absence check using state equation in 791 ms returned sat
[2023-03-13 14:11:17] [INFO ] Computed and/alt/rep : 206/229/206 causal constraints (skipped 7 transitions) in 15 ms.
[2023-03-13 14:11:19] [INFO ] Added : 186 causal constraints over 38 iterations in 1780 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 259/259 transitions.
Applied a total of 0 rules in 18 ms. Remains 289 /289 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2023-03-13 14:11:19] [INFO ] Invariant cache hit.
[2023-03-13 14:11:19] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-13 14:11:19] [INFO ] Invariant cache hit.
[2023-03-13 14:11:20] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
[2023-03-13 14:11:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 14:11:20] [INFO ] Invariant cache hit.
[2023-03-13 14:11:20] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1387 ms. Remains : 289/289 places, 259/259 transitions.
Computed a total of 289 stabilizing places and 259 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 289 transition count 259
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 287 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=143 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 165 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-13 14:11:21] [INFO ] Invariant cache hit.
[2023-03-13 14:11:21] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 58 ms returned sat
[2023-03-13 14:11:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:11:24] [INFO ] [Real]Absence check using state equation in 2212 ms returned sat
[2023-03-13 14:11:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:11:24] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 92 ms returned sat
[2023-03-13 14:11:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:11:25] [INFO ] [Nat]Absence check using state equation in 794 ms returned sat
[2023-03-13 14:11:25] [INFO ] Computed and/alt/rep : 206/229/206 causal constraints (skipped 7 transitions) in 21 ms.
[2023-03-13 14:11:27] [INFO ] Added : 186 causal constraints over 38 iterations in 1820 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 366 reset in 211 ms.
Product exploration explored 100000 steps with 365 reset in 254 ms.
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 259/259 transitions.
Applied a total of 0 rules in 15 ms. Remains 289 /289 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2023-03-13 14:11:27] [INFO ] Invariant cache hit.
[2023-03-13 14:11:27] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-13 14:11:27] [INFO ] Invariant cache hit.
[2023-03-13 14:11:28] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
[2023-03-13 14:11:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 14:11:28] [INFO ] Invariant cache hit.
[2023-03-13 14:11:29] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1504 ms. Remains : 289/289 places, 259/259 transitions.
Treatment of property HirschbergSinclair-PT-25-LTLFireability-02 finished in 17680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(p1)))))'
Support contains 5 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 527 transition count 497
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 527 transition count 497
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 525 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 525 transition count 495
Applied a total of 14 rules in 94 ms. Remains 525 /532 variables (removed 7) and now considering 495/502 (removed 7) transitions.
// Phase 1: matrix 495 rows 525 cols
[2023-03-13 14:11:29] [INFO ] Computed 30 place invariants in 7 ms
[2023-03-13 14:11:29] [INFO ] Implicit Places using invariants in 587 ms returned []
[2023-03-13 14:11:29] [INFO ] Invariant cache hit.
[2023-03-13 14:11:31] [INFO ] Implicit Places using invariants and state equation in 1968 ms returned []
Implicit Place search using SMT with State Equation took 2559 ms to find 0 implicit places.
[2023-03-13 14:11:31] [INFO ] Invariant cache hit.
[2023-03-13 14:11:32] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/532 places, 495/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3232 ms. Remains : 525/532 places, 495/502 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s15 1) (LT s82 1) (AND (GEQ s1 1) (GEQ s163 1))), p1:(LT s405 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-03 finished in 3398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F((G(p1)||G(!p1)))&&p0))))'
Support contains 4 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 527 transition count 497
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 527 transition count 497
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 526 transition count 496
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 526 transition count 496
Applied a total of 12 rules in 75 ms. Remains 526 /532 variables (removed 6) and now considering 496/502 (removed 6) transitions.
// Phase 1: matrix 496 rows 526 cols
[2023-03-13 14:11:32] [INFO ] Computed 30 place invariants in 5 ms
[2023-03-13 14:11:33] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-13 14:11:33] [INFO ] Invariant cache hit.
[2023-03-13 14:11:34] [INFO ] Implicit Places using invariants and state equation in 1786 ms returned []
Implicit Place search using SMT with State Equation took 2269 ms to find 0 implicit places.
[2023-03-13 14:11:34] [INFO ] Invariant cache hit.
[2023-03-13 14:11:35] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 526/532 places, 496/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2900 ms. Remains : 526/532 places, 496/502 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), false, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={1} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s49 1) (GEQ s500 1)), p1:(OR (LT s21 1) (LT s94 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 5345 steps with 9 reset in 25 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-04 finished in 3103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(X(p0) U X(p1))||(G(!p0)&&X(p2)))))'
Support contains 4 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 530 transition count 500
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 530 transition count 500
Applied a total of 4 rules in 33 ms. Remains 530 /532 variables (removed 2) and now considering 500/502 (removed 2) transitions.
// Phase 1: matrix 500 rows 530 cols
[2023-03-13 14:11:35] [INFO ] Computed 30 place invariants in 4 ms
[2023-03-13 14:11:36] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-13 14:11:36] [INFO ] Invariant cache hit.
[2023-03-13 14:11:37] [INFO ] Implicit Places using invariants and state equation in 1909 ms returned []
Implicit Place search using SMT with State Equation took 2288 ms to find 0 implicit places.
[2023-03-13 14:11:37] [INFO ] Invariant cache hit.
[2023-03-13 14:11:38] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 530/532 places, 500/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2831 ms. Remains : 530/532 places, 500/502 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (AND p1 (NOT p2)) (AND p0 p1)), (AND p0 p1), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 p1))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s504 1), p1:(GEQ s77 1), p2:(OR (LT s19 1) (LT s90 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 617 ms.
Product exploration explored 100000 steps with 50000 reset in 622 ms.
Computed a total of 530 stabilizing places and 500 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 530 transition count 500
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) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 16 factoid took 463 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-25-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLFireability-05 finished in 4931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 527 transition count 497
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 527 transition count 497
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 525 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 525 transition count 495
Applied a total of 14 rules in 46 ms. Remains 525 /532 variables (removed 7) and now considering 495/502 (removed 7) transitions.
// Phase 1: matrix 495 rows 525 cols
[2023-03-13 14:11:40] [INFO ] Computed 30 place invariants in 4 ms
[2023-03-13 14:11:40] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-13 14:11:40] [INFO ] Invariant cache hit.
[2023-03-13 14:11:42] [INFO ] Implicit Places using invariants and state equation in 2004 ms returned []
Implicit Place search using SMT with State Equation took 2376 ms to find 0 implicit places.
[2023-03-13 14:11:42] [INFO ] Invariant cache hit.
[2023-03-13 14:11:43] [INFO ] Dead Transitions using invariants and state equation in 557 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/532 places, 495/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2980 ms. Remains : 525/532 places, 495/502 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s29 1) (GEQ s480 1)), p0:(GEQ s400 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 209 reset in 355 ms.
Product exploration explored 100000 steps with 209 reset in 286 ms.
Computed a total of 525 stabilizing places and 495 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 525 transition count 495
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 p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 405 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Finished random walk after 474 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=118 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 355 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
[2023-03-13 14:11:45] [INFO ] Invariant cache hit.
[2023-03-13 14:11:45] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 141 ms returned sat
[2023-03-13 14:11:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:11:56] [INFO ] [Real]Absence check using state equation in 10345 ms returned sat
[2023-03-13 14:11:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:11:56] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 136 ms returned sat
[2023-03-13 14:11:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:12:00] [INFO ] [Nat]Absence check using state equation in 3558 ms returned sat
[2023-03-13 14:12:00] [INFO ] Computed and/alt/rep : 253/482/253 causal constraints (skipped 217 transitions) in 33 ms.
[2023-03-13 14:12:09] [INFO ] Added : 219 causal constraints over 44 iterations in 9160 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 525 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 : 525/525 places, 495/495 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 501 transition count 261
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 291 transition count 261
Applied a total of 420 rules in 23 ms. Remains 291 /525 variables (removed 234) and now considering 261/495 (removed 234) transitions.
// Phase 1: matrix 261 rows 291 cols
[2023-03-13 14:12:09] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-13 14:12:10] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-13 14:12:10] [INFO ] Invariant cache hit.
[2023-03-13 14:12:10] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1160 ms to find 0 implicit places.
[2023-03-13 14:12:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 14:12:10] [INFO ] Invariant cache hit.
[2023-03-13 14:12:11] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 291/525 places, 261/495 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1474 ms. Remains : 291/525 places, 261/495 transitions.
Computed a total of 291 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 291 transition count 261
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 (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 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 37 ms :[(NOT p1)]
Finished random walk after 251 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=125 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 168 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 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
[2023-03-13 14:12:11] [INFO ] Invariant cache hit.
[2023-03-13 14:12:12] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 59 ms returned sat
[2023-03-13 14:12:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:12:13] [INFO ] [Real]Absence check using state equation in 1402 ms returned sat
[2023-03-13 14:12:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:12:13] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 63 ms returned sat
[2023-03-13 14:12:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:12:14] [INFO ] [Nat]Absence check using state equation in 1125 ms returned sat
[2023-03-13 14:12:14] [INFO ] Computed and/alt/rep : 208/231/208 causal constraints (skipped 7 transitions) in 16 ms.
[2023-03-13 14:12:16] [INFO ] Added : 157 causal constraints over 32 iterations in 1216 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering criterion allowed to conclude after 18289 steps with 75 reset in 41 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-06 finished in 35731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((((X(p1) U p2)&&X(!p1))||p0))))'
Support contains 6 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 527 transition count 497
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 527 transition count 497
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 525 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 525 transition count 495
Applied a total of 14 rules in 49 ms. Remains 525 /532 variables (removed 7) and now considering 495/502 (removed 7) transitions.
// Phase 1: matrix 495 rows 525 cols
[2023-03-13 14:12:16] [INFO ] Computed 30 place invariants in 4 ms
[2023-03-13 14:12:16] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-13 14:12:16] [INFO ] Invariant cache hit.
[2023-03-13 14:12:18] [INFO ] Implicit Places using invariants and state equation in 1999 ms returned []
Implicit Place search using SMT with State Equation took 2397 ms to find 0 implicit places.
[2023-03-13 14:12:18] [INFO ] Invariant cache hit.
[2023-03-13 14:12:19] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/532 places, 495/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3032 ms. Remains : 525/532 places, 495/502 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s148 1) (LT s153 1)), p2:(AND (GEQ s336 1) (GEQ s401 1)), p1:(AND (GEQ s35 1) (GEQ s222 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 685 ms.
Product exploration explored 100000 steps with 50000 reset in 547 ms.
Computed a total of 525 stabilizing places and 495 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 525 transition count 495
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 p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 10 factoid took 228 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-25-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLFireability-07 finished in 4828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 527 transition count 497
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 527 transition count 497
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 525 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 525 transition count 495
Applied a total of 14 rules in 49 ms. Remains 525 /532 variables (removed 7) and now considering 495/502 (removed 7) transitions.
[2023-03-13 14:12:21] [INFO ] Invariant cache hit.
[2023-03-13 14:12:21] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-13 14:12:21] [INFO ] Invariant cache hit.
[2023-03-13 14:12:23] [INFO ] Implicit Places using invariants and state equation in 2064 ms returned []
Implicit Place search using SMT with State Equation took 2497 ms to find 0 implicit places.
[2023-03-13 14:12:23] [INFO ] Invariant cache hit.
[2023-03-13 14:12:24] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/532 places, 495/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3149 ms. Remains : 525/532 places, 495/502 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s170 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-09 finished in 3249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 3 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 527 transition count 497
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 527 transition count 497
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 525 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 525 transition count 495
Applied a total of 14 rules in 52 ms. Remains 525 /532 variables (removed 7) and now considering 495/502 (removed 7) transitions.
[2023-03-13 14:12:24] [INFO ] Invariant cache hit.
[2023-03-13 14:12:24] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-03-13 14:12:24] [INFO ] Invariant cache hit.
[2023-03-13 14:12:26] [INFO ] Implicit Places using invariants and state equation in 2106 ms returned []
Implicit Place search using SMT with State Equation took 2559 ms to find 0 implicit places.
[2023-03-13 14:12:26] [INFO ] Invariant cache hit.
[2023-03-13 14:12:27] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/532 places, 495/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3168 ms. Remains : 525/532 places, 495/502 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s443 1), p1:(AND (GEQ s37 1) (GEQ s322 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-10 finished in 3313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 204 rules applied. Total rules applied 204 place count 508 transition count 274
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 1 with 204 rules applied. Total rules applied 408 place count 304 transition count 274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 413 place count 299 transition count 269
Iterating global reduction 2 with 5 rules applied. Total rules applied 418 place count 299 transition count 269
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 421 place count 299 transition count 266
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 424 place count 296 transition count 266
Applied a total of 424 rules in 37 ms. Remains 296 /532 variables (removed 236) and now considering 266/502 (removed 236) transitions.
// Phase 1: matrix 266 rows 296 cols
[2023-03-13 14:12:27] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-13 14:12:28] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-13 14:12:28] [INFO ] Invariant cache hit.
[2023-03-13 14:12:28] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1226 ms to find 0 implicit places.
[2023-03-13 14:12:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 14:12:28] [INFO ] Invariant cache hit.
[2023-03-13 14:12:29] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/532 places, 266/502 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1602 ms. Remains : 296/532 places, 266/502 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s32 1), p1:(AND (GEQ s25 1) (GEQ s244 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 376 reset in 234 ms.
Product exploration explored 100000 steps with 376 reset in 277 ms.
Computed a total of 296 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 296 transition count 266
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)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 297 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 9 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 338 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-13 14:12:30] [INFO ] Invariant cache hit.
[2023-03-13 14:12:31] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 65 ms returned sat
[2023-03-13 14:12:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:12:32] [INFO ] [Real]Absence check using state equation in 1820 ms returned sat
[2023-03-13 14:12:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:12:33] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 94 ms returned sat
[2023-03-13 14:12:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:12:35] [INFO ] [Nat]Absence check using state equation in 1730 ms returned sat
[2023-03-13 14:12:35] [INFO ] Computed and/alt/rep : 205/211/205 causal constraints (skipped 14 transitions) in 19 ms.
[2023-03-13 14:12:37] [INFO ] Added : 154 causal constraints over 31 iterations in 2805 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 266/266 transitions.
Applied a total of 0 rules in 14 ms. Remains 296 /296 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2023-03-13 14:12:37] [INFO ] Invariant cache hit.
[2023-03-13 14:12:38] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-13 14:12:38] [INFO ] Invariant cache hit.
[2023-03-13 14:12:39] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
[2023-03-13 14:12:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 14:12:39] [INFO ] Invariant cache hit.
[2023-03-13 14:12:39] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1598 ms. Remains : 296/296 places, 266/266 transitions.
Computed a total of 296 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 296 transition count 266
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)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 420 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 334 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-13 14:12:40] [INFO ] Invariant cache hit.
[2023-03-13 14:12:40] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 59 ms returned sat
[2023-03-13 14:12:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:12:42] [INFO ] [Real]Absence check using state equation in 1751 ms returned sat
[2023-03-13 14:12:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:12:43] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 91 ms returned sat
[2023-03-13 14:12:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:12:44] [INFO ] [Nat]Absence check using state equation in 1697 ms returned sat
[2023-03-13 14:12:44] [INFO ] Computed and/alt/rep : 205/211/205 causal constraints (skipped 14 transitions) in 18 ms.
[2023-03-13 14:12:47] [INFO ] Added : 154 causal constraints over 31 iterations in 2780 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 377 reset in 226 ms.
Product exploration explored 100000 steps with 376 reset in 271 ms.
Support contains 3 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 266/266 transitions.
Applied a total of 0 rules in 13 ms. Remains 296 /296 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2023-03-13 14:12:48] [INFO ] Invariant cache hit.
[2023-03-13 14:12:48] [INFO ] Implicit Places using invariants in 366 ms returned []
[2023-03-13 14:12:48] [INFO ] Invariant cache hit.
[2023-03-13 14:12:49] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
[2023-03-13 14:12:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 14:12:49] [INFO ] Invariant cache hit.
[2023-03-13 14:12:49] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1463 ms. Remains : 296/296 places, 266/266 transitions.
Treatment of property HirschbergSinclair-PT-25-LTLFireability-11 finished in 21950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(p1) U X(p0))))'
Support contains 3 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 528 transition count 498
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 528 transition count 498
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 526 transition count 496
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 526 transition count 496
Applied a total of 12 rules in 47 ms. Remains 526 /532 variables (removed 6) and now considering 496/502 (removed 6) transitions.
// Phase 1: matrix 496 rows 526 cols
[2023-03-13 14:12:49] [INFO ] Computed 30 place invariants in 3 ms
[2023-03-13 14:12:50] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-13 14:12:50] [INFO ] Invariant cache hit.
[2023-03-13 14:12:52] [INFO ] Implicit Places using invariants and state equation in 2069 ms returned []
Implicit Place search using SMT with State Equation took 2487 ms to find 0 implicit places.
[2023-03-13 14:12:52] [INFO ] Invariant cache hit.
[2023-03-13 14:12:52] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 526/532 places, 496/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3107 ms. Remains : 526/532 places, 496/502 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s359 1), p0:(AND (GEQ s21 1) (GEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2589 reset in 413 ms.
Product exploration explored 100000 steps with 2601 reset in 468 ms.
Computed a total of 526 stabilizing places and 496 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 526 transition count 496
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 (AND p1 (NOT p0)))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 414 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 114 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 9 factoid took 431 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-13 14:12:54] [INFO ] Invariant cache hit.
[2023-03-13 14:12:55] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 100 ms returned sat
[2023-03-13 14:12:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:13:10] [INFO ] [Real]Absence check using state equation in 14451 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 526 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 : 526/526 places, 496/496 transitions.
Reduce places removed 23 places and 23 transitions.
Drop transitions removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 503 transition count 261
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 291 transition count 261
Applied a total of 424 rules in 23 ms. Remains 291 /526 variables (removed 235) and now considering 261/496 (removed 235) transitions.
// Phase 1: matrix 261 rows 291 cols
[2023-03-13 14:13:10] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-13 14:13:10] [INFO ] Implicit Places using invariants in 366 ms returned []
[2023-03-13 14:13:10] [INFO ] Invariant cache hit.
[2023-03-13 14:13:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 14:13:11] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1415 ms to find 0 implicit places.
[2023-03-13 14:13:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 14:13:11] [INFO ] Invariant cache hit.
[2023-03-13 14:13:11] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 291/526 places, 261/496 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1733 ms. Remains : 291/526 places, 261/496 transitions.
Computed a total of 291 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 291 transition count 261
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 154 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 38 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
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 176 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-13 14:13:12] [INFO ] Invariant cache hit.
[2023-03-13 14:13:12] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 58 ms returned sat
[2023-03-13 14:13:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:13:14] [INFO ] [Real]Absence check using state equation in 1874 ms returned sat
[2023-03-13 14:13:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:13:14] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 65 ms returned sat
[2023-03-13 14:13:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:13:15] [INFO ] [Nat]Absence check using state equation in 854 ms returned sat
[2023-03-13 14:13:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 14:13:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2023-03-13 14:13:15] [INFO ] Computed and/alt/rep : 207/231/207 causal constraints (skipped 9 transitions) in 17 ms.
[2023-03-13 14:13:16] [INFO ] Added : 96 causal constraints over 20 iterations in 901 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 2378 reset in 456 ms.
Product exploration explored 100000 steps with 2428 reset in 527 ms.
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 261/261 transitions.
Applied a total of 0 rules in 10 ms. Remains 291 /291 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-13 14:13:17] [INFO ] Invariant cache hit.
[2023-03-13 14:13:18] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-13 14:13:18] [INFO ] Invariant cache hit.
[2023-03-13 14:13:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 14:13:19] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 1412 ms to find 0 implicit places.
[2023-03-13 14:13:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-13 14:13:19] [INFO ] Invariant cache hit.
[2023-03-13 14:13:19] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1704 ms. Remains : 291/291 places, 261/261 transitions.
Treatment of property HirschbergSinclair-PT-25-LTLFireability-14 finished in 29803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(((X(F(p1))&&G(!p0))||G(F(p1)))))))'
Support contains 3 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 204 rules applied. Total rules applied 204 place count 508 transition count 274
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 1 with 204 rules applied. Total rules applied 408 place count 304 transition count 274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 413 place count 299 transition count 269
Iterating global reduction 2 with 5 rules applied. Total rules applied 418 place count 299 transition count 269
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 421 place count 299 transition count 266
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 424 place count 296 transition count 266
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 425 place count 295 transition count 265
Iterating global reduction 4 with 1 rules applied. Total rules applied 426 place count 295 transition count 265
Applied a total of 426 rules in 36 ms. Remains 295 /532 variables (removed 237) and now considering 265/502 (removed 237) transitions.
// Phase 1: matrix 265 rows 295 cols
[2023-03-13 14:13:19] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-13 14:13:19] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-13 14:13:19] [INFO ] Invariant cache hit.
[2023-03-13 14:13:20] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1186 ms to find 0 implicit places.
[2023-03-13 14:13:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 14:13:20] [INFO ] Invariant cache hit.
[2023-03-13 14:13:20] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 295/532 places, 265/502 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1576 ms. Remains : 295/532 places, 265/502 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s25 1) (GEQ s86 1)), p1:(LT s224 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1121 reset in 471 ms.
Product exploration explored 100000 steps with 1121 reset in 410 ms.
Computed a total of 295 stabilizing places and 265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 295 transition count 265
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 268 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 281 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2023-03-13 14:13:22] [INFO ] Invariant cache hit.
[2023-03-13 14:13:23] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 72 ms returned sat
[2023-03-13 14:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:13:23] [INFO ] [Real]Absence check using state equation in 622 ms returned sat
[2023-03-13 14:13:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:13:24] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 87 ms returned sat
[2023-03-13 14:13:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:13:24] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2023-03-13 14:13:24] [INFO ] Computed and/alt/rep : 205/210/205 causal constraints (skipped 13 transitions) in 17 ms.
[2023-03-13 14:13:25] [INFO ] Added : 13 causal constraints over 3 iterations in 140 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 295 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 : 295/295 places, 265/265 transitions.
Applied a total of 0 rules in 9 ms. Remains 295 /295 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2023-03-13 14:13:25] [INFO ] Invariant cache hit.
[2023-03-13 14:13:25] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-03-13 14:13:25] [INFO ] Invariant cache hit.
[2023-03-13 14:13:26] [INFO ] Implicit Places using invariants and state equation in 842 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
[2023-03-13 14:13:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 14:13:26] [INFO ] Invariant cache hit.
[2023-03-13 14:13:26] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1590 ms. Remains : 295/295 places, 265/265 transitions.
Computed a total of 295 stabilizing places and 265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 295 transition count 265
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 99 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=99 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 261 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2023-03-13 14:13:27] [INFO ] Invariant cache hit.
[2023-03-13 14:13:27] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 74 ms returned sat
[2023-03-13 14:13:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:13:28] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2023-03-13 14:13:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:13:28] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 86 ms returned sat
[2023-03-13 14:13:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:13:29] [INFO ] [Nat]Absence check using state equation in 648 ms returned sat
[2023-03-13 14:13:29] [INFO ] Computed and/alt/rep : 205/210/205 causal constraints (skipped 13 transitions) in 17 ms.
[2023-03-13 14:13:29] [INFO ] Added : 13 causal constraints over 3 iterations in 141 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1120 reset in 354 ms.
Product exploration explored 100000 steps with 1121 reset in 414 ms.
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 265/265 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 295 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 294 transition count 264
Applied a total of 2 rules in 18 ms. Remains 294 /295 variables (removed 1) and now considering 264/265 (removed 1) transitions.
// Phase 1: matrix 264 rows 294 cols
[2023-03-13 14:13:30] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-13 14:13:30] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-13 14:13:30] [INFO ] Invariant cache hit.
[2023-03-13 14:13:31] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
[2023-03-13 14:13:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 14:13:31] [INFO ] Invariant cache hit.
[2023-03-13 14:13:31] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 294/295 places, 264/265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1454 ms. Remains : 294/295 places, 264/265 transitions.
Treatment of property HirschbergSinclair-PT-25-LTLFireability-15 finished in 12499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U (p2||X(p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(p1) U X(p0))))'
Found a Shortening insensitive property : HirschbergSinclair-PT-25-LTLFireability-14
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Support contains 3 out of 532 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Reduce places removed 23 places and 23 transitions.
Drop transitions removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 509 transition count 267
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 297 transition count 267
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 428 place count 293 transition count 263
Iterating global reduction 2 with 4 rules applied. Total rules applied 432 place count 293 transition count 263
Drop transitions 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 434 place count 293 transition count 261
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 436 place count 291 transition count 261
Applied a total of 436 rules in 26 ms. Remains 291 /532 variables (removed 241) and now considering 261/502 (removed 241) transitions.
// Phase 1: matrix 261 rows 291 cols
[2023-03-13 14:13:32] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-13 14:13:32] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-13 14:13:32] [INFO ] Invariant cache hit.
[2023-03-13 14:13:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 14:13:33] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1423 ms to find 0 implicit places.
[2023-03-13 14:13:33] [INFO ] Invariant cache hit.
[2023-03-13 14:13:34] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 291/532 places, 261/502 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1733 ms. Remains : 291/532 places, 261/502 transitions.
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s191 1), p0:(AND (GEQ s12 1) (GEQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2399 reset in 469 ms.
Product exploration explored 100000 steps with 2387 reset in 528 ms.
Computed a total of 291 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 291 transition count 261
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 (AND p1 (NOT p0)))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 424 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 54 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 9 factoid took 441 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-13 14:13:36] [INFO ] Invariant cache hit.
[2023-03-13 14:13:36] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 60 ms returned sat
[2023-03-13 14:13:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:13:38] [INFO ] [Real]Absence check using state equation in 1874 ms returned sat
[2023-03-13 14:13:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:13:38] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 65 ms returned sat
[2023-03-13 14:13:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:13:39] [INFO ] [Nat]Absence check using state equation in 881 ms returned sat
[2023-03-13 14:13:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 14:13:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2023-03-13 14:13:39] [INFO ] Computed and/alt/rep : 207/231/207 causal constraints (skipped 9 transitions) in 17 ms.
[2023-03-13 14:13:40] [INFO ] Added : 96 causal constraints over 20 iterations in 889 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 291 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 : 291/291 places, 261/261 transitions.
Applied a total of 0 rules in 10 ms. Remains 291 /291 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-13 14:13:40] [INFO ] Invariant cache hit.
[2023-03-13 14:13:41] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-13 14:13:41] [INFO ] Invariant cache hit.
[2023-03-13 14:13:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 14:13:42] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 1378 ms to find 0 implicit places.
[2023-03-13 14:13:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 14:13:42] [INFO ] Invariant cache hit.
[2023-03-13 14:13:42] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1693 ms. Remains : 291/291 places, 261/261 transitions.
Computed a total of 291 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 291 transition count 261
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 206 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 113 ms :[(NOT p0)]
Finished random walk after 69 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
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 189 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-13 14:13:43] [INFO ] Invariant cache hit.
[2023-03-13 14:13:43] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 57 ms returned sat
[2023-03-13 14:13:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 14:13:45] [INFO ] [Real]Absence check using state equation in 1862 ms returned sat
[2023-03-13 14:13:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 14:13:45] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 64 ms returned sat
[2023-03-13 14:13:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 14:13:46] [INFO ] [Nat]Absence check using state equation in 857 ms returned sat
[2023-03-13 14:13:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 14:13:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2023-03-13 14:13:46] [INFO ] Computed and/alt/rep : 207/231/207 causal constraints (skipped 9 transitions) in 16 ms.
[2023-03-13 14:13:47] [INFO ] Added : 96 causal constraints over 20 iterations in 886 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2376 reset in 456 ms.
Product exploration explored 100000 steps with 2331 reset in 515 ms.
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 261/261 transitions.
Applied a total of 0 rules in 9 ms. Remains 291 /291 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-13 14:13:48] [INFO ] Invariant cache hit.
[2023-03-13 14:13:48] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-13 14:13:48] [INFO ] Invariant cache hit.
[2023-03-13 14:13:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 14:13:49] [INFO ] Implicit Places using invariants and state equation in 1015 ms returned []
Implicit Place search using SMT with State Equation took 1359 ms to find 0 implicit places.
[2023-03-13 14:13:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 14:13:49] [INFO ] Invariant cache hit.
[2023-03-13 14:13:50] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1656 ms. Remains : 291/291 places, 261/261 transitions.
Treatment of property HirschbergSinclair-PT-25-LTLFireability-14 finished in 17875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(((X(F(p1))&&G(!p0))||G(F(p1)))))))'
[2023-03-13 14:13:50] [INFO ] Flatten gal took : 38 ms
[2023-03-13 14:13:50] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-13 14:13:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 532 places, 502 transitions and 1510 arcs took 6 ms.
Total runtime 256860 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2354/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2354/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2354/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2354/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2354/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : HirschbergSinclair-PT-25-LTLFireability-01
Could not compute solution for formula : HirschbergSinclair-PT-25-LTLFireability-02
Could not compute solution for formula : HirschbergSinclair-PT-25-LTLFireability-11
Could not compute solution for formula : HirschbergSinclair-PT-25-LTLFireability-14
Could not compute solution for formula : HirschbergSinclair-PT-25-LTLFireability-15

BK_STOP 1678716833006

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name HirschbergSinclair-PT-25-LTLFireability-01
ltl formula formula --ltl=/tmp/2354/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 532 places, 502 transitions and 1510 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.150 real 0.020 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2354/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2354/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2354/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2354/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name HirschbergSinclair-PT-25-LTLFireability-02
ltl formula formula --ltl=/tmp/2354/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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
pnml2lts-mc( 0/ 4): Petri net has 532 places, 502 transitions and 1510 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
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.080 real 0.020 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2354/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2354/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2354/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2354/ltl_1_
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), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name HirschbergSinclair-PT-25-LTLFireability-11
ltl formula formula --ltl=/tmp/2354/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 532 places, 502 transitions and 1510 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.150 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2354/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2354/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2354/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2354/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name HirschbergSinclair-PT-25-LTLFireability-14
ltl formula formula --ltl=/tmp/2354/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 532 places, 502 transitions and 1510 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.060 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2354/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2354/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2354/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2354/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name HirschbergSinclair-PT-25-LTLFireability-15
ltl formula formula --ltl=/tmp/2354/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 532 places, 502 transitions and 1510 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.060 real 0.020 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2354/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2354/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2354/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2354/ltl_4_
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), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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-25"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is HirschbergSinclair-PT-25, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r201-smll-167840347800460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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