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.r096-smll-165260575700044.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 FlexibleBarrier-PT-08b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260575700044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.6K Apr 29 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 29 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 29 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 29 13:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 241K May 10 09:33 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 FlexibleBarrier-PT-08b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652614861142

Running Version 202205111006
[2022-05-15 11:41:02] [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-15 11:41:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 11:41:03] [INFO ] Load time of PNML (sax parser for PT used): 241 ms
[2022-05-15 11:41:03] [INFO ] Transformed 920 places.
[2022-05-15 11:41:03] [INFO ] Transformed 1057 transitions.
[2022-05-15 11:41:03] [INFO ] Found NUPN structural information;
[2022-05-15 11:41:03] [INFO ] Parsed PT model containing 920 places and 1057 transitions in 446 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Discarding 330 places :
Symmetric choice reduction at 0 with 330 rule applications. Total rules 330 place count 590 transition count 727
Iterating global reduction 0 with 330 rules applied. Total rules applied 660 place count 590 transition count 727
Discarding 138 places :
Symmetric choice reduction at 0 with 138 rule applications. Total rules 798 place count 452 transition count 589
Iterating global reduction 0 with 138 rules applied. Total rules applied 936 place count 452 transition count 589
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 1018 place count 370 transition count 507
Iterating global reduction 0 with 82 rules applied. Total rules applied 1100 place count 370 transition count 507
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 1136 place count 370 transition count 471
Applied a total of 1136 rules in 248 ms. Remains 370 /920 variables (removed 550) and now considering 471/1057 (removed 586) transitions.
// Phase 1: matrix 471 rows 370 cols
[2022-05-15 11:41:04] [INFO ] Computed 10 place invariants in 98 ms
[2022-05-15 11:41:04] [INFO ] Implicit Places using invariants in 595 ms returned []
// Phase 1: matrix 471 rows 370 cols
[2022-05-15 11:41:04] [INFO ] Computed 10 place invariants in 11 ms
[2022-05-15 11:41:05] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 1191 ms to find 0 implicit places.
// Phase 1: matrix 471 rows 370 cols
[2022-05-15 11:41:05] [INFO ] Computed 10 place invariants in 11 ms
[2022-05-15 11:41:05] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 370/920 places, 471/1057 transitions.
Finished structural reductions, in 1 iterations. Remains : 370/920 places, 471/1057 transitions.
Support contains 29 out of 370 places after structural reductions.
[2022-05-15 11:41:05] [INFO ] Flatten gal took : 135 ms
[2022-05-15 11:41:06] [INFO ] Flatten gal took : 66 ms
[2022-05-15 11:41:06] [INFO ] Input system was already deterministic with 471 transitions.
Incomplete random walk after 10000 steps, including 154 resets, run finished after 758 ms. (steps per millisecond=13 ) properties (out of 29) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 471 rows 370 cols
[2022-05-15 11:41:07] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-15 11:41:07] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-05-15 11:41:07] [INFO ] After 491ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2022-05-15 11:41:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2022-05-15 11:41:09] [INFO ] After 850ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2022-05-15 11:41:09] [INFO ] Deduced a trap composed of 89 places in 183 ms of which 13 ms to minimize.
[2022-05-15 11:41:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2022-05-15 11:41:10] [INFO ] After 2094ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 559 ms.
[2022-05-15 11:41:11] [INFO ] After 3267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Fused 22 Parikh solutions to 20 different solutions.
Parikh walk visited 15 properties in 291 ms.
Support contains 6 out of 370 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 370/370 places, 471/471 transitions.
Graph (trivial) has 336 edges and 370 vertex of which 49 / 370 are part of one of the 8 SCC in 16 ms
Free SCC test removed 41 places
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 329 transition count 382
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 290 transition count 382
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 79 place count 290 transition count 361
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 121 place count 269 transition count 361
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 150 place count 240 transition count 332
Iterating global reduction 2 with 29 rules applied. Total rules applied 179 place count 240 transition count 332
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 179 place count 240 transition count 331
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 181 place count 239 transition count 331
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 190 place count 230 transition count 322
Iterating global reduction 2 with 9 rules applied. Total rules applied 199 place count 230 transition count 322
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 205 place count 230 transition count 316
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 305 place count 180 transition count 266
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 321 place count 180 transition count 250
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 332 place count 169 transition count 239
Iterating global reduction 4 with 11 rules applied. Total rules applied 343 place count 169 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 347 place count 169 transition count 235
Free-agglomeration rule applied 118 times.
Iterating global reduction 5 with 118 rules applied. Total rules applied 465 place count 169 transition count 117
Reduce places removed 118 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 135 edges and 51 vertex of which 36 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Discarding 15 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 167 rules applied. Total rules applied 632 place count 36 transition count 69
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 653 place count 36 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 654 place count 35 transition count 47
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t5.t222.t371.t219.t220.t206 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 23 edges and 33 vertex of which 8 / 33 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 657 place count 29 transition count 45
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 665 place count 29 transition count 37
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 6 Pre rules applied. Total rules applied 665 place count 29 transition count 31
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 677 place count 23 transition count 31
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 681 place count 23 transition count 27
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 687 place count 20 transition count 24
Free-agglomeration rule applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 691 place count 20 transition count 20
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 699 place count 15 transition count 17
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 700 place count 15 transition count 17
Applied a total of 700 rules in 137 ms. Remains 15 /370 variables (removed 355) and now considering 17/471 (removed 454) transitions.
Finished structural reductions, in 1 iterations. Remains : 15/370 places, 17/471 transitions.
Finished random walk after 159 steps, including 0 resets, run visited all 7 properties in 3 ms. (steps per millisecond=53 )
Computed a total of 10 stabilizing places and 10 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(p0)))||((p1 U (p2 U p3))&&F(p1))))'
Support contains 4 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 471/471 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 353 transition count 454
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 353 transition count 454
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 48 place count 339 transition count 440
Iterating global reduction 0 with 14 rules applied. Total rules applied 62 place count 339 transition count 440
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 70 place count 339 transition count 432
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 335 transition count 428
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 335 transition count 428
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 81 place count 335 transition count 425
Applied a total of 81 rules in 43 ms. Remains 335 /370 variables (removed 35) and now considering 425/471 (removed 46) transitions.
// Phase 1: matrix 425 rows 335 cols
[2022-05-15 11:41:11] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:41:12] [INFO ] Implicit Places using invariants in 202 ms returned []
// Phase 1: matrix 425 rows 335 cols
[2022-05-15 11:41:12] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:41:12] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
// Phase 1: matrix 425 rows 335 cols
[2022-05-15 11:41:12] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:41:12] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 335/370 places, 425/471 transitions.
Finished structural reductions, in 1 iterations. Remains : 335/370 places, 425/471 transitions.
Stuttering acceptance computed with spot in 889 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p3), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) p1), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 8}], [{ cond=(NOT p1), acceptance={} source=4 dest: 9}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 10}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p1) p0), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 12}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=10 dest: 6}, { cond=(AND (NOT p3) p2), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=11 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=11 dest: 10}, { cond=(AND (NOT p3) p1), acceptance={0} source=11 dest: 11}], [{ cond=(NOT p1), acceptance={0} source=12 dest: 12}]], initial=0, aps=[p3:(EQ s113 1), p2:(EQ s181 1), p1:(EQ s329 1), p0:(EQ s91 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, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-00 finished in 1914 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(F(G(p0))) U G(!F(p0)))) U X(p1)))'
Support contains 2 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 471/471 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 352 transition count 453
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 352 transition count 453
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 50 place count 338 transition count 439
Iterating global reduction 0 with 14 rules applied. Total rules applied 64 place count 338 transition count 439
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 72 place count 338 transition count 431
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 334 transition count 427
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 334 transition count 427
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 83 place count 334 transition count 424
Applied a total of 83 rules in 84 ms. Remains 334 /370 variables (removed 36) and now considering 424/471 (removed 47) transitions.
// Phase 1: matrix 424 rows 334 cols
[2022-05-15 11:41:13] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-15 11:41:14] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 424 rows 334 cols
[2022-05-15 11:41:14] [INFO ] Computed 10 place invariants in 13 ms
[2022-05-15 11:41:14] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
// Phase 1: matrix 424 rows 334 cols
[2022-05-15 11:41:14] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-15 11:41:15] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 334/370 places, 424/471 transitions.
Finished structural reductions, in 1 iterations. Remains : 334/370 places, 424/471 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), (NOT p0), p0]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s179 1), p0:(EQ s117 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1533 reset in 564 ms.
Product exploration explored 100000 steps with 1518 reset in 440 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 245 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p0), p0]
Incomplete random walk after 10000 steps, including 154 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 424 rows 334 cols
[2022-05-15 11:41:16] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-15 11:41:17] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2022-05-15 11:41:17] [INFO ] After 243ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 11:41:17] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2022-05-15 11:41:17] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 3 ms to minimize.
[2022-05-15 11:41:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 245 ms
[2022-05-15 11:41:17] [INFO ] After 505ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 11:41:17] [INFO ] After 635ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 11:41:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-05-15 11:41:17] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 11:41:18] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2022-05-15 11:41:18] [INFO ] Deduced a trap composed of 81 places in 181 ms of which 0 ms to minimize.
[2022-05-15 11:41:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 345 ms
[2022-05-15 11:41:18] [INFO ] After 560ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-15 11:41:18] [INFO ] After 685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 334 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 334/334 places, 424/424 transitions.
Graph (trivial) has 306 edges and 334 vertex of which 49 / 334 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 293 transition count 337
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 256 transition count 337
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 75 place count 256 transition count 319
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 111 place count 238 transition count 319
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 127 place count 222 transition count 303
Iterating global reduction 2 with 16 rules applied. Total rules applied 143 place count 222 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 144 place count 221 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 221 transition count 302
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 249 place count 169 transition count 250
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 265 place count 169 transition count 234
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 274 place count 160 transition count 225
Iterating global reduction 3 with 9 rules applied. Total rules applied 283 place count 160 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 284 place count 160 transition count 224
Free-agglomeration rule applied 115 times.
Iterating global reduction 4 with 115 rules applied. Total rules applied 399 place count 160 transition count 109
Reduce places removed 115 places and 0 transitions.
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 119 edges and 45 vertex of which 15 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 165 rules applied. Total rules applied 564 place count 15 transition count 60
Drop transitions removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 5 with 42 rules applied. Total rules applied 606 place count 15 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 607 place count 14 transition count 17
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 14 edges and 12 vertex of which 10 / 12 are part of one of the 2 SCC in 1 ms
Free SCC test removed 8 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 610 place count 4 transition count 17
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 625 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 625 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 627 place count 2 transition count 2
Applied a total of 627 rules in 68 ms. Remains 2 /334 variables (removed 332) and now considering 2/424 (removed 422) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/334 places, 2/424 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 345 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p0), p0]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p0), p0]
// Phase 1: matrix 424 rows 334 cols
[2022-05-15 11:41:19] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:41:19] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-05-15 11:41:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:41:19] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2022-05-15 11:41:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:41:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-05-15 11:41:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:41:20] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2022-05-15 11:41:20] [INFO ] Computed and/alt/rep : 420/754/420 causal constraints (skipped 3 transitions) in 36 ms.
[2022-05-15 11:41:23] [INFO ] Added : 418 causal constraints over 84 iterations in 3295 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 334 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 424/424 transitions.
Applied a total of 0 rules in 7 ms. Remains 334 /334 variables (removed 0) and now considering 424/424 (removed 0) transitions.
// Phase 1: matrix 424 rows 334 cols
[2022-05-15 11:41:23] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:41:23] [INFO ] Implicit Places using invariants in 197 ms returned []
// Phase 1: matrix 424 rows 334 cols
[2022-05-15 11:41:23] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:41:23] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
// Phase 1: matrix 424 rows 334 cols
[2022-05-15 11:41:23] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:41:24] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 334/334 places, 424/424 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p0), p0]
Incomplete random walk after 10000 steps, including 150 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 298138 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 298138 steps, saw 88264 distinct states, run finished after 3004 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 424 rows 334 cols
[2022-05-15 11:41:28] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:41:28] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-05-15 11:41:28] [INFO ] After 232ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2022-05-15 11:41:28] [INFO ] After 307ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-05-15 11:41:28] [INFO ] After 455ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:1
[2022-05-15 11:41:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-05-15 11:41:28] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 11:41:29] [INFO ] After 346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 59 ms.
[2022-05-15 11:41:29] [INFO ] After 510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 6 ms.
Support contains 1 out of 334 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 334/334 places, 424/424 transitions.
Graph (trivial) has 306 edges and 334 vertex of which 49 / 334 are part of one of the 8 SCC in 0 ms
Free SCC test removed 41 places
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 293 transition count 337
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 256 transition count 337
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 75 place count 256 transition count 319
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 111 place count 238 transition count 319
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 127 place count 222 transition count 303
Iterating global reduction 2 with 16 rules applied. Total rules applied 143 place count 222 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 144 place count 221 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 221 transition count 302
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 249 place count 169 transition count 250
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 265 place count 169 transition count 234
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 274 place count 160 transition count 225
Iterating global reduction 3 with 9 rules applied. Total rules applied 283 place count 160 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 284 place count 160 transition count 224
Free-agglomeration rule applied 115 times.
Iterating global reduction 4 with 115 rules applied. Total rules applied 399 place count 160 transition count 109
Reduce places removed 115 places and 0 transitions.
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 119 edges and 45 vertex of which 15 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 165 rules applied. Total rules applied 564 place count 15 transition count 60
Drop transitions removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 5 with 42 rules applied. Total rules applied 606 place count 15 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 607 place count 14 transition count 17
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 14 edges and 12 vertex of which 10 / 12 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 610 place count 4 transition count 17
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 625 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 625 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 627 place count 2 transition count 2
Applied a total of 627 rules in 75 ms. Remains 2 /334 variables (removed 332) and now considering 2/424 (removed 422) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/334 places, 2/424 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 330 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p0), p0]
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p0), p0]
// Phase 1: matrix 424 rows 334 cols
[2022-05-15 11:41:30] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:41:30] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2022-05-15 11:41:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:41:30] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2022-05-15 11:41:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:41:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-05-15 11:41:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:41:31] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2022-05-15 11:41:31] [INFO ] Computed and/alt/rep : 420/754/420 causal constraints (skipped 3 transitions) in 55 ms.
[2022-05-15 11:41:36] [INFO ] Added : 418 causal constraints over 84 iterations in 5062 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p0), p0]
Stuttering criterion allowed to conclude after 8095 steps with 124 reset in 29 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-01 finished in 23219 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 370/370 places, 471/471 transitions.
Graph (trivial) has 293 edges and 370 vertex of which 49 / 370 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 328 transition count 388
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 288 transition count 388
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 81 place count 288 transition count 363
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 131 place count 263 transition count 363
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 164 place count 230 transition count 330
Iterating global reduction 2 with 33 rules applied. Total rules applied 197 place count 230 transition count 330
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 207 place count 220 transition count 320
Iterating global reduction 2 with 10 rules applied. Total rules applied 217 place count 220 transition count 320
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 227 place count 220 transition count 310
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 327 place count 170 transition count 260
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 330 place count 167 transition count 257
Iterating global reduction 3 with 3 rules applied. Total rules applied 333 place count 167 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 336 place count 167 transition count 254
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 338 place count 165 transition count 252
Applied a total of 338 rules in 122 ms. Remains 165 /370 variables (removed 205) and now considering 252/471 (removed 219) transitions.
[2022-05-15 11:41:37] [INFO ] Flow matrix only has 230 transitions (discarded 22 similar events)
// Phase 1: matrix 230 rows 165 cols
[2022-05-15 11:41:37] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:41:37] [INFO ] Implicit Places using invariants in 242 ms returned []
[2022-05-15 11:41:37] [INFO ] Flow matrix only has 230 transitions (discarded 22 similar events)
// Phase 1: matrix 230 rows 165 cols
[2022-05-15 11:41:37] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:41:37] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2022-05-15 11:41:37] [INFO ] Redundant transitions in 23 ms returned []
[2022-05-15 11:41:37] [INFO ] Flow matrix only has 230 transitions (discarded 22 similar events)
// Phase 1: matrix 230 rows 165 cols
[2022-05-15 11:41:37] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 11:41:37] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/370 places, 252/471 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/370 places, 252/471 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-02 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:(EQ s162 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-02 finished in 1004 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F(!(G(p0) U p1))))))'
Support contains 2 out of 370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 370/370 places, 471/471 transitions.
Graph (trivial) has 333 edges and 370 vertex of which 43 / 370 are part of one of the 7 SCC in 1 ms
Free SCC test removed 36 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 333 transition count 392
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 83 place count 292 transition count 392
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 83 place count 292 transition count 369
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 129 place count 269 transition count 369
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 159 place count 239 transition count 339
Iterating global reduction 2 with 30 rules applied. Total rules applied 189 place count 239 transition count 339
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 189 place count 239 transition count 337
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 193 place count 237 transition count 337
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 203 place count 227 transition count 327
Iterating global reduction 2 with 10 rules applied. Total rules applied 213 place count 227 transition count 327
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 223 place count 227 transition count 317
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 331 place count 173 transition count 263
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 333 place count 171 transition count 261
Iterating global reduction 3 with 2 rules applied. Total rules applied 335 place count 171 transition count 261
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 337 place count 171 transition count 259
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 341 place count 169 transition count 268
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 351 place count 169 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 352 place count 168 transition count 257
Applied a total of 352 rules in 88 ms. Remains 168 /370 variables (removed 202) and now considering 257/471 (removed 214) transitions.
[2022-05-15 11:41:38] [INFO ] Flow matrix only has 243 transitions (discarded 14 similar events)
// Phase 1: matrix 243 rows 168 cols
[2022-05-15 11:41:38] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 11:41:38] [INFO ] Implicit Places using invariants in 149 ms returned []
[2022-05-15 11:41:38] [INFO ] Flow matrix only has 243 transitions (discarded 14 similar events)
// Phase 1: matrix 243 rows 168 cols
[2022-05-15 11:41:38] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:41:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 11:41:38] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2022-05-15 11:41:38] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-15 11:41:38] [INFO ] Flow matrix only has 243 transitions (discarded 14 similar events)
// Phase 1: matrix 243 rows 168 cols
[2022-05-15 11:41:38] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:41:38] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/370 places, 257/471 transitions.
Finished structural reductions, in 1 iterations. Remains : 168/370 places, 257/471 transitions.
Stuttering acceptance computed with spot in 148 ms :[p1, p1, (AND p1 p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s45 1), p0:(EQ s58 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 5144 steps with 326 reset in 70 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-03 finished in 1055 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&F(p1))))'
Support contains 2 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 471/471 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 352 transition count 453
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 352 transition count 453
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 50 place count 338 transition count 439
Iterating global reduction 0 with 14 rules applied. Total rules applied 64 place count 338 transition count 439
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 72 place count 338 transition count 431
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 334 transition count 427
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 334 transition count 427
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 83 place count 334 transition count 424
Applied a total of 83 rules in 27 ms. Remains 334 /370 variables (removed 36) and now considering 424/471 (removed 47) transitions.
// Phase 1: matrix 424 rows 334 cols
[2022-05-15 11:41:39] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-15 11:41:39] [INFO ] Implicit Places using invariants in 197 ms returned []
// Phase 1: matrix 424 rows 334 cols
[2022-05-15 11:41:39] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-15 11:41:39] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
// Phase 1: matrix 424 rows 334 cols
[2022-05-15 11:41:39] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-15 11:41:40] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 334/370 places, 424/471 transitions.
Finished structural reductions, in 1 iterations. Remains : 334/370 places, 424/471 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s45 0), p0:(AND (EQ s49 0) (EQ s45 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33554 reset in 409 ms.
Product exploration explored 100000 steps with 33234 reset in 426 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 291 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true]
Incomplete random walk after 10000 steps, including 151 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 424 rows 334 cols
[2022-05-15 11:41:41] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:41:41] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), true, (X (X p1)), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 6 factoid took 126 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-05 finished in 2867 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))&&X(p1))))'
Support contains 2 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 471/471 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 352 transition count 453
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 352 transition count 453
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 50 place count 338 transition count 439
Iterating global reduction 0 with 14 rules applied. Total rules applied 64 place count 338 transition count 439
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 72 place count 338 transition count 431
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 334 transition count 427
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 334 transition count 427
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 84 place count 334 transition count 423
Applied a total of 84 rules in 32 ms. Remains 334 /370 variables (removed 36) and now considering 423/471 (removed 48) transitions.
// Phase 1: matrix 423 rows 334 cols
[2022-05-15 11:41:41] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:41:42] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 423 rows 334 cols
[2022-05-15 11:41:42] [INFO ] Computed 10 place invariants in 22 ms
[2022-05-15 11:41:42] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
// Phase 1: matrix 423 rows 334 cols
[2022-05-15 11:41:42] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:41:43] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 334/370 places, 423/471 transitions.
Finished structural reductions, in 1 iterations. Remains : 334/370 places, 423/471 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s117 1), p1:(EQ s324 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-06 finished in 1248 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||p1)))'
Support contains 1 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 471/471 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 351 transition count 452
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 351 transition count 452
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 53 place count 336 transition count 437
Iterating global reduction 0 with 15 rules applied. Total rules applied 68 place count 336 transition count 437
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 76 place count 336 transition count 429
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 331 transition count 424
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 331 transition count 424
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 90 place count 331 transition count 420
Applied a total of 90 rules in 31 ms. Remains 331 /370 variables (removed 39) and now considering 420/471 (removed 51) transitions.
// Phase 1: matrix 420 rows 331 cols
[2022-05-15 11:41:43] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:41:43] [INFO ] Implicit Places using invariants in 294 ms returned []
// Phase 1: matrix 420 rows 331 cols
[2022-05-15 11:41:43] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-15 11:41:44] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 836 ms to find 0 implicit places.
// Phase 1: matrix 420 rows 331 cols
[2022-05-15 11:41:44] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-15 11:41:44] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 331/370 places, 420/471 transitions.
Finished structural reductions, in 1 iterations. Remains : 331/370 places, 420/471 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-07 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:(EQ s45 1), p0:(EQ s45 0)], 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 43754 steps with 663 reset in 139 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-07 finished in 1537 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0)&&p1))||X((F(p2)&&p0))))'
Support contains 3 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 471/471 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 352 transition count 453
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 352 transition count 453
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 50 place count 338 transition count 439
Iterating global reduction 0 with 14 rules applied. Total rules applied 64 place count 338 transition count 439
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 72 place count 338 transition count 431
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 333 transition count 426
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 333 transition count 426
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 86 place count 333 transition count 422
Applied a total of 86 rules in 31 ms. Remains 333 /370 variables (removed 37) and now considering 422/471 (removed 49) transitions.
// Phase 1: matrix 422 rows 333 cols
[2022-05-15 11:41:44] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-15 11:41:45] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 422 rows 333 cols
[2022-05-15 11:41:45] [INFO ] Computed 10 place invariants in 8 ms
[2022-05-15 11:41:45] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 333 cols
[2022-05-15 11:41:45] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:41:45] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 333/370 places, 422/471 transitions.
Finished structural reductions, in 1 iterations. Remains : 333/370 places, 422/471 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 2}], [{ cond=p1, acceptance={0} source=5 dest: 0}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(EQ s78 1), p0:(EQ s295 1), p2:(EQ s156 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-09 finished in 1427 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 370/370 places, 471/471 transitions.
Graph (trivial) has 342 edges and 370 vertex of which 49 / 370 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 328 transition count 387
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 83 place count 287 transition count 387
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 83 place count 287 transition count 363
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 131 place count 263 transition count 363
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 164 place count 230 transition count 330
Iterating global reduction 2 with 33 rules applied. Total rules applied 197 place count 230 transition count 330
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 197 place count 230 transition count 329
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 199 place count 229 transition count 329
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 209 place count 219 transition count 319
Iterating global reduction 2 with 10 rules applied. Total rules applied 219 place count 219 transition count 319
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 229 place count 219 transition count 309
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 327 place count 170 transition count 260
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 330 place count 167 transition count 257
Iterating global reduction 3 with 3 rules applied. Total rules applied 333 place count 167 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 336 place count 167 transition count 254
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 344 place count 167 transition count 246
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 346 place count 165 transition count 244
Applied a total of 346 rules in 56 ms. Remains 165 /370 variables (removed 205) and now considering 244/471 (removed 227) transitions.
[2022-05-15 11:41:46] [INFO ] Flow matrix only has 230 transitions (discarded 14 similar events)
// Phase 1: matrix 230 rows 165 cols
[2022-05-15 11:41:46] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 11:41:46] [INFO ] Implicit Places using invariants in 189 ms returned []
[2022-05-15 11:41:46] [INFO ] Flow matrix only has 230 transitions (discarded 14 similar events)
// Phase 1: matrix 230 rows 165 cols
[2022-05-15 11:41:46] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:41:46] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2022-05-15 11:41:46] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-15 11:41:46] [INFO ] Flow matrix only has 230 transitions (discarded 14 similar events)
// Phase 1: matrix 230 rows 165 cols
[2022-05-15 11:41:46] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:41:47] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/370 places, 244/471 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/370 places, 244/471 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-10 finished in 1014 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X(F(G(F(p0))))))||G(p1)))'
Support contains 3 out of 370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 370/370 places, 471/471 transitions.
Graph (trivial) has 341 edges and 370 vertex of which 49 / 370 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 328 transition count 388
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 288 transition count 388
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 81 place count 288 transition count 365
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 127 place count 265 transition count 365
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 159 place count 233 transition count 333
Iterating global reduction 2 with 32 rules applied. Total rules applied 191 place count 233 transition count 333
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 191 place count 233 transition count 332
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 193 place count 232 transition count 332
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 203 place count 222 transition count 322
Iterating global reduction 2 with 10 rules applied. Total rules applied 213 place count 222 transition count 322
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 222 place count 222 transition count 313
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 322 place count 172 transition count 263
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 325 place count 169 transition count 260
Iterating global reduction 3 with 3 rules applied. Total rules applied 328 place count 169 transition count 260
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 331 place count 169 transition count 257
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 339 place count 169 transition count 249
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 341 place count 167 transition count 247
Applied a total of 341 rules in 80 ms. Remains 167 /370 variables (removed 203) and now considering 247/471 (removed 224) transitions.
[2022-05-15 11:41:47] [INFO ] Flow matrix only has 232 transitions (discarded 15 similar events)
// Phase 1: matrix 232 rows 167 cols
[2022-05-15 11:41:47] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 11:41:47] [INFO ] Implicit Places using invariants in 217 ms returned []
[2022-05-15 11:41:47] [INFO ] Flow matrix only has 232 transitions (discarded 15 similar events)
// Phase 1: matrix 232 rows 167 cols
[2022-05-15 11:41:47] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:41:47] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2022-05-15 11:41:47] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-15 11:41:47] [INFO ] Flow matrix only has 232 transitions (discarded 15 similar events)
// Phase 1: matrix 232 rows 167 cols
[2022-05-15 11:41:47] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:41:48] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 167/370 places, 247/471 transitions.
Finished structural reductions, in 1 iterations. Remains : 167/370 places, 247/471 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s54 1) (EQ s166 1)), p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-11 finished in 1158 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p0)) U !(X(p2)&&p1)))))'
Support contains 4 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 471/471 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 352 transition count 453
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 352 transition count 453
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 51 place count 337 transition count 438
Iterating global reduction 0 with 15 rules applied. Total rules applied 66 place count 337 transition count 438
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 75 place count 337 transition count 429
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 79 place count 333 transition count 425
Iterating global reduction 1 with 4 rules applied. Total rules applied 83 place count 333 transition count 425
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 86 place count 333 transition count 422
Applied a total of 86 rules in 37 ms. Remains 333 /370 variables (removed 37) and now considering 422/471 (removed 49) transitions.
// Phase 1: matrix 422 rows 333 cols
[2022-05-15 11:41:48] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:41:48] [INFO ] Implicit Places using invariants in 256 ms returned []
// Phase 1: matrix 422 rows 333 cols
[2022-05-15 11:41:48] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:41:49] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 333 cols
[2022-05-15 11:41:49] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:41:49] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 333/370 places, 422/471 transitions.
Finished structural reductions, in 1 iterations. Remains : 333/370 places, 422/471 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s28 1) (EQ s327 1)), p2:(EQ s238 1), p0:(EQ s124 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1538 reset in 277 ms.
Product exploration explored 100000 steps with 1522 reset in 294 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 357 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 213 ms :[(AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0)]
Incomplete random walk after 10000 steps, including 152 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 422 rows 333 cols
[2022-05-15 11:41:51] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:41:51] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-05-15 11:41:52] [INFO ] After 505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 11:41:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-05-15 11:41:52] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 11:41:52] [INFO ] After 486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 98 ms.
[2022-05-15 11:41:52] [INFO ] After 742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 13 ms.
Support contains 1 out of 333 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 333/333 places, 422/422 transitions.
Graph (trivial) has 306 edges and 333 vertex of which 49 / 333 are part of one of the 8 SCC in 0 ms
Free SCC test removed 41 places
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 292 transition count 333
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 253 transition count 333
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 79 place count 253 transition count 314
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 117 place count 234 transition count 314
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 133 place count 218 transition count 298
Iterating global reduction 2 with 16 rules applied. Total rules applied 149 place count 218 transition count 298
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 150 place count 217 transition count 297
Iterating global reduction 2 with 1 rules applied. Total rules applied 151 place count 217 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 152 place count 217 transition count 296
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 254 place count 166 transition count 245
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 270 place count 166 transition count 229
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 277 place count 159 transition count 222
Iterating global reduction 4 with 7 rules applied. Total rules applied 284 place count 159 transition count 222
Free-agglomeration rule applied 114 times.
Iterating global reduction 4 with 114 rules applied. Total rules applied 398 place count 159 transition count 108
Reduce places removed 114 places and 0 transitions.
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 118 edges and 45 vertex of which 10 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 164 rules applied. Total rules applied 562 place count 10 transition count 59
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 5 with 49 rules applied. Total rules applied 611 place count 10 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 612 place count 9 transition count 9
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t5.t222.t371.t219.t220.t206 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 5 edges and 6 vertex of which 2 / 6 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 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 6 with 4 rules applied. Total rules applied 616 place count 5 transition count 6
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 4 rules applied. Total rules applied 620 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 621 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 621 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 623 place count 2 transition count 2
Applied a total of 623 rules in 50 ms. Remains 2 /333 variables (removed 331) and now considering 2/422 (removed 420) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/333 places, 2/422 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F p2), (F (AND p2 p1))]
Knowledge based reduction with 6 factoid took 521 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 200 ms :[(AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[(AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0)]
Support contains 4 out of 333 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 422/422 transitions.
Applied a total of 0 rules in 8 ms. Remains 333 /333 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 333 cols
[2022-05-15 11:41:53] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-15 11:41:54] [INFO ] Implicit Places using invariants in 219 ms returned []
// Phase 1: matrix 422 rows 333 cols
[2022-05-15 11:41:54] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:41:54] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 333 cols
[2022-05-15 11:41:54] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:41:54] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 333/333 places, 422/422 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 271 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 206 ms :[(AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0)]
Incomplete random walk after 10000 steps, including 153 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 216130 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 216130 steps, saw 73072 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 422 rows 333 cols
[2022-05-15 11:41:58] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:41:59] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-05-15 11:41:59] [INFO ] After 504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 11:41:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-05-15 11:41:59] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 11:42:00] [INFO ] After 484ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 119 ms.
[2022-05-15 11:42:00] [INFO ] After 764ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 194 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=97 )
Parikh walk visited 4 properties in 18 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F p2), (F (AND p2 p1))]
Knowledge based reduction with 6 factoid took 482 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 213 ms :[(AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0)]
Stuttering acceptance computed with spot in 193 ms :[(AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0)]
Stuttering acceptance computed with spot in 221 ms :[(AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0)]
Product exploration explored 100000 steps with 1527 reset in 273 ms.
Product exploration explored 100000 steps with 1520 reset in 286 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 219 ms :[(AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0)]
Support contains 4 out of 333 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 333/333 places, 422/422 transitions.
Graph (trivial) has 254 edges and 333 vertex of which 49 / 333 are part of one of the 8 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 292 transition count 380
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 33 place count 292 transition count 380
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 55 place count 292 transition count 380
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 90 place count 257 transition count 345
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 125 place count 257 transition count 345
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 256 transition count 344
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 256 transition count 344
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 171 place count 256 transition count 360
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 191 place count 236 transition count 340
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 211 place count 236 transition count 340
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 219 place count 236 transition count 356
Deduced a syphon composed of 66 places in 0 ms
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 227 place count 236 transition count 348
Deduced a syphon composed of 66 places in 1 ms
Applied a total of 227 rules in 133 ms. Remains 236 /333 variables (removed 97) and now considering 348/422 (removed 74) transitions.
[2022-05-15 11:42:02] [INFO ] Redundant transitions in 20 ms returned []
[2022-05-15 11:42:02] [INFO ] Flow matrix only has 326 transitions (discarded 22 similar events)
// Phase 1: matrix 326 rows 236 cols
[2022-05-15 11:42:02] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:42:03] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 236/333 places, 348/422 transitions.
Finished structural reductions, in 1 iterations. Remains : 236/333 places, 348/422 transitions.
Product exploration explored 100000 steps with 1522 reset in 307 ms.
Product exploration explored 100000 steps with 1529 reset in 283 ms.
Built C files in :
/tmp/ltsmin10906692157181855259
[2022-05-15 11:42:03] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10906692157181855259
Running compilation step : cd /tmp/ltsmin10906692157181855259;'/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 1079 ms.
Running link step : cd /tmp/ltsmin10906692157181855259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin10906692157181855259;'/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/stateBased7412902548167169428.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 333 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 422/422 transitions.
Applied a total of 0 rules in 7 ms. Remains 333 /333 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 333 cols
[2022-05-15 11:42:18] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:42:18] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 422 rows 333 cols
[2022-05-15 11:42:18] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:42:19] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 333 cols
[2022-05-15 11:42:19] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:42:19] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 333/333 places, 422/422 transitions.
Built C files in :
/tmp/ltsmin7261870866835929277
[2022-05-15 11:42:19] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7261870866835929277
Running compilation step : cd /tmp/ltsmin7261870866835929277;'/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 963 ms.
Running link step : cd /tmp/ltsmin7261870866835929277;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin7261870866835929277;'/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/stateBased9513134881314219825.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 11:42:35] [INFO ] Flatten gal took : 28 ms
[2022-05-15 11:42:35] [INFO ] Flatten gal took : 28 ms
[2022-05-15 11:42:35] [INFO ] Time to serialize gal into /tmp/LTL7213659956327165954.gal : 7 ms
[2022-05-15 11:42:35] [INFO ] Time to serialize properties into /tmp/LTL11884899968865535425.ltl : 2 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/LTL7213659956327165954.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11884899968865535425.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/LTL7213659...267
Read 1 LTL properties
Checking formula 0 : !((X(G((F(G("(p321==1)")))U(!(((X("(p590==1)"))&&("(p73==1)"))&&("(p905==1)")))))))
Formula 0 simplified : !XG(FG"(p321==1)" U !("(p73==1)" & "(p905==1)" & X"(p590==1)"))
Detected timeout of ITS tools.
[2022-05-15 11:42:50] [INFO ] Flatten gal took : 28 ms
[2022-05-15 11:42:50] [INFO ] Applying decomposition
[2022-05-15 11:42:50] [INFO ] Flatten gal took : 25 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/graph5646160234911533930.txt' '-o' '/tmp/graph5646160234911533930.bin' '-w' '/tmp/graph5646160234911533930.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5646160234911533930.bin' '-l' '-1' '-v' '-w' '/tmp/graph5646160234911533930.weights' '-q' '0' '-e' '0.001'
[2022-05-15 11:42:50] [INFO ] Decomposing Gal with order
[2022-05-15 11:42:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 11:42:50] [INFO ] Removed a total of 201 redundant transitions.
[2022-05-15 11:42:50] [INFO ] Flatten gal took : 122 ms
[2022-05-15 11:42:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2022-05-15 11:42:50] [INFO ] Time to serialize gal into /tmp/LTL11947991968763241450.gal : 10 ms
[2022-05-15 11:42:50] [INFO ] Time to serialize properties into /tmp/LTL4562163513488424415.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/LTL11947991968763241450.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4562163513488424415.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/LTL1194799...246
Read 1 LTL properties
Checking formula 0 : !((X(G((F(G("(i5.u38.p321==1)")))U(!(((X("(i11.u75.p590==1)"))&&("(i0.u7.p73==1)"))&&("(u83.p905==1)")))))))
Formula 0 simplified : !XG(FG"(i5.u38.p321==1)" U !("(i0.u7.p73==1)" & "(u83.p905==1)" & X"(i11.u75.p590==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3673377634526044132
[2022-05-15 11:43:05] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3673377634526044132
Running compilation step : cd /tmp/ltsmin3673377634526044132;'/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 905 ms.
Running link step : cd /tmp/ltsmin3673377634526044132;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin3673377634526044132;'/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' 'X([]((<>([]((LTLAPp0==true))) U !(X((LTLAPp2==true))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-12 finished in 92433 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(p0))))'
Support contains 1 out of 370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 370/370 places, 471/471 transitions.
Graph (trivial) has 342 edges and 370 vertex of which 49 / 370 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 328 transition count 388
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 288 transition count 388
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 81 place count 288 transition count 364
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 129 place count 264 transition count 364
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 161 place count 232 transition count 332
Iterating global reduction 2 with 32 rules applied. Total rules applied 193 place count 232 transition count 332
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 193 place count 232 transition count 331
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 231 transition count 331
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 205 place count 221 transition count 321
Iterating global reduction 2 with 10 rules applied. Total rules applied 215 place count 221 transition count 321
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 225 place count 221 transition count 311
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 325 place count 171 transition count 261
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 328 place count 168 transition count 258
Iterating global reduction 3 with 3 rules applied. Total rules applied 331 place count 168 transition count 258
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 334 place count 168 transition count 255
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 342 place count 168 transition count 247
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 344 place count 166 transition count 245
Applied a total of 344 rules in 68 ms. Remains 166 /370 variables (removed 204) and now considering 245/471 (removed 226) transitions.
[2022-05-15 11:43:20] [INFO ] Flow matrix only has 230 transitions (discarded 15 similar events)
// Phase 1: matrix 230 rows 166 cols
[2022-05-15 11:43:20] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:43:21] [INFO ] Implicit Places using invariants in 197 ms returned []
[2022-05-15 11:43:21] [INFO ] Flow matrix only has 230 transitions (discarded 15 similar events)
// Phase 1: matrix 230 rows 166 cols
[2022-05-15 11:43:21] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:43:21] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2022-05-15 11:43:21] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 11:43:21] [INFO ] Flow matrix only has 230 transitions (discarded 15 similar events)
// Phase 1: matrix 230 rows 166 cols
[2022-05-15 11:43:21] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:43:21] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/370 places, 245/471 transitions.
Finished structural reductions, in 1 iterations. Remains : 166/370 places, 245/471 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s126 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6767 reset in 358 ms.
Stuttering criterion allowed to conclude after 29422 steps with 1988 reset in 118 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-13 finished in 1285 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(X(X((F(p0) U F(p1)))) U p2)) U p3))'
Support contains 5 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 471/471 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 353 transition count 454
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 353 transition count 454
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 48 place count 339 transition count 440
Iterating global reduction 0 with 14 rules applied. Total rules applied 62 place count 339 transition count 440
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 69 place count 339 transition count 433
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 335 transition count 429
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 335 transition count 429
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 80 place count 335 transition count 426
Applied a total of 80 rules in 36 ms. Remains 335 /370 variables (removed 35) and now considering 426/471 (removed 45) transitions.
// Phase 1: matrix 426 rows 335 cols
[2022-05-15 11:43:22] [INFO ] Computed 10 place invariants in 11 ms
[2022-05-15 11:43:22] [INFO ] Implicit Places using invariants in 204 ms returned []
// Phase 1: matrix 426 rows 335 cols
[2022-05-15 11:43:22] [INFO ] Computed 10 place invariants in 14 ms
[2022-05-15 11:43:22] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
// Phase 1: matrix 426 rows 335 cols
[2022-05-15 11:43:22] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:43:22] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 335/370 places, 426/471 transitions.
Finished structural reductions, in 1 iterations. Remains : 335/370 places, 426/471 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p3), p1, (OR (NOT p3) p2), (AND p2 p1)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p3:(OR (EQ s153 1) (AND (EQ s165 1) (EQ s334 1))), p1:(EQ s181 1), p2:(EQ s296 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 59 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-14 finished in 1096 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 1 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 471/471 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 351 transition count 452
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 351 transition count 452
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 53 place count 336 transition count 437
Iterating global reduction 0 with 15 rules applied. Total rules applied 68 place count 336 transition count 437
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 76 place count 336 transition count 429
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 331 transition count 424
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 331 transition count 424
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 90 place count 331 transition count 420
Applied a total of 90 rules in 21 ms. Remains 331 /370 variables (removed 39) and now considering 420/471 (removed 51) transitions.
// Phase 1: matrix 420 rows 331 cols
[2022-05-15 11:43:23] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:43:23] [INFO ] Implicit Places using invariants in 216 ms returned []
// Phase 1: matrix 420 rows 331 cols
[2022-05-15 11:43:23] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:43:23] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
// Phase 1: matrix 420 rows 331 cols
[2022-05-15 11:43:23] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 11:43:24] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 331/370 places, 420/471 transitions.
Finished structural reductions, in 1 iterations. Remains : 331/370 places, 420/471 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s304 0), p1:(EQ s304 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 637 ms.
Product exploration explored 100000 steps with 50000 reset in 410 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-15 finished in 2520 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p0)) U !(X(p2)&&p1)))))'
Found a SL insensitive property : FlexibleBarrier-PT-08b-LTLFireability-12
Stuttering acceptance computed with spot in 203 ms :[(AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0)]
Support contains 4 out of 370 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 370/370 places, 471/471 transitions.
Graph (trivial) has 290 edges and 370 vertex of which 49 / 370 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 328 transition count 389
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 289 transition count 389
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 79 place count 289 transition count 365
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 127 place count 265 transition count 365
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 159 place count 233 transition count 333
Iterating global reduction 2 with 32 rules applied. Total rules applied 191 place count 233 transition count 333
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 201 place count 223 transition count 323
Iterating global reduction 2 with 10 rules applied. Total rules applied 211 place count 223 transition count 323
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 220 place count 223 transition count 314
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 318 place count 174 transition count 265
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 321 place count 171 transition count 262
Iterating global reduction 3 with 3 rules applied. Total rules applied 324 place count 171 transition count 262
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 327 place count 171 transition count 259
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 329 place count 169 transition count 257
Applied a total of 329 rules in 33 ms. Remains 169 /370 variables (removed 201) and now considering 257/471 (removed 214) transitions.
[2022-05-15 11:43:26] [INFO ] Flow matrix only has 235 transitions (discarded 22 similar events)
// Phase 1: matrix 235 rows 169 cols
[2022-05-15 11:43:26] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:43:26] [INFO ] Implicit Places using invariants in 189 ms returned []
[2022-05-15 11:43:26] [INFO ] Flow matrix only has 235 transitions (discarded 22 similar events)
// Phase 1: matrix 235 rows 169 cols
[2022-05-15 11:43:26] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 11:43:26] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2022-05-15 11:43:26] [INFO ] Flow matrix only has 235 transitions (discarded 22 similar events)
// Phase 1: matrix 235 rows 169 cols
[2022-05-15 11:43:26] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:43:26] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 169/370 places, 257/471 transitions.
Finished structural reductions, in 1 iterations. Remains : 169/370 places, 257/471 transitions.
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s10 1) (EQ s166 1)), p2:(EQ s97 1), p0:(EQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6369 reset in 333 ms.
Product exploration explored 100000 steps with 6354 reset in 357 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 347 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 204 ms :[(AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0)]
Incomplete random walk after 10000 steps, including 658 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-15 11:43:28] [INFO ] Flow matrix only has 235 transitions (discarded 22 similar events)
// Phase 1: matrix 235 rows 169 cols
[2022-05-15 11:43:28] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:43:28] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-05-15 11:43:28] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 11:43:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-05-15 11:43:29] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 11:43:29] [INFO ] After 234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-05-15 11:43:29] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 169/169 places, 257/257 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 169 transition count 241
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 23 place count 162 transition count 234
Iterating global reduction 1 with 7 rules applied. Total rules applied 30 place count 162 transition count 234
Free-agglomeration rule applied 66 times.
Iterating global reduction 1 with 66 rules applied. Total rules applied 96 place count 162 transition count 168
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t5.t222.t371.t219.t220.t206 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 37 edges and 94 vertex of which 14 / 94 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 99 place count 87 transition count 166
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 113 place count 87 transition count 152
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 113 place count 87 transition count 144
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 129 place count 79 transition count 144
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 150 place count 58 transition count 123
Iterating global reduction 3 with 21 rules applied. Total rules applied 171 place count 58 transition count 123
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 192 place count 58 transition count 102
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 206 place count 51 transition count 95
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 213 place count 51 transition count 88
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 220 place count 51 transition count 81
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 4 with 32 rules applied. Total rules applied 252 place count 39 transition count 61
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 272 place count 29 transition count 51
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 283 place count 18 transition count 40
Iterating global reduction 6 with 11 rules applied. Total rules applied 294 place count 18 transition count 40
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 305 place count 18 transition count 29
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 309 place count 18 transition count 25
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 310 place count 18 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 311 place count 17 transition count 24
Applied a total of 311 rules in 18 ms. Remains 17 /169 variables (removed 152) and now considering 24/257 (removed 233) transitions.
Finished structural reductions, in 1 iterations. Remains : 17/169 places, 24/257 transitions.
Finished random walk after 167 steps, including 13 resets, run visited all 3 properties in 3 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F p2), (F (AND p2 p1))]
Knowledge based reduction with 6 factoid took 356 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 153 ms :[(AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0)]
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 257/257 transitions.
Applied a total of 0 rules in 6 ms. Remains 169 /169 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2022-05-15 11:43:29] [INFO ] Flow matrix only has 235 transitions (discarded 22 similar events)
// Phase 1: matrix 235 rows 169 cols
[2022-05-15 11:43:29] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:43:30] [INFO ] Implicit Places using invariants in 143 ms returned []
[2022-05-15 11:43:30] [INFO ] Flow matrix only has 235 transitions (discarded 22 similar events)
// Phase 1: matrix 235 rows 169 cols
[2022-05-15 11:43:30] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 11:43:30] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2022-05-15 11:43:30] [INFO ] Flow matrix only has 235 transitions (discarded 22 similar events)
// Phase 1: matrix 235 rows 169 cols
[2022-05-15 11:43:30] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 11:43:30] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 169/169 places, 257/257 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 338 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 188 ms :[(AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0)]
Incomplete random walk after 10000 steps, including 659 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-15 11:43:31] [INFO ] Flow matrix only has 235 transitions (discarded 22 similar events)
// Phase 1: matrix 235 rows 169 cols
[2022-05-15 11:43:31] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 11:43:31] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-05-15 11:43:31] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 11:43:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-05-15 11:43:31] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 11:43:31] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-15 11:43:32] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 169/169 places, 257/257 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 169 transition count 241
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 23 place count 162 transition count 234
Iterating global reduction 1 with 7 rules applied. Total rules applied 30 place count 162 transition count 234
Free-agglomeration rule applied 66 times.
Iterating global reduction 1 with 66 rules applied. Total rules applied 96 place count 162 transition count 168
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t5.t222.t371.t219.t220.t206 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 37 edges and 94 vertex of which 14 / 94 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 99 place count 87 transition count 166
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 113 place count 87 transition count 152
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 113 place count 87 transition count 144
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 129 place count 79 transition count 144
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 150 place count 58 transition count 123
Iterating global reduction 3 with 21 rules applied. Total rules applied 171 place count 58 transition count 123
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 192 place count 58 transition count 102
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 206 place count 51 transition count 95
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 213 place count 51 transition count 88
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 220 place count 51 transition count 81
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 4 with 32 rules applied. Total rules applied 252 place count 39 transition count 61
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 272 place count 29 transition count 51
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 283 place count 18 transition count 40
Iterating global reduction 6 with 11 rules applied. Total rules applied 294 place count 18 transition count 40
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 305 place count 18 transition count 29
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 309 place count 18 transition count 25
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 310 place count 18 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 311 place count 17 transition count 24
Applied a total of 311 rules in 22 ms. Remains 17 /169 variables (removed 152) and now considering 24/257 (removed 233) transitions.
Finished structural reductions, in 1 iterations. Remains : 17/169 places, 24/257 transitions.
Finished random walk after 203 steps, including 20 resets, run visited all 2 properties in 2 ms. (steps per millisecond=101 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F p2), (F (AND p2 p1))]
Knowledge based reduction with 6 factoid took 322 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 154 ms :[(AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[(AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0)]
Product exploration explored 100000 steps with 6351 reset in 334 ms.
Product exploration explored 100000 steps with 6356 reset in 351 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 205 ms :[(AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0)]
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 257/257 transitions.
Applied a total of 0 rules in 8 ms. Remains 169 /169 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2022-05-15 11:43:33] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-15 11:43:33] [INFO ] Flow matrix only has 235 transitions (discarded 22 similar events)
// Phase 1: matrix 235 rows 169 cols
[2022-05-15 11:43:33] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 11:43:34] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 169/169 places, 257/257 transitions.
Product exploration explored 100000 steps with 6344 reset in 593 ms.
Product exploration explored 100000 steps with 6407 reset in 432 ms.
Built C files in :
/tmp/ltsmin6504045703531803666
[2022-05-15 11:43:35] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6504045703531803666
Running compilation step : cd /tmp/ltsmin6504045703531803666;'/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 596 ms.
Running link step : cd /tmp/ltsmin6504045703531803666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6504045703531803666;'/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/stateBased11140834793609107029.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 257/257 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2022-05-15 11:43:50] [INFO ] Flow matrix only has 235 transitions (discarded 22 similar events)
// Phase 1: matrix 235 rows 169 cols
[2022-05-15 11:43:50] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 11:43:50] [INFO ] Implicit Places using invariants in 140 ms returned []
[2022-05-15 11:43:50] [INFO ] Flow matrix only has 235 transitions (discarded 22 similar events)
// Phase 1: matrix 235 rows 169 cols
[2022-05-15 11:43:50] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 11:43:50] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2022-05-15 11:43:50] [INFO ] Flow matrix only has 235 transitions (discarded 22 similar events)
// Phase 1: matrix 235 rows 169 cols
[2022-05-15 11:43:50] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 11:43:51] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 169/169 places, 257/257 transitions.
Built C files in :
/tmp/ltsmin13899636116222002384
[2022-05-15 11:43:51] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13899636116222002384
Running compilation step : cd /tmp/ltsmin13899636116222002384;'/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 804 ms.
Running link step : cd /tmp/ltsmin13899636116222002384;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin13899636116222002384;'/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/stateBased13935662361290885798.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 11:44:06] [INFO ] Flatten gal took : 16 ms
[2022-05-15 11:44:06] [INFO ] Flatten gal took : 15 ms
[2022-05-15 11:44:06] [INFO ] Time to serialize gal into /tmp/LTL14373695263816019614.gal : 3 ms
[2022-05-15 11:44:06] [INFO ] Time to serialize properties into /tmp/LTL16448854602914614304.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/LTL14373695263816019614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16448854602914614304.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/LTL1437369...268
Read 1 LTL properties
Checking formula 0 : !((X(G((F(G("(p321==1)")))U(!(((X("(p590==1)"))&&("(p73==1)"))&&("(p905==1)")))))))
Formula 0 simplified : !XG(FG"(p321==1)" U !("(p73==1)" & "(p905==1)" & X"(p590==1)"))
Detected timeout of ITS tools.
[2022-05-15 11:44:21] [INFO ] Flatten gal took : 13 ms
[2022-05-15 11:44:21] [INFO ] Applying decomposition
[2022-05-15 11:44:21] [INFO ] Flatten gal took : 13 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/graph15221575375923290596.txt' '-o' '/tmp/graph15221575375923290596.bin' '-w' '/tmp/graph15221575375923290596.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15221575375923290596.bin' '-l' '-1' '-v' '-w' '/tmp/graph15221575375923290596.weights' '-q' '0' '-e' '0.001'
[2022-05-15 11:44:21] [INFO ] Decomposing Gal with order
[2022-05-15 11:44:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 11:44:21] [INFO ] Removed a total of 121 redundant transitions.
[2022-05-15 11:44:21] [INFO ] Flatten gal took : 40 ms
[2022-05-15 11:44:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 7 ms.
[2022-05-15 11:44:21] [INFO ] Time to serialize gal into /tmp/LTL15506719921894638837.gal : 3 ms
[2022-05-15 11:44:21] [INFO ] Time to serialize properties into /tmp/LTL16408980600648516656.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/LTL15506719921894638837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16408980600648516656.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/LTL1550671...247
Read 1 LTL properties
Checking formula 0 : !((X(G((F(G("(u11.p321==1)")))U(!(((X("(i6.u20.p590==1)"))&&("(i9.u1.p73==1)"))&&("(u25.p905==1)")))))))
Formula 0 simplified : !XG(FG"(u11.p321==1)" U !("(i9.u1.p73==1)" & "(u25.p905==1)" & X"(i6.u20.p590==1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2.26651e+10 deadlock states
13 unique states visited
13 strongly connected components in search stack
14 transitions explored
13 items max in DFS search stack
196 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.00516,75980,1,0,92826,98601,2212,174097,1262,284328,129860
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-12 finished in 58218 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-12 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-15 11:44:23] [INFO ] Flatten gal took : 20 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 200959 ms.

BK_STOP 1652615064065

--------------------
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="FlexibleBarrier-PT-08b"
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 FlexibleBarrier-PT-08b, 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 r096-smll-165260575700044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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