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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 6.7K Apr 29 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 29 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.3K May 9 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:51 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 536K 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-12b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652626330425

Running Version 202205111006
[2022-05-15 14:52:12] [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 14:52:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 14:52:13] [INFO ] Load time of PNML (sax parser for PT used): 329 ms
[2022-05-15 14:52:13] [INFO ] Transformed 1988 places.
[2022-05-15 14:52:13] [INFO ] Transformed 2289 transitions.
[2022-05-15 14:52:13] [INFO ] Found NUPN structural information;
[2022-05-15 14:52:13] [INFO ] Parsed PT model containing 1988 places and 2289 transitions in 520 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 4 formulas.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 1988 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Discarding 779 places :
Symmetric choice reduction at 0 with 779 rule applications. Total rules 779 place count 1209 transition count 1510
Iterating global reduction 0 with 779 rules applied. Total rules applied 1558 place count 1209 transition count 1510
Discarding 354 places :
Symmetric choice reduction at 0 with 354 rule applications. Total rules 1912 place count 855 transition count 1156
Iterating global reduction 0 with 354 rules applied. Total rules applied 2266 place count 855 transition count 1156
Discarding 222 places :
Symmetric choice reduction at 0 with 222 rule applications. Total rules 2488 place count 633 transition count 934
Iterating global reduction 0 with 222 rules applied. Total rules applied 2710 place count 633 transition count 934
Ensure Unique test removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Iterating post reduction 0 with 107 rules applied. Total rules applied 2817 place count 633 transition count 827
Applied a total of 2817 rules in 636 ms. Remains 633 /1988 variables (removed 1355) and now considering 827/2289 (removed 1462) transitions.
// Phase 1: matrix 827 rows 633 cols
[2022-05-15 14:52:14] [INFO ] Computed 14 place invariants in 57 ms
[2022-05-15 14:52:15] [INFO ] Implicit Places using invariants in 1077 ms returned []
// Phase 1: matrix 827 rows 633 cols
[2022-05-15 14:52:15] [INFO ] Computed 14 place invariants in 29 ms
[2022-05-15 14:52:16] [INFO ] Implicit Places using invariants and state equation in 1055 ms returned []
Implicit Place search using SMT with State Equation took 2184 ms to find 0 implicit places.
// Phase 1: matrix 827 rows 633 cols
[2022-05-15 14:52:16] [INFO ] Computed 14 place invariants in 10 ms
[2022-05-15 14:52:16] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 633/1988 places, 827/2289 transitions.
Finished structural reductions, in 1 iterations. Remains : 633/1988 places, 827/2289 transitions.
Support contains 37 out of 633 places after structural reductions.
[2022-05-15 14:52:17] [INFO ] Flatten gal took : 130 ms
[2022-05-15 14:52:17] [INFO ] Flatten gal took : 73 ms
[2022-05-15 14:52:17] [INFO ] Input system was already deterministic with 827 transitions.
Incomplete random walk after 10000 steps, including 112 resets, run finished after 1111 ms. (steps per millisecond=9 ) properties (out of 29) seen :7
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 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 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) 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 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) 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 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) 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 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 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 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 827 rows 633 cols
[2022-05-15 14:52:18] [INFO ] Computed 14 place invariants in 9 ms
[2022-05-15 14:52:19] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-05-15 14:52:19] [INFO ] After 615ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2022-05-15 14:52:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2022-05-15 14:52:21] [INFO ] After 1100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2022-05-15 14:52:22] [INFO ] Deduced a trap composed of 180 places in 343 ms of which 6 ms to minimize.
[2022-05-15 14:52:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 413 ms
[2022-05-15 14:52:23] [INFO ] After 2881ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 726 ms.
[2022-05-15 14:52:23] [INFO ] After 4436ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Parikh walk visited 18 properties in 217 ms.
Support contains 6 out of 633 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 633/633 places, 827/827 transitions.
Graph (trivial) has 586 edges and 633 vertex of which 73 / 633 are part of one of the 12 SCC in 16 ms
Free SCC test removed 61 places
Drop transitions removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 572 transition count 687
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 506 transition count 687
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 133 place count 506 transition count 659
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 189 place count 478 transition count 659
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 229 place count 438 transition count 619
Iterating global reduction 2 with 40 rules applied. Total rules applied 269 place count 438 transition count 619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 270 place count 438 transition count 618
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 270 place count 438 transition count 617
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 272 place count 437 transition count 617
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 280 place count 429 transition count 609
Iterating global reduction 3 with 8 rules applied. Total rules applied 288 place count 429 transition count 609
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 295 place count 429 transition count 602
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 447 place count 353 transition count 526
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 471 place count 353 transition count 502
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 486 place count 338 transition count 487
Iterating global reduction 5 with 15 rules applied. Total rules applied 501 place count 338 transition count 487
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 504 place count 338 transition count 484
Free-agglomeration rule applied 266 times.
Iterating global reduction 6 with 266 rules applied. Total rules applied 770 place count 338 transition count 218
Reduce places removed 266 places and 0 transitions.
Drop transitions removed 109 transitions
Reduce isomorphic transitions removed 109 transitions.
Iterating post reduction 6 with 375 rules applied. Total rules applied 1145 place count 72 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1146 place count 71 transition count 108
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 60 edges and 70 vertex of which 24 / 70 are part of one of the 12 SCC in 1 ms
Free SCC test removed 12 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 1148 place count 58 transition count 108
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 1172 place count 58 transition count 84
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 12 Pre rules applied. Total rules applied 1172 place count 58 transition count 72
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1196 place count 46 transition count 72
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 1208 place count 46 transition count 60
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 1232 place count 34 transition count 48
Free-agglomeration rule applied 12 times.
Iterating global reduction 10 with 12 rules applied. Total rules applied 1244 place count 34 transition count 36
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 10 with 39 rules applied. Total rules applied 1283 place count 14 transition count 17
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1285 place count 14 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1286 place count 14 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1287 place count 13 transition count 14
Applied a total of 1287 rules in 340 ms. Remains 13 /633 variables (removed 620) and now considering 14/827 (removed 813) transitions.
Finished structural reductions, in 1 iterations. Remains : 13/633 places, 14/827 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=5 )
Computed a total of 16 stabilizing places and 16 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X(p0))))'
Support contains 6 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 827/827 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 614 transition count 808
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 614 transition count 808
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 614 transition count 807
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 56 place count 597 transition count 790
Iterating global reduction 1 with 17 rules applied. Total rules applied 73 place count 597 transition count 790
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 80 place count 597 transition count 783
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 86 place count 591 transition count 777
Iterating global reduction 2 with 6 rules applied. Total rules applied 92 place count 591 transition count 777
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 96 place count 591 transition count 773
Applied a total of 96 rules in 151 ms. Remains 591 /633 variables (removed 42) and now considering 773/827 (removed 54) transitions.
// Phase 1: matrix 773 rows 591 cols
[2022-05-15 14:52:25] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-15 14:52:25] [INFO ] Implicit Places using invariants in 355 ms returned []
// Phase 1: matrix 773 rows 591 cols
[2022-05-15 14:52:25] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-15 14:52:26] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 1082 ms to find 0 implicit places.
// Phase 1: matrix 773 rows 591 cols
[2022-05-15 14:52:26] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-15 14:52:26] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 591/633 places, 773/827 transitions.
Finished structural reductions, in 1 iterations. Remains : 591/633 places, 773/827 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s121 1) (EQ s205 1) (EQ s512 1)) (AND (EQ s550 1) (OR (EQ s569 1) (EQ s585 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][false, false]]
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 4 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-00 finished in 2060 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0 U X(X(p0)))&&p1))))'
Support contains 2 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 827/827 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 613 transition count 807
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 613 transition count 807
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 613 transition count 805
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 59 place count 596 transition count 788
Iterating global reduction 1 with 17 rules applied. Total rules applied 76 place count 596 transition count 788
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 83 place count 596 transition count 781
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 90 place count 589 transition count 774
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 589 transition count 774
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 101 place count 589 transition count 770
Applied a total of 101 rules in 58 ms. Remains 589 /633 variables (removed 44) and now considering 770/827 (removed 57) transitions.
// Phase 1: matrix 770 rows 589 cols
[2022-05-15 14:52:27] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-15 14:52:27] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 770 rows 589 cols
[2022-05-15 14:52:27] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-15 14:52:27] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 968 ms to find 0 implicit places.
// Phase 1: matrix 770 rows 589 cols
[2022-05-15 14:52:28] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-15 14:52:28] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 589/633 places, 770/827 transitions.
Finished structural reductions, in 1 iterations. Remains : 589/633 places, 770/827 transitions.
Stuttering acceptance computed with spot in 347 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=p0, acceptance={0} source=1 dest: 5}, { cond=(NOT p0), acceptance={0} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 6}]], initial=3, aps=[p1:(EQ s495 1), p0:(EQ s548 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, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 82 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-01 finished in 2016 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 633 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 633/633 places, 827/827 transitions.
Graph (trivial) has 594 edges and 633 vertex of which 73 / 633 are part of one of the 12 SCC in 2 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 571 transition count 695
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 139 place count 502 transition count 695
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 139 place count 502 transition count 665
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 199 place count 472 transition count 665
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 242 place count 429 transition count 622
Iterating global reduction 2 with 43 rules applied. Total rules applied 285 place count 429 transition count 622
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 287 place count 429 transition count 620
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 287 place count 429 transition count 619
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 289 place count 428 transition count 619
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 297 place count 420 transition count 611
Iterating global reduction 3 with 8 rules applied. Total rules applied 305 place count 420 transition count 611
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 313 place count 420 transition count 603
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 459 place count 347 transition count 530
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 462 place count 344 transition count 527
Iterating global reduction 4 with 3 rules applied. Total rules applied 465 place count 344 transition count 527
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 468 place count 344 transition count 524
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 480 place count 344 transition count 512
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 482 place count 342 transition count 510
Applied a total of 482 rules in 395 ms. Remains 342 /633 variables (removed 291) and now considering 510/827 (removed 317) transitions.
[2022-05-15 14:52:29] [INFO ] Flow matrix only has 487 transitions (discarded 23 similar events)
// Phase 1: matrix 487 rows 342 cols
[2022-05-15 14:52:29] [INFO ] Computed 14 place invariants in 9 ms
[2022-05-15 14:52:29] [INFO ] Implicit Places using invariants in 328 ms returned []
[2022-05-15 14:52:29] [INFO ] Flow matrix only has 487 transitions (discarded 23 similar events)
// Phase 1: matrix 487 rows 342 cols
[2022-05-15 14:52:29] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:52:30] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
[2022-05-15 14:52:30] [INFO ] Redundant transitions in 48 ms returned []
[2022-05-15 14:52:30] [INFO ] Flow matrix only has 487 transitions (discarded 23 similar events)
// Phase 1: matrix 487 rows 342 cols
[2022-05-15 14:52:30] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-15 14:52:31] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 342/633 places, 510/827 transitions.
Finished structural reductions, in 1 iterations. Remains : 342/633 places, 510/827 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-03 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 s221 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 1 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-03 finished in 2181 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||p1)))'
Support contains 3 out of 633 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 633/633 places, 827/827 transitions.
Graph (trivial) has 589 edges and 633 vertex of which 73 / 633 are part of one of the 12 SCC in 1 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 571 transition count 698
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 505 transition count 698
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 133 place count 505 transition count 668
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 193 place count 475 transition count 668
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 235 place count 433 transition count 626
Iterating global reduction 2 with 42 rules applied. Total rules applied 277 place count 433 transition count 626
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 279 place count 433 transition count 624
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 287 place count 425 transition count 616
Iterating global reduction 3 with 8 rules applied. Total rules applied 295 place count 425 transition count 616
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 303 place count 425 transition count 608
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 451 place count 351 transition count 534
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 454 place count 348 transition count 531
Iterating global reduction 4 with 3 rules applied. Total rules applied 457 place count 348 transition count 531
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 460 place count 348 transition count 528
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 472 place count 348 transition count 516
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 474 place count 346 transition count 514
Applied a total of 474 rules in 282 ms. Remains 346 /633 variables (removed 287) and now considering 514/827 (removed 313) transitions.
[2022-05-15 14:52:31] [INFO ] Flow matrix only has 492 transitions (discarded 22 similar events)
// Phase 1: matrix 492 rows 346 cols
[2022-05-15 14:52:31] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-15 14:52:31] [INFO ] Implicit Places using invariants in 406 ms returned []
[2022-05-15 14:52:31] [INFO ] Flow matrix only has 492 transitions (discarded 22 similar events)
// Phase 1: matrix 492 rows 346 cols
[2022-05-15 14:52:31] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-15 14:52:32] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
[2022-05-15 14:52:32] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-15 14:52:32] [INFO ] Flow matrix only has 492 transitions (discarded 22 similar events)
// Phase 1: matrix 492 rows 346 cols
[2022-05-15 14:52:32] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:52:32] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 346/633 places, 514/827 transitions.
Finished structural reductions, in 1 iterations. Remains : 346/633 places, 514/827 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s29 1) (EQ s92 0)), p1:(EQ s225 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-04 finished in 1795 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((F(p0)||F(p1)||p2)))&&p0)))'
Support contains 3 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 827/827 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 612 transition count 806
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 612 transition count 806
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 612 transition count 804
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 594 transition count 786
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 594 transition count 786
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 87 place count 594 transition count 779
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 94 place count 587 transition count 772
Iterating global reduction 2 with 7 rules applied. Total rules applied 101 place count 587 transition count 772
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 105 place count 587 transition count 768
Applied a total of 105 rules in 91 ms. Remains 587 /633 variables (removed 46) and now considering 768/827 (removed 59) transitions.
// Phase 1: matrix 768 rows 587 cols
[2022-05-15 14:52:33] [INFO ] Computed 14 place invariants in 9 ms
[2022-05-15 14:52:33] [INFO ] Implicit Places using invariants in 530 ms returned []
// Phase 1: matrix 768 rows 587 cols
[2022-05-15 14:52:33] [INFO ] Computed 14 place invariants in 9 ms
[2022-05-15 14:52:34] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1617 ms to find 0 implicit places.
// Phase 1: matrix 768 rows 587 cols
[2022-05-15 14:52:34] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-15 14:52:35] [INFO ] Dead Transitions using invariants and state equation in 871 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 587/633 places, 768/827 transitions.
Finished structural reductions, in 1 iterations. Remains : 587/633 places, 768/827 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s268 0), p1:(EQ s350 0), p2:(EQ s157 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1127 reset in 717 ms.
Product exploration explored 100000 steps with 1128 reset in 434 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 194 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 113 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 270729 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 270729 steps, saw 94433 distinct states, run finished after 3004 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 768 rows 587 cols
[2022-05-15 14:52:40] [INFO ] Computed 14 place invariants in 9 ms
[2022-05-15 14:52:40] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 14:52:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2022-05-15 14:52:41] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 14:52:41] [INFO ] After 564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 97 ms.
[2022-05-15 14:52:41] [INFO ] After 807ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 11 ms.
Support contains 3 out of 587 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 587/587 places, 768/768 transitions.
Graph (trivial) has 524 edges and 587 vertex of which 61 / 587 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Drop transitions removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 536 transition count 649
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 479 transition count 649
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 115 place count 479 transition count 621
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 171 place count 451 transition count 621
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 190 place count 432 transition count 602
Iterating global reduction 2 with 19 rules applied. Total rules applied 209 place count 432 transition count 602
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 210 place count 431 transition count 601
Iterating global reduction 2 with 1 rules applied. Total rules applied 211 place count 431 transition count 601
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 375 place count 349 transition count 519
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 397 place count 349 transition count 497
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 409 place count 337 transition count 485
Iterating global reduction 3 with 12 rules applied. Total rules applied 421 place count 337 transition count 485
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 429 place count 333 transition count 510
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 435 place count 333 transition count 504
Free-agglomeration rule applied 243 times.
Iterating global reduction 3 with 243 rules applied. Total rules applied 678 place count 333 transition count 261
Reduce places removed 243 places and 0 transitions.
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 3 with 324 rules applied. Total rules applied 1002 place count 90 transition count 180
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 1022 place count 90 transition count 160
Applied a total of 1022 rules in 243 ms. Remains 90 /587 variables (removed 497) and now considering 160/768 (removed 608) transitions.
Finished structural reductions, in 1 iterations. Remains : 90/587 places, 160/768 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Finished Best-First random walk after 506 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=253 )
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 4 factoid took 290 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 587 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 587/587 places, 768/768 transitions.
Graph (trivial) has 524 edges and 587 vertex of which 61 / 587 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 535 transition count 658
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 478 transition count 658
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 115 place count 478 transition count 630
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 171 place count 450 transition count 630
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 190 place count 431 transition count 611
Iterating global reduction 2 with 19 rules applied. Total rules applied 209 place count 431 transition count 611
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 210 place count 430 transition count 610
Iterating global reduction 2 with 1 rules applied. Total rules applied 211 place count 430 transition count 610
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 371 place count 350 transition count 530
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 379 place count 346 transition count 557
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 395 place count 346 transition count 541
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 396 place count 345 transition count 540
Applied a total of 396 rules in 132 ms. Remains 345 /587 variables (removed 242) and now considering 540/768 (removed 228) transitions.
[2022-05-15 14:52:42] [INFO ] Flow matrix only has 519 transitions (discarded 21 similar events)
// Phase 1: matrix 519 rows 345 cols
[2022-05-15 14:52:42] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:52:42] [INFO ] Implicit Places using invariants in 247 ms returned []
[2022-05-15 14:52:42] [INFO ] Flow matrix only has 519 transitions (discarded 21 similar events)
// Phase 1: matrix 519 rows 345 cols
[2022-05-15 14:52:42] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:52:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 14:52:43] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 954 ms to find 0 implicit places.
[2022-05-15 14:52:43] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-15 14:52:43] [INFO ] Flow matrix only has 519 transitions (discarded 21 similar events)
// Phase 1: matrix 519 rows 345 cols
[2022-05-15 14:52:43] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-15 14:52:44] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 345/587 places, 540/768 transitions.
Finished structural reductions, in 1 iterations. Remains : 345/587 places, 540/768 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 530 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 438578 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 438578 steps, saw 109829 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 14:52:47] [INFO ] Flow matrix only has 519 transitions (discarded 21 similar events)
// Phase 1: matrix 519 rows 345 cols
[2022-05-15 14:52:47] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-15 14:52:47] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 14:52:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-15 14:52:48] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 14:52:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 14:52:48] [INFO ] After 50ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 14:52:48] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-05-15 14:52:48] [INFO ] After 480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 345 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 345/345 places, 540/540 transitions.
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 345 transition count 518
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 34 place count 333 transition count 504
Iterating global reduction 1 with 12 rules applied. Total rules applied 46 place count 333 transition count 504
Free-agglomeration rule applied 243 times.
Iterating global reduction 1 with 243 rules applied. Total rules applied 289 place count 333 transition count 261
Reduce places removed 245 places and 0 transitions.
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (trivial) has 86 edges and 88 vertex of which 54 / 88 are part of one of the 12 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 329 rules applied. Total rules applied 618 place count 46 transition count 178
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 78 rules applied. Total rules applied 696 place count 44 transition count 102
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 702 place count 42 transition count 98
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 704 place count 40 transition count 98
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 708 place count 38 transition count 96
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 712 place count 38 transition count 92
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 733 place count 38 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 734 place count 37 transition count 70
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 6 with 41 rules applied. Total rules applied 775 place count 28 transition count 38
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 32 rules applied. Total rules applied 807 place count 12 transition count 22
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 813 place count 12 transition count 16
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 815 place count 12 transition count 16
Applied a total of 815 rules in 51 ms. Remains 12 /345 variables (removed 333) and now considering 16/540 (removed 524) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/345 places, 16/540 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Finished Best-First random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 5 factoid took 259 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5141 reset in 757 ms.
Product exploration explored 100000 steps with 5135 reset in 630 ms.
Built C files in :
/tmp/ltsmin7810511320124371267
[2022-05-15 14:52:50] [INFO ] Computing symmetric may disable matrix : 540 transitions.
[2022-05-15 14:52:50] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:52:50] [INFO ] Computing symmetric may enable matrix : 540 transitions.
[2022-05-15 14:52:50] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:52:50] [INFO ] Computing Do-Not-Accords matrix : 540 transitions.
[2022-05-15 14:52:50] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:52:50] [INFO ] Built C files in 197ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7810511320124371267
Running compilation step : cd /tmp/ltsmin7810511320124371267;'/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 2401 ms.
Running link step : cd /tmp/ltsmin7810511320124371267;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin7810511320124371267;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6688832199769748729.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 345/345 places, 540/540 transitions.
Applied a total of 0 rules in 32 ms. Remains 345 /345 variables (removed 0) and now considering 540/540 (removed 0) transitions.
[2022-05-15 14:53:05] [INFO ] Flow matrix only has 519 transitions (discarded 21 similar events)
// Phase 1: matrix 519 rows 345 cols
[2022-05-15 14:53:05] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-15 14:53:05] [INFO ] Implicit Places using invariants in 268 ms returned []
[2022-05-15 14:53:05] [INFO ] Flow matrix only has 519 transitions (discarded 21 similar events)
// Phase 1: matrix 519 rows 345 cols
[2022-05-15 14:53:05] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:53:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 14:53:06] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
[2022-05-15 14:53:06] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-15 14:53:06] [INFO ] Flow matrix only has 519 transitions (discarded 21 similar events)
// Phase 1: matrix 519 rows 345 cols
[2022-05-15 14:53:06] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:53:06] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 345/345 places, 540/540 transitions.
Built C files in :
/tmp/ltsmin16500450216617960026
[2022-05-15 14:53:06] [INFO ] Computing symmetric may disable matrix : 540 transitions.
[2022-05-15 14:53:06] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:53:06] [INFO ] Computing symmetric may enable matrix : 540 transitions.
[2022-05-15 14:53:06] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:53:06] [INFO ] Computing Do-Not-Accords matrix : 540 transitions.
[2022-05-15 14:53:06] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:53:06] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16500450216617960026
Running compilation step : cd /tmp/ltsmin16500450216617960026;'/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 1931 ms.
Running link step : cd /tmp/ltsmin16500450216617960026;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin16500450216617960026;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6883531521726980189.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 14:53:21] [INFO ] Flatten gal took : 43 ms
[2022-05-15 14:53:21] [INFO ] Flatten gal took : 40 ms
[2022-05-15 14:53:21] [INFO ] Time to serialize gal into /tmp/LTL16395323027501163495.gal : 10 ms
[2022-05-15 14:53:21] [INFO ] Time to serialize properties into /tmp/LTL17367240816090759573.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/LTL16395323027501163495.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17367240816090759573.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/LTL1639532...268
Read 1 LTL properties
Checking formula 0 : !((X((F(G(((F("(p815==0)"))||(F("(p1065==0)")))||("(p467==0)"))))&&("(p815==0)"))))
Formula 0 simplified : !X("(p815==0)" & FG("(p467==0)" | F"(p815==0)" | F"(p1065==0)"))
Detected timeout of ITS tools.
[2022-05-15 14:53:37] [INFO ] Flatten gal took : 36 ms
[2022-05-15 14:53:37] [INFO ] Applying decomposition
[2022-05-15 14:53:37] [INFO ] Flatten gal took : 35 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/graph5302607132588649783.txt' '-o' '/tmp/graph5302607132588649783.bin' '-w' '/tmp/graph5302607132588649783.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5302607132588649783.bin' '-l' '-1' '-v' '-w' '/tmp/graph5302607132588649783.weights' '-q' '0' '-e' '0.001'
[2022-05-15 14:53:37] [INFO ] Decomposing Gal with order
[2022-05-15 14:53:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 14:53:37] [INFO ] Removed a total of 303 redundant transitions.
[2022-05-15 14:53:37] [INFO ] Flatten gal took : 228 ms
[2022-05-15 14:53:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 163 labels/synchronizations in 29 ms.
[2022-05-15 14:53:37] [INFO ] Time to serialize gal into /tmp/LTL10328666604217865895.gal : 10 ms
[2022-05-15 14:53:37] [INFO ] Time to serialize properties into /tmp/LTL17034748740361259597.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/LTL10328666604217865895.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17034748740361259597.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/LTL1032866...247
Read 1 LTL properties
Checking formula 0 : !((X((F(G(((F("(i6.u18.p815==0)"))||(F("(i9.u27.p1065==0)")))||("(i3.u10.p467==0)"))))&&("(i6.u18.p815==0)"))))
Formula 0 simplified : !X("(i6.u18.p815==0)" & FG("(i3.u10.p467==0)" | F"(i6.u18.p815==0)" | F"(i9.u27.p1065==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6318452211487105558
[2022-05-15 14:53:52] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6318452211487105558
Running compilation step : cd /tmp/ltsmin6318452211487105558;'/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 1173 ms.
Running link step : cd /tmp/ltsmin6318452211487105558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6318452211487105558;'/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))||<>((LTLAPp1==true))||(LTLAPp2==true))))&&(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-05 finished in 94824 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)&&p1)) U (X(G((p2 U p3)))&&p1)))'
Support contains 5 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 827/827 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 614 transition count 808
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 614 transition count 808
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 614 transition count 806
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 56 place count 598 transition count 790
Iterating global reduction 1 with 16 rules applied. Total rules applied 72 place count 598 transition count 790
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 79 place count 598 transition count 783
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 85 place count 592 transition count 777
Iterating global reduction 2 with 6 rules applied. Total rules applied 91 place count 592 transition count 777
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 592 transition count 774
Applied a total of 94 rules in 54 ms. Remains 592 /633 variables (removed 41) and now considering 774/827 (removed 53) transitions.
// Phase 1: matrix 774 rows 592 cols
[2022-05-15 14:54:07] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:54:08] [INFO ] Implicit Places using invariants in 414 ms returned []
// Phase 1: matrix 774 rows 592 cols
[2022-05-15 14:54:08] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-15 14:54:09] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
// Phase 1: matrix 774 rows 592 cols
[2022-05-15 14:54:09] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:54:09] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 592/633 places, 774/827 transitions.
Finished structural reductions, in 1 iterations. Remains : 592/633 places, 774/827 transitions.
Stuttering acceptance computed with spot in 597 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p0)), (NOT p3), true, (NOT p0), (NOT p3), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(OR p3 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 5}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 7}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=2 dest: 9}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=6 dest: 5}, { cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=8 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={} source=8 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=9 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=9 dest: 1}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0} source=9 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p3) p2), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p1:(EQ s232 1), p0:(AND (EQ s297 1) (EQ s586 1)), p3:(EQ s317 1), p2:(NEQ s538 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-06 finished in 2440 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U X(p0)) U G(!(X(!p0)||p1)))))'
Support contains 3 out of 633 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 633/633 places, 827/827 transitions.
Graph (trivial) has 469 edges and 633 vertex of which 73 / 633 are part of one of the 12 SCC in 1 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 571 transition count 698
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 505 transition count 698
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 133 place count 505 transition count 666
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 197 place count 473 transition count 666
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 240 place count 430 transition count 623
Iterating global reduction 2 with 43 rules applied. Total rules applied 283 place count 430 transition count 623
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 285 place count 430 transition count 621
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 294 place count 421 transition count 612
Iterating global reduction 3 with 9 rules applied. Total rules applied 303 place count 421 transition count 612
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 311 place count 421 transition count 604
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 457 place count 348 transition count 531
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 460 place count 345 transition count 528
Iterating global reduction 4 with 3 rules applied. Total rules applied 463 place count 345 transition count 528
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 466 place count 345 transition count 525
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 468 place count 343 transition count 523
Applied a total of 468 rules in 142 ms. Remains 343 /633 variables (removed 290) and now considering 523/827 (removed 304) transitions.
[2022-05-15 14:54:10] [INFO ] Flow matrix only has 489 transitions (discarded 34 similar events)
// Phase 1: matrix 489 rows 343 cols
[2022-05-15 14:54:10] [INFO ] Computed 14 place invariants in 7 ms
[2022-05-15 14:54:10] [INFO ] Implicit Places using invariants in 386 ms returned []
[2022-05-15 14:54:10] [INFO ] Flow matrix only has 489 transitions (discarded 34 similar events)
// Phase 1: matrix 489 rows 343 cols
[2022-05-15 14:54:10] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-15 14:54:11] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 1090 ms to find 0 implicit places.
[2022-05-15 14:54:11] [INFO ] Redundant transitions in 35 ms returned []
[2022-05-15 14:54:11] [INFO ] Flow matrix only has 489 transitions (discarded 34 similar events)
// Phase 1: matrix 489 rows 343 cols
[2022-05-15 14:54:11] [INFO ] Computed 14 place invariants in 7 ms
[2022-05-15 14:54:12] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 343/633 places, 523/827 transitions.
Finished structural reductions, in 1 iterations. Remains : 343/633 places, 523/827 transitions.
Stuttering acceptance computed with spot in 46 ms :[(OR (NOT p0) p1)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(OR p1 (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s50 1) (EQ s340 1)), p0:(EQ s126 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-07 finished in 1959 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(p1))||X(F(p2))))'
Support contains 3 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 827/827 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 613 transition count 807
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 613 transition count 807
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 613 transition count 805
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 58 place count 597 transition count 789
Iterating global reduction 1 with 16 rules applied. Total rules applied 74 place count 597 transition count 789
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 81 place count 597 transition count 782
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 87 place count 591 transition count 776
Iterating global reduction 2 with 6 rules applied. Total rules applied 93 place count 591 transition count 776
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 96 place count 591 transition count 773
Applied a total of 96 rules in 69 ms. Remains 591 /633 variables (removed 42) and now considering 773/827 (removed 54) transitions.
// Phase 1: matrix 773 rows 591 cols
[2022-05-15 14:54:12] [INFO ] Computed 14 place invariants in 9 ms
[2022-05-15 14:54:12] [INFO ] Implicit Places using invariants in 507 ms returned []
// Phase 1: matrix 773 rows 591 cols
[2022-05-15 14:54:12] [INFO ] Computed 14 place invariants in 14 ms
[2022-05-15 14:54:13] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned []
Implicit Place search using SMT with State Equation took 1658 ms to find 0 implicit places.
// Phase 1: matrix 773 rows 591 cols
[2022-05-15 14:54:13] [INFO ] Computed 14 place invariants in 13 ms
[2022-05-15 14:54:14] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 591/633 places, 773/827 transitions.
Finished structural reductions, in 1 iterations. Remains : 591/633 places, 773/827 transitions.
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s555 1), p1:(EQ s204 1), p2:(EQ s100 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 987 ms.
Product exploration explored 100000 steps with 50000 reset in 830 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 9 factoid took 235 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-09 finished in 4889 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U p1))'
Support contains 3 out of 633 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 633/633 places, 827/827 transitions.
Graph (trivial) has 589 edges and 633 vertex of which 73 / 633 are part of one of the 12 SCC in 2 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 571 transition count 699
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 506 transition count 699
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 131 place count 506 transition count 668
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 193 place count 475 transition count 668
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 236 place count 432 transition count 625
Iterating global reduction 2 with 43 rules applied. Total rules applied 279 place count 432 transition count 625
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 281 place count 432 transition count 623
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 290 place count 423 transition count 614
Iterating global reduction 3 with 9 rules applied. Total rules applied 299 place count 423 transition count 614
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 308 place count 423 transition count 605
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 454 place count 350 transition count 532
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 457 place count 347 transition count 529
Iterating global reduction 4 with 3 rules applied. Total rules applied 460 place count 347 transition count 529
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 463 place count 347 transition count 526
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 475 place count 347 transition count 514
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 477 place count 345 transition count 512
Applied a total of 477 rules in 185 ms. Remains 345 /633 variables (removed 288) and now considering 512/827 (removed 315) transitions.
[2022-05-15 14:54:17] [INFO ] Flow matrix only has 489 transitions (discarded 23 similar events)
// Phase 1: matrix 489 rows 345 cols
[2022-05-15 14:54:17] [INFO ] Computed 14 place invariants in 7 ms
[2022-05-15 14:54:17] [INFO ] Implicit Places using invariants in 380 ms returned []
[2022-05-15 14:54:17] [INFO ] Flow matrix only has 489 transitions (discarded 23 similar events)
// Phase 1: matrix 489 rows 345 cols
[2022-05-15 14:54:17] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-15 14:54:18] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
[2022-05-15 14:54:18] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-15 14:54:18] [INFO ] Flow matrix only has 489 transitions (discarded 23 similar events)
// Phase 1: matrix 489 rows 345 cols
[2022-05-15 14:54:18] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-15 14:54:18] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 345/633 places, 512/827 transitions.
Finished structural reductions, in 1 iterations. Remains : 345/633 places, 512/827 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (EQ s52 1) (EQ s71 1)) (AND (EQ s52 1) (EQ s277 1))), p0:(EQ s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-10 finished in 1496 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0 U X(p1)))&&G(p2)&&p3)))'
Support contains 3 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 827/827 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 613 transition count 807
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 613 transition count 807
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 613 transition count 805
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 59 place count 596 transition count 788
Iterating global reduction 1 with 17 rules applied. Total rules applied 76 place count 596 transition count 788
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 83 place count 596 transition count 781
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 90 place count 589 transition count 774
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 589 transition count 774
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 101 place count 589 transition count 770
Applied a total of 101 rules in 91 ms. Remains 589 /633 variables (removed 44) and now considering 770/827 (removed 57) transitions.
// Phase 1: matrix 770 rows 589 cols
[2022-05-15 14:54:18] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-15 14:54:19] [INFO ] Implicit Places using invariants in 592 ms returned []
// Phase 1: matrix 770 rows 589 cols
[2022-05-15 14:54:19] [INFO ] Computed 14 place invariants in 9 ms
[2022-05-15 14:54:20] [INFO ] Implicit Places using invariants and state equation in 1089 ms returned []
Implicit Place search using SMT with State Equation took 1686 ms to find 0 implicit places.
// Phase 1: matrix 770 rows 589 cols
[2022-05-15 14:54:20] [INFO ] Computed 14 place invariants in 10 ms
[2022-05-15 14:54:21] [INFO ] Dead Transitions using invariants and state equation in 867 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 589/633 places, 770/827 transitions.
Finished structural reductions, in 1 iterations. Remains : 589/633 places, 770/827 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p2) (NOT p1) (NOT p3)), true]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 6}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 3}, { cond=(NOT p2), acceptance={0} source=1 dest: 6}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(AND p3 p2), acceptance={} source=4 dest: 0}, { cond=(OR (NOT p3) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p2:(EQ s583 1), p0:(OR (EQ s583 1) (EQ s90 1)), p1:(AND (EQ s237 1) (EQ s583 1)), p3:(EQ s90 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-12 finished in 3025 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(G(p1))))))'
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 827/827 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 613 transition count 807
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 613 transition count 807
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 613 transition count 806
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 59 place count 595 transition count 788
Iterating global reduction 1 with 18 rules applied. Total rules applied 77 place count 595 transition count 788
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 85 place count 595 transition count 780
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 91 place count 589 transition count 774
Iterating global reduction 2 with 6 rules applied. Total rules applied 97 place count 589 transition count 774
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 100 place count 589 transition count 771
Applied a total of 100 rules in 82 ms. Remains 589 /633 variables (removed 44) and now considering 771/827 (removed 56) transitions.
// Phase 1: matrix 771 rows 589 cols
[2022-05-15 14:54:21] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-15 14:54:22] [INFO ] Implicit Places using invariants in 600 ms returned []
// Phase 1: matrix 771 rows 589 cols
[2022-05-15 14:54:22] [INFO ] Computed 14 place invariants in 11 ms
[2022-05-15 14:54:23] [INFO ] Implicit Places using invariants and state equation in 971 ms returned []
Implicit Place search using SMT with State Equation took 1579 ms to find 0 implicit places.
// Phase 1: matrix 771 rows 589 cols
[2022-05-15 14:54:23] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-15 14:54:24] [INFO ] Dead Transitions using invariants and state equation in 813 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 589/633 places, 771/827 transitions.
Finished structural reductions, in 1 iterations. Remains : 589/633 places, 771/827 transitions.
Stuttering acceptance computed with spot in 251 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}], [{ cond=(NOT p0), acceptance={} source=6 dest: 7}, { cond=p0, acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={} source=7 dest: 4}], [{ cond=(NOT p0), acceptance={} source=8 dest: 4}, { cond=p0, acceptance={} source=8 dest: 5}]], initial=6, aps=[p1:(OR (NEQ s306 1) (NEQ s397 1) (NEQ s569 1)), p0:(EQ s350 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1126 reset in 301 ms.
Product exploration explored 100000 steps with 1128 reset in 404 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 9 states, 17 edges and 2 AP to 7 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 112 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 771 rows 589 cols
[2022-05-15 14:54:26] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-15 14:54:26] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 14:54:26] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2022-05-15 14:54:27] [INFO ] After 603ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 14:54:27] [INFO ] After 836ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 137 ms.
[2022-05-15 14:54:27] [INFO ] After 1232ms 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 14 ms.
Support contains 4 out of 589 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 589/589 places, 771/771 transitions.
Graph (trivial) has 546 edges and 589 vertex of which 73 / 589 are part of one of the 12 SCC in 0 ms
Free SCC test removed 61 places
Drop transitions removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 528 transition count 640
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 471 transition count 640
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 115 place count 471 transition count 614
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 167 place count 445 transition count 614
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 190 place count 422 transition count 591
Iterating global reduction 2 with 23 rules applied. Total rules applied 213 place count 422 transition count 591
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 214 place count 421 transition count 590
Iterating global reduction 2 with 1 rules applied. Total rules applied 215 place count 421 transition count 590
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 367 place count 345 transition count 514
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 391 place count 345 transition count 490
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 403 place count 333 transition count 478
Iterating global reduction 3 with 12 rules applied. Total rules applied 415 place count 333 transition count 478
Free-agglomeration rule applied 265 times.
Iterating global reduction 3 with 265 rules applied. Total rules applied 680 place count 333 transition count 213
Reduce places removed 265 places and 0 transitions.
Drop transitions removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Iterating post reduction 3 with 375 rules applied. Total rules applied 1055 place count 68 transition count 103
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1056 place count 67 transition count 102
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 60 edges and 66 vertex of which 24 / 66 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 1058 place count 54 transition count 102
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 1082 place count 54 transition count 78
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1082 place count 54 transition count 66
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1106 place count 42 transition count 66
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1118 place count 42 transition count 54
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1142 place count 30 transition count 42
Free-agglomeration rule applied 12 times.
Iterating global reduction 7 with 12 rules applied. Total rules applied 1154 place count 30 transition count 30
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 41 rules applied. Total rules applied 1195 place count 9 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1196 place count 9 transition count 9
Applied a total of 1196 rules in 130 ms. Remains 9 /589 variables (removed 580) and now considering 9/771 (removed 762) transitions.
Finished structural reductions, in 1 iterations. Remains : 9/589 places, 9/771 transitions.
Finished random walk after 16 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p1 p0), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (NOT (AND p1 p0))), (F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 434 ms. Reduced automaton from 7 states, 12 edges and 2 AP to 7 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 771/771 transitions.
Applied a total of 0 rules in 10 ms. Remains 589 /589 variables (removed 0) and now considering 771/771 (removed 0) transitions.
// Phase 1: matrix 771 rows 589 cols
[2022-05-15 14:54:28] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:54:29] [INFO ] Implicit Places using invariants in 398 ms returned []
// Phase 1: matrix 771 rows 589 cols
[2022-05-15 14:54:29] [INFO ] Computed 14 place invariants in 9 ms
[2022-05-15 14:54:30] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1363 ms to find 0 implicit places.
// Phase 1: matrix 771 rows 589 cols
[2022-05-15 14:54:30] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:54:30] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 589/589 places, 771/771 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 7 states, 12 edges and 2 AP to 7 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 113 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 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 13 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 771 rows 589 cols
[2022-05-15 14:54:31] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-15 14:54:31] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 14:54:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-05-15 14:54:32] [INFO ] After 488ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 14:54:32] [INFO ] After 683ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 112 ms.
[2022-05-15 14:54:32] [INFO ] After 1002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 77 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=19 )
Parikh walk visited 3 properties in 4 ms.
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (NOT (AND p1 p0))), (F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 292 ms. Reduced automaton from 7 states, 12 edges and 2 AP to 7 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 276 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 274 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1125 reset in 263 ms.
Product exploration explored 100000 steps with 1126 reset in 288 ms.
Applying partial POR strategy [true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 273 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 589 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 589/589 places, 771/771 transitions.
Graph (trivial) has 546 edges and 589 vertex of which 73 / 589 are part of one of the 12 SCC in 0 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 528 transition count 709
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 34 Pre rules applied. Total rules applied 48 place count 528 transition count 709
Deduced a syphon composed of 81 places in 1 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 82 place count 528 transition count 709
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 137 place count 473 transition count 654
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 1 with 55 rules applied. Total rules applied 192 place count 473 transition count 654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 193 place count 472 transition count 653
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 472 transition count 653
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 260 place count 472 transition count 677
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 289 place count 443 transition count 648
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 318 place count 443 transition count 648
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 330 place count 443 transition count 672
Deduced a syphon composed of 98 places in 0 ms
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 354 place count 443 transition count 648
Deduced a syphon composed of 98 places in 1 ms
Applied a total of 354 rules in 284 ms. Remains 443 /589 variables (removed 146) and now considering 648/771 (removed 123) transitions.
[2022-05-15 14:54:35] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-15 14:54:35] [INFO ] Flow matrix only has 625 transitions (discarded 23 similar events)
// Phase 1: matrix 625 rows 443 cols
[2022-05-15 14:54:35] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:54:35] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 443/589 places, 648/771 transitions.
Finished structural reductions, in 1 iterations. Remains : 443/589 places, 648/771 transitions.
Product exploration explored 100000 steps with 4053 reset in 987 ms.
Product exploration explored 100000 steps with 4052 reset in 870 ms.
Built C files in :
/tmp/ltsmin11513227135795230916
[2022-05-15 14:54:37] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11513227135795230916
Running compilation step : cd /tmp/ltsmin11513227135795230916;'/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 1833 ms.
Running link step : cd /tmp/ltsmin11513227135795230916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11513227135795230916;'/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/stateBased8493399792237811003.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 771/771 transitions.
Applied a total of 0 rules in 11 ms. Remains 589 /589 variables (removed 0) and now considering 771/771 (removed 0) transitions.
// Phase 1: matrix 771 rows 589 cols
[2022-05-15 14:54:52] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-15 14:54:53] [INFO ] Implicit Places using invariants in 567 ms returned []
// Phase 1: matrix 771 rows 589 cols
[2022-05-15 14:54:53] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:54:54] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
// Phase 1: matrix 771 rows 589 cols
[2022-05-15 14:54:54] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:54:55] [INFO ] Dead Transitions using invariants and state equation in 773 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 589/589 places, 771/771 transitions.
Built C files in :
/tmp/ltsmin1067068694905471885
[2022-05-15 14:54:55] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1067068694905471885
Running compilation step : cd /tmp/ltsmin1067068694905471885;'/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 1889 ms.
Running link step : cd /tmp/ltsmin1067068694905471885;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1067068694905471885;'/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/stateBased10343170234707023853.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 14:55:10] [INFO ] Flatten gal took : 38 ms
[2022-05-15 14:55:10] [INFO ] Flatten gal took : 46 ms
[2022-05-15 14:55:10] [INFO ] Time to serialize gal into /tmp/LTL18268751225809241284.gal : 5 ms
[2022-05-15 14:55:10] [INFO ] Time to serialize properties into /tmp/LTL17512567437436897652.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/LTL18268751225809241284.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17512567437436897652.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/LTL1826875...268
Read 1 LTL properties
Checking formula 0 : !(((G("(p1090==0)"))||(X(X(X(G("(((p936!=1)||(p1245!=1))||(p1904!=1))")))))))
Formula 0 simplified : !(G"(p1090==0)" | XXXG"(((p936!=1)||(p1245!=1))||(p1904!=1))")
Detected timeout of ITS tools.
[2022-05-15 14:55:25] [INFO ] Flatten gal took : 34 ms
[2022-05-15 14:55:25] [INFO ] Applying decomposition
[2022-05-15 14:55:25] [INFO ] Flatten gal took : 32 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/graph10723004360827588513.txt' '-o' '/tmp/graph10723004360827588513.bin' '-w' '/tmp/graph10723004360827588513.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10723004360827588513.bin' '-l' '-1' '-v' '-w' '/tmp/graph10723004360827588513.weights' '-q' '0' '-e' '0.001'
[2022-05-15 14:55:25] [INFO ] Decomposing Gal with order
[2022-05-15 14:55:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 14:55:25] [INFO ] Removed a total of 216 redundant transitions.
[2022-05-15 14:55:25] [INFO ] Flatten gal took : 157 ms
[2022-05-15 14:55:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 25 ms.
[2022-05-15 14:55:25] [INFO ] Time to serialize gal into /tmp/LTL8061103878993590988.gal : 14 ms
[2022-05-15 14:55:25] [INFO ] Time to serialize properties into /tmp/LTL4788918712941331092.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/LTL8061103878993590988.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4788918712941331092.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/LTL8061103...245
Read 1 LTL properties
Checking formula 0 : !(((G("(i11.u98.p1090==0)"))||(X(X(X(G("(((i9.i0.i1.u80.p936!=1)||(i12.u117.p1245!=1))||(u128.p1904!=1))")))))))
Formula 0 simplified : !(G"(i11.u98.p1090==0)" | XXXG"(((i9.i0.i1.u80.p936!=1)||(i12.u117.p1245!=1))||(u128.p1904!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4883916310015197297
[2022-05-15 14:55:40] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4883916310015197297
Running compilation step : cd /tmp/ltsmin4883916310015197297;'/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 1980 ms.
Running link step : cd /tmp/ltsmin4883916310015197297;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4883916310015197297;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(X(X([]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-14 finished in 94319 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((((F(p0)&&F(p1)) U X(!p2))||F(p1))) U p3))'
Support contains 4 out of 633 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 633/633 places, 827/827 transitions.
Graph (trivial) has 463 edges and 633 vertex of which 73 / 633 are part of one of the 12 SCC in 1 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 571 transition count 701
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 508 transition count 701
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 127 place count 508 transition count 670
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 189 place count 477 transition count 670
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 231 place count 435 transition count 628
Iterating global reduction 2 with 42 rules applied. Total rules applied 273 place count 435 transition count 628
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 275 place count 435 transition count 626
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 284 place count 426 transition count 617
Iterating global reduction 3 with 9 rules applied. Total rules applied 293 place count 426 transition count 617
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 301 place count 426 transition count 609
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 447 place count 353 transition count 536
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 450 place count 350 transition count 533
Iterating global reduction 4 with 3 rules applied. Total rules applied 453 place count 350 transition count 533
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 456 place count 350 transition count 530
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 458 place count 348 transition count 528
Applied a total of 458 rules in 91 ms. Remains 348 /633 variables (removed 285) and now considering 528/827 (removed 299) transitions.
[2022-05-15 14:55:56] [INFO ] Flow matrix only has 496 transitions (discarded 32 similar events)
// Phase 1: matrix 496 rows 348 cols
[2022-05-15 14:55:56] [INFO ] Computed 14 place invariants in 7 ms
[2022-05-15 14:55:56] [INFO ] Implicit Places using invariants in 341 ms returned []
[2022-05-15 14:55:56] [INFO ] Flow matrix only has 496 transitions (discarded 32 similar events)
// Phase 1: matrix 496 rows 348 cols
[2022-05-15 14:55:56] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-15 14:55:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 14:55:56] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 961 ms to find 0 implicit places.
[2022-05-15 14:55:57] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-15 14:55:57] [INFO ] Flow matrix only has 496 transitions (discarded 32 similar events)
// Phase 1: matrix 496 rows 348 cols
[2022-05-15 14:55:57] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-15 14:55:57] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 348/633 places, 528/827 transitions.
Finished structural reductions, in 1 iterations. Remains : 348/633 places, 528/827 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p3), (AND (NOT p1) p2)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}]], initial=0, aps=[p3:(EQ s344 1), p1:(EQ s18 1), p2:(AND (EQ s178 1) (EQ s347 1))], nbAcceptance=0, 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-12b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-15 finished in 1833 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((F(p0)||F(p1)||p2)))&&p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(G(p1))))))'
Found a SL insensitive property : FlexibleBarrier-PT-12b-LTLFireability-14
Stuttering acceptance computed with spot in 398 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 633/633 places, 827/827 transitions.
Graph (trivial) has 590 edges and 633 vertex of which 73 / 633 are part of one of the 12 SCC in 1 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 571 transition count 696
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 503 transition count 696
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 137 place count 503 transition count 667
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 195 place count 474 transition count 667
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 237 place count 432 transition count 625
Iterating global reduction 2 with 42 rules applied. Total rules applied 279 place count 432 transition count 625
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 280 place count 432 transition count 624
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 280 place count 432 transition count 623
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 282 place count 431 transition count 623
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 291 place count 422 transition count 614
Iterating global reduction 3 with 9 rules applied. Total rules applied 300 place count 422 transition count 614
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 308 place count 422 transition count 606
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 454 place count 349 transition count 533
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 457 place count 346 transition count 530
Iterating global reduction 4 with 3 rules applied. Total rules applied 460 place count 346 transition count 530
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 463 place count 346 transition count 527
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 475 place count 346 transition count 515
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 477 place count 344 transition count 513
Applied a total of 477 rules in 133 ms. Remains 344 /633 variables (removed 289) and now considering 513/827 (removed 314) transitions.
[2022-05-15 14:55:58] [INFO ] Flow matrix only has 490 transitions (discarded 23 similar events)
// Phase 1: matrix 490 rows 344 cols
[2022-05-15 14:55:58] [INFO ] Computed 14 place invariants in 7 ms
[2022-05-15 14:55:59] [INFO ] Implicit Places using invariants in 511 ms returned []
[2022-05-15 14:55:59] [INFO ] Flow matrix only has 490 transitions (discarded 23 similar events)
// Phase 1: matrix 490 rows 344 cols
[2022-05-15 14:55:59] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:55:59] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 1192 ms to find 0 implicit places.
[2022-05-15 14:55:59] [INFO ] Flow matrix only has 490 transitions (discarded 23 similar events)
// Phase 1: matrix 490 rows 344 cols
[2022-05-15 14:55:59] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-15 14:56:00] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 344/633 places, 513/827 transitions.
Finished structural reductions, in 1 iterations. Remains : 344/633 places, 513/827 transitions.
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}], [{ cond=(NOT p0), acceptance={} source=6 dest: 7}, { cond=p0, acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={} source=7 dest: 4}], [{ cond=(NOT p0), acceptance={} source=8 dest: 4}, { cond=p0, acceptance={} source=8 dest: 5}]], initial=6, aps=[p1:(OR (NEQ s142 1) (NEQ s190 1) (NEQ s328 1)), p0:(EQ s163 0)], 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, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5376 reset in 953 ms.
Product exploration explored 100000 steps with 5394 reset in 859 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 p1 p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 9 states, 17 edges and 2 AP to 7 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 557 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-15 14:56:02] [INFO ] Flow matrix only has 490 transitions (discarded 23 similar events)
// Phase 1: matrix 490 rows 344 cols
[2022-05-15 14:56:02] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-15 14:56:03] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 14:56:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-05-15 14:56:03] [INFO ] After 378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 14:56:03] [INFO ] After 536ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 94 ms.
[2022-05-15 14:56:03] [INFO ] After 803ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 344 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 344/344 places, 513/513 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 344 transition count 489
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 36 place count 332 transition count 477
Iterating global reduction 1 with 12 rules applied. Total rules applied 48 place count 332 transition count 477
Free-agglomeration rule applied 265 times.
Iterating global reduction 1 with 265 rules applied. Total rules applied 313 place count 332 transition count 212
Reduce places removed 266 places and 0 transitions.
Drop transitions removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Graph (trivial) has 60 edges and 66 vertex of which 24 / 66 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 1 with 377 rules applied. Total rules applied 690 place count 54 transition count 102
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 714 place count 54 transition count 78
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 714 place count 54 transition count 66
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 738 place count 42 transition count 66
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 750 place count 42 transition count 54
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 774 place count 30 transition count 42
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 786 place count 30 transition count 30
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 41 rules applied. Total rules applied 827 place count 9 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 828 place count 9 transition count 9
Applied a total of 828 rules in 51 ms. Remains 9 /344 variables (removed 335) and now considering 9/513 (removed 504) transitions.
Finished structural reductions, in 1 iterations. Remains : 9/344 places, 9/513 transitions.
Finished random walk after 18 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p1 p0), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (NOT (AND p1 p0))), (F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 295 ms. Reduced automaton from 7 states, 12 edges and 2 AP to 7 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 344 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 513/513 transitions.
Applied a total of 0 rules in 4 ms. Remains 344 /344 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2022-05-15 14:56:04] [INFO ] Flow matrix only has 490 transitions (discarded 23 similar events)
// Phase 1: matrix 490 rows 344 cols
[2022-05-15 14:56:04] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:56:04] [INFO ] Implicit Places using invariants in 309 ms returned []
[2022-05-15 14:56:04] [INFO ] Flow matrix only has 490 transitions (discarded 23 similar events)
// Phase 1: matrix 490 rows 344 cols
[2022-05-15 14:56:05] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-15 14:56:05] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
[2022-05-15 14:56:05] [INFO ] Flow matrix only has 490 transitions (discarded 23 similar events)
// Phase 1: matrix 490 rows 344 cols
[2022-05-15 14:56:05] [INFO ] Computed 14 place invariants in 7 ms
[2022-05-15 14:56:06] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 344/344 places, 513/513 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 p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 7 states, 12 edges and 2 AP to 7 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 296 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 557 resets, run finished after 481 ms. (steps per millisecond=20 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-15 14:56:07] [INFO ] Flow matrix only has 490 transitions (discarded 23 similar events)
// Phase 1: matrix 490 rows 344 cols
[2022-05-15 14:56:07] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-15 14:56:07] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 14:56:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-15 14:56:08] [INFO ] After 350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 14:56:08] [INFO ] After 508ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 94 ms.
[2022-05-15 14:56:08] [INFO ] After 741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 344 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 344/344 places, 513/513 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 344 transition count 489
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 36 place count 332 transition count 477
Iterating global reduction 1 with 12 rules applied. Total rules applied 48 place count 332 transition count 477
Free-agglomeration rule applied 265 times.
Iterating global reduction 1 with 265 rules applied. Total rules applied 313 place count 332 transition count 212
Reduce places removed 266 places and 0 transitions.
Drop transitions removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Graph (trivial) has 60 edges and 66 vertex of which 24 / 66 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 1 with 377 rules applied. Total rules applied 690 place count 54 transition count 102
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 714 place count 54 transition count 78
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 714 place count 54 transition count 66
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 738 place count 42 transition count 66
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 750 place count 42 transition count 54
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 774 place count 30 transition count 42
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 786 place count 30 transition count 30
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 41 rules applied. Total rules applied 827 place count 9 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 828 place count 9 transition count 9
Applied a total of 828 rules in 64 ms. Remains 9 /344 variables (removed 335) and now considering 9/513 (removed 504) transitions.
Finished structural reductions, in 1 iterations. Remains : 9/344 places, 9/513 transitions.
Finished random walk after 8 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (NOT (AND p1 p0))), (F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 293 ms. Reduced automaton from 7 states, 12 edges and 2 AP to 7 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 305 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 5415 reset in 864 ms.
Product exploration explored 100000 steps with 5431 reset in 675 ms.
Applying partial POR strategy [true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 344 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 344/344 places, 513/513 transitions.
Applied a total of 0 rules in 20 ms. Remains 344 /344 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2022-05-15 14:56:11] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-15 14:56:11] [INFO ] Flow matrix only has 490 transitions (discarded 23 similar events)
// Phase 1: matrix 490 rows 344 cols
[2022-05-15 14:56:11] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-15 14:56:11] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 344/344 places, 513/513 transitions.
Product exploration explored 100000 steps with 5394 reset in 1120 ms.
Product exploration explored 100000 steps with 5381 reset in 1427 ms.
Built C files in :
/tmp/ltsmin8088252056599268062
[2022-05-15 14:56:14] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8088252056599268062
Running compilation step : cd /tmp/ltsmin8088252056599268062;'/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 1374 ms.
Running link step : cd /tmp/ltsmin8088252056599268062;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8088252056599268062;'/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/stateBased15719862546961385228.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 344 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 513/513 transitions.
Applied a total of 0 rules in 4 ms. Remains 344 /344 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2022-05-15 14:56:29] [INFO ] Flow matrix only has 490 transitions (discarded 23 similar events)
// Phase 1: matrix 490 rows 344 cols
[2022-05-15 14:56:29] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-15 14:56:29] [INFO ] Implicit Places using invariants in 508 ms returned []
[2022-05-15 14:56:30] [INFO ] Flow matrix only has 490 transitions (discarded 23 similar events)
// Phase 1: matrix 490 rows 344 cols
[2022-05-15 14:56:30] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:56:30] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1295 ms to find 0 implicit places.
[2022-05-15 14:56:30] [INFO ] Flow matrix only has 490 transitions (discarded 23 similar events)
// Phase 1: matrix 490 rows 344 cols
[2022-05-15 14:56:30] [INFO ] Computed 14 place invariants in 7 ms
[2022-05-15 14:56:31] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 344/344 places, 513/513 transitions.
Built C files in :
/tmp/ltsmin13100410033823073258
[2022-05-15 14:56:31] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13100410033823073258
Running compilation step : cd /tmp/ltsmin13100410033823073258;'/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 1436 ms.
Running link step : cd /tmp/ltsmin13100410033823073258;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin13100410033823073258;'/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/stateBased14425039867278891976.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 14:56:46] [INFO ] Flatten gal took : 18 ms
[2022-05-15 14:56:46] [INFO ] Flatten gal took : 17 ms
[2022-05-15 14:56:46] [INFO ] Time to serialize gal into /tmp/LTL12845565983371175455.gal : 4 ms
[2022-05-15 14:56:46] [INFO ] Time to serialize properties into /tmp/LTL16035378163023314230.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/LTL12845565983371175455.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16035378163023314230.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/LTL1284556...268
Read 1 LTL properties
Checking formula 0 : !(((G("(p1090==0)"))||(X(X(X(G("(((p936!=1)||(p1245!=1))||(p1904!=1))")))))))
Formula 0 simplified : !(G"(p1090==0)" | XXXG"(((p936!=1)||(p1245!=1))||(p1904!=1))")
Detected timeout of ITS tools.
[2022-05-15 14:57:01] [INFO ] Flatten gal took : 16 ms
[2022-05-15 14:57:01] [INFO ] Applying decomposition
[2022-05-15 14:57:01] [INFO ] Flatten gal took : 19 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/graph9945593314384369967.txt' '-o' '/tmp/graph9945593314384369967.bin' '-w' '/tmp/graph9945593314384369967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9945593314384369967.bin' '-l' '-1' '-v' '-w' '/tmp/graph9945593314384369967.weights' '-q' '0' '-e' '0.001'
[2022-05-15 14:57:01] [INFO ] Decomposing Gal with order
[2022-05-15 14:57:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 14:57:01] [INFO ] Removed a total of 219 redundant transitions.
[2022-05-15 14:57:01] [INFO ] Flatten gal took : 52 ms
[2022-05-15 14:57:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 8 ms.
[2022-05-15 14:57:01] [INFO ] Time to serialize gal into /tmp/LTL188966817973787823.gal : 5 ms
[2022-05-15 14:57:01] [INFO ] Time to serialize properties into /tmp/LTL10773685894759415952.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/LTL188966817973787823.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10773685894759415952.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/LTL1889668...245
Read 1 LTL properties
Checking formula 0 : !(((G("(i8.u27.p1090==0)"))||(X(X(X(G("(((i6.u23.p936!=1)||(i10.u33.p1245!=1))||(u37.p1904!=1))")))))))
Formula 0 simplified : !(G"(i8.u27.p1090==0)" | XXXG"(((i6.u23.p936!=1)||(i10.u33.p1245!=1))||(u37.p1904!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4957083704953998509
[2022-05-15 14:57:16] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4957083704953998509
Running compilation step : cd /tmp/ltsmin4957083704953998509;'/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 1245 ms.
Running link step : cd /tmp/ltsmin4957083704953998509;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4957083704953998509;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(X(X([]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-14 finished in 94054 ms.
[2022-05-15 14:57:32] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10629527356711788129
[2022-05-15 14:57:32] [INFO ] Computing symmetric may disable matrix : 827 transitions.
[2022-05-15 14:57:32] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:57:32] [INFO ] Computing symmetric may enable matrix : 827 transitions.
[2022-05-15 14:57:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:57:32] [INFO ] Applying decomposition
[2022-05-15 14:57:32] [INFO ] Flatten gal took : 22 ms
[2022-05-15 14:57:32] [INFO ] Computing Do-Not-Accords matrix : 827 transitions.
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/graph11274392060826848123.txt' '-o' '/tmp/graph11274392060826848123.bin' '-w' '/tmp/graph11274392060826848123.weights'
[2022-05-15 14:57:32] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11274392060826848123.bin' '-l' '-1' '-v' '-w' '/tmp/graph11274392060826848123.weights' '-q' '0' '-e' '0.001'
[2022-05-15 14:57:32] [INFO ] Decomposing Gal with order
[2022-05-15 14:57:32] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10629527356711788129
Running compilation step : cd /tmp/ltsmin10629527356711788129;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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'
[2022-05-15 14:57:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 14:57:32] [INFO ] Removed a total of 233 redundant transitions.
[2022-05-15 14:57:32] [INFO ] Flatten gal took : 80 ms
[2022-05-15 14:57:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 10 ms.
[2022-05-15 14:57:32] [INFO ] Time to serialize gal into /tmp/LTLFireability11855497266537632905.gal : 15 ms
[2022-05-15 14:57:32] [INFO ] Time to serialize properties into /tmp/LTLFireability14594153131804932063.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11855497266537632905.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14594153131804932063.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/LTLFireabi...269
Read 2 LTL properties
Checking formula 0 : !((X((F(G(((F("(i8.u77.p815==0)"))||(F("(i11.u104.p1065==0)")))||("(i5.i1.i0.u45.p467==0)"))))&&("(i8.u77.p815==0)"))))
Formula 0 simplified : !X("(i8.u77.p815==0)" & FG("(i5.i1.i0.u45.p467==0)" | F"(i8.u77.p815==0)" | F"(i11.u104.p1065==0)"))
Compilation finished in 3205 ms.
Running link step : cd /tmp/ltsmin10629527356711788129;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin10629527356711788129;'/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))||<>((LTLAPp1==true))||(LTLAPp2==true))))&&(LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 15:19:18] [INFO ] Applying decomposition
[2022-05-15 15:19:18] [INFO ] Flatten gal took : 64 ms
[2022-05-15 15:19:18] [INFO ] Decomposing Gal with order
[2022-05-15 15:19:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 15:19:19] [INFO ] Removed a total of 208 redundant transitions.
[2022-05-15 15:19:19] [INFO ] Flatten gal took : 201 ms
[2022-05-15 15:19:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 647 labels/synchronizations in 162 ms.
[2022-05-15 15:19:19] [INFO ] Time to serialize gal into /tmp/LTLFireability879659116476065522.gal : 9 ms
[2022-05-15 15:19:19] [INFO ] Time to serialize properties into /tmp/LTLFireability8186783480787160851.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/LTLFireability879659116476065522.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8186783480787160851.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/LTLFireabi...266
Read 2 LTL properties
Checking formula 0 : !((X((F(G(((F("(i0.i0.i0.i0.i0.i0.u18.p815==0)"))||(F("(i0.i0.i0.u21.p1065==0)")))||("(i0.i0.i0.i0.i0.i0.i0.i0.i0.u15.p467==0)"))))&&(...192
Formula 0 simplified : !X("(i0.i0.i0.i0.i0.i0.u18.p815==0)" & FG("(i0.i0.i0.i0.i0.i0.i0.i0.i0.u15.p467==0)" | F"(i0.i0.i0.i0.i0.i0.u18.p815==0)" | F"(i0.i0...175
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin10629527356711788129;'/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))||<>((LTLAPp1==true))||(LTLAPp2==true))))&&(LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10629527356711788129;'/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' '([]((LTLAPp3==true))||X(X(X([]((LTLAPp4==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 15:41:07] [INFO ] Flatten gal took : 71 ms
[2022-05-15 15:41:07] [INFO ] Input system was already deterministic with 827 transitions.
[2022-05-15 15:41:07] [INFO ] Transformed 633 places.
[2022-05-15 15:41:07] [INFO ] Transformed 827 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 15:41:07] [INFO ] Time to serialize gal into /tmp/LTLFireability7604066724047253411.gal : 4 ms
[2022-05-15 15:41:07] [INFO ] Time to serialize properties into /tmp/LTLFireability3252999211631712843.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7604066724047253411.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3252999211631712843.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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/LTLFireabi...333
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((F(G(((F("(p815==0)"))||(F("(p1065==0)")))||("(p467==0)"))))&&("(p815==0)"))))
Formula 0 simplified : !X("(p815==0)" & FG("(p467==0)" | F"(p815==0)" | F"(p1065==0)"))

BK_TIME_CONFINEMENT_REACHED

--------------------
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-12b"
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-12b, 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-165260575700076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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