Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r114-smll-165264477500300.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r114-smll-165264477500300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 9.4K Apr 29 16:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 16:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 29 16:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 29 16:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 9 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 9 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 321K May 10 09:34 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 1652749426416

Running Version 202205111006
[2022-05-17 01:03:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 01:03:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 01:03:48] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2022-05-17 01:03:48] [INFO ] Transformed 600 places.
[2022-05-17 01:03:48] [INFO ] Transformed 545 transitions.
[2022-05-17 01:03:48] [INFO ] Parsed PT model containing 600 places and 545 transitions in 369 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HirschbergSinclair-PT-25-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 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 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 46 place count 554 transition count 524
Iterating global reduction 1 with 21 rules applied. Total rules applied 67 place count 554 transition count 524
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 88 place count 533 transition count 503
Iterating global reduction 1 with 21 rules applied. Total rules applied 109 place count 533 transition count 503
Applied a total of 109 rules in 190 ms. Remains 533 /600 variables (removed 67) and now considering 503/545 (removed 42) transitions.
// Phase 1: matrix 503 rows 533 cols
[2022-05-17 01:03:49] [INFO ] Computed 30 place invariants in 41 ms
[2022-05-17 01:03:50] [INFO ] Implicit Places using invariants in 985 ms returned []
// Phase 1: matrix 503 rows 533 cols
[2022-05-17 01:03:50] [INFO ] Computed 30 place invariants in 13 ms
[2022-05-17 01:03:52] [INFO ] Implicit Places using invariants and state equation in 2639 ms returned []
Implicit Place search using SMT with State Equation took 3669 ms to find 0 implicit places.
// Phase 1: matrix 503 rows 533 cols
[2022-05-17 01:03:52] [INFO ] Computed 30 place invariants in 8 ms
[2022-05-17 01:03:53] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 533/600 places, 503/545 transitions.
Finished structural reductions, in 1 iterations. Remains : 533/600 places, 503/545 transitions.
Support contains 43 out of 533 places after structural reductions.
[2022-05-17 01:03:54] [INFO ] Flatten gal took : 149 ms
[2022-05-17 01:03:54] [INFO ] Flatten gal took : 91 ms
[2022-05-17 01:03:54] [INFO ] Input system was already deterministic with 503 transitions.
Support contains 42 out of 533 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 32) seen :31
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 503 rows 533 cols
[2022-05-17 01:03:55] [INFO ] Computed 30 place invariants in 10 ms
[2022-05-17 01:03:55] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 88 ms returned sat
[2022-05-17 01:03:55] [INFO ] After 337ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 01:03:55] [INFO ] After 425ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-05-17 01:03:55] [INFO ] After 740ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 533 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 533/533 places, 503/503 transitions.
Graph (complete) has 1011 edges and 533 vertex of which 508 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.5 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 247 rules applied. Total rules applied 248 place count 508 transition count 256
Reduce places removed 222 places and 0 transitions.
Graph (complete) has 489 edges and 286 vertex of which 170 are kept as prefixes of interest. Removing 116 places using SCC suffix rule.2 ms
Discarding 116 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 223 rules applied. Total rules applied 471 place count 170 transition count 255
Drop transitions removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Iterating post reduction 2 with 114 rules applied. Total rules applied 585 place count 170 transition count 141
Reduce places removed 25 places and 25 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 610 place count 145 transition count 116
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 3 with 105 rules applied. Total rules applied 715 place count 122 transition count 34
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 4 with 82 rules applied. Total rules applied 797 place count 40 transition count 34
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 18 Pre rules applied. Total rules applied 797 place count 40 transition count 16
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 835 place count 20 transition count 16
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 838 place count 18 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 839 place count 17 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 839 place count 17 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 843 place count 15 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 845 place count 14 transition count 12
Applied a total of 845 rules in 90 ms. Remains 14 /533 variables (removed 519) and now considering 12/503 (removed 491) transitions.
Finished structural reductions, in 1 iterations. Remains : 14/533 places, 12/503 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
FORMULA HirschbergSinclair-PT-25-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 533 stabilizing places and 503 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 533 transition count 503
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X((G(p1) U (p0&&G(p1))))))))'
Support contains 3 out of 533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 533/533 places, 503/503 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 530 transition count 500
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 530 transition count 500
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 527 transition count 497
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 527 transition count 497
Applied a total of 12 rules in 112 ms. Remains 527 /533 variables (removed 6) and now considering 497/503 (removed 6) transitions.
// Phase 1: matrix 497 rows 527 cols
[2022-05-17 01:03:56] [INFO ] Computed 30 place invariants in 7 ms
[2022-05-17 01:03:57] [INFO ] Implicit Places using invariants in 621 ms returned []
// Phase 1: matrix 497 rows 527 cols
[2022-05-17 01:03:57] [INFO ] Computed 30 place invariants in 6 ms
[2022-05-17 01:03:59] [INFO ] Implicit Places using invariants and state equation in 2454 ms returned []
Implicit Place search using SMT with State Equation took 3084 ms to find 0 implicit places.
// Phase 1: matrix 497 rows 527 cols
[2022-05-17 01:03:59] [INFO ] Computed 30 place invariants in 8 ms
[2022-05-17 01:04:00] [INFO ] Dead Transitions using invariants and state equation in 761 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 527/533 places, 497/503 transitions.
Finished structural reductions, in 1 iterations. Remains : 527/533 places, 497/503 transitions.
Stuttering acceptance computed with spot in 502 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 0}, { cond=(NOT p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(AND (GEQ s9 1) (GEQ s391 1)), p0:(GEQ s69 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-00 finished in 4578 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||p1)))'
Support contains 4 out of 533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 533/533 places, 503/503 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 529 transition count 499
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 529 transition count 499
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 525 transition count 495
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 525 transition count 495
Applied a total of 16 rules in 91 ms. Remains 525 /533 variables (removed 8) and now considering 495/503 (removed 8) transitions.
// Phase 1: matrix 495 rows 525 cols
[2022-05-17 01:04:01] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-17 01:04:01] [INFO ] Implicit Places using invariants in 446 ms returned []
// Phase 1: matrix 495 rows 525 cols
[2022-05-17 01:04:01] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-17 01:04:03] [INFO ] Implicit Places using invariants and state equation in 2280 ms returned []
Implicit Place search using SMT with State Equation took 2728 ms to find 0 implicit places.
// Phase 1: matrix 495 rows 525 cols
[2022-05-17 01:04:03] [INFO ] Computed 30 place invariants in 4 ms
[2022-05-17 01:04:04] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/533 places, 495/503 transitions.
Finished structural reductions, in 1 iterations. Remains : 525/533 places, 495/503 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s13 1) (GEQ s78 1)), p0:(OR (LT s33 1) (LT s507 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 527 steps with 0 reset in 18 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-02 finished in 3405 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 1 out of 533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 533/533 places, 503/503 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 529 transition count 499
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 529 transition count 499
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 525 transition count 495
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 525 transition count 495
Applied a total of 16 rules in 53 ms. Remains 525 /533 variables (removed 8) and now considering 495/503 (removed 8) transitions.
// Phase 1: matrix 495 rows 525 cols
[2022-05-17 01:04:04] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-17 01:04:04] [INFO ] Implicit Places using invariants in 376 ms returned []
// Phase 1: matrix 495 rows 525 cols
[2022-05-17 01:04:04] [INFO ] Computed 30 place invariants in 10 ms
[2022-05-17 01:04:07] [INFO ] Implicit Places using invariants and state equation in 2407 ms returned []
Implicit Place search using SMT with State Equation took 2801 ms to find 0 implicit places.
// Phase 1: matrix 495 rows 525 cols
[2022-05-17 01:04:07] [INFO ] Computed 30 place invariants in 7 ms
[2022-05-17 01:04:08] [INFO ] Dead Transitions using invariants and state equation in 778 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/533 places, 495/503 transitions.
Finished structural reductions, in 1 iterations. Remains : 525/533 places, 495/503 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (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=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s143 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 2 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-03 finished in 3826 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(p0 U p1)&&X(G(F(G(p2)))))))'
Support contains 4 out of 533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 533/533 places, 503/503 transitions.
Reduce places removed 23 places and 23 transitions.
Drop transitions removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 510 transition count 269
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 299 transition count 269
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 425 place count 296 transition count 266
Iterating global reduction 2 with 3 rules applied. Total rules applied 428 place count 296 transition count 266
Applied a total of 428 rules in 72 ms. Remains 296 /533 variables (removed 237) and now considering 266/503 (removed 237) transitions.
// Phase 1: matrix 266 rows 296 cols
[2022-05-17 01:04:08] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-17 01:04:08] [INFO ] Implicit Places using invariants in 403 ms returned []
// Phase 1: matrix 266 rows 296 cols
[2022-05-17 01:04:08] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-17 01:04:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 01:04:09] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1293 ms to find 0 implicit places.
[2022-05-17 01:04:09] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 266 rows 296 cols
[2022-05-17 01:04:09] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-17 01:04:10] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/533 places, 266/503 transitions.
Finished structural reductions, in 1 iterations. Remains : 296/533 places, 266/503 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p2) p1), (NOT p2), p1]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(OR p0 p1), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s18 1), p1:(AND (GEQ s1 1) (GEQ s105 1)), p2:(GEQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 460 steps with 5 reset in 13 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-05 finished in 2147 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)&&X(p2)&&p0)))'
Support contains 5 out of 533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 533/533 places, 503/503 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 530 transition count 500
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 530 transition count 500
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 527 transition count 497
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 527 transition count 497
Applied a total of 12 rules in 84 ms. Remains 527 /533 variables (removed 6) and now considering 497/503 (removed 6) transitions.
// Phase 1: matrix 497 rows 527 cols
[2022-05-17 01:04:10] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-17 01:04:10] [INFO ] Implicit Places using invariants in 397 ms returned []
// Phase 1: matrix 497 rows 527 cols
[2022-05-17 01:04:11] [INFO ] Computed 30 place invariants in 6 ms
[2022-05-17 01:04:13] [INFO ] Implicit Places using invariants and state equation in 2109 ms returned []
Implicit Place search using SMT with State Equation took 2512 ms to find 0 implicit places.
// Phase 1: matrix 497 rows 527 cols
[2022-05-17 01:04:13] [INFO ] Computed 30 place invariants in 9 ms
[2022-05-17 01:04:13] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 527/533 places, 497/503 transitions.
Finished structural reductions, in 1 iterations. Remains : 527/533 places, 497/503 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s23 1) (GEQ s361 1)), p1:(GEQ s133 1), p2:(AND (GEQ s25 1) (GEQ s312 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 545 steps with 0 reset in 4 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-06 finished in 3503 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(F(p0)||p1) U G((p2 U G((F(p0)||p3))))))'
Support contains 5 out of 533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 533/533 places, 503/503 transitions.
Reduce places removed 23 places and 23 transitions.
Drop transitions removed 213 transitions
Trivial Post-agglo rules discarded 213 transitions
Performed 213 trivial Post agglomeration. Transition count delta: 213
Iterating post reduction 0 with 213 rules applied. Total rules applied 213 place count 510 transition count 267
Reduce places removed 213 places and 0 transitions.
Iterating post reduction 1 with 213 rules applied. Total rules applied 426 place count 297 transition count 267
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 430 place count 293 transition count 263
Iterating global reduction 2 with 4 rules applied. Total rules applied 434 place count 293 transition count 263
Applied a total of 434 rules in 40 ms. Remains 293 /533 variables (removed 240) and now considering 263/503 (removed 240) transitions.
// Phase 1: matrix 263 rows 293 cols
[2022-05-17 01:04:14] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-17 01:04:14] [INFO ] Implicit Places using invariants in 376 ms returned []
// Phase 1: matrix 263 rows 293 cols
[2022-05-17 01:04:14] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-17 01:04:14] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-17 01:04:15] [INFO ] Implicit Places using invariants and state equation in 1548 ms returned []
Implicit Place search using SMT with State Equation took 1926 ms to find 0 implicit places.
[2022-05-17 01:04:15] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 263 rows 293 cols
[2022-05-17 01:04:16] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-17 01:04:16] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 293/533 places, 263/503 transitions.
Finished structural reductions, in 1 iterations. Remains : 293/533 places, 263/503 transitions.
Stuttering acceptance computed with spot in 356 ms :[(AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), false, (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) (NOT p0) p2 p1), acceptance={} source=0 dest: 5}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={} source=0 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 5}, { cond=(AND p3 (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 7}], [{ cond=p0, acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p3 (NOT p0) p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(NOT p2), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=7 dest: 1}, { cond=(AND p3 (NOT p0)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s203 1)), p1:(GEQ s24 1), p3:(GEQ s248 1), p2:(GEQ s85 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 533 reset in 524 ms.
Product exploration explored 100000 steps with 534 reset in 600 ms.
Computed a total of 293 stabilizing places and 263 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 293 transition count 263
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 (NOT p3) (NOT p2)), (X (NOT (AND p3 (NOT p0) (NOT p1)))), (X (NOT p2)), (X (AND (NOT p3) (NOT p0))), (X (NOT (OR (AND p0 p2) (AND p2 p1)))), (X (AND (NOT p3) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (NOT (AND p3 (NOT p0) p2))), (X (NOT (AND p3 (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p3) (NOT p0) p2 p1))), (X (NOT p0)), (X (NOT (AND p3 (NOT p0) (NOT p2)))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1))))), (X (X (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), true, (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (NOT (AND p3 (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) p2 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p3 (NOT p0) (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p3) (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) p1))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (AND (NOT p3) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p3) (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) p1)))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (AND (NOT p3) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 31 factoid took 2391 ms. Reduced automaton from 8 states, 27 edges and 4 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Finished random walk after 189 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) (NOT p2)), (X (NOT (AND p3 (NOT p0) (NOT p1)))), (X (NOT p2)), (X (AND (NOT p3) (NOT p0))), (X (NOT (OR (AND p0 p2) (AND p2 p1)))), (X (AND (NOT p3) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (NOT (AND p3 (NOT p0) p2))), (X (NOT (AND p3 (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p3) (NOT p0) p2 p1))), (X (NOT p0)), (X (NOT (AND p3 (NOT p0) (NOT p2)))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1))))), (X (X (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), true, (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (NOT (AND p3 (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) p2 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p3 (NOT p0) (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p3) (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) p1))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (AND (NOT p3) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p3) (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) p1)))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (AND (NOT p3) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0), (F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 31 factoid took 2230 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
// Phase 1: matrix 263 rows 293 cols
[2022-05-17 01:04:23] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-17 01:04:23] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 126 ms returned sat
[2022-05-17 01:04:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 01:04:24] [INFO ] [Real]Absence check using state equation in 921 ms returned sat
[2022-05-17 01:04:24] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-17 01:04:24] [INFO ] [Real]Added 11 Read/Feed constraints in 11 ms returned sat
[2022-05-17 01:04:24] [INFO ] Computed and/alt/rep : 212/259/212 causal constraints (skipped 7 transitions) in 26 ms.
[2022-05-17 01:04:25] [INFO ] Added : 125 causal constraints over 25 iterations in 1376 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 293 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 263/263 transitions.
Applied a total of 0 rules in 6 ms. Remains 293 /293 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 293 cols
[2022-05-17 01:04:25] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-17 01:04:26] [INFO ] Implicit Places using invariants in 486 ms returned []
// Phase 1: matrix 263 rows 293 cols
[2022-05-17 01:04:26] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-17 01:04:26] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-17 01:04:27] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 1758 ms to find 0 implicit places.
// Phase 1: matrix 263 rows 293 cols
[2022-05-17 01:04:27] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-17 01:04:27] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 293/293 places, 263/263 transitions.
Computed a total of 293 stabilizing places and 263 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 293 transition count 263
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 p3)), (X (AND (NOT p0) (NOT p3))), (X (NOT p0)), true, (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 291 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Finished random walk after 209 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (NOT p0)), true, (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p3)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 8 factoid took 479 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
// Phase 1: matrix 263 rows 293 cols
[2022-05-17 01:04:29] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-17 01:04:29] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 80 ms returned sat
[2022-05-17 01:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 01:04:30] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2022-05-17 01:04:30] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-17 01:04:30] [INFO ] [Real]Added 11 Read/Feed constraints in 12 ms returned sat
[2022-05-17 01:04:30] [INFO ] Computed and/alt/rep : 212/259/212 causal constraints (skipped 7 transitions) in 27 ms.
[2022-05-17 01:04:31] [INFO ] Added : 125 causal constraints over 25 iterations in 1130 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 532 reset in 470 ms.
Product exploration explored 100000 steps with 532 reset in 477 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Support contains 3 out of 293 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 293/293 places, 263/263 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 293 transition count 263
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 45 ms. Remains 293 /293 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2022-05-17 01:04:32] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 263 rows 293 cols
[2022-05-17 01:04:32] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-17 01:04:33] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 293/293 places, 263/263 transitions.
Finished structural reductions, in 1 iterations. Remains : 293/293 places, 263/263 transitions.
Product exploration explored 100000 steps with 535 reset in 332 ms.
Product exploration explored 100000 steps with 536 reset in 496 ms.
Built C files in :
/tmp/ltsmin3183335695590573474
[2022-05-17 01:04:34] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3183335695590573474
Running compilation step : cd /tmp/ltsmin3183335695590573474;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 886 ms.
Running link step : cd /tmp/ltsmin3183335695590573474;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin3183335695590573474;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13320970169668638147.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 263/263 transitions.
Applied a total of 0 rules in 12 ms. Remains 293 /293 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 293 cols
[2022-05-17 01:04:49] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-17 01:04:49] [INFO ] Implicit Places using invariants in 346 ms returned []
// Phase 1: matrix 263 rows 293 cols
[2022-05-17 01:04:49] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-17 01:04:49] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-17 01:04:50] [INFO ] Implicit Places using invariants and state equation in 971 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
// Phase 1: matrix 263 rows 293 cols
[2022-05-17 01:04:50] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-17 01:04:50] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 293/293 places, 263/263 transitions.
Built C files in :
/tmp/ltsmin16599390298645405743
[2022-05-17 01:04:51] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16599390298645405743
Running compilation step : cd /tmp/ltsmin16599390298645405743;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 677 ms.
Running link step : cd /tmp/ltsmin16599390298645405743;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin16599390298645405743;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12888385159769917483.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 01:05:06] [INFO ] Flatten gal took : 33 ms
[2022-05-17 01:05:06] [INFO ] Flatten gal took : 23 ms
[2022-05-17 01:05:06] [INFO ] Time to serialize gal into /tmp/LTL167062513043467683.gal : 6 ms
[2022-05-17 01:05:06] [INFO ] Time to serialize properties into /tmp/LTL9577123146089968632.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL167062513043467683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9577123146089968632.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1670625...265
Read 1 LTL properties
Checking formula 0 : !(((!((F("((newmsg10>=1)&&(reply_25_4_to_left_11>=1))"))||("(init24>=1)")))U(G(("(rcv_left_reply_25_1_24>=1)")U(G((F("((newmsg10>=1)&&...228
Formula 0 simplified : !(!("(init24>=1)" | F"((newmsg10>=1)&&(reply_25_4_to_left_11>=1))") U G("(rcv_left_reply_25_1_24>=1)" U G("(rcv_left_election_25_5_6...214
Reverse transition relation is NOT exact ! Due to transitions t9, t23, t25.t26, t27.t28, t31.t32, t35.t36, t39.t40, t45.t46, t49.t50, t53.t54, t57.t58, t62...441
Computing Next relation with stutter on 1.78814e+18 deadlock states
Detected timeout of ITS tools.
[2022-05-17 01:05:21] [INFO ] Flatten gal took : 20 ms
[2022-05-17 01:05:21] [INFO ] Applying decomposition
[2022-05-17 01:05:21] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9202872045012957584.txt' '-o' '/tmp/graph9202872045012957584.bin' '-w' '/tmp/graph9202872045012957584.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9202872045012957584.bin' '-l' '-1' '-v' '-w' '/tmp/graph9202872045012957584.weights' '-q' '0' '-e' '0.001'
[2022-05-17 01:05:21] [INFO ] Decomposing Gal with order
[2022-05-17 01:05:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 01:05:21] [INFO ] Removed a total of 164 redundant transitions.
[2022-05-17 01:05:21] [INFO ] Flatten gal took : 97 ms
[2022-05-17 01:05:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 17 ms.
[2022-05-17 01:05:21] [INFO ] Time to serialize gal into /tmp/LTL14623742102053137077.gal : 11 ms
[2022-05-17 01:05:21] [INFO ] Time to serialize properties into /tmp/LTL13359747482842300224.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14623742102053137077.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13359747482842300224.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1462374...247
Read 1 LTL properties
Checking formula 0 : !(((!((F("((i4.i1.u1.newmsg10>=1)&&(i5.i5.u78.reply_25_4_to_left_11>=1))"))||("(i3.i4.u2.init24>=1)")))U(G(("(i3.i0.u28.rcv_left_reply...294
Formula 0 simplified : !(!("(i3.i4.u2.init24>=1)" | F"((i4.i1.u1.newmsg10>=1)&&(i5.i5.u78.reply_25_4_to_left_11>=1))") U G("(i3.i0.u28.rcv_left_reply_25_1_...280
Reverse transition relation is NOT exact ! Due to transitions t25_t26, t31_t32, t49_t50, t65_t66, t109_t110, t295_t296, t426_t427, t476_t477, i0.t45_t46, i...545
Computing Next relation with stutter on 1.78814e+18 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9861723968947778506
[2022-05-17 01:05:36] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9861723968947778506
Running compilation step : cd /tmp/ltsmin9861723968947778506;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 791 ms.
Running link step : cd /tmp/ltsmin9861723968947778506;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin9861723968947778506;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!(<>((LTLAPp0==true))||(LTLAPp1==true)) U [](((LTLAPp2==true) U []((<>((LTLAPp0==true))||(LTLAPp3==true))))))' '--buchi-type=spotba'
LTSmin run took 569 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-25-LTLFireability-07 finished in 84150 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G((F(p0)&&G(p1)))&&F(!p0)))))'
Support contains 4 out of 533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 533/533 places, 503/503 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 529 transition count 499
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 529 transition count 499
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 525 transition count 495
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 525 transition count 495
Applied a total of 16 rules in 70 ms. Remains 525 /533 variables (removed 8) and now considering 495/503 (removed 8) transitions.
// Phase 1: matrix 495 rows 525 cols
[2022-05-17 01:05:38] [INFO ] Computed 30 place invariants in 4 ms
[2022-05-17 01:05:38] [INFO ] Implicit Places using invariants in 585 ms returned []
// Phase 1: matrix 495 rows 525 cols
[2022-05-17 01:05:38] [INFO ] Computed 30 place invariants in 8 ms
[2022-05-17 01:05:41] [INFO ] Implicit Places using invariants and state equation in 2417 ms returned []
Implicit Place search using SMT with State Equation took 3018 ms to find 0 implicit places.
// Phase 1: matrix 495 rows 525 cols
[2022-05-17 01:05:41] [INFO ] Computed 30 place invariants in 11 ms
[2022-05-17 01:05:41] [INFO ] Dead Transitions using invariants and state equation in 676 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/533 places, 495/503 transitions.
Finished structural reductions, in 1 iterations. Remains : 525/533 places, 495/503 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, true, (NOT p0), (OR (NOT p1) (NOT p0)), p0]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s215 1) (GEQ s95 1)), p0:(OR (LT s25 1) (LT s294 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6230 steps with 17 reset in 28 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-08 finished in 4047 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(!p1 U ((F(p0) U p2) U p3))))'
Support contains 3 out of 533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 533/533 places, 503/503 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 530 transition count 500
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 530 transition count 500
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 527 transition count 497
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 527 transition count 497
Applied a total of 12 rules in 62 ms. Remains 527 /533 variables (removed 6) and now considering 497/503 (removed 6) transitions.
// Phase 1: matrix 497 rows 527 cols
[2022-05-17 01:05:42] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-17 01:05:42] [INFO ] Implicit Places using invariants in 545 ms returned []
// Phase 1: matrix 497 rows 527 cols
[2022-05-17 01:05:42] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-17 01:05:44] [INFO ] Implicit Places using invariants and state equation in 2029 ms returned []
Implicit Place search using SMT with State Equation took 2585 ms to find 0 implicit places.
// Phase 1: matrix 497 rows 527 cols
[2022-05-17 01:05:44] [INFO ] Computed 30 place invariants in 4 ms
[2022-05-17 01:05:45] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 527/533 places, 497/503 transitions.
Finished structural reductions, in 1 iterations. Remains : 527/533 places, 497/503 transitions.
Stuttering acceptance computed with spot in 532 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p2), (NOT p3), (NOT p3)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p0 p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=7 dest: 3}, { cond=(NOT p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=8 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(NOT p3), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={0} source=9 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=9 dest: 7}, { cond=(AND (NOT p3) p1), acceptance={0} source=9 dest: 8}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p3:(GEQ s125 1), p2:(GEQ s331 1), p0:(GEQ s380 1), p1:(AND (GEQ s380 1) (GEQ s331 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 814 reset in 808 ms.
Product exploration explored 100000 steps with 802 reset in 792 ms.
Computed a total of 527 stabilizing places and 497 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 527 transition count 497
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p3) (NOT p0))), (X (AND (NOT p3) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) p0 p1))), (X (NOT (AND (NOT p3) p2 (NOT p0) p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p3) p0 p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (AND (NOT p3) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT p0)), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p3) (NOT p0) (NOT p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 40 factoid took 2965 ms. Reduced automaton from 10 states, 35 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 287 ms :[(NOT p3), (NOT p0), (NOT p2), (NOT p3), (NOT p3)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 526 ms. (steps per millisecond=19 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 497 rows 527 cols
[2022-05-17 01:05:51] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-17 01:05:51] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p3) (NOT p0))), (X (AND (NOT p3) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) p0 p1))), (X (NOT (AND (NOT p3) p2 (NOT p0) p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p3) p0 p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (AND (NOT p3) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT p0)), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p3) (NOT p0) (NOT p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (G (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (G (NOT (AND p1 (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F p3), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 (NOT p3))), (F (NOT (AND (NOT p1) (NOT p3))))]
Knowledge based reduction with 42 factoid took 2990 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 285 ms :[(NOT p3), (NOT p0), (NOT p2), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 290 ms :[(NOT p3), (NOT p0), (NOT p2), (NOT p3), (NOT p3)]
// Phase 1: matrix 497 rows 527 cols
[2022-05-17 01:05:55] [INFO ] Computed 30 place invariants in 4 ms
[2022-05-17 01:05:56] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 142 ms returned unsat
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p3) (NOT p0))), (X (AND (NOT p3) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) p0 p1))), (X (NOT (AND (NOT p3) p2 (NOT p0) p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p3) p0 p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (AND (NOT p3) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT p0)), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p3) (NOT p0) (NOT p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (G (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (G (NOT (AND p1 (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F p3), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 (NOT p3))), (F (NOT (AND (NOT p1) (NOT p3)))), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 42 factoid took 1123 ms. Reduced automaton from 5 states, 9 edges and 4 AP to 1 states, 1 edges and 0 AP.
FORMULA HirschbergSinclair-PT-25-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLFireability-09 finished in 15271 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(!p0)))'
Support contains 2 out of 533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 533/533 places, 503/503 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 529 transition count 499
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 529 transition count 499
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 525 transition count 495
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 525 transition count 495
Applied a total of 16 rules in 72 ms. Remains 525 /533 variables (removed 8) and now considering 495/503 (removed 8) transitions.
// Phase 1: matrix 495 rows 525 cols
[2022-05-17 01:05:57] [INFO ] Computed 30 place invariants in 26 ms
[2022-05-17 01:05:58] [INFO ] Implicit Places using invariants in 643 ms returned []
// Phase 1: matrix 495 rows 525 cols
[2022-05-17 01:05:58] [INFO ] Computed 30 place invariants in 4 ms
[2022-05-17 01:06:00] [INFO ] Implicit Places using invariants and state equation in 2717 ms returned []
Implicit Place search using SMT with State Equation took 3375 ms to find 0 implicit places.
// Phase 1: matrix 495 rows 525 cols
[2022-05-17 01:06:00] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-17 01:06:01] [INFO ] Dead Transitions using invariants and state equation in 670 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/533 places, 495/503 transitions.
Finished structural reductions, in 1 iterations. Remains : 525/533 places, 495/503 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), p0, true]
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=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s43 1) (GEQ s502 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-10 finished in 4314 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(p0)))))'
Support contains 1 out of 533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 533/533 places, 503/503 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 529 transition count 499
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 529 transition count 499
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 525 transition count 495
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 525 transition count 495
Applied a total of 16 rules in 64 ms. Remains 525 /533 variables (removed 8) and now considering 495/503 (removed 8) transitions.
// Phase 1: matrix 495 rows 525 cols
[2022-05-17 01:06:01] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-17 01:06:02] [INFO ] Implicit Places using invariants in 480 ms returned []
// Phase 1: matrix 495 rows 525 cols
[2022-05-17 01:06:02] [INFO ] Computed 30 place invariants in 4 ms
[2022-05-17 01:06:04] [INFO ] Implicit Places using invariants and state equation in 2564 ms returned []
Implicit Place search using SMT with State Equation took 3055 ms to find 0 implicit places.
// Phase 1: matrix 495 rows 525 cols
[2022-05-17 01:06:04] [INFO ] Computed 30 place invariants in 4 ms
[2022-05-17 01:06:05] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/533 places, 495/503 transitions.
Finished structural reductions, in 1 iterations. Remains : 525/533 places, 495/503 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LT s164 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 33333 reset in 817 ms.
Product exploration explored 100000 steps with 33333 reset in 764 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 : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-25-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLFireability-11 finished in 5735 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(p0)))&&F(p1))))'
Support contains 3 out of 533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 533/533 places, 503/503 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 529 transition count 499
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 529 transition count 499
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 525 transition count 495
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 525 transition count 495
Applied a total of 16 rules in 61 ms. Remains 525 /533 variables (removed 8) and now considering 495/503 (removed 8) transitions.
// Phase 1: matrix 495 rows 525 cols
[2022-05-17 01:06:07] [INFO ] Computed 30 place invariants in 6 ms
[2022-05-17 01:06:08] [INFO ] Implicit Places using invariants in 431 ms returned []
// Phase 1: matrix 495 rows 525 cols
[2022-05-17 01:06:08] [INFO ] Computed 30 place invariants in 4 ms
[2022-05-17 01:06:09] [INFO ] Implicit Places using invariants and state equation in 1886 ms returned []
Implicit Place search using SMT with State Equation took 2321 ms to find 0 implicit places.
// Phase 1: matrix 495 rows 525 cols
[2022-05-17 01:06:09] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-17 01:06:10] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/533 places, 495/503 transitions.
Finished structural reductions, in 1 iterations. Remains : 525/533 places, 495/503 transitions.
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 2}]], initial=0, aps=[p1:(GEQ s469 1), p0:(AND (LT s469 1) (OR (LT s29 1) (LT s420 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, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 456 reset in 314 ms.
Product exploration explored 100000 steps with 470 reset in 441 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) p0), (X (NOT p1)), true, (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 251 ms. Reduced automaton from 8 states, 12 edges and 2 AP to 7 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 456 steps, including 0 resets, run visited all 3 properties in 28 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 460 ms. Reduced automaton from 7 states, 10 edges and 2 AP to 7 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 495 rows 525 cols
[2022-05-17 01:06:13] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-17 01:06:14] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 154 ms returned sat
[2022-05-17 01:06:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 01:06:14] [INFO ] [Real]Absence check using state equation in 390 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 7 states, 10 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA HirschbergSinclair-PT-25-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLFireability-12 finished in 7319 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 533/533 places, 503/503 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions removed 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 215 rules applied. Total rules applied 215 place count 509 transition count 264
Reduce places removed 215 places and 0 transitions.
Iterating post reduction 1 with 215 rules applied. Total rules applied 430 place count 294 transition count 264
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 434 place count 290 transition count 260
Iterating global reduction 2 with 4 rules applied. Total rules applied 438 place count 290 transition count 260
Applied a total of 438 rules in 55 ms. Remains 290 /533 variables (removed 243) and now considering 260/503 (removed 243) transitions.
// Phase 1: matrix 260 rows 290 cols
[2022-05-17 01:06:14] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-17 01:06:15] [INFO ] Implicit Places using invariants in 543 ms returned []
// Phase 1: matrix 260 rows 290 cols
[2022-05-17 01:06:15] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-17 01:06:16] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned []
Implicit Place search using SMT with State Equation took 1747 ms to find 0 implicit places.
[2022-05-17 01:06:16] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 260 rows 290 cols
[2022-05-17 01:06:16] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-17 01:06:17] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 290/533 places, 260/503 transitions.
Finished structural reductions, in 1 iterations. Remains : 290/533 places, 260/503 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s18 1) (GEQ s119 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 788 reset in 486 ms.
Product exploration explored 100000 steps with 789 reset in 499 ms.
Computed a total of 290 stabilizing places and 260 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 290 transition count 260
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 to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Finished random walk after 131 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=65 )
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 236 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 260 rows 290 cols
[2022-05-17 01:06:19] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-17 01:06:19] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 108 ms returned sat
[2022-05-17 01:06:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 01:06:20] [INFO ] [Real]Absence check using state equation in 835 ms returned sat
[2022-05-17 01:06:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 01:06:20] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 74 ms returned sat
[2022-05-17 01:06:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 01:06:21] [INFO ] [Nat]Absence check using state equation in 809 ms returned sat
[2022-05-17 01:06:21] [INFO ] Computed and/alt/rep : 207/230/207 causal constraints (skipped 7 transitions) in 33 ms.
[2022-05-17 01:06:22] [INFO ] Added : 59 causal constraints over 12 iterations in 593 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 290 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 290/290 places, 260/260 transitions.
Applied a total of 0 rules in 38 ms. Remains 290 /290 variables (removed 0) and now considering 260/260 (removed 0) transitions.
// Phase 1: matrix 260 rows 290 cols
[2022-05-17 01:06:22] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-17 01:06:22] [INFO ] Implicit Places using invariants in 539 ms returned []
// Phase 1: matrix 260 rows 290 cols
[2022-05-17 01:06:22] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-17 01:06:23] [INFO ] Implicit Places using invariants and state equation in 1149 ms returned []
Implicit Place search using SMT with State Equation took 1702 ms to find 0 implicit places.
[2022-05-17 01:06:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 260 rows 290 cols
[2022-05-17 01:06:23] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-17 01:06:24] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 260/260 transitions.
Computed a total of 290 stabilizing places and 260 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 290 transition count 260
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 216 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Finished random walk after 136 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=68 )
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 222 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 260 rows 290 cols
[2022-05-17 01:06:25] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-17 01:06:25] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 105 ms returned sat
[2022-05-17 01:06:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 01:06:26] [INFO ] [Real]Absence check using state equation in 756 ms returned sat
[2022-05-17 01:06:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 01:06:26] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 80 ms returned sat
[2022-05-17 01:06:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 01:06:27] [INFO ] [Nat]Absence check using state equation in 798 ms returned sat
[2022-05-17 01:06:27] [INFO ] Computed and/alt/rep : 207/230/207 causal constraints (skipped 7 transitions) in 19 ms.
[2022-05-17 01:06:28] [INFO ] Added : 59 causal constraints over 12 iterations in 658 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 788 reset in 510 ms.
Product exploration explored 100000 steps with 789 reset in 500 ms.
Built C files in :
/tmp/ltsmin11843369850705691417
[2022-05-17 01:06:29] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2022-05-17 01:06:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 01:06:29] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2022-05-17 01:06:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 01:06:29] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2022-05-17 01:06:29] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 01:06:29] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11843369850705691417
Running compilation step : cd /tmp/ltsmin11843369850705691417;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 945 ms.
Running link step : cd /tmp/ltsmin11843369850705691417;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11843369850705691417;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5478447750805020874.hoa' '--buchi-type=spotba'
LTSmin run took 12502 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-25-LTLFireability-13 finished in 28225 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(X(p1)))&&F(p2)))'
Support contains 3 out of 533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 533/533 places, 503/503 transitions.
Reduce places removed 25 places and 25 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 221 place count 508 transition count 257
Reduce places removed 221 places and 0 transitions.
Iterating post reduction 1 with 221 rules applied. Total rules applied 442 place count 287 transition count 257
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 446 place count 283 transition count 253
Iterating global reduction 2 with 4 rules applied. Total rules applied 450 place count 283 transition count 253
Applied a total of 450 rules in 30 ms. Remains 283 /533 variables (removed 250) and now considering 253/503 (removed 250) transitions.
// Phase 1: matrix 253 rows 283 cols
[2022-05-17 01:06:43] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-17 01:06:43] [INFO ] Implicit Places using invariants in 339 ms returned []
// Phase 1: matrix 253 rows 283 cols
[2022-05-17 01:06:43] [INFO ] Computed 30 place invariants in 0 ms
[2022-05-17 01:06:44] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1304 ms to find 0 implicit places.
[2022-05-17 01:06:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 253 rows 283 cols
[2022-05-17 01:06:44] [INFO ] Computed 30 place invariants in 4 ms
[2022-05-17 01:06:44] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 283/533 places, 253/503 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/533 places, 253/503 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s237 1), p2:(GEQ s198 1), p1:(GEQ s128 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 272 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-14 finished in 1970 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(p0))))'
Support contains 1 out of 533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 533/533 places, 503/503 transitions.
Reduce places removed 25 places and 25 transitions.
Drop transitions removed 223 transitions
Trivial Post-agglo rules discarded 223 transitions
Performed 223 trivial Post agglomeration. Transition count delta: 223
Iterating post reduction 0 with 223 rules applied. Total rules applied 223 place count 508 transition count 255
Reduce places removed 223 places and 0 transitions.
Iterating post reduction 1 with 223 rules applied. Total rules applied 446 place count 285 transition count 255
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 450 place count 281 transition count 251
Iterating global reduction 2 with 4 rules applied. Total rules applied 454 place count 281 transition count 251
Applied a total of 454 rules in 24 ms. Remains 281 /533 variables (removed 252) and now considering 251/503 (removed 252) transitions.
// Phase 1: matrix 251 rows 281 cols
[2022-05-17 01:06:45] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-17 01:06:45] [INFO ] Implicit Places using invariants in 482 ms returned []
// Phase 1: matrix 251 rows 281 cols
[2022-05-17 01:06:45] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-17 01:06:46] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1289 ms to find 0 implicit places.
[2022-05-17 01:06:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 251 rows 281 cols
[2022-05-17 01:06:46] [INFO ] Computed 30 place invariants in 0 ms
[2022-05-17 01:06:46] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 281/533 places, 251/503 transitions.
Finished structural reductions, in 1 iterations. Remains : 281/533 places, 251/503 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
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 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s70 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1712 reset in 630 ms.
Product exploration explored 100000 steps with 1731 reset in 547 ms.
Computed a total of 281 stabilizing places and 251 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 281 transition count 251
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-25-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLFireability-15 finished in 3329 ms.
All properties solved by simple procedures.
Total runtime 179886 ms.

BK_STOP 1652749608914

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="itstools"
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-4028"
echo " Executing tool itstools"
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 r114-smll-165264477500300"
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 ;