Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 6.9K Feb 25 12:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 12:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 12:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 12:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 25 12:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 374K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678555913080

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-10b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 17:31:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 17:31:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 17:31:54] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2023-03-11 17:31:54] [INFO ] Transformed 1402 places.
[2023-03-11 17:31:54] [INFO ] Transformed 1613 transitions.
[2023-03-11 17:31:54] [INFO ] Found NUPN structural information;
[2023-03-11 17:31:54] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 409 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 1402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Discarding 531 places :
Symmetric choice reduction at 0 with 531 rule applications. Total rules 531 place count 871 transition count 1082
Iterating global reduction 0 with 531 rules applied. Total rules applied 1062 place count 871 transition count 1082
Discarding 240 places :
Symmetric choice reduction at 0 with 240 rule applications. Total rules 1302 place count 631 transition count 842
Iterating global reduction 0 with 240 rules applied. Total rules applied 1542 place count 631 transition count 842
Discarding 147 places :
Symmetric choice reduction at 0 with 147 rule applications. Total rules 1689 place count 484 transition count 695
Iterating global reduction 0 with 147 rules applied. Total rules applied 1836 place count 484 transition count 695
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 1902 place count 484 transition count 629
Applied a total of 1902 rules in 224 ms. Remains 484 /1402 variables (removed 918) and now considering 629/1613 (removed 984) transitions.
// Phase 1: matrix 629 rows 484 cols
[2023-03-11 17:31:55] [INFO ] Computed 12 place invariants in 30 ms
[2023-03-11 17:31:55] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-11 17:31:55] [INFO ] Invariant cache hit.
[2023-03-11 17:31:56] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2023-03-11 17:31:56] [INFO ] Invariant cache hit.
[2023-03-11 17:31:56] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 484/1402 places, 629/1613 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1214 ms. Remains : 484/1402 places, 629/1613 transitions.
Support contains 37 out of 484 places after structural reductions.
[2023-03-11 17:31:56] [INFO ] Flatten gal took : 77 ms
[2023-03-11 17:31:56] [INFO ] Flatten gal took : 45 ms
[2023-03-11 17:31:56] [INFO ] Input system was already deterministic with 629 transitions.
Support contains 32 out of 484 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 30) seen :12
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-11 17:31:57] [INFO ] Invariant cache hit.
[2023-03-11 17:31:57] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-11 17:31:58] [INFO ] After 646ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:16
[2023-03-11 17:31:58] [INFO ] After 740ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-11 17:31:58] [INFO ] After 1181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-11 17:31:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-11 17:31:59] [INFO ] After 508ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-11 17:32:00] [INFO ] After 1151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 367 ms.
[2023-03-11 17:32:00] [INFO ] After 1901ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 14 properties in 57 ms.
Support contains 5 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 629/629 transitions.
Graph (trivial) has 442 edges and 484 vertex of which 61 / 484 are part of one of the 10 SCC in 3 ms
Free SCC test removed 51 places
Drop transitions removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 433 transition count 518
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 384 transition count 518
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 99 place count 384 transition count 497
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 141 place count 363 transition count 497
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 172 place count 332 transition count 466
Iterating global reduction 2 with 31 rules applied. Total rules applied 203 place count 332 transition count 466
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 207 place count 332 transition count 462
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 214 place count 325 transition count 455
Iterating global reduction 3 with 7 rules applied. Total rules applied 221 place count 325 transition count 455
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 225 place count 325 transition count 451
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 351 place count 262 transition count 388
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 371 place count 262 transition count 368
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 384 place count 249 transition count 355
Iterating global reduction 5 with 13 rules applied. Total rules applied 397 place count 249 transition count 355
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 400 place count 249 transition count 352
Free-agglomeration rule applied 187 times.
Iterating global reduction 6 with 187 rules applied. Total rules applied 587 place count 249 transition count 165
Reduce places removed 187 places and 0 transitions.
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 162 edges and 62 vertex of which 42 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 269 rules applied. Total rules applied 856 place count 42 transition count 84
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 7 with 28 rules applied. Total rules applied 884 place count 42 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 885 place count 41 transition count 55
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 41 edges and 39 vertex of which 30 / 39 are part of one of the 6 SCC in 1 ms
Free SCC test removed 24 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 888 place count 15 transition count 55
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 9 with 42 rules applied. Total rules applied 930 place count 14 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 930 place count 14 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 932 place count 13 transition count 13
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 933 place count 13 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 934 place count 12 transition count 12
Applied a total of 934 rules in 129 ms. Remains 12 /484 variables (removed 472) and now considering 12/629 (removed 617) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 12/484 places, 12/629 transitions.
Finished random walk after 22 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=22 )
Computed a total of 13 stabilizing places and 13 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p1)))))'
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 467 transition count 612
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 467 transition count 612
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 467 transition count 608
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 48 place count 457 transition count 598
Iterating global reduction 1 with 10 rules applied. Total rules applied 58 place count 457 transition count 598
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 63 place count 457 transition count 593
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 68 place count 452 transition count 588
Iterating global reduction 2 with 5 rules applied. Total rules applied 73 place count 452 transition count 588
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 78 place count 452 transition count 583
Applied a total of 78 rules in 42 ms. Remains 452 /484 variables (removed 32) and now considering 583/629 (removed 46) transitions.
// Phase 1: matrix 583 rows 452 cols
[2023-03-11 17:32:01] [INFO ] Computed 12 place invariants in 10 ms
[2023-03-11 17:32:01] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-11 17:32:01] [INFO ] Invariant cache hit.
[2023-03-11 17:32:01] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2023-03-11 17:32:01] [INFO ] Invariant cache hit.
[2023-03-11 17:32:01] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 452/484 places, 583/629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 734 ms. Remains : 452/484 places, 583/629 transitions.
Stuttering acceptance computed with spot in 326 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s282 1), p1:(EQ s155 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-00 finished in 1121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 466 transition count 611
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 466 transition count 611
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 466 transition count 607
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 51 place count 455 transition count 596
Iterating global reduction 1 with 11 rules applied. Total rules applied 62 place count 455 transition count 596
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 67 place count 455 transition count 591
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 73 place count 449 transition count 585
Iterating global reduction 2 with 6 rules applied. Total rules applied 79 place count 449 transition count 585
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 85 place count 449 transition count 579
Applied a total of 85 rules in 34 ms. Remains 449 /484 variables (removed 35) and now considering 579/629 (removed 50) transitions.
// Phase 1: matrix 579 rows 449 cols
[2023-03-11 17:32:02] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-11 17:32:02] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-11 17:32:02] [INFO ] Invariant cache hit.
[2023-03-11 17:32:02] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2023-03-11 17:32:02] [INFO ] Invariant cache hit.
[2023-03-11 17:32:02] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 449/484 places, 579/629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 694 ms. Remains : 449/484 places, 579/629 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s102 1) (EQ s443 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-01 finished in 842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Graph (trivial) has 451 edges and 484 vertex of which 61 / 484 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 432 transition count 522
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 378 transition count 522
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 109 place count 378 transition count 497
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 159 place count 353 transition count 497
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 193 place count 319 transition count 463
Iterating global reduction 2 with 34 rules applied. Total rules applied 227 place count 319 transition count 463
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 231 place count 319 transition count 459
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 239 place count 311 transition count 451
Iterating global reduction 3 with 8 rules applied. Total rules applied 247 place count 311 transition count 451
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 255 place count 311 transition count 443
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 375 place count 251 transition count 383
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 378 place count 248 transition count 380
Iterating global reduction 4 with 3 rules applied. Total rules applied 381 place count 248 transition count 380
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 384 place count 248 transition count 377
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 394 place count 248 transition count 367
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 396 place count 246 transition count 365
Applied a total of 396 rules in 152 ms. Remains 246 /484 variables (removed 238) and now considering 365/629 (removed 264) transitions.
[2023-03-11 17:32:03] [INFO ] Flow matrix only has 346 transitions (discarded 19 similar events)
// Phase 1: matrix 346 rows 246 cols
[2023-03-11 17:32:03] [INFO ] Computed 12 place invariants in 9 ms
[2023-03-11 17:32:03] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-11 17:32:03] [INFO ] Flow matrix only has 346 transitions (discarded 19 similar events)
[2023-03-11 17:32:03] [INFO ] Invariant cache hit.
[2023-03-11 17:32:03] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-03-11 17:32:03] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-11 17:32:03] [INFO ] Flow matrix only has 346 transitions (discarded 19 similar events)
[2023-03-11 17:32:03] [INFO ] Invariant cache hit.
[2023-03-11 17:32:03] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 246/484 places, 365/629 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 638 ms. Remains : 246/484 places, 365/629 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s113 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-03 finished in 693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0) U ((p1||X(p2)) U X(!p3))))))'
Support contains 8 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 468 transition count 613
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 468 transition count 613
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 468 transition count 611
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 45 place count 457 transition count 600
Iterating global reduction 1 with 11 rules applied. Total rules applied 56 place count 457 transition count 600
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 61 place count 457 transition count 595
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 451 transition count 589
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 451 transition count 589
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 79 place count 451 transition count 583
Applied a total of 79 rules in 65 ms. Remains 451 /484 variables (removed 33) and now considering 583/629 (removed 46) transitions.
// Phase 1: matrix 583 rows 451 cols
[2023-03-11 17:32:03] [INFO ] Computed 12 place invariants in 8 ms
[2023-03-11 17:32:03] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-11 17:32:03] [INFO ] Invariant cache hit.
[2023-03-11 17:32:04] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
[2023-03-11 17:32:04] [INFO ] Invariant cache hit.
[2023-03-11 17:32:04] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 451/484 places, 583/629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 760 ms. Remains : 451/484 places, 583/629 transitions.
Stuttering acceptance computed with spot in 338 ms :[p3, p3, (AND (NOT p0) (NOT p2) p3), p3, true, (AND p0 (NOT p2) p3), (AND p0 p3)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p3), acceptance={0} source=3 dest: 2}, { cond=p3, acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p0) p3), acceptance={0} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2) p3), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p1) p0 p3), acceptance={0} source=6 dest: 5}, { cond=(AND p0 p3), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s445 1), p0:(EQ s76 1), p2:(AND (EQ s219 1) (EQ s231 1) (EQ s417 1)), p3:(AND (EQ s88 1) (EQ s184 1) (EQ s383 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28612 reset in 360 ms.
Product exploration explored 100000 steps with 28649 reset in 294 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 540 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter sensitive) to 7 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[p3, p3, (AND (NOT p0) p3 (NOT p2)), p3, true, (AND p0 p3 (NOT p2)), (AND p0 p3)]
Incomplete random walk after 10000 steps, including 131 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 9) seen :1
Finished Best-First random walk after 471 steps, including 0 resets, run visited all 8 properties in 4 ms. (steps per millisecond=117 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p3 (NOT p1))), (F p3), (F (AND p0 p3 (NOT p2))), (F (AND (NOT p0) p3)), (F p1), (F (AND p3 (NOT p1))), (F (AND (NOT p0) p3 (NOT p2))), (F (AND p0 p3)), (F (AND p0 p3 (NOT p1)))]
Knowledge based reduction with 9 factoid took 759 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter sensitive) to 7 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[p3, p3, (AND (NOT p0) p3 (NOT p2)), p3, true, (AND p0 p3 (NOT p2)), (AND p0 p3)]
Stuttering acceptance computed with spot in 285 ms :[p3, p3, (AND (NOT p0) p3 (NOT p2)), p3, true, (AND p0 p3 (NOT p2)), (AND p0 p3)]
Support contains 8 out of 451 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 451/451 places, 583/583 transitions.
Applied a total of 0 rules in 11 ms. Remains 451 /451 variables (removed 0) and now considering 583/583 (removed 0) transitions.
[2023-03-11 17:32:07] [INFO ] Invariant cache hit.
[2023-03-11 17:32:07] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-11 17:32:07] [INFO ] Invariant cache hit.
[2023-03-11 17:32:08] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2023-03-11 17:32:08] [INFO ] Invariant cache hit.
[2023-03-11 17:32:08] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 705 ms. Remains : 451/451 places, 583/583 transitions.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT p1)), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 454 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter sensitive) to 7 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[p3, p3, (AND (NOT p0) (NOT p2) p3), p3, true, (AND p0 (NOT p2) p3), (AND p0 p3)]
Incomplete random walk after 10000 steps, including 127 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 9) seen :1
Finished Best-First random walk after 1777 steps, including 2 resets, run visited all 8 properties in 6 ms. (steps per millisecond=296 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT p1)), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p3)), (F p3), (F (AND p0 (NOT p2) p3)), (F (AND (NOT p0) p3)), (F p1), (F (AND (NOT p1) p3)), (F (AND (NOT p0) (NOT p2) p3)), (F (AND p0 p3)), (F (AND p0 (NOT p1) p3))]
Knowledge based reduction with 9 factoid took 697 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter sensitive) to 7 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[p3, p3, (AND (NOT p0) (NOT p2) p3), p3, true, (AND p0 (NOT p2) p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 274 ms :[p3, p3, (AND (NOT p0) (NOT p2) p3), p3, true, (AND p0 (NOT p2) p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 256 ms :[p3, p3, (AND (NOT p0) (NOT p2) p3), p3, true, (AND p0 (NOT p2) p3), (AND p0 p3)]
Product exploration explored 100000 steps with 28552 reset in 226 ms.
Product exploration explored 100000 steps with 28623 reset in 232 ms.
Applying partial POR strategy [false, false, true, false, true, true, false]
Stuttering acceptance computed with spot in 269 ms :[p3, p3, (AND (NOT p0) (NOT p2) p3), p3, true, (AND p0 (NOT p2) p3), (AND p0 p3)]
Support contains 8 out of 451 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 451/451 places, 583/583 transitions.
Graph (trivial) has 323 edges and 451 vertex of which 55 / 451 are part of one of the 9 SCC in 1 ms
Free SCC test removed 46 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 405 transition count 536
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 40 place count 405 transition count 537
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 70 place count 405 transition count 537
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 114 place count 361 transition count 493
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 158 place count 361 transition count 493
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 1 with 58 rules applied. Total rules applied 216 place count 361 transition count 513
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 241 place count 336 transition count 488
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 266 place count 336 transition count 488
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 277 place count 336 transition count 511
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 278 place count 335 transition count 509
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 279 place count 335 transition count 509
Deduced a syphon composed of 85 places in 0 ms
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 289 place count 335 transition count 499
Deduced a syphon composed of 85 places in 0 ms
Applied a total of 289 rules in 91 ms. Remains 335 /451 variables (removed 116) and now considering 499/583 (removed 84) transitions.
[2023-03-11 17:32:11] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-11 17:32:11] [INFO ] Flow matrix only has 473 transitions (discarded 26 similar events)
// Phase 1: matrix 473 rows 335 cols
[2023-03-11 17:32:11] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-11 17:32:12] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 335/451 places, 499/583 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 403 ms. Remains : 335/451 places, 499/583 transitions.
Support contains 8 out of 451 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 451/451 places, 583/583 transitions.
Applied a total of 0 rules in 12 ms. Remains 451 /451 variables (removed 0) and now considering 583/583 (removed 0) transitions.
// Phase 1: matrix 583 rows 451 cols
[2023-03-11 17:32:12] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-11 17:32:12] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-11 17:32:12] [INFO ] Invariant cache hit.
[2023-03-11 17:32:12] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2023-03-11 17:32:12] [INFO ] Invariant cache hit.
[2023-03-11 17:32:12] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 654 ms. Remains : 451/451 places, 583/583 transitions.
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-05 finished in 9297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Graph (trivial) has 450 edges and 484 vertex of which 61 / 484 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 432 transition count 523
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 379 transition count 523
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 107 place count 379 transition count 499
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 155 place count 355 transition count 499
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 189 place count 321 transition count 465
Iterating global reduction 2 with 34 rules applied. Total rules applied 223 place count 321 transition count 465
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 227 place count 321 transition count 461
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 235 place count 313 transition count 453
Iterating global reduction 3 with 8 rules applied. Total rules applied 243 place count 313 transition count 453
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 250 place count 313 transition count 446
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 372 place count 252 transition count 385
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 375 place count 249 transition count 382
Iterating global reduction 4 with 3 rules applied. Total rules applied 378 place count 249 transition count 382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 381 place count 249 transition count 379
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 391 place count 249 transition count 369
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 393 place count 247 transition count 367
Applied a total of 393 rules in 87 ms. Remains 247 /484 variables (removed 237) and now considering 367/629 (removed 262) transitions.
[2023-03-11 17:32:13] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
// Phase 1: matrix 348 rows 247 cols
[2023-03-11 17:32:13] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-11 17:32:13] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-11 17:32:13] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2023-03-11 17:32:13] [INFO ] Invariant cache hit.
[2023-03-11 17:32:13] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2023-03-11 17:32:13] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 17:32:13] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2023-03-11 17:32:13] [INFO ] Invariant cache hit.
[2023-03-11 17:32:13] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 247/484 places, 367/629 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 749 ms. Remains : 247/484 places, 367/629 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-06 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 s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-06 finished in 831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1)||G((p0||X(!p1))))))'
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Graph (trivial) has 449 edges and 484 vertex of which 61 / 484 are part of one of the 10 SCC in 0 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 432 transition count 522
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 378 transition count 522
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 109 place count 378 transition count 497
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 159 place count 353 transition count 497
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 193 place count 319 transition count 463
Iterating global reduction 2 with 34 rules applied. Total rules applied 227 place count 319 transition count 463
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 231 place count 319 transition count 459
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 239 place count 311 transition count 451
Iterating global reduction 3 with 8 rules applied. Total rules applied 247 place count 311 transition count 451
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 255 place count 311 transition count 443
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 375 place count 251 transition count 383
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 377 place count 249 transition count 381
Iterating global reduction 4 with 2 rules applied. Total rules applied 379 place count 249 transition count 381
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 381 place count 249 transition count 379
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 391 place count 249 transition count 369
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 393 place count 247 transition count 367
Applied a total of 393 rules in 71 ms. Remains 247 /484 variables (removed 237) and now considering 367/629 (removed 262) transitions.
[2023-03-11 17:32:13] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
// Phase 1: matrix 348 rows 247 cols
[2023-03-11 17:32:13] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-11 17:32:14] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-11 17:32:14] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2023-03-11 17:32:14] [INFO ] Invariant cache hit.
[2023-03-11 17:32:14] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2023-03-11 17:32:14] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 17:32:14] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2023-03-11 17:32:14] [INFO ] Invariant cache hit.
[2023-03-11 17:32:14] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 247/484 places, 367/629 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 670 ms. Remains : 247/484 places, 367/629 transitions.
Stuttering acceptance computed with spot in 34 ms :[false]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}]], initial=0, aps=[p1:(NEQ s83 1), p0:(EQ s77 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6142 reset in 520 ms.
Product exploration explored 100000 steps with 6156 reset in 472 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 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 159 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[false]
Incomplete random walk after 10000 steps, including 617 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 17:32:15] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2023-03-11 17:32:15] [INFO ] Invariant cache hit.
[2023-03-11 17:32:15] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-11 17:32:15] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 17:32:15] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-11 17:32:15] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 17:32:15] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-11 17:32:15] [INFO ] After 158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 367/367 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 247 transition count 347
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 30 place count 237 transition count 337
Iterating global reduction 1 with 10 rules applied. Total rules applied 40 place count 237 transition count 337
Free-agglomeration rule applied 183 times.
Iterating global reduction 1 with 183 rules applied. Total rules applied 223 place count 237 transition count 154
Discarding 35 places :
Also discarding 85 output transitions
Drop transitions removed 85 transitions
Remove reverse transitions (loop back) rule discarded transition t91.t507.t426 and 35 places that fell out of Prefix Of Interest.
Drop transitions removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Graph (trivial) has 19 edges and 17 vertex of which 12 / 17 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 271 place count 8 transition count 23
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 19 rules applied. Total rules applied 290 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 293 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 294 place count 4 transition count 4
Applied a total of 294 rules in 27 ms. Remains 4 /247 variables (removed 243) and now considering 4/367 (removed 363) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 4/247 places, 4/367 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 230 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[false]
Stuttering acceptance computed with spot in 28 ms :[false]
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 367/367 transitions.
Applied a total of 0 rules in 10 ms. Remains 247 /247 variables (removed 0) and now considering 367/367 (removed 0) transitions.
[2023-03-11 17:32:16] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2023-03-11 17:32:16] [INFO ] Invariant cache hit.
[2023-03-11 17:32:16] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-11 17:32:16] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2023-03-11 17:32:16] [INFO ] Invariant cache hit.
[2023-03-11 17:32:16] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-11 17:32:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 17:32:16] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2023-03-11 17:32:16] [INFO ] Invariant cache hit.
[2023-03-11 17:32:16] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 468 ms. Remains : 247/247 places, 367/367 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 160 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[false]
Incomplete random walk after 10000 steps, including 625 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 17:32:17] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2023-03-11 17:32:17] [INFO ] Invariant cache hit.
[2023-03-11 17:32:17] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-11 17:32:17] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 17:32:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-11 17:32:17] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 17:32:17] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-11 17:32:17] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 367/367 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 247 transition count 347
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 30 place count 237 transition count 337
Iterating global reduction 1 with 10 rules applied. Total rules applied 40 place count 237 transition count 337
Free-agglomeration rule applied 183 times.
Iterating global reduction 1 with 183 rules applied. Total rules applied 223 place count 237 transition count 154
Discarding 35 places :
Also discarding 85 output transitions
Drop transitions removed 85 transitions
Remove reverse transitions (loop back) rule discarded transition t91.t507.t426 and 35 places that fell out of Prefix Of Interest.
Drop transitions removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Graph (trivial) has 19 edges and 17 vertex of which 12 / 17 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 271 place count 8 transition count 23
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 19 rules applied. Total rules applied 290 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 293 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 294 place count 4 transition count 4
Applied a total of 294 rules in 17 ms. Remains 4 /247 variables (removed 243) and now considering 4/367 (removed 363) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 4/247 places, 4/367 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 222 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[false]
Stuttering acceptance computed with spot in 34 ms :[false]
Stuttering acceptance computed with spot in 37 ms :[false]
Product exploration explored 100000 steps with 6142 reset in 416 ms.
Product exploration explored 100000 steps with 6137 reset in 430 ms.
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 367/367 transitions.
Applied a total of 0 rules in 9 ms. Remains 247 /247 variables (removed 0) and now considering 367/367 (removed 0) transitions.
[2023-03-11 17:32:18] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2023-03-11 17:32:18] [INFO ] Invariant cache hit.
[2023-03-11 17:32:18] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-11 17:32:18] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2023-03-11 17:32:18] [INFO ] Invariant cache hit.
[2023-03-11 17:32:18] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2023-03-11 17:32:18] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 17:32:18] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2023-03-11 17:32:18] [INFO ] Invariant cache hit.
[2023-03-11 17:32:18] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 487 ms. Remains : 247/247 places, 367/367 transitions.
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-07 finished in 5237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U (p1||X(X(G(p2))))))'
Support contains 5 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 468 transition count 613
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 468 transition count 613
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 468 transition count 609
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 458 transition count 599
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 458 transition count 599
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 61 place count 458 transition count 594
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 66 place count 453 transition count 589
Iterating global reduction 2 with 5 rules applied. Total rules applied 71 place count 453 transition count 589
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 76 place count 453 transition count 584
Applied a total of 76 rules in 27 ms. Remains 453 /484 variables (removed 31) and now considering 584/629 (removed 45) transitions.
// Phase 1: matrix 584 rows 453 cols
[2023-03-11 17:32:19] [INFO ] Computed 12 place invariants in 8 ms
[2023-03-11 17:32:19] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-11 17:32:19] [INFO ] Invariant cache hit.
[2023-03-11 17:32:19] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2023-03-11 17:32:19] [INFO ] Invariant cache hit.
[2023-03-11 17:32:19] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 453/484 places, 584/629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 697 ms. Remains : 453/484 places, 584/629 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), p0]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s49 1) (EQ s135 1)), p1:(AND (EQ s283 1) (EQ s451 1)), p2:(EQ s289 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-08 finished in 871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F((p1||(F(p3)&&p2)))))))'
Support contains 6 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Graph (trivial) has 364 edges and 484 vertex of which 55 / 484 are part of one of the 9 SCC in 1 ms
Free SCC test removed 46 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 437 transition count 528
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 384 transition count 527
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 383 transition count 527
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 109 place count 383 transition count 502
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 159 place count 358 transition count 502
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 191 place count 326 transition count 470
Iterating global reduction 3 with 32 rules applied. Total rules applied 223 place count 326 transition count 470
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 226 place count 326 transition count 467
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 226 place count 326 transition count 466
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 228 place count 325 transition count 466
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 237 place count 316 transition count 457
Iterating global reduction 4 with 9 rules applied. Total rules applied 246 place count 316 transition count 457
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 255 place count 316 transition count 448
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 126 rules applied. Total rules applied 381 place count 253 transition count 385
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 383 place count 251 transition count 383
Iterating global reduction 5 with 2 rules applied. Total rules applied 385 place count 251 transition count 383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 387 place count 251 transition count 381
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 389 place count 249 transition count 379
Applied a total of 389 rules in 54 ms. Remains 249 /484 variables (removed 235) and now considering 379/629 (removed 250) transitions.
[2023-03-11 17:32:19] [INFO ] Flow matrix only has 353 transitions (discarded 26 similar events)
// Phase 1: matrix 353 rows 249 cols
[2023-03-11 17:32:19] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-11 17:32:20] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-11 17:32:20] [INFO ] Flow matrix only has 353 transitions (discarded 26 similar events)
[2023-03-11 17:32:20] [INFO ] Invariant cache hit.
[2023-03-11 17:32:20] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2023-03-11 17:32:20] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 17:32:20] [INFO ] Flow matrix only has 353 transitions (discarded 26 similar events)
[2023-03-11 17:32:20] [INFO ] Invariant cache hit.
[2023-03-11 17:32:20] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 249/484 places, 379/629 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 719 ms. Remains : 249/484 places, 379/629 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s36 1) (EQ s99 1) (EQ s185 1)), p2:(AND (EQ s128 1) (EQ s246 1)), p1:(EQ s246 0), p3:(EQ s96 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 21 steps with 1 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-09 finished in 855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X((p1||X(G(p2))))) U (p2 U X(p3))))'
Support contains 4 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 468 transition count 613
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 468 transition count 613
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 468 transition count 609
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 459 transition count 600
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 459 transition count 600
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 59 place count 459 transition count 595
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 63 place count 455 transition count 591
Iterating global reduction 2 with 4 rules applied. Total rules applied 67 place count 455 transition count 591
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 71 place count 455 transition count 587
Applied a total of 71 rules in 30 ms. Remains 455 /484 variables (removed 29) and now considering 587/629 (removed 42) transitions.
// Phase 1: matrix 587 rows 455 cols
[2023-03-11 17:32:20] [INFO ] Computed 12 place invariants in 12 ms
[2023-03-11 17:32:20] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-11 17:32:20] [INFO ] Invariant cache hit.
[2023-03-11 17:32:21] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2023-03-11 17:32:21] [INFO ] Invariant cache hit.
[2023-03-11 17:32:21] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 455/484 places, 587/629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 744 ms. Remains : 455/484 places, 587/629 transitions.
Stuttering acceptance computed with spot in 324 ms :[(NOT p3), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p2) (NOT p1)), (NOT p2), true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 5}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p3), acceptance={} source=8 dest: 5}]], initial=0, aps=[p2:(EQ s262 1), p0:(EQ s260 1), p1:(EQ s252 1), p3:(EQ s449 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 4 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-10 finished in 1100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G(p1)))))'
Support contains 1 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 467 transition count 612
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 467 transition count 612
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 467 transition count 608
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 48 place count 457 transition count 598
Iterating global reduction 1 with 10 rules applied. Total rules applied 58 place count 457 transition count 598
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 63 place count 457 transition count 593
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 68 place count 452 transition count 588
Iterating global reduction 2 with 5 rules applied. Total rules applied 73 place count 452 transition count 588
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 78 place count 452 transition count 583
Applied a total of 78 rules in 26 ms. Remains 452 /484 variables (removed 32) and now considering 583/629 (removed 46) transitions.
// Phase 1: matrix 583 rows 452 cols
[2023-03-11 17:32:21] [INFO ] Computed 12 place invariants in 8 ms
[2023-03-11 17:32:21] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-11 17:32:21] [INFO ] Invariant cache hit.
[2023-03-11 17:32:22] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2023-03-11 17:32:22] [INFO ] Invariant cache hit.
[2023-03-11 17:32:22] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 452/484 places, 583/629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 663 ms. Remains : 452/484 places, 583/629 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s49 1), p1:(EQ s49 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][false, false, false]]
Product exploration explored 100000 steps with 1303 reset in 209 ms.
Entered a terminal (fully accepting) state of product in 85821 steps with 1117 reset in 179 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-11 finished in 1146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&(p1||F(G(p2))))))'
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 468 transition count 613
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 468 transition count 613
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 468 transition count 609
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 459 transition count 600
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 459 transition count 600
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 57 place count 459 transition count 597
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 63 place count 453 transition count 591
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 453 transition count 591
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 75 place count 453 transition count 585
Applied a total of 75 rules in 28 ms. Remains 453 /484 variables (removed 31) and now considering 585/629 (removed 44) transitions.
// Phase 1: matrix 585 rows 453 cols
[2023-03-11 17:32:23] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-11 17:32:23] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-11 17:32:23] [INFO ] Invariant cache hit.
[2023-03-11 17:32:23] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2023-03-11 17:32:23] [INFO ] Invariant cache hit.
[2023-03-11 17:32:23] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 453/484 places, 585/629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 679 ms. Remains : 453/484 places, 585/629 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s392 1), p0:(EQ s365 0), p2:(EQ s365 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 81 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-12 finished in 845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 466 transition count 611
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 466 transition count 611
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 466 transition count 607
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 51 place count 455 transition count 596
Iterating global reduction 1 with 11 rules applied. Total rules applied 62 place count 455 transition count 596
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 67 place count 455 transition count 591
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 73 place count 449 transition count 585
Iterating global reduction 2 with 6 rules applied. Total rules applied 79 place count 449 transition count 585
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 85 place count 449 transition count 579
Applied a total of 85 rules in 24 ms. Remains 449 /484 variables (removed 35) and now considering 579/629 (removed 50) transitions.
// Phase 1: matrix 579 rows 449 cols
[2023-03-11 17:32:23] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-11 17:32:23] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-11 17:32:23] [INFO ] Invariant cache hit.
[2023-03-11 17:32:24] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2023-03-11 17:32:24] [INFO ] Invariant cache hit.
[2023-03-11 17:32:24] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 449/484 places, 579/629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 661 ms. Remains : 449/484 places, 579/629 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s443 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-13 finished in 795 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||((p1 U p2)&&X(G(p3)))))'
Support contains 3 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 467 transition count 612
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 467 transition count 612
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 467 transition count 608
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 48 place count 457 transition count 598
Iterating global reduction 1 with 10 rules applied. Total rules applied 58 place count 457 transition count 598
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 62 place count 457 transition count 594
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 68 place count 451 transition count 588
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 451 transition count 588
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 80 place count 451 transition count 582
Applied a total of 80 rules in 24 ms. Remains 451 /484 variables (removed 33) and now considering 582/629 (removed 47) transitions.
// Phase 1: matrix 582 rows 451 cols
[2023-03-11 17:32:24] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-11 17:32:24] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-11 17:32:24] [INFO ] Invariant cache hit.
[2023-03-11 17:32:25] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2023-03-11 17:32:25] [INFO ] Invariant cache hit.
[2023-03-11 17:32:25] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 451/484 places, 582/629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 660 ms. Remains : 451/484 places, 582/629 transitions.
Stuttering acceptance computed with spot in 356 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (NOT p3), true, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 7}], [{ cond=(AND p2 p3 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p0))), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) p1 p3 (NOT p0)), acceptance={} source=1 dest: 8}], [{ cond=p3, acceptance={} source=2 dest: 3}, { cond=(NOT p3), acceptance={} source=2 dest: 9}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=p3, acceptance={} source=4 dest: 4}, { cond=(NOT p3), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p2) p1 p3), acceptance={} source=7 dest: 1}, { cond=(AND p2 p3), acceptance={} source=7 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p3)), acceptance={} source=7 dest: 9}], [{ cond=(AND p2 p3), acceptance={0} source=8 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p3)), acceptance={0} source=8 dest: 5}, { cond=(AND (NOT p2) p1 p3), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 5}]], initial=0, aps=[p2:(EQ s321 1), p1:(EQ s329 1), p3:(EQ s286 0), p0:(EQ s329 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 217 ms.
Product exploration explored 100000 steps with 33333 reset in 235 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p3 p0), (X p3), (X (OR (AND (NOT p2) (NOT p1)) (NOT p3))), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p2) p1 p3))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p0))))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p3) (NOT p0)))))
Knowledge based reduction with 11 factoid took 239 ms. Reduced automaton from 10 states, 21 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-10b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-14 finished in 1752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0) U ((p1||X(p2)) U X(!p3))))))'
Found a Lengthening insensitive property : FlexibleBarrier-PT-10b-LTLFireability-05
Stuttering acceptance computed with spot in 262 ms :[p3, p3, (AND (NOT p0) (NOT p2) p3), p3, true, (AND p0 (NOT p2) p3), (AND p0 p3)]
Support contains 8 out of 484 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Graph (trivial) has 354 edges and 484 vertex of which 55 / 484 are part of one of the 9 SCC in 0 ms
Free SCC test removed 46 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 437 transition count 527
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 383 transition count 527
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 109 place count 383 transition count 502
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 159 place count 358 transition count 502
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 190 place count 327 transition count 471
Iterating global reduction 2 with 31 rules applied. Total rules applied 221 place count 327 transition count 471
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 223 place count 327 transition count 469
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 231 place count 319 transition count 461
Iterating global reduction 3 with 8 rules applied. Total rules applied 239 place count 319 transition count 461
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 247 place count 319 transition count 453
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 375 place count 255 transition count 389
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 378 place count 252 transition count 386
Iterating global reduction 4 with 3 rules applied. Total rules applied 381 place count 252 transition count 386
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 384 place count 252 transition count 383
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
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 388 place count 250 transition count 394
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 389 place count 249 transition count 393
Applied a total of 389 rules in 42 ms. Remains 249 /484 variables (removed 235) and now considering 393/629 (removed 236) transitions.
[2023-03-11 17:32:26] [INFO ] Flow matrix only has 367 transitions (discarded 26 similar events)
// Phase 1: matrix 367 rows 249 cols
[2023-03-11 17:32:26] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-11 17:32:26] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-11 17:32:26] [INFO ] Flow matrix only has 367 transitions (discarded 26 similar events)
[2023-03-11 17:32:26] [INFO ] Invariant cache hit.
[2023-03-11 17:32:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 17:32:27] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2023-03-11 17:32:27] [INFO ] Flow matrix only has 367 transitions (discarded 26 similar events)
[2023-03-11 17:32:27] [INFO ] Invariant cache hit.
[2023-03-11 17:32:27] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 249/484 places, 393/629 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 536 ms. Remains : 249/484 places, 393/629 transitions.
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p3), acceptance={0} source=3 dest: 2}, { cond=p3, acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p0) p3), acceptance={0} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2) p3), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p1) p0 p3), acceptance={0} source=6 dest: 5}, { cond=(AND p0 p3), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s246 1), p0:(EQ s32 1), p2:(AND (EQ s97 1) (EQ s104 1) (EQ s218 1)), p3:(AND (EQ s37 1) (EQ s81 1) (EQ s184 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 27993 reset in 424 ms.
Product exploration explored 100000 steps with 27873 reset in 425 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), true, (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p3))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 418 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter sensitive) to 7 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[p3, p3, (AND (NOT p0) p3 (NOT p2)), p3, true, (AND p0 p3 (NOT p2)), (AND p0 p3)]
Incomplete random walk after 10000 steps, including 558 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 9) seen :1
Finished Best-First random walk after 649 steps, including 0 resets, run visited all 8 properties in 1 ms. (steps per millisecond=649 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), true, (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p3))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (AND (NOT p0) (NOT p1) p3)), (F p3), (F (AND p0 p3 (NOT p2))), (F (AND (NOT p0) p3)), (F p1), (F (AND (NOT p1) p3)), (F (AND (NOT p0) p3 (NOT p2))), (F (AND p0 p3)), (F (AND p0 (NOT p1) p3))]
Knowledge based reduction with 7 factoid took 654 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter sensitive) to 7 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[p3, p3, (AND (NOT p0) p3 (NOT p2)), p3, true, (AND p0 p3 (NOT p2)), (AND p0 p3)]
Stuttering acceptance computed with spot in 254 ms :[p3, p3, (AND (NOT p0) p3 (NOT p2)), p3, true, (AND p0 p3 (NOT p2)), (AND p0 p3)]
Support contains 8 out of 249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 393/393 transitions.
Applied a total of 0 rules in 3 ms. Remains 249 /249 variables (removed 0) and now considering 393/393 (removed 0) transitions.
[2023-03-11 17:32:30] [INFO ] Flow matrix only has 367 transitions (discarded 26 similar events)
[2023-03-11 17:32:30] [INFO ] Invariant cache hit.
[2023-03-11 17:32:30] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-11 17:32:30] [INFO ] Flow matrix only has 367 transitions (discarded 26 similar events)
[2023-03-11 17:32:30] [INFO ] Invariant cache hit.
[2023-03-11 17:32:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 17:32:30] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2023-03-11 17:32:30] [INFO ] Flow matrix only has 367 transitions (discarded 26 similar events)
[2023-03-11 17:32:30] [INFO ] Invariant cache hit.
[2023-03-11 17:32:30] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 456 ms. Remains : 249/249 places, 393/393 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 418 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter sensitive) to 7 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[p3, p3, (AND (NOT p0) (NOT p2) p3), p3, true, (AND p0 (NOT p2) p3), (AND p0 p3)]
Incomplete random walk after 10000 steps, including 557 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 9) seen :1
Finished Best-First random walk after 607 steps, including 0 resets, run visited all 8 properties in 2 ms. (steps per millisecond=303 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (AND (NOT p0) p3 (NOT p1))), (F p3), (F (AND p0 (NOT p2) p3)), (F (AND (NOT p0) p3)), (F p1), (F (AND p3 (NOT p1))), (F (AND (NOT p0) (NOT p2) p3)), (F (AND p0 p3)), (F (AND p0 p3 (NOT p1)))]
Knowledge based reduction with 7 factoid took 669 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter sensitive) to 7 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[p3, p3, (AND (NOT p0) (NOT p2) p3), p3, true, (AND p0 (NOT p2) p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 372 ms :[p3, p3, (AND (NOT p0) (NOT p2) p3), p3, true, (AND p0 (NOT p2) p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 277 ms :[p3, p3, (AND (NOT p0) (NOT p2) p3), p3, true, (AND p0 (NOT p2) p3), (AND p0 p3)]
Product exploration explored 100000 steps with 28038 reset in 412 ms.
Product exploration explored 100000 steps with 27949 reset in 419 ms.
Applying partial POR strategy [false, false, true, false, true, true, false]
Stuttering acceptance computed with spot in 293 ms :[p3, p3, (AND (NOT p0) (NOT p2) p3), p3, true, (AND p0 (NOT p2) p3), (AND p0 p3)]
Support contains 8 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 393/393 transitions.
Applied a total of 0 rules in 7 ms. Remains 249 /249 variables (removed 0) and now considering 393/393 (removed 0) transitions.
[2023-03-11 17:32:34] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 17:32:34] [INFO ] Flow matrix only has 367 transitions (discarded 26 similar events)
[2023-03-11 17:32:34] [INFO ] Invariant cache hit.
[2023-03-11 17:32:34] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 249/249 places, 393/393 transitions.
Support contains 8 out of 249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 393/393 transitions.
Applied a total of 0 rules in 1 ms. Remains 249 /249 variables (removed 0) and now considering 393/393 (removed 0) transitions.
[2023-03-11 17:32:34] [INFO ] Flow matrix only has 367 transitions (discarded 26 similar events)
[2023-03-11 17:32:34] [INFO ] Invariant cache hit.
[2023-03-11 17:32:34] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-11 17:32:34] [INFO ] Flow matrix only has 367 transitions (discarded 26 similar events)
[2023-03-11 17:32:34] [INFO ] Invariant cache hit.
[2023-03-11 17:32:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 17:32:34] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-11 17:32:34] [INFO ] Flow matrix only has 367 transitions (discarded 26 similar events)
[2023-03-11 17:32:34] [INFO ] Invariant cache hit.
[2023-03-11 17:32:34] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 445 ms. Remains : 249/249 places, 393/393 transitions.
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-05 finished in 8649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1)||G((p0||X(!p1))))))'
[2023-03-11 17:32:35] [INFO ] Flatten gal took : 33 ms
[2023-03-11 17:32:35] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-11 17:32:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 484 places, 629 transitions and 1793 arcs took 7 ms.
Total runtime 40581 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1867/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1867/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : FlexibleBarrier-PT-10b-LTLFireability-05
Could not compute solution for formula : FlexibleBarrier-PT-10b-LTLFireability-07

BK_STOP 1678555956665

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name FlexibleBarrier-PT-10b-LTLFireability-05
ltl formula formula --ltl=/tmp/1867/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 484 places, 629 transitions and 1793 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.030 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1867/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1867/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1867/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1867/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name FlexibleBarrier-PT-10b-LTLFireability-07
ltl formula formula --ltl=/tmp/1867/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 484 places, 629 transitions and 1793 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.030 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1867/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1867/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1867/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1867/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-10b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is FlexibleBarrier-PT-10b, 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 r169-tall-167838856000500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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